WORST_CASE(?, O(n^1)) a__gXa__hXa__cda__hda__gcmarkgXa__gXmarkhXa__hXmarkca__cmarkdda__gXgXa__hXhXa__ccd0c0g1h1a__g1a__c0a__h1mark112.13212a__g021a__c01a__h021mark021a__h121g121d11c11h121a__g121a__c11a__h221g221d21c21h221h321a__g131a__h231g231h331d02c02g022h022c13AProVEAProVE 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