Average Error: 0.0 → 0.0
Time: 2.9s
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 r243863 = x;
        double r243864 = y;
        double r243865 = r243863 * r243864;
        double r243866 = 1.0;
        double r243867 = r243866 - r243863;
        double r243868 = z;
        double r243869 = r243867 * r243868;
        double r243870 = r243865 + r243869;
        return r243870;
}
↓
double f(double x, double y, double z) {
        double r243871 = x;
        double r243872 = y;
        double r243873 = r243871 * r243872;
        double r243874 = 1.0;
        double r243875 = r243874 - r243871;
        double r243876 = z;
        double r243877 = r243875 * r243876;
        double r243878 = r243873 + r243877;
        return r243878;
}

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