Average Error: 0.0 → 0.0
Time: 1.9s
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 r260089 = x;
        double r260090 = y;
        double r260091 = r260089 * r260090;
        double r260092 = 1.0;
        double r260093 = r260092 - r260089;
        double r260094 = z;
        double r260095 = r260093 * r260094;
        double r260096 = r260091 + r260095;
        return r260096;
}
↓
double f(double x, double y, double z) {
        double r260097 = x;
        double r260098 = y;
        double r260099 = r260097 * r260098;
        double r260100 = 1.0;
        double r260101 = r260100 - r260097;
        double r260102 = z;
        double r260103 = r260101 * r260102;
        double r260104 = r260099 + r260103;
        return r260104;
}

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