Average Error: 0.0 → 0.0
Time: 3.1s
Precision: 64
\[x + y \cdot z\]
\[x + y \cdot z\]
x + y \cdot z
x + y \cdot z
double f(double x, double y, double z) {
        double r1021547 = x;
        double r1021548 = y;
        double r1021549 = z;
        double r1021550 = r1021548 * r1021549;
        double r1021551 = r1021547 + r1021550;
        return r1021551;
}

double f(double x, double y, double z) {
        double r1021552 = x;
        double r1021553 = y;
        double r1021554 = z;
        double r1021555 = r1021553 * r1021554;
        double r1021556 = r1021552 + r1021555;
        return r1021556;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + y \cdot z\]
  2. Final simplification0.0

    \[\leadsto x + y \cdot z\]

Reproduce

herbie shell --seed 1 
(FPCore (x y z)
  :name "x+y*z"
  :precision binary64
  (+ x (* y z)))