details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.0675311088562 seconds
cpu usage	0.077800211
max memory	9293824.0

stage attributes

key	value
output-size	3206
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 times 1: plus(x,0()) -> x 2: plus(x,i(x)) -> 0() 3: i(0()) -> 0() 4: i(i(x)) -> x 5: i(plus(x,y)) -> plus(i(x),i(y)) 6: times(x,1()) -> x 7: times(x,0()) -> 0() 8: times(x,i(y)) -> i(times(x,y)) 9: times(x,plus(y,z)) -> plus(times(x,y),times(x,z)) Number of strict rules: 9 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #times(x,plus(y,z)) -> #plus(times(x,y),times(x,z)) #2: #times(x,plus(y,z)) -> #times(x,y) #3: #times(x,plus(y,z)) -> #times(x,z) #4: #times(x,times(y,z)) ->= #times(times(x,y),z) #5: #times(x,times(y,z)) ->= #times(x,y) #6: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z) #7: #plus(x,plus(y,z)) ->= #plus(x,y) #8: #i(plus(x,y)) -> #plus(i(x),i(y)) #9: #i(plus(x,y)) -> #i(x) #10: #i(plus(x,y)) -> #i(y) #11: #times(x,i(y)) -> #i(times(x,y)) #12: #times(x,i(y)) -> #times(x,y) Number of SCCs: 3, DPs: 9 SCC { #9 #10 } POLO(Sum)... succeeded. 1 w: 0 #plus w: 0 #times w: 0 0 w: 0 times w: 0 i w: 0 plus w: x1 + x2 + 1 #i w: x1 USABLE RULES: { } Removed DPs: #9 #10 Number of SCCs: 2, DPs: 7 SCC { #6 #7 } only weak rules. Number of SCCs: 1, DPs: 5 SCC { #2..5 #12 } POLO(Sum)... POLO(max)... QLPOS... succeeded. 1 s: [] p: 0 #plus s: {} p: 1 #times s: {1,2} p: 3 0 s: [] p: 0 times s: {1,2} p: 3 i s: [1] p: 2 plus s: {1,2} p: 1 #i s: [] p: 0 USABLE RULES: { 1..11 } Removed DPs: #2 #3 #5 #12 Number of SCCs: 1, DPs: 1 SCC { #4 } only weak rules. Number of SCCs: 0, DPs: 0 Next Dependency Pairs: #13: #plus(plus(x,i(x)),_1) -> #plus(0(),_1) #14: #times(times(x,1()),_1) -> #times(x,_1) #15: #times(times(x,plus(y,z)),_1) -> #times(plus(times(x,y),times(x,z)),_1) #16: #times(x,times(y,z)) ->= #times(times(x,y),z) #17: #times(x,times(y,z)) ->= #times(x,y) #18: #times(times(x,0()),_1) -> #times(0(),_1) #19: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z) #20: #plus(x,plus(y,z)) ->= #plus(x,y) #21: #plus(plus(x,0()),_1) -> #plus(x,_1) #22: #times(times(x,i(y)),_1) -> #times(i(times(x,y)),_1) Number of SCCs: 2, DPs: 10 SCC { #14..18 #22 } POLO(Sum)... POLO(max)... QLPOS... succeeded. 1 s: [] p: 4 #plus s: {} p: 1 #times s: {1,2} p: 3 0 s: [] p: 0 times s: {1,2} p: 3 i s: [1] p: 2 plus s: {1,2} p: 1 #i s: [] p: 0 USABLE RULES: { 1..11 } Removed DPs: #14 #15 #17 #18 #22 Number of SCCs: 2, DPs: 5 SCC { #16 } only weak rules. Number of SCCs: 1, DPs: 4 SCC { #13 #19..21 } POLO(Sum)... succeeded. 1 w: 1 #plus w: x1 + x2 #times w: 0 popout

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

job log

popout

actions

all output return to TRS Equat 89423