The Whiley Theorem Prover (WyTP) is an automatic and interactive theorem prover designed to discharge verification conditions generated by the Whiley Compiler. WyTP operates over a variant of first-order logic which includes integer arithmetic, arrays and quantification.
To get the contradiction, we need to instantiate the quantifier with k => i. But, unfortunately, quantifier instantiation is not being triggered because there is no array access expression xs[i].
The following fails to verify:
The important parts of the generated proof are:
To get the contradiction, we need to instantiate the quantifier with
k => i
. But, unfortunately, quantifier instantiation is not being triggered because there is no array access expressionxs[i]
.