Average Error: 0.0 → 0.0
Time: 4.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 r144332 = x;
        double r144333 = y;
        double r144334 = z;
        double r144335 = r144334 + r144332;
        double r144336 = r144333 * r144335;
        double r144337 = r144332 + r144336;
        return r144337;
}
↓
double f(double x, double y, double z) {
        double r144338 = x;
        double r144339 = y;
        double r144340 = z;
        double r144341 = r144340 + r144338;
        double r144342 = r144339 * r144341;
        double r144343 = r144338 + r144342;
        return r144343;
}

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 2020042 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))