Average Error: 0.0 → 0.0
Time: 1.4s
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 r42739 = x;
        double r42740 = y;
        double r42741 = r42739 + r42740;
        double r42742 = 1.0;
        double r42743 = z;
        double r42744 = r42742 - r42743;
        double r42745 = r42741 * r42744;
        return r42745;
}
↓
double f(double x, double y, double z) {
        double r42746 = x;
        double r42747 = y;
        double r42748 = r42746 + r42747;
        double r42749 = 1.0;
        double r42750 = z;
        double r42751 = r42749 - r42750;
        double r42752 = r42748 * r42751;
        return r42752;
}

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