Average Error: 0.0 → 0.0
Time: 6.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 r61108 = x;
        double r61109 = y;
        double r61110 = r61108 + r61109;
        double r61111 = z;
        double r61112 = 1.0;
        double r61113 = r61111 + r61112;
        double r61114 = r61110 * r61113;
        return r61114;
}
↓
double f(double x, double y, double z) {
        double r61115 = x;
        double r61116 = y;
        double r61117 = r61115 + r61116;
        double r61118 = z;
        double r61119 = 1.0;
        double r61120 = r61118 + r61119;
        double r61121 = r61117 * r61120;
        return r61121;
}

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