details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	257.696340084 seconds
cpu usage	257.728534608
max memory	1.33722112E8

stage attributes

key	value
output-size	4078
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: cond1(true(),x,y) -> cond2(gr(x,y),x,y) 2: cond2(true(),x,y) -> cond3(gr(x,0()),x,y) 3: cond2(false(),x,y) -> cond4(gr(y,0()),x,y) 4: cond3(true(),x,y) -> cond3(gr(x,0()),p(x),y) 5: cond3(false(),x,y) -> cond1(and(gr(x,0()),gr(y,0())),x,y) 6: cond4(true(),x,y) -> cond4(gr(y,0()),x,p(y)) 7: cond4(false(),x,y) -> cond1(and(gr(x,0()),gr(y,0())),x,y) 8: gr(0(),x) -> false() 9: gr(s(x),0()) -> true() 10: gr(s(x),s(y)) -> gr(x,y) 11: and(true(),true()) -> true() 12: and(false(),x) -> false() 13: and(x,false()) -> false() 14: p(0()) -> 0() 15: p(s(x)) -> x Number of strict rules: 15 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #cond2(true(),x,y) -> #cond3(gr(x,0()),x,y) #2: #cond2(true(),x,y) -> #gr(x,0()) #3: #cond4(true(),x,y) -> #cond4(gr(y,0()),x,p(y)) #4: #cond4(true(),x,y) -> #gr(y,0()) #5: #cond4(true(),x,y) -> #p(y) #6: #cond4(false(),x,y) -> #cond1(and(gr(x,0()),gr(y,0())),x,y) #7: #cond4(false(),x,y) -> #and(gr(x,0()),gr(y,0())) #8: #cond4(false(),x,y) -> #gr(x,0()) #9: #cond4(false(),x,y) -> #gr(y,0()) #10: #gr(s(x),s(y)) -> #gr(x,y) #11: #cond3(false(),x,y) -> #cond1(and(gr(x,0()),gr(y,0())),x,y) #12: #cond3(false(),x,y) -> #and(gr(x,0()),gr(y,0())) #13: #cond3(false(),x,y) -> #gr(x,0()) #14: #cond3(false(),x,y) -> #gr(y,0()) #15: #cond2(false(),x,y) -> #cond4(gr(y,0()),x,y) #16: #cond2(false(),x,y) -> #gr(y,0()) #17: #cond1(true(),x,y) -> #cond2(gr(x,y),x,y) #18: #cond1(true(),x,y) -> #gr(x,y) #19: #cond3(true(),x,y) -> #cond3(gr(x,0()),p(x),y) #20: #cond3(true(),x,y) -> #gr(x,0()) #21: #cond3(true(),x,y) -> #p(x) Number of SCCs: 2, DPs: 8 SCC { #10 } Sum... succeeded. cond2(x1,x2,x3) w: (0) #cond3(x1,x2,x3) w: (0) s(x1) w: (1 + x1) #cond1(x1,x2,x3) w: (0) and(x1,x2) w: (0) #cond4(x1,x2,x3) w: (0) false() w: (0) #p(x1) w: (0) cond4(x1,x2,x3) w: (0) true() w: (0) cond1(x1,x2,x3) w: (0) p(x1) w: (0) 0() w: (0) #gr(x1,x2) w: (x2) cond3(x1,x2,x3) w: (0) #cond2(x1,x2,x3) w: (0) gr(x1,x2) w: (0) #and(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #10 Number of SCCs: 1, DPs: 7 SCC { #1 #3 #6 #11 #15 #17 #19 } Sum... Max... QLPOpS... NegMaxSum... succeeded. cond2(x1,x2,x3) w: (0) #cond3(x1,x2,x3) w: (max{0, 28105 + x3}) s(x1) w: (max{0, 28102 + x1}) #cond1(x1,x2,x3) w: (max{0, 28105 + x3, 1 + x1}) and(x1,x2) w: (max{0, 1 + x2}) #cond4(x1,x2,x3) w: (max{0, 28105 + x3, 3 + x1}) false() w: (1) #p(x1) w: (0) cond4(x1,x2,x3) w: (0) true() w: (28103) cond1(x1,x2,x3) w: (0) p(x1) w: (max{0, -1 + x1}) 0() w: (0) #gr(x1,x2) w: (0) cond3(x1,x2,x3) w: (0) #cond2(x1,x2,x3) w: (max{0, 28105 + x3}) gr(x1,x2) w: (max{0, 1 + x1}) #and(x1,x2) w: (0) USABLE RULES: { 8 9 11..15 } Removed DPs: #3 Number of SCCs: 1, DPs: 6 SCC { #1 #6 #11 #15 #17 #19 } Sum... Max... QLPOpS... NegMaxSum... succeeded. cond2(x1,x2,x3) w: (0) #cond3(x1,x2,x3) w: (max{0, 50581 + x2, -2241 + x1}) s(x1) w: (max{0, 28102 + x1}) popout

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

job log

popout

actions

all output return to TRS Standard