Average Error: 0.0 → 0.0
Time: 8.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 r42684 = x;
        double r42685 = y;
        double r42686 = r42684 + r42685;
        double r42687 = z;
        double r42688 = 1.0;
        double r42689 = r42687 + r42688;
        double r42690 = r42686 * r42689;
        return r42690;
}
↓
double f(double x, double y, double z) {
        double r42691 = x;
        double r42692 = y;
        double r42693 = r42691 + r42692;
        double r42694 = z;
        double r42695 = 1.0;
        double r42696 = r42694 + r42695;
        double r42697 = r42693 * r42696;
        return r42697;
}

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