Average Error: 0.0 → 0.0
Time: 7.2s
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 r187155 = x;
        double r187156 = y;
        double r187157 = r187155 * r187156;
        double r187158 = 1.0;
        double r187159 = r187158 - r187155;
        double r187160 = z;
        double r187161 = r187159 * r187160;
        double r187162 = r187157 + r187161;
        return r187162;
}
↓
double f(double x, double y, double z) {
        double r187163 = x;
        double r187164 = y;
        double r187165 = r187163 * r187164;
        double r187166 = 1.0;
        double r187167 = r187166 - r187163;
        double r187168 = z;
        double r187169 = r187167 * r187168;
        double r187170 = r187165 + r187169;
        return r187170;
}

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