details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.238754034042 seconds
cpu usage	0.246923393
max memory	5185536.0

stage attributes

key	value
output-size	27324
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____(__(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__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__isNePal(__(I,__(P,I))) -> tt a__isNePal(X) -> isNePal(X) mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil) -> nil mark(tt) -> tt ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: 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__AND(tt,X) -> MARK(X) MARK(__(X1,X2)) -> A____(mark(X1),mark(X2)) MARK(__(X1,X2)) -> MARK(X1) MARK(__(X1,X2)) -> MARK(X2) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(isNePal(X)) -> A__ISNEPAL(mark(X)) MARK(isNePal(X)) -> MARK(X) -> Rules: 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__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__isNePal(__(I,__(P,I))) -> tt a__isNePal(X) -> isNePal(X) mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil) -> nil mark(tt) -> tt Problem 1: SCC Processor: -> Pairs: 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__AND(tt,X) -> MARK(X) MARK(__(X1,X2)) -> A____(mark(X1),mark(X2)) MARK(__(X1,X2)) -> MARK(X1) MARK(__(X1,X2)) -> MARK(X2) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(isNePal(X)) -> A__ISNEPAL(mark(X)) MARK(isNePal(X)) -> MARK(X) -> Rules: 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__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__isNePal(__(I,__(P,I))) -> tt a__isNePal(X) -> isNePal(X) mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil) -> nil mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A____(__(X,Y),Z) -> A____(mark(X),a____(mark(Y),mark(Z))) A____(__(X,Y),Z) -> A____(mark(Y),mark(Z)) popout

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

job log

popout

actions

all output return to TRS Inner 89993