details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.26901388168 seconds
cpu usage	1.223832997
max memory	1.0440704E7

stage attributes

key	value
output-size	127724
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S I:S P:S V:S V1:S V2:S X:S X1:S X2:S Y:S Z:S) (RULES a__U11(tt) -> tt a__U11(X:S) -> U11(X:S) a__U21(tt,V2:S) -> a__U22(a__isList(V2:S)) a__U21(X1:S,X2:S) -> U21(X1:S,X2:S) a__U22(tt) -> tt a__U22(X:S) -> U22(X:S) a__U31(tt) -> tt a__U31(X:S) -> U31(X:S) a__U41(tt,V2:S) -> a__U42(a__isNeList(V2:S)) a__U41(X1:S,X2:S) -> U41(X1:S,X2:S) a__U42(tt) -> tt a__U42(X:S) -> U42(X:S) a__U51(tt,V2:S) -> a__U52(a__isList(V2:S)) a__U51(X1:S,X2:S) -> U51(X1:S,X2:S) a__U52(tt) -> tt a__U52(X:S) -> U52(X:S) a__U61(tt) -> tt a__U61(X:S) -> U61(X:S) a__U71(tt,P:S) -> a__U72(a__isPal(P:S)) a__U71(X1:S,X2:S) -> U71(X1:S,X2:S) a__U72(tt) -> tt a__U72(X:S) -> U72(X:S) a__U81(tt) -> tt a__U81(X:S) -> U81(X:S) a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) a____(nil,X:S) -> mark(X:S) a____(X:S,nil) -> mark(X:S) a____(X1:S,X2:S) -> __(X1:S,X2:S) a__isList(__(V1:S,V2:S)) -> a__U21(a__isList(V1:S),V2:S) a__isList(nil) -> tt a__isList(V:S) -> a__U11(a__isNeList(V:S)) a__isList(X:S) -> isList(X:S) a__isNeList(__(V1:S,V2:S)) -> a__U41(a__isList(V1:S),V2:S) a__isNeList(__(V1:S,V2:S)) -> a__U51(a__isNeList(V1:S),V2:S) a__isNeList(V:S) -> a__U31(a__isQid(V:S)) a__isNeList(X:S) -> isNeList(X:S) a__isNePal(__(I:S,__(P:S,I:S))) -> a__U71(a__isQid(I:S),P:S) a__isNePal(V:S) -> a__U61(a__isQid(V:S)) a__isNePal(X:S) -> isNePal(X:S) a__isPal(nil) -> tt a__isPal(V:S) -> a__U81(a__isNePal(V:S)) a__isPal(X:S) -> isPal(X:S) a__isQid(a) -> tt a__isQid(e) -> tt a__isQid(i) -> tt a__isQid(o) -> tt a__isQid(u) -> tt a__isQid(X:S) -> isQid(X:S) mark(U11(X:S)) -> a__U11(mark(X:S)) mark(U21(X1:S,X2:S)) -> a__U21(mark(X1:S),X2:S) mark(U22(X:S)) -> a__U22(mark(X:S)) mark(U31(X:S)) -> a__U31(mark(X:S)) mark(U41(X1:S,X2:S)) -> a__U41(mark(X1:S),X2:S) mark(U42(X:S)) -> a__U42(mark(X:S)) mark(U51(X1:S,X2:S)) -> a__U51(mark(X1:S),X2:S) mark(U52(X:S)) -> a__U52(mark(X:S)) mark(U61(X:S)) -> a__U61(mark(X:S)) mark(U71(X1:S,X2:S)) -> a__U71(mark(X1:S),X2:S) mark(U72(X:S)) -> a__U72(mark(X:S)) mark(U81(X:S)) -> a__U81(mark(X:S)) mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) mark(a) -> a mark(e) -> e mark(i) -> i mark(isList(X:S)) -> a__isList(X:S) mark(isNeList(X:S)) -> a__isNeList(X:S) mark(isNePal(X:S)) -> a__isNePal(X:S) mark(isPal(X:S)) -> a__isPal(X:S) mark(isQid(X:S)) -> a__isQid(X:S) mark(nil) -> nil mark(o) -> o mark(tt) -> tt mark(u) -> u ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__U21(tt,V2:S) -> A__U22(a__isList(V2:S)) A__U21(tt,V2:S) -> A__ISLIST(V2:S) A__U41(tt,V2:S) -> A__U42(a__isNeList(V2:S)) A__U41(tt,V2:S) -> A__ISNELIST(V2:S) A__U51(tt,V2:S) -> A__U52(a__isList(V2:S)) A__U51(tt,V2:S) -> A__ISLIST(V2:S) A__U71(tt,P:S) -> A__U72(a__isPal(P:S)) A__U71(tt,P:S) -> A__ISPAL(P:S) popout

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

job log

popout

actions

all output return to TRS Innermost