Average Error: 0.0 → 0.0
Time: 4.9s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(x + y\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(x + y\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r26620 = x;
        double r26621 = y;
        double r26622 = r26620 + r26621;
        double r26623 = 1.0;
        double r26624 = z;
        double r26625 = r26623 - r26624;
        double r26626 = r26622 * r26625;
        return r26626;
}
↓
double f(double x, double y, double z) {
        double r26627 = x;
        double r26628 = y;
        double r26629 = r26627 + r26628;
        double r26630 = 1.0;
        double r26631 = z;
        double r26632 = r26630 - r26631;
        double r26633 = r26629 * r26632;
        return r26633;
}

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(1 - z\right)\]

  2. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot \left(1 - z\right)\]

Reproduce

herbie shell --seed 2020042 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  :precision binary64
  (* (+ x y) (- 1 z)))