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 r34676 = x;
        double r34677 = y;
        double r34678 = r34676 + r34677;
        double r34679 = z;
        double r34680 = 1.0;
        double r34681 = r34679 + r34680;
        double r34682 = r34678 * r34681;
        return r34682;
}
↓
double f(double x, double y, double z) {
        double r34683 = x;
        double r34684 = y;
        double r34685 = r34683 + r34684;
        double r34686 = z;
        double r34687 = 1.0;
        double r34688 = r34686 + r34687;
        double r34689 = r34685 * r34688;
        return r34689;
}

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