Average Error: 0.0 → 0.0
Time: 2.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 r104252 = x;
        double r104253 = y;
        double r104254 = z;
        double r104255 = r104254 + r104252;
        double r104256 = r104253 * r104255;
        double r104257 = r104252 + r104256;
        return r104257;
}
↓
double f(double x, double y, double z) {
        double r104258 = x;
        double r104259 = y;
        double r104260 = z;
        double r104261 = r104260 + r104258;
        double r104262 = r104259 * r104261;
        double r104263 = r104258 + r104262;
        return r104263;
}

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