Average Error: 0.0 → 0.0
Time: 5.3s
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 r311568 = x;
        double r311569 = y;
        double r311570 = r311568 * r311569;
        double r311571 = 1.0;
        double r311572 = r311571 - r311568;
        double r311573 = z;
        double r311574 = r311572 * r311573;
        double r311575 = r311570 + r311574;
        return r311575;
}
↓
double f(double x, double y, double z) {
        double r311576 = x;
        double r311577 = y;
        double r311578 = r311576 * r311577;
        double r311579 = 1.0;
        double r311580 = r311579 - r311576;
        double r311581 = z;
        double r311582 = r311580 * r311581;
        double r311583 = r311578 + r311582;
        return r311583;
}

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