Average Error: 0.0 → 0.0
Time: 8.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 r27974 = x;
        double r27975 = y;
        double r27976 = r27974 + r27975;
        double r27977 = z;
        double r27978 = 1.0;
        double r27979 = r27977 + r27978;
        double r27980 = r27976 * r27979;
        return r27980;
}
↓
double f(double x, double y, double z) {
        double r27981 = x;
        double r27982 = y;
        double r27983 = r27981 + r27982;
        double r27984 = z;
        double r27985 = 1.0;
        double r27986 = r27984 + r27985;
        double r27987 = r27983 * r27986;
        return r27987;
}

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