[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 1 from proof max-perm-ls (conclusion)
⊦ max(ints) < max(ints0) ∧ ints0 ≠ [] → ¬ perm(ints, ints1 + ints0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
max(ints) < max(ints0), perm(ints, ints1 + ints0) ⊦ ints0 = []
Rule argument
Additional information