Average Error: 0.0 → 0.0
Time: 4.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 r245045 = x;
        double r245046 = y;
        double r245047 = r245045 * r245046;
        double r245048 = 1.0;
        double r245049 = r245048 - r245045;
        double r245050 = z;
        double r245051 = r245049 * r245050;
        double r245052 = r245047 + r245051;
        return r245052;
}
↓
double f(double x, double y, double z) {
        double r245053 = x;
        double r245054 = y;
        double r245055 = r245053 * r245054;
        double r245056 = 1.0;
        double r245057 = r245056 - r245053;
        double r245058 = z;
        double r245059 = r245057 * r245058;
        double r245060 = r245055 + r245059;
        return r245060;
}

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