Average Error: 0.0 → 0.0
Time: 2.7s
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 r262795 = x;
        double r262796 = y;
        double r262797 = r262795 * r262796;
        double r262798 = 1.0;
        double r262799 = r262798 - r262795;
        double r262800 = z;
        double r262801 = r262799 * r262800;
        double r262802 = r262797 + r262801;
        return r262802;
}
↓
double f(double x, double y, double z) {
        double r262803 = x;
        double r262804 = y;
        double r262805 = r262803 * r262804;
        double r262806 = 1.0;
        double r262807 = r262806 - r262803;
        double r262808 = z;
        double r262809 = r262807 * r262808;
        double r262810 = r262805 + r262809;
        return r262810;
}

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 2020042 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:$crender from diagrams-rasterific-1.3.1.3"
  :precision binary64
  (+ (* x y) (* (- 1 x) z)))