details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.383288145065 seconds
cpu usage	0.411766377
max memory	2.7582464E7

stage attributes

key	value
output-size	2458
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: a(x1) -> x1 2: o(x1) -> x1 3: l(x1) -> x1 4: S(x1) -> x1 5: +(x1,x2) -> x2 6: +(x1,x2) -> x1 7: P(x1) -> x1 8: M(x1) -> x1 9: P(0()) -> S(0()) 10: +(x,S(y)) -> S(+(x,y)) 11: a(l(x)) -> l(a(a(x))) 12: l(o(x)) -> o(l(l(x))) 13: o(x) -> l(x) 14: l(x) -> a(x) 15: a(S(x)) -> S(l(x)) 16: a(+(x,y)) -> +(l(x),y) 17: a(+(x,y)) -> +(x,l(y)) 18: a(P(x1)) -> P(l(x1)) 19: +(x,o(y)) -> o(+(x,y)) 20: P(o(x1)) -> o(P(x1)) 21: M(l(y)) -> +(M(y),P(y)) 22: a(S(x)) -> o(x) 23: P(S(y)) -> o(M(y)) 24: P(P(y)) -> o(M(y)) Number of strict rules: 24 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #o(x) -> #l(x) #2: #P(0()) -> #S(0()) #3: #a(l(x)) -> #l(a(a(x))) #4: #a(l(x)) -> #a(a(x)) #5: #a(l(x)) -> #a(x) #6: #P(P(y)) -> #o(M(y)) #7: #P(P(y)) -> #M(y) #8: #P(S(y)) -> #o(M(y)) #9: #P(S(y)) -> #M(y) #10: #l(o(x)) -> #o(l(l(x))) #11: #l(o(x)) -> #l(l(x)) #12: #l(o(x)) -> #l(x) #13: #l(x) -> #a(x) #14: #P(o(x1)) -> #o(P(x1)) #15: #P(o(x1)) -> #P(x1) #16: #+(x,S(y)) -> #S(+(x,y)) #17: #+(x,S(y)) -> #+(x,y) #18: #a(S(x)) -> #o(x) #19: #a(+(x,y)) -> #+(x,l(y)) #20: #a(+(x,y)) -> #l(y) #21: #+(x,o(y)) -> #o(+(x,y)) #22: #+(x,o(y)) -> #+(x,y) #23: #M(l(y)) -> #+(M(y),P(y)) #24: #M(l(y)) -> #M(y) #25: #M(l(y)) -> #P(y) #26: #a(+(x,y)) -> #+(l(x),y) #27: #a(+(x,y)) -> #l(x) #28: #a(S(x)) -> #S(l(x)) #29: #a(S(x)) -> #l(x) #30: #a(P(x1)) -> #P(l(x1)) #31: #a(P(x1)) -> #l(x1) Number of SCCs: 1, DPs: 28 SCC { #1 #3..15 #17..27 #29..31 } POLO(Sum)... POLO(max)... succeeded. a w: x1 #P w: x1 + 2 S w: x1 l w: x1 o w: x1 0 w: 1 #o w: x1 + 1 #S w: 0 #l w: x1 + 1 P w: x1 + 1 #a w: x1 + 1 + w: max(x1, x2) M w: x1 + 1 #+ w: max(x1 + 1, x2 + 1) #M w: x1 + 2 USABLE RULES: { 1..24 } Removed DPs: #6 #7 #31 Number of SCCs: 1, DPs: 25 SCC { #1 #3..5 #8..15 #17..27 #29 #30 } 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 Stand 20472