details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.29990696907 seconds
cpu usage	0.31173541
max memory	2.22208E7

stage attributes

key	value
output-size	2378
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: null(nil()) -> true() 2: null(add(n,x)) -> false() 3: tail(add(n,x)) -> x 4: tail(nil()) -> nil() 5: head(add(n,x)) -> n 6: app(nil(),y) -> y 7: app(add(n,x),y) -> add(n,app(x,y)) 8: reverse(nil()) -> nil() 9: reverse(add(n,x)) -> app(reverse(x),add(n,nil())) 10: shuffle(x) -> shuff(x,nil()) 11: shuff(x,y) -> if(null(x),x,y,app(y,add(head(x),nil()))) 12: if(true(),x,y,z) -> y 13: if(false(),x,y,z) -> shuff(reverse(tail(x)),z) Number of strict rules: 13 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #if(false(),x,y,z) -> #shuff(reverse(tail(x)),z) #2: #if(false(),x,y,z) -> #reverse(tail(x)) #3: #if(false(),x,y,z) -> #tail(x) #4: #reverse(add(n,x)) -> #app(reverse(x),add(n,nil())) #5: #reverse(add(n,x)) -> #reverse(x) #6: #shuff(x,y) -> #if(null(x),x,y,app(y,add(head(x),nil()))) #7: #shuff(x,y) -> #null(x) #8: #shuff(x,y) -> #app(y,add(head(x),nil())) #9: #shuff(x,y) -> #head(x) #10: #app(add(n,x),y) -> #app(x,y) #11: #shuffle(x) -> #shuff(x,nil()) Number of SCCs: 3, DPs: 4 SCC { #5 } POLO(Sum)... succeeded. #reverse w: x1 false w: 0 #head w: 0 reverse w: 0 true w: 0 shuffle w: 0 tail w: 0 if w: 0 null w: 0 nil w: 0 #tail w: 0 #app w: 0 #shuffle w: 0 #shuff w: 0 #null w: 0 head w: 0 #if w: 0 shuff w: 0 add w: x2 + 1 app w: 0 USABLE RULES: { } Removed DPs: #5 Number of SCCs: 2, DPs: 3 SCC { #10 } POLO(Sum)... succeeded. #reverse w: 0 false w: 0 #head w: 0 reverse w: 0 true w: 0 shuffle w: 0 tail w: 0 if w: 0 null w: 0 nil w: 0 #tail w: 0 #app w: x1 #shuffle w: 0 #shuff w: 0 #null w: 0 head w: 0 #if w: 0 shuff w: 0 add w: x2 + 1 app w: 0 USABLE RULES: { } Removed DPs: #10 Number of SCCs: 1, DPs: 2 SCC { #1 #6 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed. popout

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

job log

popout

actions

all output return to TRS Stand 20472