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