details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.846135854721 seconds
cpu usage	0.962066393
max memory	3.4676736E7

stage attributes

key	value
output-size	4278
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: a__fact(X) -> a__if(a__zero(mark(X)),s(0()),prod(X,fact(p(X)))) 2: a__add(0(),X) -> mark(X) 3: a__add(s(X),Y) -> s(a__add(mark(X),mark(Y))) 4: a__prod(0(),X) -> 0() 5: a__prod(s(X),Y) -> a__add(mark(Y),a__prod(mark(X),mark(Y))) 6: a__if(true(),X,Y) -> mark(X) 7: a__if(false(),X,Y) -> mark(Y) 8: a__zero(0()) -> true() 9: a__zero(s(X)) -> false() 10: a__p(s(X)) -> mark(X) 11: mark(fact(X)) -> a__fact(mark(X)) 12: mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) 13: mark(zero(X)) -> a__zero(mark(X)) 14: mark(prod(X1,X2)) -> a__prod(mark(X1),mark(X2)) 15: mark(p(X)) -> a__p(mark(X)) 16: mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) 17: mark(s(X)) -> s(mark(X)) 18: mark(0()) -> 0() 19: mark(true()) -> true() 20: mark(false()) -> false() 21: a__fact(X) -> fact(X) 22: a__if(X1,X2,X3) -> if(X1,X2,X3) 23: a__zero(X) -> zero(X) 24: a__prod(X1,X2) -> prod(X1,X2) 25: a__p(X) -> p(X) 26: a__add(X1,X2) -> add(X1,X2) Number of strict rules: 26 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #a__add(0(),X) -> #mark(X) #2: #a__if(true(),X,Y) -> #mark(X) #3: #mark(zero(X)) -> #a__zero(mark(X)) #4: #mark(zero(X)) -> #mark(X) #5: #mark(fact(X)) -> #a__fact(mark(X)) #6: #mark(fact(X)) -> #mark(X) #7: #mark(if(X1,X2,X3)) -> #a__if(mark(X1),X2,X3) #8: #mark(if(X1,X2,X3)) -> #mark(X1) #9: #mark(prod(X1,X2)) -> #a__prod(mark(X1),mark(X2)) #10: #mark(prod(X1,X2)) -> #mark(X1) #11: #mark(prod(X1,X2)) -> #mark(X2) #12: #a__if(false(),X,Y) -> #mark(Y) #13: #a__p(s(X)) -> #mark(X) #14: #a__prod(s(X),Y) -> #a__add(mark(Y),a__prod(mark(X),mark(Y))) #15: #a__prod(s(X),Y) -> #mark(Y) #16: #a__prod(s(X),Y) -> #a__prod(mark(X),mark(Y)) #17: #a__prod(s(X),Y) -> #mark(X) #18: #a__prod(s(X),Y) -> #mark(Y) #19: #mark(s(X)) -> #mark(X) #20: #mark(add(X1,X2)) -> #a__add(mark(X1),mark(X2)) #21: #mark(add(X1,X2)) -> #mark(X1) #22: #mark(add(X1,X2)) -> #mark(X2) #23: #a__add(s(X),Y) -> #a__add(mark(X),mark(Y)) #24: #a__add(s(X),Y) -> #mark(X) #25: #a__add(s(X),Y) -> #mark(Y) #26: #a__fact(X) -> #a__if(a__zero(mark(X)),s(0()),prod(X,fact(p(X)))) #27: #a__fact(X) -> #a__zero(mark(X)) #28: #a__fact(X) -> #mark(X) #29: #mark(p(X)) -> #a__p(mark(X)) #30: #mark(p(X)) -> #mark(X) Number of SCCs: 1, DPs: 28 SCC { #1 #2 #4..26 #28..30 } POLO(Sum)... POLO(max)... succeeded. zero w: x1 + 1 prod w: max(x1 + 1, x2) s w: x1 a__prod w: max(x1 + 1, x2) #a__zero w: 0 a__fact w: x1 + 3 #a__add w: max(x1 + 1, x2 + 1) a__add w: max(x1, x2) false w: 1 a__p w: x1 true w: 1 a__zero w: x1 + 1 p w: x1 #mark w: x1 + 1 0 w: 1 if w: max(x1 + 2, x2 + 1, x3) #a__fact w: x1 + 4 fact w: x1 + 3 mark w: x1 #a__p w: x1 + 1 #a__if w: max(x2 + 2, x3 + 1) #a__prod w: max(x1 + 2, x2 + 1) add w: max(x1, x2) a__if w: max(x1 + 2, x2 + 1, x3) USABLE RULES: { 1..26 } Removed DPs: #2 #4 #6 #8 #10 #17 #28 Number of SCCs: 1, DPs: 21 SCC { #1 #5 #7 #9 #11..16 #18..26 #29 #30 } POLO(Sum)... POLO(max)... succeeded. popout

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

job log

popout

actions

all output return to TRS Stand 20472