Average Error: 0.0 → 0.0
Time: 9.1s
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 r153026 = x;
        double r153027 = y;
        double r153028 = r153026 * r153027;
        double r153029 = 1.0;
        double r153030 = r153029 - r153026;
        double r153031 = z;
        double r153032 = r153030 * r153031;
        double r153033 = r153028 + r153032;
        return r153033;
}
↓
double f(double x, double y, double z) {
        double r153034 = x;
        double r153035 = y;
        double r153036 = r153034 * r153035;
        double r153037 = 1.0;
        double r153038 = r153037 - r153034;
        double r153039 = z;
        double r153040 = r153038 * r153039;
        double r153041 = r153036 + r153040;
        return r153041;
}

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