Average Error: 0.0 → 0.0
Time: 955.0ms
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 r19831 = x;
        double r19832 = y;
        double r19833 = r19831 + r19832;
        double r19834 = z;
        double r19835 = 1.0;
        double r19836 = r19834 + r19835;
        double r19837 = r19833 * r19836;
        return r19837;
}
↓
double f(double x, double y, double z) {
        double r19838 = x;
        double r19839 = y;
        double r19840 = r19838 + r19839;
        double r19841 = z;
        double r19842 = 1.0;
        double r19843 = r19841 + r19842;
        double r19844 = r19840 * r19843;
        return r19844;
}

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