Average Error: 0.0 → 0.0
Time: 13.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 r113823 = x;
        double r113824 = y;
        double r113825 = z;
        double r113826 = r113825 + r113823;
        double r113827 = r113824 * r113826;
        double r113828 = r113823 + r113827;
        return r113828;
}
↓
double f(double x, double y, double z) {
        double r113829 = x;
        double r113830 = y;
        double r113831 = z;
        double r113832 = r113831 + r113829;
        double r113833 = r113830 * r113832;
        double r113834 = r113829 + r113833;
        return r113834;
}

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