Average Error: 0.0 → 0.0
Time: 1.6s
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 r271515 = x;
        double r271516 = y;
        double r271517 = r271515 * r271516;
        double r271518 = 1.0;
        double r271519 = r271518 - r271515;
        double r271520 = z;
        double r271521 = r271519 * r271520;
        double r271522 = r271517 + r271521;
        return r271522;
}
↓
double f(double x, double y, double z) {
        double r271523 = x;
        double r271524 = y;
        double r271525 = r271523 * r271524;
        double r271526 = 1.0;
        double r271527 = r271526 - r271523;
        double r271528 = z;
        double r271529 = r271527 * r271528;
        double r271530 = r271525 + r271529;
        return r271530;
}

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