Average Error: 0.0 → 0.0
Time: 13.5s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + y \cdot \left(z + x\right)\]
x + y \cdot \left(z + x\right)
↓
x + y \cdot \left(z + x\right)
double f(double x, double y, double z) {
        double r107185 = x;
        double r107186 = y;
        double r107187 = z;
        double r107188 = r107187 + r107185;
        double r107189 = r107186 * r107188;
        double r107190 = r107185 + r107189;
        return r107190;
}
↓
double f(double x, double y, double z) {
        double r107191 = x;
        double r107192 = y;
        double r107193 = z;
        double r107194 = r107193 + r107191;
        double r107195 = r107192 * r107194;
        double r107196 = r107191 + r107195;
        return r107196;
}

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

Reproduce

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