Average Error: 0.0 → 0.0
Time: 3.4s
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 r41573 = x;
        double r41574 = y;
        double r41575 = r41573 + r41574;
        double r41576 = z;
        double r41577 = 1.0;
        double r41578 = r41576 + r41577;
        double r41579 = r41575 * r41578;
        return r41579;
}
↓
double f(double x, double y, double z) {
        double r41580 = x;
        double r41581 = y;
        double r41582 = r41580 + r41581;
        double r41583 = z;
        double r41584 = 1.0;
        double r41585 = r41583 + r41584;
        double r41586 = r41582 * r41585;
        return r41586;
}

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