Average Error: 0.0 → 0.0
Time: 6.2s
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 r379733 = x;
        double r379734 = y;
        double r379735 = r379733 * r379734;
        double r379736 = 1.0;
        double r379737 = r379736 - r379733;
        double r379738 = z;
        double r379739 = r379737 * r379738;
        double r379740 = r379735 + r379739;
        return r379740;
}
↓
double f(double x, double y, double z) {
        double r379741 = x;
        double r379742 = y;
        double r379743 = r379741 * r379742;
        double r379744 = 1.0;
        double r379745 = r379744 - r379741;
        double r379746 = z;
        double r379747 = r379745 * r379746;
        double r379748 = r379743 + r379747;
        return r379748;
}

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