Average Error: 0.0 → 0.0
Time: 9.0s
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 r333149 = x;
        double r333150 = y;
        double r333151 = r333149 * r333150;
        double r333152 = 1.0;
        double r333153 = r333152 - r333149;
        double r333154 = z;
        double r333155 = r333153 * r333154;
        double r333156 = r333151 + r333155;
        return r333156;
}
↓
double f(double x, double y, double z) {
        double r333157 = x;
        double r333158 = y;
        double r333159 = r333157 * r333158;
        double r333160 = 1.0;
        double r333161 = r333160 - r333157;
        double r333162 = z;
        double r333163 = r333161 * r333162;
        double r333164 = r333159 + r333163;
        return r333164;
}

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