Average Error: 0.0 → 0.0
Time: 1.4s
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 r204848 = x;
        double r204849 = y;
        double r204850 = r204848 * r204849;
        double r204851 = 1.0;
        double r204852 = r204851 - r204848;
        double r204853 = z;
        double r204854 = r204852 * r204853;
        double r204855 = r204850 + r204854;
        return r204855;
}
↓
double f(double x, double y, double z) {
        double r204856 = x;
        double r204857 = y;
        double r204858 = r204856 * r204857;
        double r204859 = 1.0;
        double r204860 = r204859 - r204856;
        double r204861 = z;
        double r204862 = r204860 * r204861;
        double r204863 = r204858 + r204862;
        return r204863;
}

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