Average Error: 0.0 → 0.0
Time: 1.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 r21127 = x;
        double r21128 = y;
        double r21129 = r21127 + r21128;
        double r21130 = z;
        double r21131 = 1.0;
        double r21132 = r21130 + r21131;
        double r21133 = r21129 * r21132;
        return r21133;
}
↓
double f(double x, double y, double z) {
        double r21134 = x;
        double r21135 = y;
        double r21136 = r21134 + r21135;
        double r21137 = z;
        double r21138 = 1.0;
        double r21139 = r21137 + r21138;
        double r21140 = r21136 * r21139;
        return r21140;
}

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