Average Error: 0.0 → 0.0
Time: 6.4s
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 r37791 = x;
        double r37792 = y;
        double r37793 = r37791 + r37792;
        double r37794 = z;
        double r37795 = 1.0;
        double r37796 = r37794 + r37795;
        double r37797 = r37793 * r37796;
        return r37797;
}
↓
double f(double x, double y, double z) {
        double r37798 = x;
        double r37799 = y;
        double r37800 = r37798 + r37799;
        double r37801 = z;
        double r37802 = 1.0;
        double r37803 = r37801 + r37802;
        double r37804 = r37800 * r37803;
        return r37804;
}

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