Average Error: 0.0 → 0.0
Time: 55.3s
Precision: 64
\[x \cdot y + \left(1 - x\right) \cdot z\]
↓
\[z \cdot \left(1 - x\right) + y \cdot x\]
x \cdot y + \left(1 - x\right) \cdot z
↓
z \cdot \left(1 - x\right) + y \cdot x
double f(double x, double y, double z) {
        double r11742549 = x;
        double r11742550 = y;
        double r11742551 = r11742549 * r11742550;
        double r11742552 = 1.0;
        double r11742553 = r11742552 - r11742549;
        double r11742554 = z;
        double r11742555 = r11742553 * r11742554;
        double r11742556 = r11742551 + r11742555;
        return r11742556;
}
↓
double f(double x, double y, double z) {
        double r11742557 = z;
        double r11742558 = 1.0;
        double r11742559 = x;
        double r11742560 = r11742558 - r11742559;
        double r11742561 = r11742557 * r11742560;
        double r11742562 = y;
        double r11742563 = r11742562 * r11742559;
        double r11742564 = r11742561 + r11742563;
        return r11742564;
}

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 z \cdot \left(1 - x\right) + y \cdot x\]

Reproduce

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