Average Error: 0.0 → 0.0
Time: 2.5s
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 r246766 = x;
        double r246767 = y;
        double r246768 = r246766 * r246767;
        double r246769 = 1.0;
        double r246770 = r246769 - r246766;
        double r246771 = z;
        double r246772 = r246770 * r246771;
        double r246773 = r246768 + r246772;
        return r246773;
}
↓
double f(double x, double y, double z) {
        double r246774 = x;
        double r246775 = y;
        double r246776 = r246774 * r246775;
        double r246777 = 1.0;
        double r246778 = r246777 - r246774;
        double r246779 = z;
        double r246780 = r246778 * r246779;
        double r246781 = r246776 + r246780;
        return r246781;
}

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