Average Error: 0.0 → 0.0
Time: 3.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 r206 = x;
        double r207 = y;
        double r208 = r206 + r207;
        double r209 = z;
        double r210 = 1.0;
        double r211 = r209 + r210;
        double r212 = r208 * r211;
        return r212;
}
↓
double f(double x, double y, double z) {
        double r213 = x;
        double r214 = y;
        double r215 = r213 + r214;
        double r216 = z;
        double r217 = 1.0;
        double r218 = r216 + r217;
        double r219 = r215 * r218;
        return r219;
}

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