Average Error: 0.0 → 0.0
Time: 2.8s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot \left(z + 1\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot \left(z + 1\right)
double f(double x, double y, double z) {
        double r38235 = x;
        double r38236 = y;
        double r38237 = r38235 + r38236;
        double r38238 = z;
        double r38239 = 1.0;
        double r38240 = r38238 + r38239;
        double r38241 = r38237 * r38240;
        return r38241;
}
↓
double f(double x, double y, double z) {
        double r38242 = x;
        double r38243 = y;
        double r38244 = r38242 + r38243;
        double r38245 = z;
        double r38246 = 1.0;
        double r38247 = r38245 + r38246;
        double r38248 = r38244 * r38247;
        return r38248;
}

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

    \[\left(x + y\right) \cdot \left(z + 1\right)\]

  2. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot \left(z + 1\right)\]

Reproduce

herbie shell --seed 2020046 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))