3.97/1.82	YES
3.97/1.83	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.97/1.83	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.97/1.83	
3.97/1.83	
3.97/1.83	Termination w.r.t. Q of the given QTRS could be proven:
3.97/1.83	
3.97/1.83	(0) QTRS
3.97/1.83	(1) QTRSToCSRProof [SOUND, 0 ms]
3.97/1.83	(2) CSR
3.97/1.83	(3) CSDependencyPairsProof [EQUIVALENT, 0 ms]
3.97/1.83	(4) QCSDP
3.97/1.83	(5) QCSDependencyGraphProof [EQUIVALENT, 0 ms]
3.97/1.83	(6) AND
3.97/1.83	    (7) QCSDP
3.97/1.83	        (8) QCSDPSubtermProof [EQUIVALENT, 0 ms]
3.97/1.83	        (9) QCSDP
3.97/1.83	        (10) PIsEmptyProof [EQUIVALENT, 0 ms]
3.97/1.83	        (11) YES
3.97/1.83	    (12) QCSDP
3.97/1.83	        (13) QCSDPSubtermProof [EQUIVALENT, 0 ms]
3.97/1.83	        (14) QCSDP
3.97/1.83	        (15) PIsEmptyProof [EQUIVALENT, 0 ms]
3.97/1.83	        (16) YES
3.97/1.83	    (17) QCSDP
3.97/1.83	        (18) QCSDPSubtermProof [EQUIVALENT, 0 ms]
3.97/1.83	        (19) QCSDP
3.97/1.83	        (20) PIsEmptyProof [EQUIVALENT, 0 ms]
3.97/1.83	        (21) YES
3.97/1.83	    (22) QCSDP
3.97/1.83	        (23) QCSDPSubtermProof [EQUIVALENT, 0 ms]
3.97/1.83	        (24) QCSDP
3.97/1.83	        (25) PIsEmptyProof [EQUIVALENT, 0 ms]
3.97/1.83	        (26) YES
3.97/1.83	
3.97/1.83	
3.97/1.83	----------------------------------------
3.97/1.83	
3.97/1.83	(0)
3.97/1.83	Obligation:
3.97/1.83	Q restricted rewrite system:
3.97/1.83	The TRS R consists of the following rules:
3.97/1.83	
3.97/1.83	   active(terms(N)) -> mark(cons(recip(sqr(N)), terms(s(N))))
3.97/1.83	   active(sqr(0)) -> mark(0)
3.97/1.83	   active(sqr(s(X))) -> mark(s(add(sqr(X), dbl(X))))
3.97/1.83	   active(dbl(0)) -> mark(0)
3.97/1.83	   active(dbl(s(X))) -> mark(s(s(dbl(X))))
3.97/1.83	   active(add(0, X)) -> mark(X)
3.97/1.83	   active(add(s(X), Y)) -> mark(s(add(X, Y)))
3.97/1.83	   active(first(0, X)) -> mark(nil)
3.97/1.83	   active(first(s(X), cons(Y, Z))) -> mark(cons(Y, first(X, Z)))
3.97/1.83	   active(half(0)) -> mark(0)
3.97/1.83	   active(half(s(0))) -> mark(0)
3.97/1.83	   active(half(s(s(X)))) -> mark(s(half(X)))
3.97/1.83	   active(half(dbl(X))) -> mark(X)
3.97/1.83	   active(terms(X)) -> terms(active(X))
3.97/1.83	   active(cons(X1, X2)) -> cons(active(X1), X2)
3.97/1.83	   active(recip(X)) -> recip(active(X))
3.97/1.83	   active(sqr(X)) -> sqr(active(X))
3.97/1.83	   active(s(X)) -> s(active(X))
3.97/1.83	   active(add(X1, X2)) -> add(active(X1), X2)
3.97/1.83	   active(add(X1, X2)) -> add(X1, active(X2))
3.97/1.83	   active(dbl(X)) -> dbl(active(X))
3.97/1.83	   active(first(X1, X2)) -> first(active(X1), X2)
3.97/1.83	   active(first(X1, X2)) -> first(X1, active(X2))
3.97/1.83	   active(half(X)) -> half(active(X))
3.97/1.83	   terms(mark(X)) -> mark(terms(X))
3.97/1.83	   cons(mark(X1), X2) -> mark(cons(X1, X2))
3.97/1.83	   recip(mark(X)) -> mark(recip(X))
3.97/1.83	   sqr(mark(X)) -> mark(sqr(X))
3.97/1.83	   s(mark(X)) -> mark(s(X))
3.97/1.83	   add(mark(X1), X2) -> mark(add(X1, X2))
3.97/1.83	   add(X1, mark(X2)) -> mark(add(X1, X2))
3.97/1.83	   dbl(mark(X)) -> mark(dbl(X))
3.97/1.83	   first(mark(X1), X2) -> mark(first(X1, X2))
3.97/1.83	   first(X1, mark(X2)) -> mark(first(X1, X2))
3.97/1.83	   half(mark(X)) -> mark(half(X))
3.97/1.83	   proper(terms(X)) -> terms(proper(X))
3.97/1.83	   proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
3.97/1.83	   proper(recip(X)) -> recip(proper(X))
3.97/1.83	   proper(sqr(X)) -> sqr(proper(X))
3.97/1.83	   proper(s(X)) -> s(proper(X))
3.97/1.83	   proper(0) -> ok(0)
3.97/1.83	   proper(add(X1, X2)) -> add(proper(X1), proper(X2))
3.97/1.83	   proper(dbl(X)) -> dbl(proper(X))
3.97/1.83	   proper(first(X1, X2)) -> first(proper(X1), proper(X2))
3.97/1.83	   proper(nil) -> ok(nil)
3.97/1.83	   proper(half(X)) -> half(proper(X))
3.97/1.83	   terms(ok(X)) -> ok(terms(X))
3.97/1.83	   cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
3.97/1.83	   recip(ok(X)) -> ok(recip(X))
3.97/1.83	   sqr(ok(X)) -> ok(sqr(X))
3.97/1.83	   s(ok(X)) -> ok(s(X))
3.97/1.83	   add(ok(X1), ok(X2)) -> ok(add(X1, X2))
3.97/1.83	   dbl(ok(X)) -> ok(dbl(X))
3.97/1.83	   first(ok(X1), ok(X2)) -> ok(first(X1, X2))
3.97/1.83	   half(ok(X)) -> ok(half(X))
3.97/1.83	   top(mark(X)) -> top(proper(X))
3.97/1.83	   top(ok(X)) -> top(active(X))
3.97/1.83	
3.97/1.83	The set Q consists of the following terms:
3.97/1.83	
3.97/1.83	   active(terms(x0))
3.97/1.83	   active(cons(x0, x1))
3.97/1.83	   active(recip(x0))
3.97/1.83	   active(sqr(x0))
3.97/1.83	   active(s(x0))
3.97/1.83	   active(add(x0, x1))
3.97/1.83	   active(dbl(x0))
3.97/1.83	   active(first(x0, x1))
3.97/1.83	   active(half(x0))
3.97/1.83	   terms(mark(x0))
3.97/1.83	   cons(mark(x0), x1)
3.97/1.83	   recip(mark(x0))
3.97/1.83	   sqr(mark(x0))
3.97/1.83	   s(mark(x0))
3.97/1.83	   add(mark(x0), x1)
3.97/1.83	   add(x0, mark(x1))
3.97/1.83	   dbl(mark(x0))
3.97/1.83	   first(mark(x0), x1)
3.97/1.83	   first(x0, mark(x1))
3.97/1.83	   half(mark(x0))
3.97/1.83	   proper(terms(x0))
3.97/1.83	   proper(cons(x0, x1))
3.97/1.83	   proper(recip(x0))
3.97/1.83	   proper(sqr(x0))
3.97/1.83	   proper(s(x0))
3.97/1.83	   proper(0)
3.97/1.83	   proper(add(x0, x1))
3.97/1.83	   proper(dbl(x0))
3.97/1.83	   proper(first(x0, x1))
3.97/1.83	   proper(nil)
3.97/1.83	   proper(half(x0))
3.97/1.83	   terms(ok(x0))
3.97/1.83	   cons(ok(x0), ok(x1))
3.97/1.83	   recip(ok(x0))
3.97/1.83	   sqr(ok(x0))
3.97/1.83	   s(ok(x0))
3.97/1.83	   add(ok(x0), ok(x1))
3.97/1.83	   dbl(ok(x0))
3.97/1.83	   first(ok(x0), ok(x1))
3.97/1.83	   half(ok(x0))
3.97/1.83	   top(mark(x0))
3.97/1.83	   top(ok(x0))
3.97/1.83	
3.97/1.83	
3.97/1.83	----------------------------------------
3.97/1.83	
3.97/1.83	(1) QTRSToCSRProof (SOUND)
3.97/1.83	The following Q TRS is given: Q restricted rewrite system:
3.97/1.83	The TRS R consists of the following rules:
3.97/1.83	
3.97/1.83	   active(terms(N)) -> mark(cons(recip(sqr(N)), terms(s(N))))
3.97/1.83	   active(sqr(0)) -> mark(0)
3.97/1.83	   active(sqr(s(X))) -> mark(s(add(sqr(X), dbl(X))))
3.97/1.83	   active(dbl(0)) -> mark(0)
3.97/1.83	   active(dbl(s(X))) -> mark(s(s(dbl(X))))
3.97/1.83	   active(add(0, X)) -> mark(X)
3.97/1.83	   active(add(s(X), Y)) -> mark(s(add(X, Y)))
3.97/1.83	   active(first(0, X)) -> mark(nil)
3.97/1.83	   active(first(s(X), cons(Y, Z))) -> mark(cons(Y, first(X, Z)))
3.97/1.83	   active(half(0)) -> mark(0)
3.97/1.83	   active(half(s(0))) -> mark(0)
3.97/1.83	   active(half(s(s(X)))) -> mark(s(half(X)))
3.97/1.83	   active(half(dbl(X))) -> mark(X)
3.97/1.83	   active(terms(X)) -> terms(active(X))
3.97/1.83	   active(cons(X1, X2)) -> cons(active(X1), X2)
3.97/1.83	   active(recip(X)) -> recip(active(X))
3.97/1.83	   active(sqr(X)) -> sqr(active(X))
3.97/1.83	   active(s(X)) -> s(active(X))
3.97/1.83	   active(add(X1, X2)) -> add(active(X1), X2)
3.97/1.84	   active(add(X1, X2)) -> add(X1, active(X2))
3.97/1.84	   active(dbl(X)) -> dbl(active(X))
3.97/1.84	   active(first(X1, X2)) -> first(active(X1), X2)
3.97/1.84	   active(first(X1, X2)) -> first(X1, active(X2))
3.97/1.84	   active(half(X)) -> half(active(X))
3.97/1.84	   terms(mark(X)) -> mark(terms(X))
3.97/1.84	   cons(mark(X1), X2) -> mark(cons(X1, X2))
3.97/1.84	   recip(mark(X)) -> mark(recip(X))
3.97/1.84	   sqr(mark(X)) -> mark(sqr(X))
3.97/1.84	   s(mark(X)) -> mark(s(X))
3.97/1.84	   add(mark(X1), X2) -> mark(add(X1, X2))
3.97/1.84	   add(X1, mark(X2)) -> mark(add(X1, X2))
3.97/1.84	   dbl(mark(X)) -> mark(dbl(X))
3.97/1.84	   first(mark(X1), X2) -> mark(first(X1, X2))
3.97/1.84	   first(X1, mark(X2)) -> mark(first(X1, X2))
3.97/1.84	   half(mark(X)) -> mark(half(X))
3.97/1.84	   proper(terms(X)) -> terms(proper(X))
3.97/1.84	   proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
3.97/1.84	   proper(recip(X)) -> recip(proper(X))
3.97/1.84	   proper(sqr(X)) -> sqr(proper(X))
3.97/1.84	   proper(s(X)) -> s(proper(X))
3.97/1.84	   proper(0) -> ok(0)
3.97/1.84	   proper(add(X1, X2)) -> add(proper(X1), proper(X2))
3.97/1.84	   proper(dbl(X)) -> dbl(proper(X))
3.97/1.84	   proper(first(X1, X2)) -> first(proper(X1), proper(X2))
3.97/1.84	   proper(nil) -> ok(nil)
3.97/1.84	   proper(half(X)) -> half(proper(X))
3.97/1.84	   terms(ok(X)) -> ok(terms(X))
3.97/1.84	   cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
3.97/1.84	   recip(ok(X)) -> ok(recip(X))
3.97/1.84	   sqr(ok(X)) -> ok(sqr(X))
3.97/1.84	   s(ok(X)) -> ok(s(X))
3.97/1.84	   add(ok(X1), ok(X2)) -> ok(add(X1, X2))
3.97/1.84	   dbl(ok(X)) -> ok(dbl(X))
3.97/1.84	   first(ok(X1), ok(X2)) -> ok(first(X1, X2))
3.97/1.84	   half(ok(X)) -> ok(half(X))
3.97/1.84	   top(mark(X)) -> top(proper(X))
3.97/1.84	   top(ok(X)) -> top(active(X))
3.97/1.84	
3.97/1.84	The set Q consists of the following terms:
3.97/1.84	
3.97/1.84	   active(terms(x0))
3.97/1.84	   active(cons(x0, x1))
3.97/1.84	   active(recip(x0))
3.97/1.84	   active(sqr(x0))
3.97/1.84	   active(s(x0))
3.97/1.84	   active(add(x0, x1))
3.97/1.84	   active(dbl(x0))
3.97/1.84	   active(first(x0, x1))
3.97/1.84	   active(half(x0))
3.97/1.84	   terms(mark(x0))
3.97/1.84	   cons(mark(x0), x1)
3.97/1.84	   recip(mark(x0))
3.97/1.84	   sqr(mark(x0))
3.97/1.84	   s(mark(x0))
3.97/1.84	   add(mark(x0), x1)
3.97/1.84	   add(x0, mark(x1))
3.97/1.84	   dbl(mark(x0))
3.97/1.84	   first(mark(x0), x1)
3.97/1.84	   first(x0, mark(x1))
3.97/1.84	   half(mark(x0))
3.97/1.84	   proper(terms(x0))
3.97/1.84	   proper(cons(x0, x1))
3.97/1.84	   proper(recip(x0))
3.97/1.84	   proper(sqr(x0))
3.97/1.84	   proper(s(x0))
3.97/1.84	   proper(0)
3.97/1.84	   proper(add(x0, x1))
3.97/1.84	   proper(dbl(x0))
3.97/1.84	   proper(first(x0, x1))
3.97/1.84	   proper(nil)
3.97/1.84	   proper(half(x0))
3.97/1.84	   terms(ok(x0))
3.97/1.84	   cons(ok(x0), ok(x1))
3.97/1.84	   recip(ok(x0))
3.97/1.84	   sqr(ok(x0))
3.97/1.84	   s(ok(x0))
3.97/1.84	   add(ok(x0), ok(x1))
3.97/1.84	   dbl(ok(x0))
3.97/1.84	   first(ok(x0), ok(x1))
3.97/1.84	   half(ok(x0))
3.97/1.84	   top(mark(x0))
3.97/1.84	   top(ok(x0))
3.97/1.84	
3.97/1.84	Special symbols used for the transformation (see [GM04]):
3.97/1.84	top: top_1, active: active_1, mark: mark_1, ok: ok_1, proper: proper_1
3.97/1.84	The replacement map contains the following entries:
3.97/1.84	
3.97/1.84	terms: {1}
3.97/1.84	cons: {1}
3.97/1.84	recip: {1}
3.97/1.84	sqr: {1}
3.97/1.84	s: {1}
3.97/1.84	0: empty set
3.97/1.84	add: {1, 2}
3.97/1.84	dbl: {1}
3.97/1.84	first: {1, 2}
3.97/1.84	nil: empty set
3.97/1.84	half: {1}
3.97/1.84	The QTRS contained just a subset of rules created by the complete Giesl-Middeldorp transformation. Therefore, the inverse transformation is sound, but not necessarily complete.
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(2)
3.97/1.84	Obligation:
3.97/1.84	Context-sensitive rewrite system:
3.97/1.84	The TRS R consists of the following rules:
3.97/1.84	
3.97/1.84	   terms(N) -> cons(recip(sqr(N)), terms(s(N)))
3.97/1.84	   sqr(0) -> 0
3.97/1.84	   sqr(s(X)) -> s(add(sqr(X), dbl(X)))
3.97/1.84	   dbl(0) -> 0
3.97/1.84	   dbl(s(X)) -> s(s(dbl(X)))
3.97/1.84	   add(0, X) -> X
3.97/1.84	   add(s(X), Y) -> s(add(X, Y))
3.97/1.84	   first(0, X) -> nil
3.97/1.84	   first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
3.97/1.84	   half(0) -> 0
3.97/1.84	   half(s(0)) -> 0
3.97/1.84	   half(s(s(X))) -> s(half(X))
3.97/1.84	   half(dbl(X)) -> X
3.97/1.84	
3.97/1.84	The replacement map contains the following entries:
3.97/1.84	
3.97/1.84	terms: {1}
3.97/1.84	cons: {1}
3.97/1.84	recip: {1}
3.97/1.84	sqr: {1}
3.97/1.84	s: {1}
3.97/1.84	0: empty set
3.97/1.84	add: {1, 2}
3.97/1.84	dbl: {1}
3.97/1.84	first: {1, 2}
3.97/1.84	nil: empty set
3.97/1.84	half: {1}
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(3) CSDependencyPairsProof (EQUIVALENT)
3.97/1.84	Using Improved CS-DPs [LPAR08] we result in the following initial Q-CSDP problem.
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(4)
3.97/1.84	Obligation:
3.97/1.84	Q-restricted context-sensitive dependency pair problem:
3.97/1.84	The symbols in {terms_1, recip_1, sqr_1, s_1, add_2, dbl_1, first_2, half_1, SQR_1, TERMS_1, ADD_2, DBL_1, HALF_1} are replacing on all positions.
3.97/1.84	For all symbols f in {cons_2} we have mu(f) = {1}.
3.97/1.84	
3.97/1.84	The ordinary context-sensitive dependency pairs DP_o are:
3.97/1.84	   TERMS(N) -> SQR(N)
3.97/1.84	   SQR(s(X)) -> ADD(sqr(X), dbl(X))
3.97/1.84	   SQR(s(X)) -> SQR(X)
3.97/1.84	   SQR(s(X)) -> DBL(X)
3.97/1.84	   DBL(s(X)) -> DBL(X)
3.97/1.84	   ADD(s(X), Y) -> ADD(X, Y)
3.97/1.84	   HALF(s(s(X))) -> HALF(X)
3.97/1.84	
3.97/1.84	The TRS R consists of the following rules:
3.97/1.84	
3.97/1.84	   terms(N) -> cons(recip(sqr(N)), terms(s(N)))
3.97/1.84	   sqr(0) -> 0
3.97/1.84	   sqr(s(X)) -> s(add(sqr(X), dbl(X)))
3.97/1.84	   dbl(0) -> 0
3.97/1.84	   dbl(s(X)) -> s(s(dbl(X)))
3.97/1.84	   add(0, X) -> X
3.97/1.84	   add(s(X), Y) -> s(add(X, Y))
3.97/1.84	   first(0, X) -> nil
3.97/1.84	   first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
3.97/1.84	   half(0) -> 0
3.97/1.84	   half(s(0)) -> 0
3.97/1.84	   half(s(s(X))) -> s(half(X))
3.97/1.84	   half(dbl(X)) -> X
3.97/1.84	
3.97/1.84	Q is empty.
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(5) QCSDependencyGraphProof (EQUIVALENT)
3.97/1.84	The approximation of the Context-Sensitive Dependency Graph [LPAR08] contains 4 SCCs with 3 less nodes.
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(6)
3.97/1.84	Complex Obligation (AND)
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(7)
3.97/1.84	Obligation:
3.97/1.84	Q-restricted context-sensitive dependency pair problem:
3.97/1.84	The symbols in {terms_1, recip_1, sqr_1, s_1, add_2, dbl_1, first_2, half_1, HALF_1} are replacing on all positions.
3.97/1.84	For all symbols f in {cons_2} we have mu(f) = {1}.
3.97/1.84	
3.97/1.84	The TRS P consists of the following rules:
3.97/1.84	
3.97/1.84	   HALF(s(s(X))) -> HALF(X)
3.97/1.84	
3.97/1.84	The TRS R consists of the following rules:
3.97/1.84	
3.97/1.84	   terms(N) -> cons(recip(sqr(N)), terms(s(N)))
3.97/1.84	   sqr(0) -> 0
3.97/1.84	   sqr(s(X)) -> s(add(sqr(X), dbl(X)))
3.97/1.84	   dbl(0) -> 0
3.97/1.84	   dbl(s(X)) -> s(s(dbl(X)))
3.97/1.84	   add(0, X) -> X
3.97/1.84	   add(s(X), Y) -> s(add(X, Y))
3.97/1.84	   first(0, X) -> nil
3.97/1.84	   first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
3.97/1.84	   half(0) -> 0
3.97/1.84	   half(s(0)) -> 0
3.97/1.84	   half(s(s(X))) -> s(half(X))
3.97/1.84	   half(dbl(X)) -> X
3.97/1.84	
3.97/1.84	Q is empty.
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(8) QCSDPSubtermProof (EQUIVALENT)
3.97/1.84	We use the subterm processor [DA_EMMES].
3.97/1.84	
3.97/1.84	
3.97/1.84	The following pairs can be oriented strictly and are deleted.
3.97/1.84	
3.97/1.84	   HALF(s(s(X))) -> HALF(X)
3.97/1.84	The remaining pairs can at least be oriented weakly.
3.97/1.84	none
3.97/1.84	Used ordering:  Combined order from the following AFS and order.
3.97/1.84	HALF(x1)  =  x1
3.97/1.84	
3.97/1.84	
3.97/1.84	Subterm Order
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(9)
3.97/1.84	Obligation:
3.97/1.84	Q-restricted context-sensitive dependency pair problem:
3.97/1.84	The symbols in {terms_1, recip_1, sqr_1, s_1, add_2, dbl_1, first_2, half_1} are replacing on all positions.
3.97/1.84	For all symbols f in {cons_2} we have mu(f) = {1}.
3.97/1.84	
3.97/1.84	The TRS P consists of the following rules:
3.97/1.84	none
3.97/1.84	
3.97/1.84	The TRS R consists of the following rules:
3.97/1.84	
3.97/1.84	   terms(N) -> cons(recip(sqr(N)), terms(s(N)))
3.97/1.84	   sqr(0) -> 0
3.97/1.84	   sqr(s(X)) -> s(add(sqr(X), dbl(X)))
3.97/1.84	   dbl(0) -> 0
3.97/1.84	   dbl(s(X)) -> s(s(dbl(X)))
3.97/1.84	   add(0, X) -> X
3.97/1.84	   add(s(X), Y) -> s(add(X, Y))
3.97/1.84	   first(0, X) -> nil
3.97/1.84	   first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
3.97/1.84	   half(0) -> 0
3.97/1.84	   half(s(0)) -> 0
3.97/1.84	   half(s(s(X))) -> s(half(X))
3.97/1.84	   half(dbl(X)) -> X
3.97/1.84	
3.97/1.84	Q is empty.
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(10) PIsEmptyProof (EQUIVALENT)
3.97/1.84	The TRS P is empty. Hence, there is no (P,Q,R,mu)-chain.
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(11)
3.97/1.84	YES
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(12)
3.97/1.84	Obligation:
3.97/1.84	Q-restricted context-sensitive dependency pair problem:
3.97/1.84	The symbols in {terms_1, recip_1, sqr_1, s_1, add_2, dbl_1, first_2, half_1, DBL_1} are replacing on all positions.
3.97/1.84	For all symbols f in {cons_2} we have mu(f) = {1}.
3.97/1.84	
3.97/1.84	The TRS P consists of the following rules:
3.97/1.84	
3.97/1.84	   DBL(s(X)) -> DBL(X)
3.97/1.84	
3.97/1.84	The TRS R consists of the following rules:
3.97/1.84	
3.97/1.84	   terms(N) -> cons(recip(sqr(N)), terms(s(N)))
3.97/1.84	   sqr(0) -> 0
3.97/1.84	   sqr(s(X)) -> s(add(sqr(X), dbl(X)))
3.97/1.84	   dbl(0) -> 0
3.97/1.84	   dbl(s(X)) -> s(s(dbl(X)))
3.97/1.84	   add(0, X) -> X
3.97/1.84	   add(s(X), Y) -> s(add(X, Y))
3.97/1.84	   first(0, X) -> nil
3.97/1.84	   first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
3.97/1.84	   half(0) -> 0
3.97/1.84	   half(s(0)) -> 0
3.97/1.84	   half(s(s(X))) -> s(half(X))
3.97/1.84	   half(dbl(X)) -> X
3.97/1.84	
3.97/1.84	Q is empty.
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(13) QCSDPSubtermProof (EQUIVALENT)
3.97/1.84	We use the subterm processor [DA_EMMES].
3.97/1.84	
3.97/1.84	
3.97/1.84	The following pairs can be oriented strictly and are deleted.
3.97/1.84	
3.97/1.84	   DBL(s(X)) -> DBL(X)
3.97/1.84	The remaining pairs can at least be oriented weakly.
3.97/1.84	none
3.97/1.84	Used ordering:  Combined order from the following AFS and order.
3.97/1.84	DBL(x1)  =  x1
3.97/1.84	
3.97/1.84	
3.97/1.84	Subterm Order
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(14)
3.97/1.84	Obligation:
3.97/1.84	Q-restricted context-sensitive dependency pair problem:
3.97/1.84	The symbols in {terms_1, recip_1, sqr_1, s_1, add_2, dbl_1, first_2, half_1} are replacing on all positions.
3.97/1.84	For all symbols f in {cons_2} we have mu(f) = {1}.
3.97/1.84	
3.97/1.84	The TRS P consists of the following rules:
3.97/1.84	none
3.97/1.84	
3.97/1.84	The TRS R consists of the following rules:
3.97/1.84	
3.97/1.84	   terms(N) -> cons(recip(sqr(N)), terms(s(N)))
3.97/1.84	   sqr(0) -> 0
3.97/1.84	   sqr(s(X)) -> s(add(sqr(X), dbl(X)))
3.97/1.84	   dbl(0) -> 0
3.97/1.84	   dbl(s(X)) -> s(s(dbl(X)))
3.97/1.84	   add(0, X) -> X
3.97/1.84	   add(s(X), Y) -> s(add(X, Y))
3.97/1.84	   first(0, X) -> nil
3.97/1.84	   first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
3.97/1.84	   half(0) -> 0
3.97/1.84	   half(s(0)) -> 0
3.97/1.84	   half(s(s(X))) -> s(half(X))
3.97/1.84	   half(dbl(X)) -> X
3.97/1.84	
3.97/1.84	Q is empty.
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(15) PIsEmptyProof (EQUIVALENT)
3.97/1.84	The TRS P is empty. Hence, there is no (P,Q,R,mu)-chain.
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(16)
3.97/1.84	YES
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(17)
3.97/1.84	Obligation:
3.97/1.84	Q-restricted context-sensitive dependency pair problem:
3.97/1.84	The symbols in {terms_1, recip_1, sqr_1, s_1, add_2, dbl_1, first_2, half_1, ADD_2} are replacing on all positions.
3.97/1.84	For all symbols f in {cons_2} we have mu(f) = {1}.
3.97/1.84	
3.97/1.84	The TRS P consists of the following rules:
3.97/1.84	
3.97/1.84	   ADD(s(X), Y) -> ADD(X, Y)
3.97/1.84	
3.97/1.84	The TRS R consists of the following rules:
3.97/1.84	
3.97/1.84	   terms(N) -> cons(recip(sqr(N)), terms(s(N)))
3.97/1.84	   sqr(0) -> 0
3.97/1.84	   sqr(s(X)) -> s(add(sqr(X), dbl(X)))
3.97/1.84	   dbl(0) -> 0
3.97/1.84	   dbl(s(X)) -> s(s(dbl(X)))
3.97/1.84	   add(0, X) -> X
3.97/1.84	   add(s(X), Y) -> s(add(X, Y))
3.97/1.84	   first(0, X) -> nil
3.97/1.84	   first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
3.97/1.84	   half(0) -> 0
3.97/1.84	   half(s(0)) -> 0
3.97/1.84	   half(s(s(X))) -> s(half(X))
3.97/1.84	   half(dbl(X)) -> X
3.97/1.84	
3.97/1.84	Q is empty.
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(18) QCSDPSubtermProof (EQUIVALENT)
3.97/1.84	We use the subterm processor [DA_EMMES].
3.97/1.84	
3.97/1.84	
3.97/1.84	The following pairs can be oriented strictly and are deleted.
3.97/1.84	
3.97/1.84	   ADD(s(X), Y) -> ADD(X, Y)
3.97/1.84	The remaining pairs can at least be oriented weakly.
3.97/1.84	none
3.97/1.84	Used ordering:  Combined order from the following AFS and order.
3.97/1.84	ADD(x1, x2)  =  x1
3.97/1.84	
3.97/1.84	
3.97/1.84	Subterm Order
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(19)
3.97/1.84	Obligation:
3.97/1.84	Q-restricted context-sensitive dependency pair problem:
3.97/1.84	The symbols in {terms_1, recip_1, sqr_1, s_1, add_2, dbl_1, first_2, half_1} are replacing on all positions.
3.97/1.84	For all symbols f in {cons_2} we have mu(f) = {1}.
3.97/1.84	
3.97/1.84	The TRS P consists of the following rules:
3.97/1.84	none
3.97/1.84	
3.97/1.84	The TRS R consists of the following rules:
3.97/1.84	
3.97/1.84	   terms(N) -> cons(recip(sqr(N)), terms(s(N)))
3.97/1.84	   sqr(0) -> 0
3.97/1.84	   sqr(s(X)) -> s(add(sqr(X), dbl(X)))
3.97/1.84	   dbl(0) -> 0
3.97/1.84	   dbl(s(X)) -> s(s(dbl(X)))
3.97/1.84	   add(0, X) -> X
3.97/1.84	   add(s(X), Y) -> s(add(X, Y))
3.97/1.84	   first(0, X) -> nil
3.97/1.84	   first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
3.97/1.84	   half(0) -> 0
3.97/1.84	   half(s(0)) -> 0
3.97/1.84	   half(s(s(X))) -> s(half(X))
3.97/1.84	   half(dbl(X)) -> X
3.97/1.84	
3.97/1.84	Q is empty.
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(20) PIsEmptyProof (EQUIVALENT)
3.97/1.84	The TRS P is empty. Hence, there is no (P,Q,R,mu)-chain.
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(21)
3.97/1.84	YES
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(22)
3.97/1.84	Obligation:
3.97/1.84	Q-restricted context-sensitive dependency pair problem:
3.97/1.84	The symbols in {terms_1, recip_1, sqr_1, s_1, add_2, dbl_1, first_2, half_1, SQR_1} are replacing on all positions.
3.97/1.84	For all symbols f in {cons_2} we have mu(f) = {1}.
3.97/1.84	
3.97/1.84	The TRS P consists of the following rules:
3.97/1.84	
3.97/1.84	   SQR(s(X)) -> SQR(X)
3.97/1.84	
3.97/1.84	The TRS R consists of the following rules:
3.97/1.84	
3.97/1.84	   terms(N) -> cons(recip(sqr(N)), terms(s(N)))
3.97/1.84	   sqr(0) -> 0
3.97/1.84	   sqr(s(X)) -> s(add(sqr(X), dbl(X)))
3.97/1.84	   dbl(0) -> 0
3.97/1.84	   dbl(s(X)) -> s(s(dbl(X)))
3.97/1.84	   add(0, X) -> X
3.97/1.84	   add(s(X), Y) -> s(add(X, Y))
3.97/1.84	   first(0, X) -> nil
3.97/1.84	   first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
3.97/1.84	   half(0) -> 0
3.97/1.84	   half(s(0)) -> 0
3.97/1.84	   half(s(s(X))) -> s(half(X))
3.97/1.84	   half(dbl(X)) -> X
3.97/1.84	
3.97/1.84	Q is empty.
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(23) QCSDPSubtermProof (EQUIVALENT)
3.97/1.84	We use the subterm processor [DA_EMMES].
3.97/1.84	
3.97/1.84	
3.97/1.84	The following pairs can be oriented strictly and are deleted.
3.97/1.84	
3.97/1.84	   SQR(s(X)) -> SQR(X)
3.97/1.84	The remaining pairs can at least be oriented weakly.
3.97/1.84	none
3.97/1.84	Used ordering:  Combined order from the following AFS and order.
3.97/1.84	SQR(x1)  =  x1
3.97/1.84	
3.97/1.84	
3.97/1.84	Subterm Order
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(24)
3.97/1.84	Obligation:
3.97/1.84	Q-restricted context-sensitive dependency pair problem:
3.97/1.84	The symbols in {terms_1, recip_1, sqr_1, s_1, add_2, dbl_1, first_2, half_1} are replacing on all positions.
3.97/1.84	For all symbols f in {cons_2} we have mu(f) = {1}.
3.97/1.84	
3.97/1.84	The TRS P consists of the following rules:
3.97/1.84	none
3.97/1.84	
3.97/1.84	The TRS R consists of the following rules:
3.97/1.84	
3.97/1.84	   terms(N) -> cons(recip(sqr(N)), terms(s(N)))
3.97/1.84	   sqr(0) -> 0
3.97/1.84	   sqr(s(X)) -> s(add(sqr(X), dbl(X)))
3.97/1.84	   dbl(0) -> 0
3.97/1.84	   dbl(s(X)) -> s(s(dbl(X)))
3.97/1.84	   add(0, X) -> X
3.97/1.84	   add(s(X), Y) -> s(add(X, Y))
3.97/1.84	   first(0, X) -> nil
3.97/1.84	   first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
3.97/1.84	   half(0) -> 0
3.97/1.84	   half(s(0)) -> 0
3.97/1.84	   half(s(s(X))) -> s(half(X))
3.97/1.84	   half(dbl(X)) -> X
3.97/1.84	
3.97/1.84	Q is empty.
3.97/1.84	
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(25) PIsEmptyProof (EQUIVALENT)
3.97/1.84	The TRS P is empty. Hence, there is no (P,Q,R,mu)-chain.
3.97/1.84	----------------------------------------
3.97/1.84	
3.97/1.84	(26)
3.97/1.84	YES
4.09/1.86	EOF