Average Error: 0.0 → 0.0
Time: 3.5s
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 r44694 = x;
        double r44695 = y;
        double r44696 = r44694 + r44695;
        double r44697 = z;
        double r44698 = 1.0;
        double r44699 = r44697 + r44698;
        double r44700 = r44696 * r44699;
        return r44700;
}
↓
double f(double x, double y, double z) {
        double r44701 = x;
        double r44702 = y;
        double r44703 = r44701 + r44702;
        double r44704 = z;
        double r44705 = 1.0;
        double r44706 = r44704 + r44705;
        double r44707 = r44703 * r44706;
        return r44707;
}

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