details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	5.51454305649 seconds
cpu usage	6.440466808
max memory	9.2921856E7

stage attributes

key	value
output-size	2248
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: isEmpty(empty()) -> true() 2: isEmpty(node(l,r)) -> false() 3: left(empty()) -> empty() 4: left(node(l,r)) -> l 5: right(empty()) -> empty() 6: right(node(l,r)) -> r 7: inc(0()) -> s(0()) 8: inc(s(x)) -> s(inc(x)) 9: count(n,x) -> if(isEmpty(n),isEmpty(left(n)),right(n),node(left(left(n)),node(right(left(n)),right(n))),x,inc(x)) 10: if(true(),b,n,m,x,y) -> x 11: if(false(),false(),n,m,x,y) -> count(m,x) 12: if(false(),true(),n,m,x,y) -> count(n,y) 13: nrOfNodes(n) -> count(n,0()) Number of strict rules: 13 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #nrOfNodes(n) -> #count(n,0()) #2: #count(n,x) -> #if(isEmpty(n),isEmpty(left(n)),right(n),node(left(left(n)),node(right(left(n)),right(n))),x,inc(x)) #3: #count(n,x) -> #isEmpty(n) #4: #count(n,x) -> #isEmpty(left(n)) #5: #count(n,x) -> #left(n) #6: #count(n,x) -> #right(n) #7: #count(n,x) -> #left(left(n)) #8: #count(n,x) -> #left(n) #9: #count(n,x) -> #right(left(n)) #10: #count(n,x) -> #left(n) #11: #count(n,x) -> #right(n) #12: #count(n,x) -> #inc(x) #13: #if(false(),false(),n,m,x,y) -> #count(m,x) #14: #if(false(),true(),n,m,x,y) -> #count(n,y) #15: #inc(s(x)) -> #inc(x) Number of SCCs: 2, DPs: 4 SCC { #15 } Sum... succeeded. #left(x1) w: (0) s(x1) w: (1 + x1) left(x1) w: (0) #isEmpty(x1) w: (0) false() w: (0) isEmpty(x1) w: (0) #inc(x1) w: (x1) #nrOfNodes(x1) w: (0) inc(x1) w: (0) true() w: (0) #count(x1,x2) w: (0) count(x1,x2) w: (0) 0() w: (0) if(x1,x2,x3,x4,x5,x6) w: (0) right(x1) w: (0) #if(x1,x2,x3,x4,x5,x6) w: (0) empty() w: (0) nrOfNodes(x1) w: (0) #right(x1) w: (0) node(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #15 Number of SCCs: 1, DPs: 3 SCC { #2 #13 #14 } 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