/export/starexec/sandbox/solver/bin/starexec_run_certified /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) walk#1Leafx2cons_xx2walk#1Nodex5x3comp_f_gwalk#1x5walk#1x3comp_f_g#1comp_f_gx4x5comp_f_gx2x3x1comp_f_g#1x4x5comp_f_g#1x2x3x1comp_f_g#1comp_f_gx7x9cons_xx2x4comp_f_g#1x7x9Consx2x4comp_f_g#1cons_xx2comp_f_gx5x7x3Consx2comp_f_g#1x5x7x3comp_f_g#1cons_xx5cons_xx2x4Consx5Consx2x4mainLeafx4Consx4NilmainNodex9x5comp_f_g#1walk#1x9walk#1x5NilLeaf1cons_x1Node2comp_f_g2Cons2Nil0walk#11comp_f_g#13main112.1200123Leaf000cons_x000Node0000comp_f_g0000Cons0000Nil00walk#1001comp_f_g#100002main003cons_x101walk#1104walk#1105comp_f_g1451comp_f_g#110006comp_f_g#110062Cons1007comp_f_g#110072comp_f_g#110008Cons1082Cons1009Cons1092Nil110Cons10103walk#11011walk#11012Nil113comp_f_g#111112133cons_x104cons_x105cons_x1011cons_x1012comp_f_g1454comp_f_g1455comp_f_g14511comp_f_g14512comp_f_g#110066comp_f_g#110076comp_f_g#110068Cons1067Cons1077comp_f_g#110078Cons1086Cons1088Cons1069Cons1079Cons1096Cons1098comp_f_g#12451314comp_f_g#1245143Cons201315comp_f_g#1245153comp_f_g#12451316Cons20163Cons201317Cons20173comp_f_g#12451414comp_f_g#12451514comp_f_g#12451416Cons201415Cons201515comp_f_g#12451516Cons201614Cons201616Cons201417Cons201517Cons201714Cons201716AProVEAProVE 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