Average Error: 0.0 → 0.0
Time: 27.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 r7441759 = x;
        double r7441760 = y;
        double r7441761 = z;
        double r7441762 = r7441761 + r7441759;
        double r7441763 = r7441760 * r7441762;
        double r7441764 = r7441759 + r7441763;
        return r7441764;
}
↓
double f(double x, double y, double z) {
        double r7441765 = x;
        double r7441766 = z;
        double r7441767 = r7441765 + r7441766;
        double r7441768 = y;
        double r7441769 = r7441767 * r7441768;
        double r7441770 = r7441765 + r7441769;
        return r7441770;
}

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