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