Average Error: 0.0 → 0.0
Time: 11.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 r109510 = x;
        double r109511 = y;
        double r109512 = z;
        double r109513 = r109512 + r109510;
        double r109514 = r109511 * r109513;
        double r109515 = r109510 + r109514;
        return r109515;
}
↓
double f(double x, double y, double z) {
        double r109516 = x;
        double r109517 = y;
        double r109518 = z;
        double r109519 = r109518 + r109516;
        double r109520 = r109517 * r109519;
        double r109521 = r109516 + r109520;
        return r109521;
}

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