Average Error: 0.0 → 0.0
Time: 9.1s
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 r133471 = x;
        double r133472 = y;
        double r133473 = r133471 * r133472;
        double r133474 = 1.0;
        double r133475 = r133474 - r133471;
        double r133476 = z;
        double r133477 = r133475 * r133476;
        double r133478 = r133473 + r133477;
        return r133478;
}
↓
double f(double x, double y, double z) {
        double r133479 = x;
        double r133480 = y;
        double r133481 = r133479 * r133480;
        double r133482 = 1.0;
        double r133483 = r133482 - r133479;
        double r133484 = z;
        double r133485 = r133483 * r133484;
        double r133486 = r133481 + r133485;
        return r133486;
}

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