Average Error: 0.0 → 0.0
Time: 4.9s
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 r151392 = x;
        double r151393 = y;
        double r151394 = r151392 * r151393;
        double r151395 = 1.0;
        double r151396 = r151395 - r151392;
        double r151397 = z;
        double r151398 = r151396 * r151397;
        double r151399 = r151394 + r151398;
        return r151399;
}
↓
double f(double x, double y, double z) {
        double r151400 = x;
        double r151401 = y;
        double r151402 = r151400 * r151401;
        double r151403 = 1.0;
        double r151404 = r151403 - r151400;
        double r151405 = z;
        double r151406 = r151404 * r151405;
        double r151407 = r151402 + r151406;
        return r151407;
}

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