details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.151778 seconds
cpu usage	0.038274
user time	0.019428
system time	0.018846
max virtual memory	113188.0
max residence set size	6292.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: 1: p(s(x1)) -> s(x1) 2: n(s(x1)) -> s(x1) 3: o(s(x1)) -> s(x1) 4: o(n(x1)) -> n(o(x1)) 5: o(m(x1)) -> n(o(x1)) 6: n(o(p(x1))) -> o(n(x1)) 7: t(x1) ->= t(c(n(x1))) 8: p(n(x1)) ->= m(p(x1)) 9: p(m(x1)) ->= m(p(x1)) 10: n(p(x1)) ->= p(n(x1)) 11: c(p(x1)) ->= p(c(x1)) 12: c(m(x1)) ->= m(c(x1)) 13: c(n(x1)) ->= n(c(x1)) 14: c(o(x1)) ->= o(c(x1)) 15: c(o(x1)) ->= o(x1) Number of strict rules: 6 Direct POLO(bPol) ... removes: 1 3 6 s w: 2 * x1 + 1 n w: x1 t w: x1 + 8945 c w: x1 o w: 2 * x1 + 1 p w: x1 + 1 m w: x1 Number of strict rules: 3 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #c(n(x1)) ->? #n(c(x1)) #2: #c(n(x1)) ->? #c(x1) #3: #c(p(x1)) ->? #c(x1) #4: #c(m(x1)) ->? #c(x1) #5: #c(o(x1)) ->? #o(c(x1)) #6: #c(o(x1)) ->? #c(x1) #7: #t(x1) ->? #t(c(n(x1))) #8: #t(x1) ->? #c(n(x1)) #9: #t(x1) ->? #n(x1) #10: #n(p(x1)) ->? #n(x1) #11: #o(m(x1)) -> #n(o(x1)) #12: #o(m(x1)) -> #o(x1) #13: #o(n(x1)) -> #n(o(x1)) #14: #o(n(x1)) -> #o(x1) Number of SCCs: 4, DPs: 8 SCC { #10 } POLO(Sum)... succeeded. s w: 0 n w: 0 t w: 0 c w: 0 o w: 0 p w: x1 + 1 #o w: 0 #c w: 0 #t w: 0 #n w: x1 m w: 0 USABLE RULES: { } Removed DPs: #10 Number of SCCs: 3, DPs: 7 SCC { #7 } 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 SRS Relative