Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[x \cdot y + \left(1 - x\right) \cdot z\]
↓
\[x \cdot y + \left(1 - x\right) \cdot z\]
x \cdot y + \left(1 - x\right) \cdot z
↓
x \cdot y + \left(1 - x\right) \cdot z
double f(double x, double y, double z) {
        double r321977 = x;
        double r321978 = y;
        double r321979 = r321977 * r321978;
        double r321980 = 1.0;
        double r321981 = r321980 - r321977;
        double r321982 = z;
        double r321983 = r321981 * r321982;
        double r321984 = r321979 + r321983;
        return r321984;
}
↓
double f(double x, double y, double z) {
        double r321985 = x;
        double r321986 = y;
        double r321987 = r321985 * r321986;
        double r321988 = 1.0;
        double r321989 = r321988 - r321985;
        double r321990 = z;
        double r321991 = r321989 * r321990;
        double r321992 = r321987 + r321991;
        return r321992;
}

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

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020081 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:$crender from diagrams-rasterific-1.3.1.3"
  :precision binary64
  (+ (* x y) (* (- 1 x) z)))