Average Error: 0.0 → 0.0
Time: 15.2s
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 r164325 = x;
        double r164326 = y;
        double r164327 = r164325 * r164326;
        double r164328 = 1.0;
        double r164329 = r164328 - r164325;
        double r164330 = z;
        double r164331 = r164329 * r164330;
        double r164332 = r164327 + r164331;
        return r164332;
}
↓
double f(double x, double y, double z) {
        double r164333 = x;
        double r164334 = y;
        double r164335 = r164333 * r164334;
        double r164336 = 1.0;
        double r164337 = r164336 - r164333;
        double r164338 = z;
        double r164339 = r164337 * r164338;
        double r164340 = r164335 + r164339;
        return r164340;
}

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