Average Error: 0.0 → 0.0
Time: 1.2s
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 r31688 = x;
        double r31689 = y;
        double r31690 = r31688 + r31689;
        double r31691 = z;
        double r31692 = 1.0;
        double r31693 = r31691 + r31692;
        double r31694 = r31690 * r31693;
        return r31694;
}
↓
double f(double x, double y, double z) {
        double r31695 = x;
        double r31696 = y;
        double r31697 = r31695 + r31696;
        double r31698 = z;
        double r31699 = 1.0;
        double r31700 = r31698 + r31699;
        double r31701 = r31697 * r31700;
        return r31701;
}

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