Average Error: 0.0 → 0.0
Time: 8.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 r252832 = x;
        double r252833 = y;
        double r252834 = r252832 * r252833;
        double r252835 = 1.0;
        double r252836 = r252835 - r252832;
        double r252837 = z;
        double r252838 = r252836 * r252837;
        double r252839 = r252834 + r252838;
        return r252839;
}
↓
double f(double x, double y, double z) {
        double r252840 = x;
        double r252841 = y;
        double r252842 = r252840 * r252841;
        double r252843 = 1.0;
        double r252844 = r252843 - r252840;
        double r252845 = z;
        double r252846 = r252844 * r252845;
        double r252847 = r252842 + r252846;
        return r252847;
}

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