Average Error: 0.0 → 0.0
Time: 15.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 r172023 = x;
        double r172024 = y;
        double r172025 = r172023 * r172024;
        double r172026 = 1.0;
        double r172027 = r172026 - r172023;
        double r172028 = z;
        double r172029 = r172027 * r172028;
        double r172030 = r172025 + r172029;
        return r172030;
}
↓
double f(double x, double y, double z) {
        double r172031 = x;
        double r172032 = y;
        double r172033 = r172031 * r172032;
        double r172034 = 1.0;
        double r172035 = r172034 - r172031;
        double r172036 = z;
        double r172037 = r172035 * r172036;
        double r172038 = r172033 + r172037;
        return r172038;
}

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