Average Error: 0.0 → 0.0
Time: 25.5s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + \left(x + z\right) \cdot y\]
x + y \cdot \left(z + x\right)
↓
x + \left(x + z\right) \cdot y
double f(double x, double y, double z) {
        double r9219494 = x;
        double r9219495 = y;
        double r9219496 = z;
        double r9219497 = r9219496 + r9219494;
        double r9219498 = r9219495 * r9219497;
        double r9219499 = r9219494 + r9219498;
        return r9219499;
}
↓
double f(double x, double y, double z) {
        double r9219500 = x;
        double r9219501 = z;
        double r9219502 = r9219500 + r9219501;
        double r9219503 = y;
        double r9219504 = r9219502 * r9219503;
        double r9219505 = r9219500 + r9219504;
        return r9219505;
}

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 + \left(x + z\right) \cdot y\]

Reproduce

herbie shell --seed 2019158 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  (+ x (* y (+ z x))))