/export/starexec/sandbox/solver/bin/starexec_run_certified /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^3)) f01xfsxxxfxyszsf01z0010s1f332.1f01z0fsz0z0z0f01z0cfsz0z0z0fz0z1sz2sf01z2fz0z1sz2c1f01z2f01z0fz0z1sz2f01z0fsz0z0z0fz0z1sz2sf01z21c1110c11110f3230003100s1111fz0z1sz2c1f01z2f01z0cfsz0z0z0fz0z1sz2c1f01z231111c1001100000011000000001c11000000000110000011001f3031000000011000110011111000000000200000011003s100210000000000000011100112111000000103100000000f01z0cfsz0z0z0f01z0cfsz0z0z0fz0z1sz2c1f01z2AProVEAProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Statistics for single proof: 100.00 % (5 real / 0 unknown / 0 assumptions / 5 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe