/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)) walk#1Nilwalk_xswalk#1Consx4x3comp_f_gwalk#1x3walk_xs_3x4comp_f_g#1comp_f_gx7x9walk_xs_3x8x12comp_f_g#1x7x9Consx8x12comp_f_g#1walk_xswalk_xs_3x8x12Consx8x12mainNilNilmainConsx4x5comp_f_g#1walk#1x5walk_xs_3x4NilNil0walk_xs0Cons2comp_f_g2walk_xs_31walk#11comp_f_g#13main112.1200123Nil00walk_xs00Cons0000comp_f_g0000walk_xs_3000walk#1001comp_f_g#100002main003walk_xs11walk#1104walk_xs_3105comp_f_g1451Cons1006comp_f_g#110062Cons1002Nil13walk#1107walk_xs_3108Nil19comp_f_g#117893walk_xs14walk_xs17comp_f_g1454comp_f_g1457Cons1066Cons1062Cons20910comp_f_g#1245103Cons2093Cons201010Cons20103AProVEAProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Statistics for single proof: 100.00 % (1 real / 0 unknown / 0 assumptions / 1 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe