Average Error: 0.0 → 0.0
Time: 6.9s
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 r121242 = x;
        double r121243 = y;
        double r121244 = z;
        double r121245 = r121244 + r121242;
        double r121246 = r121243 * r121245;
        double r121247 = r121242 + r121246;
        return r121247;
}
↓
double f(double x, double y, double z) {
        double r121248 = x;
        double r121249 = y;
        double r121250 = z;
        double r121251 = r121250 + r121248;
        double r121252 = r121249 * r121251;
        double r121253 = r121248 + r121252;
        return r121253;
}

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))))