Average Error: 0.0 → 0.0
Time: 1.2s
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 r43995 = x;
        double r43996 = y;
        double r43997 = r43995 + r43996;
        double r43998 = z;
        double r43999 = 1.0;
        double r44000 = r43998 + r43999;
        double r44001 = r43997 * r44000;
        return r44001;
}
↓
double f(double x, double y, double z) {
        double r44002 = x;
        double r44003 = y;
        double r44004 = r44002 + r44003;
        double r44005 = z;
        double r44006 = 1.0;
        double r44007 = r44005 + r44006;
        double r44008 = r44004 * r44007;
        return r44008;
}

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 2020002 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))