/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)) div2SSx+S0div2xdiv2S00div200+xS0Sx+S0ySyS100div21+212.1div2SSz0+S0div2z0div2SSz0c2+S0div2z0div2z0div2S00div2S0c3div200div20c4+z0S0Sz0+z0S0c+S0z0Sz0+S0z0c1+z0S0+S0z0div2SSz0div2S0div201c00c100c2211012c300c400div211+211112+2110div21111S1111001div2S0c3div20c4+z0S0c+S0z0c1div2SSz0c2+S0div2z0div2z0div2S0c3div20c41c00c100c2211012c300c400div21111+211112+21div21110S1111001div2SSz0c2+S0div2z0div2z0+z0S0c+S0z0c1div2SSz0c2+S0div2z0div2z0div2S0c3div20c4AProVEAProVE 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