Average Error: 0.0 → 0.0
Time: 1.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 r192050 = x;
        double r192051 = y;
        double r192052 = r192050 * r192051;
        double r192053 = 1.0;
        double r192054 = r192053 - r192050;
        double r192055 = z;
        double r192056 = r192054 * r192055;
        double r192057 = r192052 + r192056;
        return r192057;
}
↓
double f(double x, double y, double z) {
        double r192058 = x;
        double r192059 = y;
        double r192060 = r192058 * r192059;
        double r192061 = 1.0;
        double r192062 = r192061 - r192058;
        double r192063 = z;
        double r192064 = r192062 * r192063;
        double r192065 = r192060 + r192064;
        return r192065;
}

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