Average Error: 0.0 → 0.0
Time: 9.3s
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 r100204 = x;
        double r100205 = y;
        double r100206 = z;
        double r100207 = r100206 + r100204;
        double r100208 = r100205 * r100207;
        double r100209 = r100204 + r100208;
        return r100209;
}
↓
double f(double x, double y, double z) {
        double r100210 = x;
        double r100211 = z;
        double r100212 = r100210 + r100211;
        double r100213 = y;
        double r100214 = r100212 * r100213;
        double r100215 = r100210 + r100214;
        return r100215;
}

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. Simplified0.0

    \[\leadsto \color{blue}{y \cdot \left(x + z\right) + x}\]

  3. Final simplification0.0

    \[\leadsto x + \left(x + z\right) \cdot y\]

Reproduce

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