details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.143879890442 seconds
cpu usage	0.155288548
max memory	1.4749696E7

stage attributes

key	value
output-size	1598
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: isList(nil()) -> tt() 2: isList(Cons(x,xs)) -> isList(xs) 3: downfrom(0()) -> nil() 4: downfrom(s(x)) -> Cons(s(x),downfrom(x)) 5: f(x) -> cond(isList(downfrom(x)),s(x)) 6: cond(tt(),x) -> f(x) Number of strict rules: 6 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #isList(Cons(x,xs)) -> #isList(xs) #2: #cond(tt(),x) -> #f(x) #3: #f(x) -> #cond(isList(downfrom(x)),s(x)) #4: #f(x) -> #isList(downfrom(x)) #5: #f(x) -> #downfrom(x) #6: #downfrom(s(x)) -> #downfrom(x) Number of SCCs: 3, DPs: 4 SCC { #6 } POLO(Sum)... succeeded. s w: x1 + 1 f w: 0 isList w: 0 #cond w: 0 0 w: 0 nil w: 0 #f w: 0 #isList w: 0 #downfrom w: x1 tt w: 0 downfrom w: 0 Cons w: 0 cond w: 0 USABLE RULES: { } Removed DPs: #6 Number of SCCs: 2, DPs: 3 SCC { #1 } POLO(Sum)... succeeded. s w: 1 f w: 0 isList w: 0 #cond w: 0 0 w: 0 nil w: 0 #f w: 0 #isList w: x1 #downfrom w: 0 tt w: 0 downfrom w: 0 Cons w: x2 + 1 cond w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 2 SCC { #2 #3 } 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