/export/starexec/sandbox/solver/bin/starexec_run_certified /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) sum00sumsx+sumxsxsum100sum1sxs+sum1x+xx00s1+2sum1sum1112.1sum00sum0csumsz0+sumz0sz0sumsz0c1sumz0sum100sum10c2sum1sz0s+sum1z0+z0z0sum1sz0c3sum1z0sum0sumsz0sum10sum1sz0sum00sumsz0+sumz0sz0sum100sum1sz0s+sum1z0+z0z01c00c11110c200c31110sum1110sum11110001s1111sum0csumsz0c1sumz0sum10c2sum1sz0c3sum1z0sum0csumsz0c1sumz0sum10c2sum1sz0c3sum1z0AProVEAProVE 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