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