Average Error: 0.0 → 0.0
Time: 7.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 r132409 = x;
        double r132410 = y;
        double r132411 = r132409 * r132410;
        double r132412 = 1.0;
        double r132413 = r132412 - r132409;
        double r132414 = z;
        double r132415 = r132413 * r132414;
        double r132416 = r132411 + r132415;
        return r132416;
}
↓
double f(double x, double y, double z) {
        double r132417 = x;
        double r132418 = y;
        double r132419 = r132417 * r132418;
        double r132420 = 1.0;
        double r132421 = r132420 - r132417;
        double r132422 = z;
        double r132423 = r132421 * r132422;
        double r132424 = r132419 + r132423;
        return r132424;
}

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