Average Error: 0.0 → 0.0
Time: 44.4s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[\left(z + x\right) \cdot y + x\]
x + y \cdot \left(z + x\right)
↓
\left(z + x\right) \cdot y + x
double f(double x, double y, double z) {
        double r6077749 = x;
        double r6077750 = y;
        double r6077751 = z;
        double r6077752 = r6077751 + r6077749;
        double r6077753 = r6077750 * r6077752;
        double r6077754 = r6077749 + r6077753;
        return r6077754;
}
↓
double f(double x, double y, double z) {
        double r6077755 = z;
        double r6077756 = x;
        double r6077757 = r6077755 + r6077756;
        double r6077758 = y;
        double r6077759 = r6077757 * r6077758;
        double r6077760 = r6077759 + r6077756;
        return r6077760;
}

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 \left(z + x\right) \cdot y + x\]

Reproduce

herbie shell --seed 2019200 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  (+ x (* y (+ z x))))