Average Error: 0.0 → 0.0
Time: 959.0ms
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 r23039 = x;
        double r23040 = y;
        double r23041 = r23039 + r23040;
        double r23042 = z;
        double r23043 = 1.0;
        double r23044 = r23042 + r23043;
        double r23045 = r23041 * r23044;
        return r23045;
}
↓
double f(double x, double y, double z) {
        double r23046 = x;
        double r23047 = y;
        double r23048 = r23046 + r23047;
        double r23049 = z;
        double r23050 = 1.0;
        double r23051 = r23049 + r23050;
        double r23052 = r23048 * r23051;
        return r23052;
}

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)))