Average Error: 0.0 → 0.0
Time: 5.9s
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 r31896 = x;
        double r31897 = y;
        double r31898 = r31896 + r31897;
        double r31899 = z;
        double r31900 = 1.0;
        double r31901 = r31899 + r31900;
        double r31902 = r31898 * r31901;
        return r31902;
}
↓
double f(double x, double y, double z) {
        double r31903 = x;
        double r31904 = y;
        double r31905 = r31903 + r31904;
        double r31906 = z;
        double r31907 = 1.0;
        double r31908 = r31906 + r31907;
        double r31909 = r31905 * r31908;
        return r31909;
}

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 2019209 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))