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 r15984 = x;
        double r15985 = y;
        double r15986 = r15984 + r15985;
        double r15987 = z;
        double r15988 = 1.0;
        double r15989 = r15987 + r15988;
        double r15990 = r15986 * r15989;
        return r15990;
}
↓
double f(double x, double y, double z) {
        double r15991 = x;
        double r15992 = y;
        double r15993 = r15991 + r15992;
        double r15994 = z;
        double r15995 = 1.0;
        double r15996 = r15994 + r15995;
        double r15997 = r15993 * r15996;
        return r15997;
}

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