Average Error: 0.1 → 0.1
Time: 2.4s
Precision: 64
\[\left(x \cdot y\right) \cdot \left(1 - y\right)\]
↓
\[\left(x \cdot y\right) \cdot 1 + \left(x \cdot y\right) \cdot \left(-y\right)\]
\left(x \cdot y\right) \cdot \left(1 - y\right)
↓
\left(x \cdot y\right) \cdot 1 + \left(x \cdot y\right) \cdot \left(-y\right)
double f(double x, double y) {
        double r14942 = x;
        double r14943 = y;
        double r14944 = r14942 * r14943;
        double r14945 = 1.0;
        double r14946 = r14945 - r14943;
        double r14947 = r14944 * r14946;
        return r14947;
}
↓
double f(double x, double y) {
        double r14948 = x;
        double r14949 = y;
        double r14950 = r14948 * r14949;
        double r14951 = 1.0;
        double r14952 = r14950 * r14951;
        double r14953 = -r14949;
        double r14954 = r14950 * r14953;
        double r14955 = r14952 + r14954;
        return r14955;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\left(x \cdot y\right) \cdot \left(1 - y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.1

    \[\leadsto \left(x \cdot y\right) \cdot \color{blue}{\left(1 + \left(-y\right)\right)}\]

  4. Applied distribute-lft-in0.1

    \[\leadsto \color{blue}{\left(x \cdot y\right) \cdot 1 + \left(x \cdot y\right) \cdot \left(-y\right)}\]

  5. Final simplification0.1

    \[\leadsto \left(x \cdot y\right) \cdot 1 + \left(x \cdot y\right) \cdot \left(-y\right)\]

Reproduce

herbie shell --seed 2019353 
(FPCore (x y)
  :name "Statistics.Distribution.Binomial:$cvariance from math-functions-0.1.5.2"
  :precision binary64
  (* (* x y) (- 1 y)))