Average Error: 0.0 → 0.0
Time: 3.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 r264301 = x;
        double r264302 = y;
        double r264303 = r264301 * r264302;
        double r264304 = 1.0;
        double r264305 = r264304 - r264301;
        double r264306 = z;
        double r264307 = r264305 * r264306;
        double r264308 = r264303 + r264307;
        return r264308;
}
↓
double f(double x, double y, double z) {
        double r264309 = x;
        double r264310 = y;
        double r264311 = r264309 * r264310;
        double r264312 = 1.0;
        double r264313 = r264312 - r264309;
        double r264314 = z;
        double r264315 = r264313 * r264314;
        double r264316 = r264311 + r264315;
        return r264316;
}

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