Average Error: 0.0 → 0.0
Time: 2.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 r37743 = x;
        double r37744 = y;
        double r37745 = r37743 + r37744;
        double r37746 = z;
        double r37747 = 1.0;
        double r37748 = r37746 + r37747;
        double r37749 = r37745 * r37748;
        return r37749;
}
↓
double f(double x, double y, double z) {
        double r37750 = x;
        double r37751 = y;
        double r37752 = r37750 + r37751;
        double r37753 = z;
        double r37754 = 1.0;
        double r37755 = r37753 + r37754;
        double r37756 = r37752 * r37755;
        return r37756;
}

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