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 r38735 = x;
        double r38736 = y;
        double r38737 = r38735 + r38736;
        double r38738 = z;
        double r38739 = 1.0;
        double r38740 = r38738 + r38739;
        double r38741 = r38737 * r38740;
        return r38741;
}
↓
double f(double x, double y, double z) {
        double r38742 = x;
        double r38743 = y;
        double r38744 = r38742 + r38743;
        double r38745 = z;
        double r38746 = 1.0;
        double r38747 = r38745 + r38746;
        double r38748 = r38744 * r38747;
        return r38748;
}

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