Average Error: 0.0 → 0.0
Time: 4.6s
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 r41898 = x;
        double r41899 = y;
        double r41900 = r41898 + r41899;
        double r41901 = z;
        double r41902 = 1.0;
        double r41903 = r41901 + r41902;
        double r41904 = r41900 * r41903;
        return r41904;
}
↓
double f(double x, double y, double z) {
        double r41905 = x;
        double r41906 = y;
        double r41907 = r41905 + r41906;
        double r41908 = z;
        double r41909 = 1.0;
        double r41910 = r41908 + r41909;
        double r41911 = r41907 * r41910;
        return r41911;
}

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