Average Error: 0.0 → 0.0
Time: 58.4s
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 r6740561 = x;
        double r6740562 = y;
        double r6740563 = z;
        double r6740564 = r6740563 + r6740561;
        double r6740565 = r6740562 * r6740564;
        double r6740566 = r6740561 + r6740565;
        return r6740566;
}
↓
double f(double x, double y, double z) {
        double r6740567 = x;
        double r6740568 = z;
        double r6740569 = r6740567 + r6740568;
        double r6740570 = y;
        double r6740571 = r6740569 * r6740570;
        double r6740572 = r6740567 + r6740571;
        return r6740572;
}

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