Average Error: 0.0 → 0.0
Time: 11.3s
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 r259560 = x;
        double r259561 = y;
        double r259562 = r259560 * r259561;
        double r259563 = 1.0;
        double r259564 = r259563 - r259560;
        double r259565 = z;
        double r259566 = r259564 * r259565;
        double r259567 = r259562 + r259566;
        return r259567;
}
↓
double f(double x, double y, double z) {
        double r259568 = x;
        double r259569 = y;
        double r259570 = r259568 * r259569;
        double r259571 = 1.0;
        double r259572 = r259571 - r259568;
        double r259573 = z;
        double r259574 = r259572 * r259573;
        double r259575 = r259570 + r259574;
        return r259575;
}

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