details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.176534891129 seconds
cpu usage	0.180133113
max memory	5640192.0

stage attributes

key	value
output-size	36772
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 I P X X1 X2 Y Z) (RULES __(active(X1),X2) -> __(X1,X2) __(mark(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(nil,X)) -> mark(X) active(__(X,nil)) -> mark(X) active(and(tt,X)) -> mark(X) active(isNePal(__(I,__(P,I)))) -> mark(tt) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNePal(active(X)) -> isNePal(X) isNePal(mark(X)) -> isNePal(X) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNePal(X)) -> active(isNePal(mark(X))) mark(nil) -> active(nil) mark(tt) -> active(tt) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: __#(active(X1),X2) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) ACTIVE(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) ACTIVE(__(__(X,Y),Z)) -> __#(Y,Z) ACTIVE(__(__(X,Y),Z)) -> MARK(__(X,__(Y,Z))) ACTIVE(__(nil,X)) -> MARK(X) ACTIVE(__(X,nil)) -> MARK(X) ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNePal(__(I,__(P,I)))) -> MARK(tt) AND(active(X1),X2) -> AND(X1,X2) AND(mark(X1),X2) -> AND(X1,X2) AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) ISNEPAL(active(X)) -> ISNEPAL(X) ISNEPAL(mark(X)) -> ISNEPAL(X) MARK(__(X1,X2)) -> __#(mark(X1),mark(X2)) MARK(__(X1,X2)) -> ACTIVE(__(mark(X1),mark(X2))) MARK(__(X1,X2)) -> MARK(X1) MARK(__(X1,X2)) -> MARK(X2) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(isNePal(X)) -> ACTIVE(isNePal(mark(X))) MARK(isNePal(X)) -> ISNEPAL(mark(X)) MARK(isNePal(X)) -> MARK(X) -> Rules: __(active(X1),X2) -> __(X1,X2) __(mark(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(nil,X)) -> mark(X) active(__(X,nil)) -> mark(X) active(and(tt,X)) -> mark(X) active(isNePal(__(I,__(P,I)))) -> mark(tt) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNePal(active(X)) -> isNePal(X) isNePal(mark(X)) -> isNePal(X) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNePal(X)) -> active(isNePal(mark(X))) mark(nil) -> active(nil) mark(tt) -> active(tt) Problem 1: SCC Processor: -> Pairs: __#(active(X1),X2) -> __#(X1,X2) __#(mark(X1),X2) -> __#(X1,X2) __#(X1,active(X2)) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) ACTIVE(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) ACTIVE(__(__(X,Y),Z)) -> __#(Y,Z) ACTIVE(__(__(X,Y),Z)) -> MARK(__(X,__(Y,Z))) ACTIVE(__(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