Average Error: 0.0 → 0.0
Time: 1.7s
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 r232338 = x;
        double r232339 = y;
        double r232340 = r232338 * r232339;
        double r232341 = 1.0;
        double r232342 = r232341 - r232338;
        double r232343 = z;
        double r232344 = r232342 * r232343;
        double r232345 = r232340 + r232344;
        return r232345;
}
↓
double f(double x, double y, double z) {
        double r232346 = x;
        double r232347 = y;
        double r232348 = r232346 * r232347;
        double r232349 = 1.0;
        double r232350 = r232349 - r232346;
        double r232351 = z;
        double r232352 = r232350 * r232351;
        double r232353 = r232348 + r232352;
        return r232353;
}

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