Average Error: 0.0 → 0.0
Time: 12.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 r266999 = x;
        double r267000 = y;
        double r267001 = r266999 * r267000;
        double r267002 = 1.0;
        double r267003 = r267002 - r266999;
        double r267004 = z;
        double r267005 = r267003 * r267004;
        double r267006 = r267001 + r267005;
        return r267006;
}
↓
double f(double x, double y, double z) {
        double r267007 = x;
        double r267008 = y;
        double r267009 = r267007 * r267008;
        double r267010 = 1.0;
        double r267011 = r267010 - r267007;
        double r267012 = z;
        double r267013 = r267011 * r267012;
        double r267014 = r267009 + r267013;
        return r267014;
}

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