major code change: refute can now handle any Isabelle term, adds certain axioms automatically, and can handle inductive datatypes (but not yet recursion over them)
Chain = List +
consts chain :: "('a => 'a => bool) * 'a list => bool"
recdef chain "measure (%(r,xs). length xs)"
"chain(r, []) = True"
"chain(r, [x]) = True"
"chain(r, x#y#zs) = (r x y & chain(r, y#zs))"
end