details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.403192996979 seconds
cpu usage	0.39925038
max memory	2.248704E7

stage attributes

key	value
output-size	2121
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: p(0()) -> s(s(0())) 2: p(s(x)) -> x 3: p(p(s(x))) -> p(x) 4: le(p(s(x)),x) -> le(x,x) 5: le(0(),y) -> true() 6: le(s(x),0()) -> false() 7: le(s(x),s(y)) -> le(x,y) 8: minus(x,y) -> if(le(x,y),x,y) 9: if(true(),x,y) -> 0() 10: if(false(),x,y) -> s(minus(p(x),y)) Number of strict rules: 10 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #le(s(x),s(y)) -> #le(x,y) #2: #if(false(),x,y) -> #minus(p(x),y) #3: #if(false(),x,y) -> #p(x) #4: #p(p(s(x))) -> #p(x) #5: #minus(x,y) -> #if(le(x,y),x,y) #6: #minus(x,y) -> #le(x,y) #7: #le(p(s(x)),x) -> #le(x,x) Number of SCCs: 3, DPs: 5 SCC { #4 } Sum... succeeded. le(x1,x2) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (0) minus(x1,x2) w: (0) false() w: (0) #p(x1) w: (x1) true() w: (0) p(x1) w: (x1) 0() w: (0) if(x1,x2,x3) w: (0) #minus(x1,x2) w: (0) #if(x1,x2,x3) w: (0) USABLE RULES: { } Removed DPs: #4 Number of SCCs: 2, DPs: 4 SCC { #1 #7 } Sum... succeeded. le(x1,x2) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (7719 + x2) minus(x1,x2) w: (0) false() w: (0) #p(x1) w: (0) true() w: (0) p(x1) w: (1) 0() w: (0) if(x1,x2,x3) w: (0) #minus(x1,x2) w: (0) #if(x1,x2,x3) w: (0) USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 3 SCC { #7 } Sum... succeeded. le(x1,x2) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (7719 + x2 + x1) minus(x1,x2) w: (0) false() w: (0) #p(x1) w: (0) true() w: (0) p(x1) w: (1 + x1) 0() w: (0) if(x1,x2,x3) w: (0) #minus(x1,x2) w: (0) #if(x1,x2,x3) w: (0) USABLE RULES: { } Removed DPs: #7 Number of SCCs: 1, DPs: 2 SCC { #2 #5 } 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