Average Error: 0.0 → 0.0
Time: 9.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 r160298 = x;
        double r160299 = y;
        double r160300 = z;
        double r160301 = r160300 + r160298;
        double r160302 = r160299 * r160301;
        double r160303 = r160298 + r160302;
        return r160303;
}
↓
double f(double x, double y, double z) {
        double r160304 = x;
        double r160305 = y;
        double r160306 = z;
        double r160307 = r160306 + r160304;
        double r160308 = r160305 * r160307;
        double r160309 = r160304 + r160308;
        return r160309;
}

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