Average Error: 0.0 → 0.0
Time: 9.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 r5187198 = x;
        double r5187199 = y;
        double r5187200 = r5187198 + r5187199;
        double r5187201 = z;
        double r5187202 = 1.0;
        double r5187203 = r5187201 + r5187202;
        double r5187204 = r5187200 * r5187203;
        return r5187204;
}
↓
double f(double x, double y, double z) {
        double r5187205 = x;
        double r5187206 = y;
        double r5187207 = r5187205 + r5187206;
        double r5187208 = z;
        double r5187209 = 1.0;
        double r5187210 = r5187208 + r5187209;
        double r5187211 = r5187207 * r5187210;
        return r5187211;
}

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