Average Error: 0.0 → 0.0
Time: 6.8s
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 r201625 = x;
        double r201626 = y;
        double r201627 = r201625 * r201626;
        double r201628 = 1.0;
        double r201629 = r201628 - r201625;
        double r201630 = z;
        double r201631 = r201629 * r201630;
        double r201632 = r201627 + r201631;
        return r201632;
}
↓
double f(double x, double y, double z) {
        double r201633 = x;
        double r201634 = y;
        double r201635 = r201633 * r201634;
        double r201636 = 1.0;
        double r201637 = r201636 - r201633;
        double r201638 = z;
        double r201639 = r201637 * r201638;
        double r201640 = r201635 + r201639;
        return r201640;
}

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)))