Average Error: 0.0 → 0.0
Time: 850.0ms
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 r210282 = x;
        double r210283 = y;
        double r210284 = r210282 * r210283;
        double r210285 = 1.0;
        double r210286 = r210285 - r210282;
        double r210287 = z;
        double r210288 = r210286 * r210287;
        double r210289 = r210284 + r210288;
        return r210289;
}
↓
double f(double x, double y, double z) {
        double r210290 = x;
        double r210291 = y;
        double r210292 = r210290 * r210291;
        double r210293 = 1.0;
        double r210294 = r210293 - r210290;
        double r210295 = z;
        double r210296 = r210294 * r210295;
        double r210297 = r210292 + r210296;
        return r210297;
}

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