Average Error: 0.0 → 0.0
Time: 2.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 r269196 = x;
        double r269197 = y;
        double r269198 = r269196 * r269197;
        double r269199 = 1.0;
        double r269200 = r269199 - r269196;
        double r269201 = z;
        double r269202 = r269200 * r269201;
        double r269203 = r269198 + r269202;
        return r269203;
}
↓
double f(double x, double y, double z) {
        double r269204 = x;
        double r269205 = y;
        double r269206 = r269204 * r269205;
        double r269207 = 1.0;
        double r269208 = r269207 - r269204;
        double r269209 = z;
        double r269210 = r269208 * r269209;
        double r269211 = r269206 + r269210;
        return r269211;
}

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