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 r31875 = x;
        double r31876 = y;
        double r31877 = r31875 + r31876;
        double r31878 = z;
        double r31879 = 1.0;
        double r31880 = r31878 + r31879;
        double r31881 = r31877 * r31880;
        return r31881;
}
↓
double f(double x, double y, double z) {
        double r31882 = x;
        double r31883 = y;
        double r31884 = r31882 + r31883;
        double r31885 = z;
        double r31886 = 1.0;
        double r31887 = r31885 + r31886;
        double r31888 = r31884 * r31887;
        return r31888;
}

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