Average Error: 0.0 → 0.0
Time: 5.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 r34089 = x;
        double r34090 = y;
        double r34091 = r34089 + r34090;
        double r34092 = z;
        double r34093 = 1.0;
        double r34094 = r34092 + r34093;
        double r34095 = r34091 * r34094;
        return r34095;
}
↓
double f(double x, double y, double z) {
        double r34096 = x;
        double r34097 = y;
        double r34098 = r34096 + r34097;
        double r34099 = z;
        double r34100 = 1.0;
        double r34101 = r34099 + r34100;
        double r34102 = r34098 * r34101;
        return r34102;
}

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