Average Error: 0.0 → 0.0
Time: 3.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 r31834 = x;
        double r31835 = y;
        double r31836 = r31834 + r31835;
        double r31837 = 1.0;
        double r31838 = z;
        double r31839 = r31837 - r31838;
        double r31840 = r31836 * r31839;
        return r31840;
}
↓
double f(double x, double y, double z) {
        double r31841 = x;
        double r31842 = y;
        double r31843 = r31841 + r31842;
        double r31844 = 1.0;
        double r31845 = z;
        double r31846 = r31844 - r31845;
        double r31847 = r31843 * r31846;
        return r31847;
}

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