Average Error: 0.0 → 0.0
Time: 2.9s
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 r249874 = x;
        double r249875 = y;
        double r249876 = r249874 * r249875;
        double r249877 = 1.0;
        double r249878 = r249877 - r249874;
        double r249879 = z;
        double r249880 = r249878 * r249879;
        double r249881 = r249876 + r249880;
        return r249881;
}
↓
double f(double x, double y, double z) {
        double r249882 = x;
        double r249883 = y;
        double r249884 = r249882 * r249883;
        double r249885 = 1.0;
        double r249886 = r249885 - r249882;
        double r249887 = z;
        double r249888 = r249886 * r249887;
        double r249889 = r249884 + r249888;
        return r249889;
}

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