Average Error: 0.0 → 0.0
Time: 9.0s
Precision: 64
\[x \cdot y + \left(1.0 - x\right) \cdot z\]
↓
\[x \cdot y + \left(1.0 - x\right) \cdot z\]
x \cdot y + \left(1.0 - x\right) \cdot z
↓
x \cdot y + \left(1.0 - x\right) \cdot z
double f(double x, double y, double z) {
        double r11219569 = x;
        double r11219570 = y;
        double r11219571 = r11219569 * r11219570;
        double r11219572 = 1.0;
        double r11219573 = r11219572 - r11219569;
        double r11219574 = z;
        double r11219575 = r11219573 * r11219574;
        double r11219576 = r11219571 + r11219575;
        return r11219576;
}
↓
double f(double x, double y, double z) {
        double r11219577 = x;
        double r11219578 = y;
        double r11219579 = r11219577 * r11219578;
        double r11219580 = 1.0;
        double r11219581 = r11219580 - r11219577;
        double r11219582 = z;
        double r11219583 = r11219581 * r11219582;
        double r11219584 = r11219579 + r11219583;
        return r11219584;
}

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.0 - x\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto x \cdot y + \left(1.0 - x\right) \cdot z\]

Reproduce

herbie shell --seed 2019162 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:$crender from diagrams-rasterific-1.3.1.3"
  (+ (* x y) (* (- 1.0 x) z)))