Average Error: 0.0 → 0.0
Time: 11.1s
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 r140361 = x;
        double r140362 = y;
        double r140363 = z;
        double r140364 = r140363 + r140361;
        double r140365 = r140362 * r140364;
        double r140366 = r140361 + r140365;
        return r140366;
}
↓
double f(double x, double y, double z) {
        double r140367 = x;
        double r140368 = y;
        double r140369 = z;
        double r140370 = r140369 + r140367;
        double r140371 = r140368 * r140370;
        double r140372 = r140367 + r140371;
        return r140372;
}

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