Average Error: 0.0 → 0.0
Time: 6.3s
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 r61094 = x;
        double r61095 = y;
        double r61096 = r61094 + r61095;
        double r61097 = z;
        double r61098 = 1.0;
        double r61099 = r61097 + r61098;
        double r61100 = r61096 * r61099;
        return r61100;
}
↓
double f(double x, double y, double z) {
        double r61101 = x;
        double r61102 = y;
        double r61103 = r61101 + r61102;
        double r61104 = z;
        double r61105 = 1.0;
        double r61106 = r61104 + r61105;
        double r61107 = r61103 * r61106;
        return r61107;
}

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