2.60/1.27 NO 2.60/1.28 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 2.60/1.28 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.60/1.28 2.60/1.28 2.60/1.28 Outermost Termination of the given OTRS could be disproven: 2.60/1.28 2.60/1.28 (0) OTRS 2.60/1.28 (1) OutermostNonTerminationProof [COMPLETE, 0 ms] 2.60/1.28 (2) NO 2.60/1.28 2.60/1.28 2.60/1.28 ---------------------------------------- 2.60/1.28 2.60/1.28 (0) 2.60/1.28 Obligation: 2.60/1.28 Term rewrite system R: 2.60/1.28 The TRS R consists of the following rules: 2.60/1.28 2.60/1.28 and(tt) -> X 2.60/1.28 __(__(X, Y), Z) -> __(X, __(Y, Z)) 2.60/1.28 __(X, nil) -> X 2.60/1.28 __(nil, X) -> X 2.60/1.28 isNePal(__(I, __(P, I))) -> tt 2.60/1.28 2.60/1.28 2.60/1.28 2.60/1.28 Outermost Strategy. 2.60/1.28 2.60/1.28 ---------------------------------------- 2.60/1.28 2.60/1.28 (1) OutermostNonTerminationProof (COMPLETE) 2.60/1.28 Term rewrite system R: 2.60/1.28 The TRS R consists of the following rules: 2.60/1.28 2.60/1.28 and(tt) -> X 2.60/1.28 __(__(X, Y), Z) -> __(X, __(Y, Z)) 2.60/1.28 __(X, nil) -> X 2.60/1.28 __(nil, X) -> X 2.60/1.28 isNePal(__(I, __(P, I))) -> tt 2.60/1.28 2.60/1.28 2.60/1.28 2.60/1.28 Outermost Strategy. 2.60/1.28 2.60/1.28 ---------- Loop: ---------- 2.60/1.28 2.60/1.28 and(tt) -> and(tt) with rule and(tt) -> X at position [] and matcher [X / and(tt)] 2.60/1.28 2.60/1.28 Now an instance of the first term with Matcher [ ] occurs in the last term at position []. 2.60/1.28 2.60/1.28 Context: [] 2.60/1.28 2.60/1.28 We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop. 2.60/1.28 ---------------------------------------- 2.60/1.28 2.60/1.28 (2) 2.60/1.28 NO 2.60/1.30 EOF