Average Error: 0.0 → 0.0
Time: 4.6s
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 r302393 = x;
        double r302394 = y;
        double r302395 = r302393 * r302394;
        double r302396 = 1.0;
        double r302397 = r302396 - r302393;
        double r302398 = z;
        double r302399 = r302397 * r302398;
        double r302400 = r302395 + r302399;
        return r302400;
}
↓
double f(double x, double y, double z) {
        double r302401 = x;
        double r302402 = y;
        double r302403 = r302401 * r302402;
        double r302404 = 1.0;
        double r302405 = r302404 - r302401;
        double r302406 = z;
        double r302407 = r302405 * r302406;
        double r302408 = r302403 + r302407;
        return r302408;
}

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)))