Average Error: 0.0 → 0.0
Time: 7.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 r168666 = x;
        double r168667 = y;
        double r168668 = r168666 * r168667;
        double r168669 = 1.0;
        double r168670 = r168669 - r168666;
        double r168671 = z;
        double r168672 = r168670 * r168671;
        double r168673 = r168668 + r168672;
        return r168673;
}
↓
double f(double x, double y, double z) {
        double r168674 = x;
        double r168675 = y;
        double r168676 = r168674 * r168675;
        double r168677 = 1.0;
        double r168678 = r168677 - r168674;
        double r168679 = z;
        double r168680 = r168678 * r168679;
        double r168681 = r168676 + r168680;
        return r168681;
}

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