Average Error: 0.0 → 0.0
Time: 3.8s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + y \cdot \left(z + x\right)\]
x + y \cdot \left(z + x\right)
↓
x + y \cdot \left(z + x\right)
double f(double x, double y, double z) {
        double r133281 = x;
        double r133282 = y;
        double r133283 = z;
        double r133284 = r133283 + r133281;
        double r133285 = r133282 * r133284;
        double r133286 = r133281 + r133285;
        return r133286;
}
↓
double f(double x, double y, double z) {
        double r133287 = x;
        double r133288 = y;
        double r133289 = z;
        double r133290 = r133289 + r133287;
        double r133291 = r133288 * r133290;
        double r133292 = r133287 + r133291;
        return r133292;
}

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 \left(z + x\right)\]

  2. Final simplification0.0

    \[\leadsto x + y \cdot \left(z + x\right)\]

Reproduce

herbie shell --seed 2020083 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))