details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.11737203598 seconds
cpu usage	0.054084086
max memory	1.2210176E7

stage attributes

key	value
output-size	2443
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: p(s(x)) -> x 2: fact(0()) -> s(0()) 3: fact(s(x)) -> *(s(x),fact(p(s(x)))) 4: *(0(),y) -> 0() 5: *(s(x),y) -> +(*(x,y),y) 6: +(x,0()) -> x 7: +(x,s(y)) -> s(+(x,y)) Number of strict rules: 7 Direct poly ... failed. Freezing * p 1: p❆1_s(x) -> x 2: fact(0()) -> s(0()) 3: fact(s(x)) -> *❆1_s(x,fact(p❆1_s(x))) 4: *❆1_0(y) -> 0() 5: *❆1_s(x,y) -> +(*(x,y),y) 6: +(x,0()) -> x 7: +(x,s(y)) -> s(+(x,y)) 8: p(s(_1)) ->= p❆1_s(_1) 9: *(0(),_1) ->= *❆1_0(_1) 10: *(s(_1),_2) ->= *❆1_s(_1,_2) Number of strict rules: 7 Direct poly ... failed. Dependency Pairs: #1: #*(0(),_1) ->? #*❆1_0(_1) #2: #+(x,s(y)) -> #+(x,y) #3: #*(s(_1),_2) ->? #*❆1_s(_1,_2) #4: #*❆1_s(x,y) -> #+(*(x,y),y) #5: #*❆1_s(x,y) -> #*(x,y) #6: #fact(s(x)) -> #*❆1_s(x,fact(p❆1_s(x))) #7: #fact(s(x)) -> #fact(p❆1_s(x)) #8: #fact(s(x)) -> #p❆1_s(x) #9: #p(s(_1)) ->? #p❆1_s(_1) Number of SCCs: 3, DPs: 4 SCC { #7 } Sum... succeeded. *❆1_0(x1) w: (0) s(x1) w: (1 + x1) p❆1_s(x1) w: (x1) #*(x1,x2) w: (0) #fact(x1) w: (x1) #p(x1) w: (0) #*❆1_s(x1,x2) w: (0) #p❆1_s(x1) w: (0) p(x1) w: (0) 0() w: (0) fact(x1) w: (0) #*❆1_0(x1) w: (0) +(x1,x2) w: (0) *❆1_s(x1,x2) w: (0) #+(x1,x2) w: (0) *(x1,x2) w: (0) USABLE RULES: { 1 } Removed DPs: #7 Number of SCCs: 2, DPs: 3 SCC { #2 } Sum... succeeded. *❆1_0(x1) w: (0) s(x1) w: (1 + x1) p❆1_s(x1) w: (x1) #*(x1,x2) w: (0) #fact(x1) w: (x1) #p(x1) w: (0) #*❆1_s(x1,x2) w: (0) #p❆1_s(x1) w: (0) p(x1) w: (0) 0() w: (0) fact(x1) w: (0) #*❆1_0(x1) w: (0) +(x1,x2) w: (0) *❆1_s(x1,x2) w: (0) #+(x1,x2) w: (x2) *(x1,x2) w: (0) USABLE RULES: { 1 } Removed DPs: #2 Number of SCCs: 1, DPs: 2 SCC { #3 #5 } Sum... succeeded. *❆1_0(x1) w: (0) s(x1) w: (2 + x1) p❆1_s(x1) w: (x1) #*(x1,x2) w: (x1) #fact(x1) w: (x1) #p(x1) w: (0) #*❆1_s(x1,x2) w: (1 + x1) #p❆1_s(x1) w: (0) p(x1) w: (0) 0() w: (0) fact(x1) w: (0) #*❆1_0(x1) w: (0) +(x1,x2) w: (0) *❆1_s(x1,x2) w: (0) #+(x1,x2) w: (0) popout

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

job log

popout

actions

all output return to TRS Standard