Average Error: 0.0 → 0.0
Time: 11.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 r41214 = x;
        double r41215 = y;
        double r41216 = r41214 + r41215;
        double r41217 = z;
        double r41218 = 1.0;
        double r41219 = r41217 + r41218;
        double r41220 = r41216 * r41219;
        return r41220;
}
↓
double f(double x, double y, double z) {
        double r41221 = x;
        double r41222 = y;
        double r41223 = r41221 + r41222;
        double r41224 = z;
        double r41225 = 1.0;
        double r41226 = r41224 + r41225;
        double r41227 = r41223 * r41226;
        return r41227;
}

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