Average Error: 0.0 → 0.0
Time: 2.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 r302352 = x;
        double r302353 = y;
        double r302354 = r302352 * r302353;
        double r302355 = 1.0;
        double r302356 = r302355 - r302352;
        double r302357 = z;
        double r302358 = r302356 * r302357;
        double r302359 = r302354 + r302358;
        return r302359;
}
↓
double f(double x, double y, double z) {
        double r302360 = x;
        double r302361 = y;
        double r302362 = r302360 * r302361;
        double r302363 = 1.0;
        double r302364 = r302363 - r302360;
        double r302365 = z;
        double r302366 = r302364 * r302365;
        double r302367 = r302362 + r302366;
        return r302367;
}

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