Average Error: 0.0 → 0.0
Time: 8.7s
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 r2662562 = x;
        double r2662563 = y;
        double r2662564 = r2662562 + r2662563;
        double r2662565 = z;
        double r2662566 = 1.0;
        double r2662567 = r2662565 + r2662566;
        double r2662568 = r2662564 * r2662567;
        return r2662568;
}
↓
double f(double x, double y, double z) {
        double r2662569 = x;
        double r2662570 = y;
        double r2662571 = r2662569 + r2662570;
        double r2662572 = z;
        double r2662573 = 1.0;
        double r2662574 = r2662572 + r2662573;
        double r2662575 = r2662571 * r2662574;
        return r2662575;
}

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