Average Error: 0.0 → 0.0
Time: 10.4s
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 r788191 = x;
        double r788192 = y;
        double r788193 = r788191 * r788192;
        double r788194 = 1.0;
        double r788195 = r788194 - r788191;
        double r788196 = z;
        double r788197 = r788195 * r788196;
        double r788198 = r788193 + r788197;
        return r788198;
}
↓
double f(double x, double y, double z) {
        double r788199 = x;
        double r788200 = y;
        double r788201 = r788199 * r788200;
        double r788202 = 1.0;
        double r788203 = r788202 - r788199;
        double r788204 = z;
        double r788205 = r788203 * r788204;
        double r788206 = r788201 + r788205;
        return r788206;
}

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