Average Error: 0.0 → 0.0
Time: 2.8s
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 r290148 = x;
        double r290149 = y;
        double r290150 = r290148 * r290149;
        double r290151 = 1.0;
        double r290152 = r290151 - r290148;
        double r290153 = z;
        double r290154 = r290152 * r290153;
        double r290155 = r290150 + r290154;
        return r290155;
}
↓
double f(double x, double y, double z) {
        double r290156 = x;
        double r290157 = y;
        double r290158 = r290156 * r290157;
        double r290159 = 1.0;
        double r290160 = r290159 - r290156;
        double r290161 = z;
        double r290162 = r290160 * r290161;
        double r290163 = r290158 + r290162;
        return r290163;
}

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