Average Error: 0.0 → 0.0
Time: 9.3s
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 r274233 = x;
        double r274234 = y;
        double r274235 = r274233 * r274234;
        double r274236 = 1.0;
        double r274237 = r274236 - r274233;
        double r274238 = z;
        double r274239 = r274237 * r274238;
        double r274240 = r274235 + r274239;
        return r274240;
}
↓
double f(double x, double y, double z) {
        double r274241 = x;
        double r274242 = y;
        double r274243 = r274241 * r274242;
        double r274244 = 1.0;
        double r274245 = r274244 - r274241;
        double r274246 = z;
        double r274247 = r274245 * r274246;
        double r274248 = r274243 + r274247;
        return r274248;
}

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