details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.829168081284 seconds
cpu usage	1.057267121
max memory	4.982784E7

stage attributes

key	value
output-size	3458
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,x2) -> x2 8: P(x1,x2) -> x1 9: M(x1,x2) -> x2 10: M(x1,x2) -> x1 11: J1(x1,x2) -> x2 12: J1(x1,x2) -> x1 13: Q11(x1,x2) -> x2 14: Q11(x1,x2) -> x1 15: R1(x1,x2,x3) -> x3 16: R1(x1,x2,x3) -> x2 17: R1(x1,x2,x3) -> x1 18: P(0(),0()) -> S(0()) 19: +(x,S(y)) -> S(+(x,y)) 20: a(l(x)) -> l(a(a(x))) 21: l(o(x)) -> o(l(l(x))) 22: o(x) -> l(x) 23: l(x) -> a(x) 24: a(S(x)) -> S(l(x)) 25: a(+(x,y)) -> +(l(x),y) 26: a(+(x,y)) -> +(x,l(y)) 27: a(P(x1,x2)) -> P(x1,l(x2)) 28: a(P(x1,x2)) -> P(l(x1),x2) 29: +(x,o(y)) -> o(+(x,y)) 30: P(x1,o(x2)) -> o(P(x1,x2)) 31: P(o(x1),x2) -> o(P(x1,x2)) 32: M(x1,l(y)) -> +(M(x1,y),P(x1,y)) 33: J1(l(x1),y) -> P(J1(x1,y),0()) 34: a(S(x)) -> o(x) 35: P(0(),S(y)) -> o(M(0(),y)) 36: P(0(),P(x1,y)) -> o(M(x1,y)) 37: P(S(x1),y) -> o(J1(x1,y)) 38: P(S(x1),S(y)) -> o(J1(x1,P(S(x1),y))) 39: a(P(x1,0())) -> Q11(a(x1),x1) 40: Q11(o(x1),y) -> o(P(x1,y)) 41: a(P(x1,S(y))) -> R1(a(x1),x1,y) 42: R1(o(x1),y,z) -> o(P(x1,P(y,z))) Number of strict rules: 42 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #+(x,o(y)) -> #o(+(x,y)) #2: #+(x,o(y)) -> #+(x,y) #3: #P(0(),S(y)) -> #o(M(0(),y)) #4: #P(0(),S(y)) -> #M(0(),y) #5: #R1(o(x1),y,z) -> #o(P(x1,P(y,z))) #6: #R1(o(x1),y,z) -> #P(x1,P(y,z)) #7: #R1(o(x1),y,z) -> #P(y,z) #8: #a(P(x1,S(y))) -> #R1(a(x1),x1,y) #9: #a(P(x1,S(y))) -> #a(x1) #10: #P(S(x1),y) -> #o(J1(x1,y)) #11: #P(S(x1),y) -> #J1(x1,y) #12: #P(S(x1),S(y)) -> #o(J1(x1,P(S(x1),y))) #13: #P(S(x1),S(y)) -> #J1(x1,P(S(x1),y)) #14: #P(S(x1),S(y)) -> #P(S(x1),y) #15: #Q11(o(x1),y) -> #o(P(x1,y)) #16: #Q11(o(x1),y) -> #P(x1,y) #17: #a(S(x)) -> #S(l(x)) #18: #a(S(x)) -> #l(x) #19: #l(x) -> #a(x) #20: #P(o(x1),x2) -> #o(P(x1,x2)) #21: #P(o(x1),x2) -> #P(x1,x2) #22: #P(x1,o(x2)) -> #o(P(x1,x2)) #23: #P(x1,o(x2)) -> #P(x1,x2) #24: #a(+(x,y)) -> #+(l(x),y) #25: #a(+(x,y)) -> #l(x) #26: #a(l(x)) -> #l(a(a(x))) #27: #a(l(x)) -> #a(a(x)) #28: #a(l(x)) -> #a(x) #29: #a(P(x1,0())) -> #Q11(a(x1),x1) #30: #a(P(x1,0())) -> #a(x1) #31: #J1(l(x1),y) -> #P(J1(x1,y),0()) #32: #J1(l(x1),y) -> #J1(x1,y) #33: #a(P(x1,x2)) -> #P(l(x1),x2) #34: #a(P(x1,x2)) -> #l(x1) #35: #o(x) -> #l(x) #36: #a(S(x)) -> #o(x) #37: #a(P(x1,x2)) -> #P(x1,l(x2)) #38: #a(P(x1,x2)) -> #l(x2) #39: #M(x1,l(y)) -> #+(M(x1,y),P(x1,y)) #40: #M(x1,l(y)) -> #M(x1,y) #41: #M(x1,l(y)) -> #P(x1,y) #42: #+(x,S(y)) -> #S(+(x,y)) #43: #+(x,S(y)) -> #+(x,y) #44: #a(+(x,y)) -> #+(x,l(y)) #45: #a(+(x,y)) -> #l(y) #46: #P(0(),P(x1,y)) -> #o(M(x1,y)) popout

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

job log

popout

actions

all output return to TRS Stand 20472