/export/starexec/sandbox2/solver/bin/starexec_run_certified /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^2)) sum00sumsx+sumxsx+x0x+xsys+xy00s1sum1+222.1sum00sum0csumsz0+sumz0sz0sumsz0c1+sumz0sz0sumz0+z00z0+z00c2+z0sz1s+z0z1+z0sz1c3+z0z1sum0sumsz0+z00+z0sz11c00c1211012c200c31110sum1111+21sum11+20001s11sum0csum0csumsz0c1+sumz0sz0sumz0+z00c2+z0sz1c3+z0z11c00c1211012c200c31110sum1111+2112sum1110+20001s1111sumsz0c1+sumz0sz0sumz0sum0csumsz0c1+sumz0sz0sumz0+z00c2+z0sz1c3+z0z11c00c1211012c200c31110sum13+2332sum1110+21003s1211+z00c2sum0csumsz0c1+sumz0sz0sumz0+z00c2+z0sz1c3+z0z12c00c1211012c200c31110sum1221211+2112222sum11110+2120000s1111+z0sz1c3+z0z1sum0csumsz0c1+sumz0sz0sumz0+z00c2+z0sz1c3+z0z1AProVEAProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Statistics for single proof: 100.00 % (6 real / 0 unknown / 0 assumptions / 6 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe