Average Error: 0.1 → 0.1
Time: 2.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 r16640 = x;
        double r16641 = y;
        double r16642 = r16640 * r16641;
        double r16643 = 1.0;
        double r16644 = r16643 - r16641;
        double r16645 = r16642 * r16644;
        return r16645;
}
↓
double f(double x, double y) {
        double r16646 = 1.0;
        double r16647 = y;
        double r16648 = r16646 - r16647;
        double r16649 = x;
        double r16650 = r16649 * r16647;
        double r16651 = r16648 * r16650;
        return r16651;
}

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 2020036 
(FPCore (x y)
  :name "Statistics.Distribution.Binomial:$cvariance from math-functions-0.1.5.2"
  :precision binary64
  (* (* x y) (- 1 y)))