WORST_CASE(?, O(n^1)) fXgn__hn__fXhXn__hXfXn__fXactivaten__hXhactivateXactivaten__fXfactivateXactivateXXg1n__h1n__f1f1h1activate112.1200123g000n__h000n__f000f001h002activate003n__f105n__h154g141n__h102n__f101activate106h163activate107f173n__f279n__h298g283n__h263n__f273h166h167f176f177g286g287n__h266n__h267n__f276n__f277030607AProVEAProVE 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