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 r57406 = x;
        double r57407 = y;
        double r57408 = r57406 + r57407;
        double r57409 = z;
        double r57410 = 1.0;
        double r57411 = r57409 + r57410;
        double r57412 = r57408 * r57411;
        return r57412;
}
↓
double f(double x, double y, double z) {
        double r57413 = x;
        double r57414 = y;
        double r57415 = r57413 + r57414;
        double r57416 = z;
        double r57417 = 1.0;
        double r57418 = r57416 + r57417;
        double r57419 = r57415 * r57418;
        return r57419;
}

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