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	n140.star.cs.uiowa.edu
space	Transformed_CSR_innermost_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.269596 seconds
cpu usage	0.287116
user time	0.209225
system time	0.077891
max virtual memory	113188.0
max residence set size	7040.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S I:S P:S X:S X1:S X2:S Y:S Z:S) (RULES 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__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNePal(__(I:S,__(P:S,I:S))) -> tt a__isNePal(X:S) -> isNePal(X:S) mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) mark(nil) -> nil mark(tt) -> tt ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A____(__(X:S,Y:S),Z:S) -> A____(mark(X:S),a____(mark(Y:S),mark(Z:S))) A____(__(X:S,Y:S),Z:S) -> A____(mark(Y:S),mark(Z:S)) A____(__(X:S,Y:S),Z:S) -> MARK(X:S) A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) A____(nil,X:S) -> MARK(X:S) A____(X:S,nil) -> MARK(X:S) A__AND(tt,X:S) -> MARK(X:S) MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) MARK(__(X1:S,X2:S)) -> MARK(X1:S) MARK(__(X1:S,X2:S)) -> MARK(X2:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNePal(X:S)) -> A__ISNEPAL(mark(X:S)) MARK(isNePal(X:S)) -> MARK(X:S) -> Rules: 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__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNePal(__(I:S,__(P:S,I:S))) -> tt a__isNePal(X:S) -> isNePal(X:S) mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) mark(nil) -> nil mark(tt) -> tt Problem 1: SCC Processor: -> Pairs: A____(__(X:S,Y:S),Z:S) -> A____(mark(X:S),a____(mark(Y:S),mark(Z:S))) A____(__(X:S,Y:S),Z:S) -> A____(mark(Y:S),mark(Z:S)) A____(__(X:S,Y:S),Z:S) -> MARK(X:S) A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) A____(nil,X:S) -> MARK(X:S) A____(X:S,nil) -> MARK(X:S) A__AND(tt,X:S) -> MARK(X:S) MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) MARK(__(X1:S,X2:S)) -> MARK(X1:S) MARK(__(X1:S,X2:S)) -> MARK(X2:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNePal(X:S)) -> A__ISNEPAL(mark(X:S)) MARK(isNePal(X:S)) -> MARK(X:S) -> Rules: 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__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNePal(__(I:S,__(P:S,I:S))) -> tt a__isNePal(X:S) -> isNePal(X:S) mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) mark(nil) -> nil mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A____(__(X:S,Y:S),Z:S) -> A____(mark(X:S),a____(mark(Y:S),mark(Z:S))) A____(__(X:S,Y:S),Z:S) -> A____(mark(Y:S),mark(Z:S)) A____(__(X:S,Y:S),Z:S) -> MARK(X:S) A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) A____(nil,X:S) -> MARK(X:S) A____(X:S,nil) -> MARK(X:S) A__AND(tt,X:S) -> MARK(X:S) popout

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

job log

popout

actions

all output return to TRS Innermost