Average Error: 0.0 → 0.0
Time: 1.1s
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 r40793 = x;
        double r40794 = y;
        double r40795 = r40793 + r40794;
        double r40796 = 1.0;
        double r40797 = z;
        double r40798 = r40796 - r40797;
        double r40799 = r40795 * r40798;
        return r40799;
}
↓
double f(double x, double y, double z) {
        double r40800 = x;
        double r40801 = y;
        double r40802 = r40800 + r40801;
        double r40803 = 1.0;
        double r40804 = z;
        double r40805 = r40803 - r40804;
        double r40806 = r40802 * r40805;
        return r40806;
}

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