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 r37612 = x;
        double r37613 = y;
        double r37614 = r37612 + r37613;
        double r37615 = z;
        double r37616 = 1.0;
        double r37617 = r37615 + r37616;
        double r37618 = r37614 * r37617;
        return r37618;
}
↓
double f(double x, double y, double z) {
        double r37619 = x;
        double r37620 = y;
        double r37621 = r37619 + r37620;
        double r37622 = z;
        double r37623 = 1.0;
        double r37624 = r37622 + r37623;
        double r37625 = r37621 * r37624;
        return r37625;
}

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