Average Error: 0.0 → 0.0
Time: 3.3s
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 r230 = x;
        double r231 = y;
        double r232 = r230 + r231;
        double r233 = z;
        double r234 = 1.0;
        double r235 = r233 + r234;
        double r236 = r232 * r235;
        return r236;
}
↓
double f(double x, double y, double z) {
        double r237 = x;
        double r238 = y;
        double r239 = r237 + r238;
        double r240 = z;
        double r241 = 1.0;
        double r242 = r240 + r241;
        double r243 = r239 * r242;
        return r243;
}

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 2020025 +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)))