Average Error: 0.0 → 0.0
Time: 4.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 r1180 = x;
        double r1181 = y;
        double r1182 = r1180 * r1181;
        double r1183 = 1.0;
        double r1184 = r1183 - r1180;
        double r1185 = z;
        double r1186 = r1184 * r1185;
        double r1187 = r1182 + r1186;
        return r1187;
}
↓
double f(double x, double y, double z) {
        double r1188 = x;
        double r1189 = y;
        double r1190 = r1188 * r1189;
        double r1191 = 1.0;
        double r1192 = r1191 - r1188;
        double r1193 = z;
        double r1194 = r1192 * r1193;
        double r1195 = r1190 + r1194;
        return r1195;
}

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