Average Error: 0.0 → 0.0
Time: 1.2s
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 r51116 = x;
        double r51117 = y;
        double r51118 = r51116 + r51117;
        double r51119 = z;
        double r51120 = 1.0;
        double r51121 = r51119 + r51120;
        double r51122 = r51118 * r51121;
        return r51122;
}
↓
double f(double x, double y, double z) {
        double r51123 = x;
        double r51124 = y;
        double r51125 = r51123 + r51124;
        double r51126 = z;
        double r51127 = 1.0;
        double r51128 = r51126 + r51127;
        double r51129 = r51125 * r51128;
        return r51129;
}

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