details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.144579 seconds
cpu usage	0.089406
user time	0.06369
system time	0.025716
max virtual memory	113188.0
max residence set size	6928.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: AC symbols: plus times 1: zero(S()) -> S() 2: plus(x,S()) -> x 3: plus(zero(x),zero(y)) -> zero(plus(x,y)) 4: plus(zero(x),un(y)) -> un(plus(x,y)) 5: plus(un(x),un(y)) -> zero(plus(x,plus(y,un(S())))) 6: times(x,S()) -> S() 7: times(x,times(S(),z)) -> times(S(),z) 8: times(x,zero(y)) -> zero(times(x,y)) 9: times(x,times(zero(y),z)) -> times(zero(times(x,y)),z) 10: times(x,un(y)) -> plus(x,zero(times(x,y))) 11: times(x,times(un(y),z)) -> times(plus(x,zero(times(x,y))),z) Number of strict rules: 11 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #times(x,times(y,z)) ->= #times(times(x,y),z) #2: #times(x,times(y,z)) ->= #times(x,y) #3: #times(x,times(zero(y),z)) -> #times(zero(times(x,y)),z) #4: #times(x,times(zero(y),z)) -> #zero(times(x,y)) #5: #times(x,times(zero(y),z)) -> #times(x,y) #6: #times(x,times(un(y),z)) -> #times(plus(x,zero(times(x,y))),z) #7: #times(x,times(un(y),z)) -> #plus(x,zero(times(x,y))) #8: #times(x,times(un(y),z)) -> #zero(times(x,y)) #9: #times(x,times(un(y),z)) -> #times(x,y) #10: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z) #11: #plus(x,plus(y,z)) ->= #plus(x,y) #12: #times(x,un(y)) -> #plus(x,zero(times(x,y))) #13: #times(x,un(y)) -> #zero(times(x,y)) #14: #times(x,un(y)) -> #times(x,y) #15: #plus(un(x),un(y)) -> #zero(plus(x,plus(y,un(S())))) #16: #plus(un(x),un(y)) -> #plus(x,plus(y,un(S()))) #17: #plus(un(x),un(y)) -> #plus(y,un(S())) #18: #plus(zero(x),zero(y)) -> #zero(plus(x,y)) #19: #plus(zero(x),zero(y)) -> #plus(x,y) #20: #times(x,zero(y)) -> #zero(times(x,y)) #21: #times(x,zero(y)) -> #times(x,y) #22: #plus(zero(x),un(y)) -> #plus(x,y) Number of SCCs: 2, DPs: 14 SCC { #10 #11 #16 #17 #19 #22 } POLO(Sum)... succeeded. zero w: x1 + 1 S w: 1 #plus w: x1 + x2 #times w: 0 times w: 0 plus w: x1 + x2 + 2438 #zero w: 0 un w: x1 + 2440 USABLE RULES: { 1..5 12 } Removed DPs: #11 #16 #17 #19 #22 Number of SCCs: 2, DPs: 9 SCC { #10 } only weak rules. Number of SCCs: 1, DPs: 8 SCC { #1..3 #5 #6 #9 #14 #21 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded. zero w: max(x1, 0) S w: 0 #plus w: 0 #times w: max(x1 + x2 + 1, 0) times w: max(x1 + x2 + 7720, 0) plus w: max(x1, x2, 0) #zero w: 0 un w: max(x1, 0) USABLE RULES: { 1..13 } Removed DPs: #2 #5 #9 Number of SCCs: 1, DPs: 5 SCC { #1 #3 #6 #14 #21 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed. popout

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

job log

popout

actions

all output return to TRS Equational