WORST_CASE(?, O(n^1)) decreaseConsxxsdecreasexsdecreaseNilnumber42Nilnumber42xConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilConsNilNilgoalxdecreasexCons2Nil0decrease1number421goal112.1200123Cons0000Nil00decrease001number42002goal003decrease101Nil14number42141Nil15Nil18Cons1587Cons1576Cons1566Cons1562decrease103number42143Nil29Nil212Cons291211Cons291110Cons291010Cons29101Cons29103AProVEAProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Statistics for single proof: 100.00 % (1 real / 0 unknown / 0 assumptions / 1 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe