Average Error: 0.0 → 0.0
Time: 10.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 r229198 = x;
        double r229199 = y;
        double r229200 = r229198 * r229199;
        double r229201 = 1.0;
        double r229202 = r229201 - r229198;
        double r229203 = z;
        double r229204 = r229202 * r229203;
        double r229205 = r229200 + r229204;
        return r229205;
}
↓
double f(double x, double y, double z) {
        double r229206 = x;
        double r229207 = y;
        double r229208 = r229206 * r229207;
        double r229209 = 1.0;
        double r229210 = r229209 - r229206;
        double r229211 = z;
        double r229212 = r229210 * r229211;
        double r229213 = r229208 + r229212;
        return r229213;
}

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