Average Error: 0.0 → 0.0
Time: 11.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 r38836 = x;
        double r38837 = y;
        double r38838 = r38836 + r38837;
        double r38839 = 1.0;
        double r38840 = z;
        double r38841 = r38839 - r38840;
        double r38842 = r38838 * r38841;
        return r38842;
}
↓
double f(double x, double y, double z) {
        double r38843 = x;
        double r38844 = y;
        double r38845 = r38843 + r38844;
        double r38846 = 1.0;
        double r38847 = z;
        double r38848 = r38846 - r38847;
        double r38849 = r38845 * r38848;
        return r38849;
}

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