Average Error: 0.0 → 0.0
Time: 2.7s
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 r186234 = x;
        double r186235 = y;
        double r186236 = z;
        double r186237 = r186236 + r186234;
        double r186238 = r186235 * r186237;
        double r186239 = r186234 + r186238;
        return r186239;
}
↓
double f(double x, double y, double z) {
        double r186240 = x;
        double r186241 = y;
        double r186242 = z;
        double r186243 = r186242 + r186240;
        double r186244 = r186241 * r186243;
        double r186245 = r186240 + r186244;
        return r186245;
}

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