Average Error: 0.0 → 0.0
Time: 3.1s
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 r342709 = x;
        double r342710 = y;
        double r342711 = r342709 * r342710;
        double r342712 = 1.0;
        double r342713 = r342712 - r342709;
        double r342714 = z;
        double r342715 = r342713 * r342714;
        double r342716 = r342711 + r342715;
        return r342716;
}
↓
double f(double x, double y, double z) {
        double r342717 = x;
        double r342718 = y;
        double r342719 = r342717 * r342718;
        double r342720 = 1.0;
        double r342721 = r342720 - r342717;
        double r342722 = z;
        double r342723 = r342721 * r342722;
        double r342724 = r342719 + r342723;
        return r342724;
}

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