Average Error: 0.0 → 0.0
Time: 2.9s
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 r161092 = x;
        double r161093 = y;
        double r161094 = r161092 * r161093;
        double r161095 = 1.0;
        double r161096 = r161095 - r161092;
        double r161097 = z;
        double r161098 = r161096 * r161097;
        double r161099 = r161094 + r161098;
        return r161099;
}
↓
double f(double x, double y, double z) {
        double r161100 = x;
        double r161101 = y;
        double r161102 = r161100 * r161101;
        double r161103 = 1.0;
        double r161104 = r161103 - r161100;
        double r161105 = z;
        double r161106 = r161104 * r161105;
        double r161107 = r161102 + r161106;
        return r161107;
}

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