Average Error: 0.0 → 0.0
Time: 929.0ms
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 r256134 = x;
        double r256135 = y;
        double r256136 = r256134 * r256135;
        double r256137 = 1.0;
        double r256138 = r256137 - r256134;
        double r256139 = z;
        double r256140 = r256138 * r256139;
        double r256141 = r256136 + r256140;
        return r256141;
}
↓
double f(double x, double y, double z) {
        double r256142 = x;
        double r256143 = y;
        double r256144 = r256142 * r256143;
        double r256145 = 1.0;
        double r256146 = r256145 - r256142;
        double r256147 = z;
        double r256148 = r256146 * r256147;
        double r256149 = r256144 + r256148;
        return r256149;
}

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