details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.934806108475 seconds
cpu usage	0.945538692
max memory	2.689024E7

stage attributes

key	value
output-size	1513
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: cond1(true(),x,y) -> cond2(gr(x,y),x,y) 2: cond2(true(),x,y) -> cond1(gr(x,0()),y,y) 3: cond2(false(),x,y) -> cond1(gr(x,0()),p(x),y) 4: gr(0(),x) -> false() 5: gr(s(x),0()) -> true() 6: gr(s(x),s(y)) -> gr(x,y) 7: p(0()) -> 0() 8: p(s(x)) -> x Number of strict rules: 8 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #cond2(true(),x,y) -> #cond1(gr(x,0()),y,y) #2: #cond2(true(),x,y) -> #gr(x,0()) #3: #gr(s(x),s(y)) -> #gr(x,y) #4: #cond2(false(),x,y) -> #cond1(gr(x,0()),p(x),y) #5: #cond2(false(),x,y) -> #gr(x,0()) #6: #cond2(false(),x,y) -> #p(x) #7: #cond1(true(),x,y) -> #cond2(gr(x,y),x,y) #8: #cond1(true(),x,y) -> #gr(x,y) Number of SCCs: 2, DPs: 4 SCC { #3 } Sum... succeeded. cond2(x1,x2,x3) w: (0) s(x1) w: (1 + x1) #cond1(x1,x2,x3) w: (0) false() w: (0) #p(x1) w: (0) true() w: (0) cond1(x1,x2,x3) w: (0) p(x1) w: (0) 0() w: (0) #gr(x1,x2) w: (x2 + x1) #cond2(x1,x2,x3) w: (0) gr(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #3 Number of SCCs: 1, DPs: 3 SCC { #1 #4 #7 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed. popout

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

job log

popout

actions

all output return to TRS Standard