/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)) f01xfsxxxfxyszsf01z0010s1f322.1f01z0fsz0z0z0f01z0cfsz0z0z0fz0z1sz2sf01z2fz0z1sz2c1f01z2f01z0fz0z1sz2f01z0fsz0z0z0fz0z1sz2sf01z21c1110c11110f3130001100s1111fz0z1sz2c1f01z2f01z0cfsz0z0z0fz0z1sz2c1f01z221111c10000110001c1131000110001f3000000110100002110003s1410001102101004111001031000f01z0cfsz0z0z0f01z0cfsz0z0z0fz0z1sz2c1f01z2AProVEAProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Statistics for single proof: 100.00 % (5 real / 0 unknown / 0 assumptions / 5 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe