Average Error: 0.0 → 0.0
Time: 3.4s
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 r129190 = x;
        double r129191 = y;
        double r129192 = z;
        double r129193 = r129192 + r129190;
        double r129194 = r129191 * r129193;
        double r129195 = r129190 + r129194;
        return r129195;
}
↓
double f(double x, double y, double z) {
        double r129196 = x;
        double r129197 = y;
        double r129198 = z;
        double r129199 = r129198 + r129196;
        double r129200 = r129197 * r129199;
        double r129201 = r129196 + r129200;
        return r129201;
}

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