details

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

run statistics

property	value
solver	sol 37957
configuration	hrs
runtime (wallclock)	0.0637679100037 seconds
cpu usage	0.06352386
max memory	9551872.0

stage attributes

key	value
output-size	10002
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_hrs /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE We split firstr-order part and higher-order part, and do modular checking by a general modularity. ******** FO SN check ******** Check SN using NaTT (Nagoya Termination Tool) Input TRS: 1: if(true(),X,Y) -> X 2: if(false(),X,Y) -> Y 3: lteq(s(M),o()) -> false() 4: lteq(o(),M) -> true() 5: lteq(s(M),s(K)) -> lteq(M,K) 6: from(M,nil()) -> nil() 7: from(M,cons(H,Z)) -> if(lteq(M,H),cons(H,Z),from(M,Z)) 8: _(X1,X2) -> X1 9: _(X1,X2) -> X2 Number of strict rules: 9 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #from(M,cons(H,Z)) -> #if(lteq(M,H),cons(H,Z),from(M,Z)) #2: #from(M,cons(H,Z)) -> #lteq(M,H) #3: #from(M,cons(H,Z)) -> #from(M,Z) #4: #lteq(s(M),s(K)) -> #lteq(M,K) Number of SCCs: 2, DPs: 2 SCC { #3 } POLO(Sum)... succeeded. s w: 0 #lteq w: 0 false w: 0 _ w: 0 true w: 0 o w: 0 lteq w: 0 if w: 0 from w: 0 nil w: 0 #_ w: 0 #from w: x2 cons w: x2 + 1 #if w: 0 USABLE RULES: { } Removed DPs: #3 Number of SCCs: 1, DPs: 1 SCC { #4 } POLO(Sum)... succeeded. s w: x1 + 1 #lteq w: x1 false w: 0 _ w: 0 true w: 0 o w: 0 lteq w: 0 if w: 0 from w: 0 nil w: 0 #_ w: 0 #from w: 0 cons w: 1 #if w: 0 USABLE RULES: { } Removed DPs: #4 Number of SCCs: 0, DPs: 0 ... Input TRS: 1: if(true(),X,Y) -> X 2: if(false(),X,Y) -> Y 3: lteq(s(M),o()) -> false() 4: lteq(o(),M) -> true() 5: lteq(s(M),s(K)) -> lteq(M,K) 6: from(M,nil()) -> nil() 7: from(M,cons(H,Z)) -> if(lteq(M,H),cons(H,Z),from(M,Z)) 8: _(X1,X2) -> X1 9: _(X1,X2) -> X2 Number of strict rules: 9 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #from(M,cons(H,Z)) -> #if(lteq(M,H),cons(H,Z),from(M,Z)) #2: #from(M,cons(H,Z)) -> #lteq(M,H) #3: #from(M,cons(H,Z)) -> #from(M,Z) #4: #lteq(s(M),s(K)) -> #lteq(M,K) Number of SCCs: 2, DPs: 2 SCC { #3 } POLO(Sum)... succeeded. s w: 0 #lteq w: 0 false w: 0 _ w: 0 true w: 0 o w: 0 lteq w: 0 if w: 0 popout

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

job log

popout

actions

all output return to HRS 58631