details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.155829906464 seconds
cpu usage	0.132592403
max memory	9912320.0

stage attributes

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

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

job log

popout

actions

all output return to TRS Equational