Average Error: 0.0 → 0.0
Time: 1.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 r36135 = x;
        double r36136 = y;
        double r36137 = r36135 + r36136;
        double r36138 = z;
        double r36139 = 1.0;
        double r36140 = r36138 + r36139;
        double r36141 = r36137 * r36140;
        return r36141;
}
↓
double f(double x, double y, double z) {
        double r36142 = x;
        double r36143 = y;
        double r36144 = r36142 + r36143;
        double r36145 = z;
        double r36146 = 1.0;
        double r36147 = r36145 + r36146;
        double r36148 = r36144 * r36147;
        return r36148;
}

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