details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.110032081604 seconds
cpu usage	0.080741298
max memory	1.0448896E7

stage attributes

key	value
output-size	2822
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: AC symbols: plus 1: app(nil(),k) -> k 2: app(l,nil()) -> l 3: app(cons(x,l),k) -> cons(x,app(l,k)) 4: sum(cons(x,nil())) -> cons(x,nil()) 5: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 6: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 7: plus(0(),y) -> y 8: plus(s(x),y) -> s(plus(x,y)) Number of strict rules: 8 Direct POLO(bPol) ... removes: 1 5 7 2 s w: x1 sum w: x1 0 w: 0 nil w: 1 plus w: x1 + x2 + 1 cons w: 2 * x1 + x2 + 15924 app w: x1 + x2 + 1 Number of strict rules: 4 Direct POLO(bPol) ... removes: 3 s w: x1 sum w: x1 0 w: 0 nil w: 1 plus w: x1 + x2 + 1 cons w: 2 * x1 + x2 + 14682 app w: 2 * x1 + x2 + 20977 Number of strict rules: 3 Direct POLO(bPol) ... failed. Uncurrying sum AC symbols: plus 4: sum^1_cons(x,nil()) -> cons(x,nil()) 6: sum^1_app(l,cons(x,cons(y,k))) -> sum^1_app(l,sum^1_cons(x,cons(y,k))) 8: plus(s(x),y) -> s(plus(x,y)) 9: sum(cons(_1,_2)) ->= sum^1_cons(_1,_2) 10: sum(app(_1,_2)) ->= sum^1_app(_1,_2) Number of strict rules: 3 Direct POLO(bPol) ... removes: 4 10 9 6 sum^1_app w: x1 + 2 * x2 s w: x1 sum^1_cons w: x1 + x2 + 20905 sum w: 2 * x1 0 w: 0 nil w: 10451 plus w: x1 + x2 cons w: x1 + 2 * x2 + 10453 app w: 2 * x1 + x2 + 32286 Number of strict rules: 1 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z) #2: #plus(x,plus(y,z)) ->= #plus(x,y) #3: #plus(s(x),y) -> #plus(x,y) Number of SCCs: 1, DPs: 3 SCC { #1..3 } POLO(Sum)... succeeded. sum^1_app w: 0 s w: x1 + 1 sum^1_cons w: 0 #plus w: x1 + x2 sum w: 0 0 w: 0 nil w: 0 plus w: x1 + x2 + 39 cons w: 0 app w: 0 USABLE RULES: { 8 11 } Removed DPs: #2 #3 Number of SCCs: 1, DPs: 1 SCC { #1 } only weak rules. Number of SCCs: 0, DPs: 0 Next Dependency Pairs: #4: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z) #5: #plus(x,plus(y,z)) ->= #plus(x,y) #6: #plus(plus(s(x),y),_1) -> #plus(s(plus(x,y)),_1) Number of SCCs: 1, DPs: 3 SCC { #4..6 } POLO(Sum)... succeeded. sum^1_app w: 0 s w: 23676 sum^1_cons w: 0 #plus w: x1 + x2 sum w: 0 0 w: 0 nil w: 0 plus w: x1 + x2 + 1 cons w: 0 app w: 0 USABLE RULES: { 8 11 } Removed DPs: #5 #6 Number of SCCs: 1, DPs: 1 popout

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

job log

popout

actions

all output return to TRS Equational