A (human) proof of a triple binomial sum supercongruence
  In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they propose some supercongruences as conjectures. Here we prove one of them and we leave some remarks for the others. 
Roberto Tauraso
math.CO