Average Error: 0.0 → 0.0
Time: 3.4s
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 r217412 = x;
        double r217413 = y;
        double r217414 = r217412 * r217413;
        double r217415 = 1.0;
        double r217416 = r217415 - r217412;
        double r217417 = z;
        double r217418 = r217416 * r217417;
        double r217419 = r217414 + r217418;
        return r217419;
}
↓
double f(double x, double y, double z) {
        double r217420 = x;
        double r217421 = y;
        double r217422 = r217420 * r217421;
        double r217423 = 1.0;
        double r217424 = r217423 - r217420;
        double r217425 = z;
        double r217426 = r217424 * r217425;
        double r217427 = r217422 + r217426;
        return r217427;
}

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