Average Error: 0.0 → 0.0
Time: 1.7s
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 r52595 = x;
        double r52596 = y;
        double r52597 = r52595 + r52596;
        double r52598 = z;
        double r52599 = 1.0;
        double r52600 = r52598 + r52599;
        double r52601 = r52597 * r52600;
        return r52601;
}
↓
double f(double x, double y, double z) {
        double r52602 = x;
        double r52603 = y;
        double r52604 = r52602 + r52603;
        double r52605 = z;
        double r52606 = 1.0;
        double r52607 = r52605 + r52606;
        double r52608 = r52604 * r52607;
        return r52608;
}

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