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 r236538 = x;
        double r236539 = y;
        double r236540 = r236538 * r236539;
        double r236541 = 1.0;
        double r236542 = r236541 - r236538;
        double r236543 = z;
        double r236544 = r236542 * r236543;
        double r236545 = r236540 + r236544;
        return r236545;
}
↓
double f(double x, double y, double z) {
        double r236546 = x;
        double r236547 = y;
        double r236548 = r236546 * r236547;
        double r236549 = 1.0;
        double r236550 = r236549 - r236546;
        double r236551 = z;
        double r236552 = r236550 * r236551;
        double r236553 = r236548 + r236552;
        return r236553;
}

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