Average Error: 0.0 → 0.0
Time: 661.0ms
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 r246834 = x;
        double r246835 = y;
        double r246836 = r246834 * r246835;
        double r246837 = 1.0;
        double r246838 = r246837 - r246834;
        double r246839 = z;
        double r246840 = r246838 * r246839;
        double r246841 = r246836 + r246840;
        return r246841;
}
↓
double f(double x, double y, double z) {
        double r246842 = x;
        double r246843 = y;
        double r246844 = r246842 * r246843;
        double r246845 = 1.0;
        double r246846 = r246845 - r246842;
        double r246847 = z;
        double r246848 = r246846 * r246847;
        double r246849 = r246844 + r246848;
        return r246849;
}

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