Average Error: 0.0 → 0.0
Time: 1.0s
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 r34845 = x;
        double r34846 = y;
        double r34847 = r34845 + r34846;
        double r34848 = z;
        double r34849 = 1.0;
        double r34850 = r34848 + r34849;
        double r34851 = r34847 * r34850;
        return r34851;
}
↓
double f(double x, double y, double z) {
        double r34852 = x;
        double r34853 = y;
        double r34854 = r34852 + r34853;
        double r34855 = z;
        double r34856 = 1.0;
        double r34857 = r34855 + r34856;
        double r34858 = r34854 * r34857;
        return r34858;
}

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