Average Error: 0.0 → 0.0
Time: 21.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 r5547607 = x;
        double r5547608 = y;
        double r5547609 = z;
        double r5547610 = r5547609 + r5547607;
        double r5547611 = r5547608 * r5547610;
        double r5547612 = r5547607 + r5547611;
        return r5547612;
}
↓
double f(double x, double y, double z) {
        double r5547613 = x;
        double r5547614 = z;
        double r5547615 = r5547613 + r5547614;
        double r5547616 = y;
        double r5547617 = r5547615 * r5547616;
        double r5547618 = r5547613 + r5547617;
        return r5547618;
}

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))))