Average Error: 0.0 → 0.0
Time: 1.9s
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 r39264 = x;
        double r39265 = y;
        double r39266 = r39264 + r39265;
        double r39267 = z;
        double r39268 = 1.0;
        double r39269 = r39267 + r39268;
        double r39270 = r39266 * r39269;
        return r39270;
}
↓
double f(double x, double y, double z) {
        double r39271 = x;
        double r39272 = y;
        double r39273 = r39271 + r39272;
        double r39274 = z;
        double r39275 = 1.0;
        double r39276 = r39274 + r39275;
        double r39277 = r39273 * r39276;
        return r39277;
}

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