Average Error: 0.0 → 0.0
Time: 2.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 r32973 = x;
        double r32974 = y;
        double r32975 = r32973 + r32974;
        double r32976 = z;
        double r32977 = 1.0;
        double r32978 = r32976 + r32977;
        double r32979 = r32975 * r32978;
        return r32979;
}
↓
double f(double x, double y, double z) {
        double r32980 = x;
        double r32981 = y;
        double r32982 = r32980 + r32981;
        double r32983 = z;
        double r32984 = 1.0;
        double r32985 = r32983 + r32984;
        double r32986 = r32982 * r32985;
        return r32986;
}

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