Average Error: 0.0 → 0.0
Time: 13.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 r134737 = x;
        double r134738 = y;
        double r134739 = r134737 * r134738;
        double r134740 = 1.0;
        double r134741 = r134740 - r134737;
        double r134742 = z;
        double r134743 = r134741 * r134742;
        double r134744 = r134739 + r134743;
        return r134744;
}
↓
double f(double x, double y, double z) {
        double r134745 = x;
        double r134746 = y;
        double r134747 = r134745 * r134746;
        double r134748 = 1.0;
        double r134749 = r134748 - r134745;
        double r134750 = z;
        double r134751 = r134749 * r134750;
        double r134752 = r134747 + r134751;
        return r134752;
}

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