Average Error: 0.0 → 0.0
Time: 3.5s
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 r251468 = x;
        double r251469 = y;
        double r251470 = r251468 * r251469;
        double r251471 = 1.0;
        double r251472 = r251471 - r251468;
        double r251473 = z;
        double r251474 = r251472 * r251473;
        double r251475 = r251470 + r251474;
        return r251475;
}
↓
double f(double x, double y, double z) {
        double r251476 = x;
        double r251477 = y;
        double r251478 = r251476 * r251477;
        double r251479 = 1.0;
        double r251480 = r251479 - r251476;
        double r251481 = z;
        double r251482 = r251480 * r251481;
        double r251483 = r251478 + r251482;
        return r251483;
}

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