details

property	value
status	complete
benchmark	#3.5b.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n014.star.cs.uiowa.edu
space	AG01

run statistics

property	value
solver	NaTT 2.3.3
configuration	default
runtime (wallclock)	0.0867447853088 seconds
cpu usage	0.0928478
max memory	5.9662336E7

stage attributes

key	value
output-size	3722
starexec-result	"YES"

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: le(0(),y) -> true() 2: le(s(x),0()) -> false() 3: le(s(x),s(y)) -> le(x,y) 4: minus(0(),y) -> 0() 5: minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) 6: if_minus(true(),s(x),y) -> 0() 7: if_minus(false(),s(x),y) -> s(minus(x,y)) 8: mod(0(),y) -> 0() 9: mod(s(x),0()) -> 0() 10: mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) 11: if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) 12: if_mod(false(),s(x),s(y)) -> s(x) Number of strict rules: 12 Direct Order(PosReal,>,Poly) ... failed. Freezing le 1: le❆1_0(y) -> true() 2: le❆1_s(x,0()) -> false() 3: le❆1_s(x,s(y)) -> le(x,y) 4: minus(0(),y) -> 0() 5: minus(s(x),y) -> if_minus(le❆1_s(x,y),s(x),y) 6: if_minus(true(),s(x),y) -> 0() 7: if_minus(false(),s(x),y) -> s(minus(x,y)) 8: mod(0(),y) -> 0() 9: mod(s(x),0()) -> 0() 10: mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) 11: if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) 12: if_mod(false(),s(x),s(y)) -> s(x) 13: le(0(),_1) ->= le❆1_0(_1) 14: le(s(_1),_2) ->= le❆1_s(_1,_2) Number of strict rules: 12 Direct Order(PosReal,>,Poly) ... failed. Dependency Pairs: #1: #le(0(),_1) ->? #le❆1_0(_1) #2: #if_mod(true(),s(x),s(y)) -> #mod(minus(x,y),s(y)) #3: #if_mod(true(),s(x),s(y)) -> #minus(x,y) #4: #le(s(_1),_2) ->? #le❆1_s(_1,_2) #5: #if_minus(false(),s(x),y) -> #minus(x,y) #6: #mod(s(x),s(y)) -> #if_mod(le(y,x),s(x),s(y)) #7: #mod(s(x),s(y)) -> #le(y,x) #8: #minus(s(x),y) -> #if_minus(le❆1_s(x,y),s(x),y) #9: #minus(s(x),y) -> #le❆1_s(x,y) #10: #le❆1_s(x,s(y)) -> #le(x,y) Number of SCCs: 3, DPs: 6, edges: 6 SCC { #4 #10 } Removing DPs: Order(PosReal,>,Sum)... succeeded. le(x1,x2) weight: 0 s(x1) weight: (/ 1 2) + x1 #le(x1,x2) weight: (/ 1 4) + x2 minus(x1,x2) weight: 0 mod(x1,x2) weight: 0 false() weight: 0 true() weight: 0 #le❆1_0(x1) weight: 0 le❆1_s(x1,x2) weight: 0 if_mod(x1,x2,x3) weight: 0 0() weight: 0 #if_minus(x1,x2,x3) weight: 0 #le❆1_s(x1,x2) weight: x2 #minus(x1,x2) weight: 0 #mod(x1,x2) weight: 0 #if_mod(x1,x2,x3) weight: 0 if_minus(x1,x2,x3) weight: 0 le❆1_0(x1) weight: 0 Usable rules: { } Removed DPs: #4 #10 Number of SCCs: 2, DPs: 4, edges: 4 SCC { #5 #8 } Removing DPs: Order(PosReal,>,Sum)... succeeded. le(x1,x2) weight: 0 s(x1) weight: (/ 1 2) + x1 #le(x1,x2) weight: (/ 1 4) minus(x1,x2) weight: 0 mod(x1,x2) weight: 0 false() weight: 0 true() weight: 0 #le❆1_0(x1) weight: 0 le❆1_s(x1,x2) weight: (/ 1 4) + x2 if_mod(x1,x2,x3) weight: 0 0() weight: 0 #if_minus(x1,x2,x3) weight: x2 #le❆1_s(x1,x2) weight: 0 #minus(x1,x2) weight: (/ 1 4) + x1 #mod(x1,x2) weight: 0 #if_mod(x1,x2,x3) weight: 0 if_minus(x1,x2,x3) weight: 0 le❆1_0(x1) weight: (/ 1 4) Usable rules: { } Removed DPs: #5 #8 Number of SCCs: 1, DPs: 2, edges: 2 SCC { #2 #6 } Removing DPs: Order(PosReal,>,Sum)... succeeded. le(x1,x2) weight: (/ 1 2) + x2 popout

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

job log

popout

actions

all output return to TRS Standard