Average Error: 0.0 → 0.0
Time: 808.0ms
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 r18604 = x;
        double r18605 = y;
        double r18606 = r18604 + r18605;
        double r18607 = z;
        double r18608 = 1.0;
        double r18609 = r18607 + r18608;
        double r18610 = r18606 * r18609;
        return r18610;
}
↓
double f(double x, double y, double z) {
        double r18611 = x;
        double r18612 = y;
        double r18613 = r18611 + r18612;
        double r18614 = z;
        double r18615 = 1.0;
        double r18616 = r18614 + r18615;
        double r18617 = r18613 * r18616;
        return r18617;
}

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