WORST_CASE(?, O(n^1)) fn__fn__afn__gn__fn__afXn__fXan__agXn__gXactivaten__fXfXactivaten__aaactivaten__gXgactivateXactivateXXn__f1n__a0n__g1f1a0g1activate112.12001234n__f000n__a00n__g000f001a02g003activate004n__a17n__f176n__g165f151n__f101n__a12n__g103f104a14activate108g184f154n__f251n__f204n__a24n__g284f108a18g188f158n__f254n__f208n__a28n__g288n__f2580408AProVEAProVE 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