details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.103425979614 seconds
cpu usage	0.067540983
max memory	9166848.0

stage attributes

key	value
output-size	2361
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: plus(s(s(x)),y) -> s(plus(x,s(y))) 2: plus(x,s(s(y))) -> s(plus(s(x),y)) 3: plus(s(0()),y) -> s(y) 4: plus(0(),y) -> y 5: ack(0(),y) -> s(y) 6: ack(s(x),0()) -> ack(x,s(0())) 7: ack(s(x),s(y)) -> ack(x,plus(y,ack(s(x),y))) Number of strict rules: 7 Direct poly ... failed. Freezing ack 1: plus(s(s(x)),y) -> s(plus(x,s(y))) 2: plus(x,s(s(y))) -> s(plus(s(x),y)) 3: plus(s(0()),y) -> s(y) 4: plus(0(),y) -> y 5: ack❆1_0(y) -> s(y) 6: ack❆1_s(x,0()) -> ack(x,s(0())) 7: ack❆1_s(x,s(y)) -> ack(x,plus(y,ack❆1_s(x,y))) 8: ack(0(),_1) ->= ack❆1_0(_1) 9: ack(s(_1),_2) ->= ack❆1_s(_1,_2) Number of strict rules: 7 Direct poly ... failed. Dependency Pairs: #1: #plus(x,s(s(y))) -> #plus(s(x),y) #2: #ack❆1_s(x,0()) -> #ack(x,s(0())) #3: #ack(s(_1),_2) ->? #ack❆1_s(_1,_2) #4: #ack❆1_s(x,s(y)) -> #ack(x,plus(y,ack❆1_s(x,y))) #5: #ack❆1_s(x,s(y)) -> #plus(y,ack❆1_s(x,y)) #6: #ack❆1_s(x,s(y)) -> #ack❆1_s(x,y) #7: #plus(s(s(x)),y) -> #plus(x,s(y)) #8: #ack(0(),_1) ->? #ack❆1_0(_1) Number of SCCs: 2, DPs: 6 SCC { #1 #7 } Sum... succeeded. s(x1) w: (1 + x1) ack(x1,x2) w: (0) #plus(x1,x2) w: (1 + x2 + x1) #ack❆1_0(x1) w: (0) 0() w: (0) ack❆1_0(x1) w: (0) plus(x1,x2) w: (0) #ack(x1,x2) w: (0) ack❆1_s(x1,x2) w: (0) #ack❆1_s(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #1 #7 Number of SCCs: 1, DPs: 4 SCC { #2..4 #6 } Sum... succeeded. s(x1) w: (3 + x1) ack(x1,x2) w: (x2 + x1) #plus(x1,x2) w: (1) #ack❆1_0(x1) w: (0) 0() w: (1) ack❆1_0(x1) w: (2) plus(x1,x2) w: (4 + x2 + x1) #ack(x1,x2) w: (21238 + x1) ack❆1_s(x1,x2) w: (1 + x2) #ack❆1_s(x1,x2) w: (21239 + x1) USABLE RULES: { } Removed DPs: #2..4 Number of SCCs: 1, DPs: 1 SCC { #6 } Sum... succeeded. s(x1) w: (3 + x1) ack(x1,x2) w: (x2 + x1) #plus(x1,x2) w: (1) #ack❆1_0(x1) w: (0) 0() w: (1) ack❆1_0(x1) w: (2) plus(x1,x2) w: (4 + x2 + x1) #ack(x1,x2) w: (21238) ack❆1_s(x1,x2) w: (2 + x2) #ack❆1_s(x1,x2) w: (21239 + x2) USABLE RULES: { } Removed DPs: #6 Number of SCCs: 0, DPs: 0 popout

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

job log

popout

actions

all output return to TRS Standard