Average Error: 0.0 → 0.0
Time: 15.1s
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 r49761 = x;
        double r49762 = y;
        double r49763 = r49761 + r49762;
        double r49764 = z;
        double r49765 = 1.0;
        double r49766 = r49764 + r49765;
        double r49767 = r49763 * r49766;
        return r49767;
}
↓
double f(double x, double y, double z) {
        double r49768 = x;
        double r49769 = y;
        double r49770 = r49768 + r49769;
        double r49771 = z;
        double r49772 = 1.0;
        double r49773 = r49771 + r49772;
        double r49774 = r49770 * r49773;
        return r49774;
}

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