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 r29176 = x;
        double r29177 = y;
        double r29178 = r29176 + r29177;
        double r29179 = z;
        double r29180 = 1.0;
        double r29181 = r29179 + r29180;
        double r29182 = r29178 * r29181;
        return r29182;
}
↓
double f(double x, double y, double z) {
        double r29183 = x;
        double r29184 = y;
        double r29185 = r29183 + r29184;
        double r29186 = z;
        double r29187 = 1.0;
        double r29188 = r29186 + r29187;
        double r29189 = r29185 * r29188;
        return r29189;
}

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