/export/starexec/sandbox2/solver/bin/starexec_run_certified /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) andnotnotxynotzandybandxzxnot1band2and312.1andnotnotz0z1notz2andz1bandz0z2z0andnotnotz0z1notz2candz1bandz0z2z0andnotnotz0z1notz2andnotnotz0z1notz2andz1bandz0z2z01c1110and311012not11band20andnotnotz0z1notz2candz1bandz0z2z0andnotnotz0z1notz2candz1bandz0z2z0AProVEAProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Statistics for single proof: 100.00 % (4 real / 0 unknown / 0 assumptions / 4 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe