Average Error: 0.0 → 0.0
Time: 7.9s
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 r91239 = x;
        double r91240 = y;
        double r91241 = z;
        double r91242 = r91241 + r91239;
        double r91243 = r91240 * r91242;
        double r91244 = r91239 + r91243;
        return r91244;
}
↓
double f(double x, double y, double z) {
        double r91245 = x;
        double r91246 = y;
        double r91247 = z;
        double r91248 = r91247 + r91245;
        double r91249 = r91246 * r91248;
        double r91250 = r91245 + r91249;
        return r91250;
}

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