details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.246448040009 seconds
cpu usage	0.253895049
max memory	5308416.0

stage attributes

key	value
output-size	28522
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR I P X X1 X2 Y Z) (RULES a__U11(tt) -> a__U12(tt) a__U11(X) -> U11(X) a__U12(tt) -> tt a__U12(X) -> U12(X) a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(nil,X) -> mark(X) a____(X,nil) -> mark(X) a____(X1,X2) -> __(X1,X2) a__isNePal(__(I,__(P,I))) -> a__U11(tt) a__isNePal(X) -> isNePal(X) mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil) -> nil mark(tt) -> tt ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__U11(tt) -> A__U12(tt) A____(__(X,Y),Z) -> A____(mark(X),a____(mark(Y),mark(Z))) A____(__(X,Y),Z) -> A____(mark(Y),mark(Z)) A____(__(X,Y),Z) -> MARK(X) A____(__(X,Y),Z) -> MARK(Y) A____(__(X,Y),Z) -> MARK(Z) A____(nil,X) -> MARK(X) A____(X,nil) -> MARK(X) A__ISNEPAL(__(I,__(P,I))) -> A__U11(tt) MARK(U11(X)) -> A__U11(mark(X)) MARK(U11(X)) -> MARK(X) MARK(U12(X)) -> A__U12(mark(X)) MARK(U12(X)) -> MARK(X) MARK(__(X1,X2)) -> A____(mark(X1),mark(X2)) MARK(__(X1,X2)) -> MARK(X1) MARK(__(X1,X2)) -> MARK(X2) MARK(isNePal(X)) -> A__ISNEPAL(mark(X)) MARK(isNePal(X)) -> MARK(X) -> Rules: a__U11(tt) -> a__U12(tt) a__U11(X) -> U11(X) a__U12(tt) -> tt a__U12(X) -> U12(X) a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(nil,X) -> mark(X) a____(X,nil) -> mark(X) a____(X1,X2) -> __(X1,X2) a__isNePal(__(I,__(P,I))) -> a__U11(tt) a__isNePal(X) -> isNePal(X) mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil) -> nil mark(tt) -> tt Problem 1: SCC Processor: -> Pairs: A__U11(tt) -> A__U12(tt) A____(__(X,Y),Z) -> A____(mark(X),a____(mark(Y),mark(Z))) A____(__(X,Y),Z) -> A____(mark(Y),mark(Z)) A____(__(X,Y),Z) -> MARK(X) A____(__(X,Y),Z) -> MARK(Y) A____(__(X,Y),Z) -> MARK(Z) A____(nil,X) -> MARK(X) A____(X,nil) -> MARK(X) A__ISNEPAL(__(I,__(P,I))) -> A__U11(tt) MARK(U11(X)) -> A__U11(mark(X)) MARK(U11(X)) -> MARK(X) MARK(U12(X)) -> A__U12(mark(X)) MARK(U12(X)) -> MARK(X) MARK(__(X1,X2)) -> A____(mark(X1),mark(X2)) MARK(__(X1,X2)) -> MARK(X1) MARK(__(X1,X2)) -> MARK(X2) MARK(isNePal(X)) -> A__ISNEPAL(mark(X)) MARK(isNePal(X)) -> MARK(X) -> Rules: a__U11(tt) -> a__U12(tt) a__U11(X) -> U11(X) a__U12(tt) -> tt a__U12(X) -> U12(X) a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(nil,X) -> mark(X) popout

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

job log

popout

actions

all output return to TRS Inner 89993