Average Error: 0.0 → 0.0
Time: 3.7s
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 r290417 = x;
        double r290418 = y;
        double r290419 = r290417 * r290418;
        double r290420 = 1.0;
        double r290421 = r290420 - r290417;
        double r290422 = z;
        double r290423 = r290421 * r290422;
        double r290424 = r290419 + r290423;
        return r290424;
}
↓
double f(double x, double y, double z) {
        double r290425 = x;
        double r290426 = y;
        double r290427 = r290425 * r290426;
        double r290428 = 1.0;
        double r290429 = r290428 - r290425;
        double r290430 = z;
        double r290431 = r290429 * r290430;
        double r290432 = r290427 + r290431;
        return r290432;
}

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