Average Error: 0.0 → 0.0
Time: 22.1s
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 r4136451 = x;
        double r4136452 = y;
        double r4136453 = z;
        double r4136454 = r4136453 + r4136451;
        double r4136455 = r4136452 * r4136454;
        double r4136456 = r4136451 + r4136455;
        return r4136456;
}
↓
double f(double x, double y, double z) {
        double r4136457 = x;
        double r4136458 = z;
        double r4136459 = r4136457 + r4136458;
        double r4136460 = y;
        double r4136461 = r4136459 * r4136460;
        double r4136462 = r4136457 + r4136461;
        return r4136462;
}

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