Average Error: 0.1 → 0.1
Time: 1.7s
Precision: 64
\[\left(x \cdot y\right) \cdot \left(1 - y\right)\]
↓
\[\left(1 - y\right) \cdot \left(x \cdot y\right)\]
\left(x \cdot y\right) \cdot \left(1 - y\right)
↓
\left(1 - y\right) \cdot \left(x \cdot y\right)
double f(double x, double y) {
        double r19581 = x;
        double r19582 = y;
        double r19583 = r19581 * r19582;
        double r19584 = 1.0;
        double r19585 = r19584 - r19582;
        double r19586 = r19583 * r19585;
        return r19586;
}
↓
double f(double x, double y) {
        double r19587 = 1.0;
        double r19588 = y;
        double r19589 = r19587 - r19588;
        double r19590 = x;
        double r19591 = r19590 * r19588;
        double r19592 = r19589 * r19591;
        return r19592;
}

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 *-commutative0.1

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

  4. Final simplification0.1

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

Reproduce

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