Average Error: 0.0 → 0.0
Time: 12.6s
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 r6542575 = x;
        double r6542576 = y;
        double r6542577 = z;
        double r6542578 = r6542577 + r6542575;
        double r6542579 = r6542576 * r6542578;
        double r6542580 = r6542575 + r6542579;
        return r6542580;
}
↓
double f(double x, double y, double z) {
        double r6542581 = x;
        double r6542582 = z;
        double r6542583 = r6542581 + r6542582;
        double r6542584 = y;
        double r6542585 = r6542583 * r6542584;
        double r6542586 = r6542581 + r6542585;
        return r6542586;
}

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