Average Error: 0.0 → 0.0
Time: 3.6s
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 r216663 = x;
        double r216664 = y;
        double r216665 = r216663 * r216664;
        double r216666 = 1.0;
        double r216667 = r216666 - r216663;
        double r216668 = z;
        double r216669 = r216667 * r216668;
        double r216670 = r216665 + r216669;
        return r216670;
}
↓
double f(double x, double y, double z) {
        double r216671 = x;
        double r216672 = y;
        double r216673 = r216671 * r216672;
        double r216674 = 1.0;
        double r216675 = r216674 - r216671;
        double r216676 = z;
        double r216677 = r216675 * r216676;
        double r216678 = r216673 + r216677;
        return r216678;
}

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