WORST_CASE(?, O(n^1)) f0cons0n__fs0fs0fps0psXXfXn__fXactivaten__fXfXactivateXX00cons2n__f1s1f1p1activate112.1200123000cons0000n__f000s000f001p002activate003014017s176n__f165cons1451s179p198f181n__f101f103cons1453f183n__f281n__f20302100213s21312n__f21211cons210111cons210113n__f283020378AProVEAProVE 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