Average Error: 0.0 → 0.0
Time: 3.3s
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 r336864 = x;
        double r336865 = y;
        double r336866 = r336864 * r336865;
        double r336867 = 1.0;
        double r336868 = r336867 - r336864;
        double r336869 = z;
        double r336870 = r336868 * r336869;
        double r336871 = r336866 + r336870;
        return r336871;
}
↓
double f(double x, double y, double z) {
        double r336872 = x;
        double r336873 = y;
        double r336874 = r336872 * r336873;
        double r336875 = 1.0;
        double r336876 = r336875 - r336872;
        double r336877 = z;
        double r336878 = r336876 * r336877;
        double r336879 = r336874 + r336878;
        return r336879;
}

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