Average Error: 0.0 → 0.0
Time: 3.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 r23216 = x;
        double r23217 = y;
        double r23218 = r23216 + r23217;
        double r23219 = z;
        double r23220 = 1.0;
        double r23221 = r23219 + r23220;
        double r23222 = r23218 * r23221;
        return r23222;
}
↓
double f(double x, double y, double z) {
        double r23223 = x;
        double r23224 = y;
        double r23225 = r23223 + r23224;
        double r23226 = z;
        double r23227 = 1.0;
        double r23228 = r23226 + r23227;
        double r23229 = r23225 * r23228;
        return r23229;
}

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