2.60/1.23	NO
2.60/1.24	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
2.60/1.24	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.60/1.24	
2.60/1.24	
2.60/1.24	Outermost Termination of the given OTRS could be disproven:
2.60/1.24	
2.60/1.24	(0) OTRS
2.60/1.24	(1) OutermostNonTerminationProof [COMPLETE, 0 ms]
2.60/1.24	(2) NO
2.60/1.24	
2.60/1.24	
2.60/1.24	----------------------------------------
2.60/1.24	
2.60/1.24	(0)
2.60/1.24	Obligation:
2.60/1.24	Term rewrite system R:
2.60/1.24	The TRS R consists of the following rules:
2.60/1.24	
2.60/1.24	   and(tt) -> X
2.60/1.24	   __(__(X, Y), Z) -> __(X, __(Y, Z))
2.60/1.24	   __(X, nil) -> X
2.60/1.24	   __(nil, X) -> X
2.60/1.24	   U11(tt) -> U12(isNeList)
2.60/1.24	   U12(tt) -> tt
2.60/1.24	   U21(tt) -> U22(isList)
2.60/1.24	   U22(tt) -> U23(isList)
2.60/1.24	   U23(tt) -> tt
2.60/1.24	   U31(tt) -> U32(isQid)
2.60/1.24	   U32(tt) -> tt
2.60/1.24	   U41(tt) -> U42(isList)
2.60/1.24	   U42(tt) -> U43(isNeList)
2.60/1.24	   U43(tt) -> tt
2.60/1.24	   U51(tt) -> U52(isNeList)
2.60/1.24	   U52(tt) -> U53(isList)
2.60/1.24	   U53(tt) -> tt
2.60/1.24	   U61(tt) -> U62(isQid)
2.60/1.24	   U62(tt) -> tt
2.60/1.24	   U71(tt) -> U72(isNePal)
2.60/1.24	   U72(tt) -> tt
2.60/1.24	   isList -> U11(isPalListKind)
2.60/1.24	   isList -> tt
2.60/1.24	   isList -> U21(and(isPalListKind))
2.60/1.24	   isNeList -> U31(isPalListKind)
2.60/1.24	   isNeList -> U41(and(isPalListKind))
2.60/1.24	   isNeList -> U51(and(isPalListKind))
2.60/1.24	   isNePal -> U61(isPalListKind)
2.60/1.24	   isNePal -> and(and(isQid))
2.60/1.24	   isPal -> U71(isPalListKind)
2.60/1.24	   isPal -> tt
2.60/1.24	   isPalListKind -> tt
2.60/1.24	   isPalListKind -> and(isPalListKind)
2.60/1.24	   isQid -> tt
2.60/1.24	
2.60/1.24	
2.60/1.24	
2.60/1.24	Outermost Strategy.
2.60/1.24	
2.60/1.24	----------------------------------------
2.60/1.24	
2.60/1.24	(1) OutermostNonTerminationProof (COMPLETE)
2.60/1.24	Term rewrite system R:
2.60/1.24	The TRS R consists of the following rules:
2.60/1.24	
2.60/1.24	   and(tt) -> X
2.60/1.24	   __(__(X, Y), Z) -> __(X, __(Y, Z))
2.60/1.24	   __(X, nil) -> X
2.60/1.24	   __(nil, X) -> X
2.60/1.24	   U11(tt) -> U12(isNeList)
2.60/1.24	   U12(tt) -> tt
2.60/1.24	   U21(tt) -> U22(isList)
2.60/1.24	   U22(tt) -> U23(isList)
2.60/1.24	   U23(tt) -> tt
2.60/1.24	   U31(tt) -> U32(isQid)
2.60/1.24	   U32(tt) -> tt
2.60/1.24	   U41(tt) -> U42(isList)
2.60/1.24	   U42(tt) -> U43(isNeList)
2.60/1.24	   U43(tt) -> tt
2.60/1.24	   U51(tt) -> U52(isNeList)
2.60/1.24	   U52(tt) -> U53(isList)
2.60/1.24	   U53(tt) -> tt
2.60/1.24	   U61(tt) -> U62(isQid)
2.60/1.24	   U62(tt) -> tt
2.60/1.24	   U71(tt) -> U72(isNePal)
2.60/1.24	   U72(tt) -> tt
2.60/1.24	   isList -> U11(isPalListKind)
2.60/1.24	   isList -> tt
2.60/1.24	   isList -> U21(and(isPalListKind))
2.60/1.24	   isNeList -> U31(isPalListKind)
2.60/1.24	   isNeList -> U41(and(isPalListKind))
2.60/1.24	   isNeList -> U51(and(isPalListKind))
2.60/1.24	   isNePal -> U61(isPalListKind)
2.60/1.24	   isNePal -> and(and(isQid))
2.60/1.24	   isPal -> U71(isPalListKind)
2.60/1.24	   isPal -> tt
2.60/1.24	   isPalListKind -> tt
2.60/1.24	   isPalListKind -> and(isPalListKind)
2.60/1.24	   isQid -> tt
2.60/1.24	
2.60/1.24	
2.60/1.24	
2.60/1.24	Outermost Strategy.
2.60/1.24	
2.60/1.24	---------- Loop: ----------
2.60/1.24	
2.60/1.24	and(tt) -> and(tt) with rule and(tt) -> X at position [] and matcher [X / and(tt)]
2.60/1.24	
2.60/1.24	Now an instance of the first term with Matcher [ ] occurs in the last term at position [].
2.60/1.24	
2.60/1.24	Context: []
2.60/1.24	
2.60/1.24	We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop.
2.60/1.24	----------------------------------------
2.60/1.24	
2.60/1.24	(2)
2.60/1.24	NO
2.60/1.25	EOF