Average Error: 0.0 → 0.0
Time: 7.4s
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 r200303 = x;
        double r200304 = y;
        double r200305 = r200303 * r200304;
        double r200306 = 1.0;
        double r200307 = r200306 - r200303;
        double r200308 = z;
        double r200309 = r200307 * r200308;
        double r200310 = r200305 + r200309;
        return r200310;
}
↓
double f(double x, double y, double z) {
        double r200311 = x;
        double r200312 = y;
        double r200313 = r200311 * r200312;
        double r200314 = 1.0;
        double r200315 = r200314 - r200311;
        double r200316 = z;
        double r200317 = r200315 * r200316;
        double r200318 = r200313 + r200317;
        return r200318;
}

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