Average Error: 0.0 → 0.0
Time: 5.4s
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 r114209 = x;
        double r114210 = y;
        double r114211 = z;
        double r114212 = r114211 + r114209;
        double r114213 = r114210 * r114212;
        double r114214 = r114209 + r114213;
        return r114214;
}
↓
double f(double x, double y, double z) {
        double r114215 = x;
        double r114216 = y;
        double r114217 = z;
        double r114218 = r114217 + r114215;
        double r114219 = r114216 * r114218;
        double r114220 = r114215 + r114219;
        return r114220;
}

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