Average Error: 0.0 → 0.0
Time: 39.6s
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 r49799 = x;
        double r49800 = y;
        double r49801 = r49799 + r49800;
        double r49802 = z;
        double r49803 = 1.0;
        double r49804 = r49802 + r49803;
        double r49805 = r49801 * r49804;
        return r49805;
}
↓
double f(double x, double y, double z) {
        double r49806 = x;
        double r49807 = y;
        double r49808 = r49806 + r49807;
        double r49809 = z;
        double r49810 = 1.0;
        double r49811 = r49809 + r49810;
        double r49812 = r49808 * r49811;
        return r49812;
}

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