Average Error: 0.0 → 0.0
Time: 2.6s
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 r33230 = x;
        double r33231 = y;
        double r33232 = r33230 + r33231;
        double r33233 = z;
        double r33234 = 1.0;
        double r33235 = r33233 + r33234;
        double r33236 = r33232 * r33235;
        return r33236;
}
↓
double f(double x, double y, double z) {
        double r33237 = x;
        double r33238 = y;
        double r33239 = r33237 + r33238;
        double r33240 = z;
        double r33241 = 1.0;
        double r33242 = r33240 + r33241;
        double r33243 = r33239 * r33242;
        return r33243;
}

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