Average Error: 0.0 → 0.0
Time: 11.5s
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 r175288 = x;
        double r175289 = y;
        double r175290 = r175288 * r175289;
        double r175291 = 1.0;
        double r175292 = r175291 - r175288;
        double r175293 = z;
        double r175294 = r175292 * r175293;
        double r175295 = r175290 + r175294;
        return r175295;
}
↓
double f(double x, double y, double z) {
        double r175296 = x;
        double r175297 = y;
        double r175298 = r175296 * r175297;
        double r175299 = 1.0;
        double r175300 = r175299 - r175296;
        double r175301 = z;
        double r175302 = r175300 * r175301;
        double r175303 = r175298 + r175302;
        return r175303;
}

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