details

property	value
status	complete
benchmark	cime1.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n098.star.cs.uiowa.edu
space	Secret_05_TRS

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	6.70309996605 seconds
cpu usage	8.63670048
max memory	1.64073472E8

stage attributes

key	value
output-size	4564
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: sortSu(circ(sortSu(cons(te(a),sortSu(s))),sortSu(t))) -> sortSu(cons(te(msubst(te(a),sortSu(t))),sortSu(circ(sortSu(s),sortSu(t))))) 2: sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(te(a),sortSu(t))))) -> sortSu(cons(te(a),sortSu(circ(sortSu(s),sortSu(t))))) 3: sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(sop(lift()),sortSu(t))))) -> sortSu(cons(sop(lift()),sortSu(circ(sortSu(s),sortSu(t))))) 4: sortSu(circ(sortSu(circ(sortSu(s),sortSu(t))),sortSu(u))) -> sortSu(circ(sortSu(s),sortSu(circ(sortSu(t),sortSu(u))))) 5: sortSu(circ(sortSu(s),sortSu(id()))) -> sortSu(s) 6: sortSu(circ(sortSu(id()),sortSu(s))) -> sortSu(s) 7: sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(circ(sortSu(cons(sop(lift()),sortSu(t))),sortSu(u))))) -> sortSu(circ(sortSu(cons(sop(lift()),sortSu(circ(sortSu(s),sortSu(t))))),sortSu(u))) 8: te(subst(te(a),sortSu(id()))) -> te(a) 9: te(msubst(te(a),sortSu(id()))) -> te(a) 10: te(msubst(te(msubst(te(a),sortSu(s))),sortSu(t))) -> te(msubst(te(a),sortSu(circ(sortSu(s),sortSu(t))))) Number of strict rules: 10 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(te(a),sortSu(t))))) -> #sortSu(cons(te(a),sortSu(circ(sortSu(s),sortSu(t))))) #2: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(te(a),sortSu(t))))) -> #sortSu(circ(sortSu(s),sortSu(t))) #3: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(circ(sortSu(cons(sop(lift()),sortSu(t))),sortSu(u))))) -> #sortSu(circ(sortSu(cons(sop(lift()),sortSu(circ(sortSu(s),sortSu(t))))),sortSu(u))) #4: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(circ(sortSu(cons(sop(lift()),sortSu(t))),sortSu(u))))) -> #sortSu(cons(sop(lift()),sortSu(circ(sortSu(s),sortSu(t))))) #5: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(circ(sortSu(cons(sop(lift()),sortSu(t))),sortSu(u))))) -> #sortSu(circ(sortSu(s),sortSu(t))) #6: #te(msubst(te(msubst(te(a),sortSu(s))),sortSu(t))) -> #te(msubst(te(a),sortSu(circ(sortSu(s),sortSu(t))))) #7: #te(msubst(te(msubst(te(a),sortSu(s))),sortSu(t))) -> #sortSu(circ(sortSu(s),sortSu(t))) #8: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(sop(lift()),sortSu(t))))) -> #sortSu(cons(sop(lift()),sortSu(circ(sortSu(s),sortSu(t))))) #9: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(sop(lift()),sortSu(t))))) -> #sortSu(circ(sortSu(s),sortSu(t))) #10: #sortSu(circ(sortSu(cons(te(a),sortSu(s))),sortSu(t))) -> #sortSu(cons(te(msubst(te(a),sortSu(t))),sortSu(circ(sortSu(s),sortSu(t))))) #11: #sortSu(circ(sortSu(cons(te(a),sortSu(s))),sortSu(t))) -> #te(msubst(te(a),sortSu(t))) #12: #sortSu(circ(sortSu(cons(te(a),sortSu(s))),sortSu(t))) -> #sortSu(circ(sortSu(s),sortSu(t))) #13: #sortSu(circ(sortSu(circ(sortSu(s),sortSu(t))),sortSu(u))) -> #sortSu(circ(sortSu(s),sortSu(circ(sortSu(t),sortSu(u))))) #14: #sortSu(circ(sortSu(circ(sortSu(s),sortSu(t))),sortSu(u))) -> #sortSu(circ(sortSu(t),sortSu(u))) Number of SCCs: 1, DPs: 10 SCC { #2 #3 #5..7 #9 #11..14 } Sum... Max... QLPOpS... NegMaxSum... succeeded. sortSu(x1) w: (max{0, 16 + x1}) sop(x1) w: (max{0, -18 + x1}) #te(x1) w: (max{0, 22135 + x1}) #sortSu(x1) w: (max{0, 22141 + x1}) lift() w: (0) msubst(x1,x2) w: (max{0, -20 + x2 + x1}) subst(x1,x2) w: (max{0, -25 + x2 + x1}) te(x1) w: (max{0, 25 + x1}) cons(x1,x2) w: (max{0, 3 + x2, 20 + x1}) id() w: (0) circ(x1,x2) w: (max{0, -11 + x2 + x1}) USABLE RULES: { 1..10 } Removed DPs: #2 #3 #5 #7 #9 #11 #12 #14 Number of SCCs: 2, DPs: 2 SCC { #13 } Sum... Max... QLPOpS... succeeded. sortSu(x1) 1[x1] sop(x1) 0[x1] #te(x1) 0[] #sortSu(x1) 0[x1] lift() 1 msubst(x1,x2) 0[] subst(x1,x2) 0[x1] te(x1) 0[] cons(x1,x2) 0[] id() 0 circ(x1,x2) 2[x1,x2] USABLE RULES: { 1..7 } Removed DPs: #13 Number of SCCs: 1, DPs: 1 SCC { #6 } Sum... succeeded. sortSu(x1) w: (841) sop(x1) w: (16908) #te(x1) w: (1 + x1) #sortSu(x1) w: (0) lift() w: (1) msubst(x1,x2) w: (552 + x1) subst(x1,x2) w: (x1) te(x1) w: (39 + x1) cons(x1,x2) w: (1) id() w: (1) circ(x1,x2) w: (18588) USABLE RULES: { 8..10 } Removed DPs: #6 Number of SCCs: 0, DPs: 0 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard