Average Error: 0.0 → 0.0
Time: 1.0s
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 r178553 = x;
        double r178554 = y;
        double r178555 = r178553 * r178554;
        double r178556 = 1.0;
        double r178557 = r178556 - r178553;
        double r178558 = z;
        double r178559 = r178557 * r178558;
        double r178560 = r178555 + r178559;
        return r178560;
}
↓
double f(double x, double y, double z) {
        double r178561 = x;
        double r178562 = y;
        double r178563 = r178561 * r178562;
        double r178564 = 1.0;
        double r178565 = r178564 - r178561;
        double r178566 = z;
        double r178567 = r178565 * r178566;
        double r178568 = r178563 + r178567;
        return r178568;
}

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