Average Error: 0.0 → 0.0
Time: 9.8s
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 r206482 = x;
        double r206483 = y;
        double r206484 = r206482 * r206483;
        double r206485 = 1.0;
        double r206486 = r206485 - r206482;
        double r206487 = z;
        double r206488 = r206486 * r206487;
        double r206489 = r206484 + r206488;
        return r206489;
}
↓
double f(double x, double y, double z) {
        double r206490 = x;
        double r206491 = y;
        double r206492 = r206490 * r206491;
        double r206493 = 1.0;
        double r206494 = r206493 - r206490;
        double r206495 = z;
        double r206496 = r206494 * r206495;
        double r206497 = r206492 + r206496;
        return r206497;
}

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