4.31/1.84	YES
4.31/1.85	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
4.31/1.85	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.31/1.85	
4.31/1.85	
4.31/1.85	Termination w.r.t. Q of the given QTRS could be proven:
4.31/1.85	
4.31/1.85	(0) QTRS
4.31/1.85	(1) QTRSToCSRProof [SOUND, 0 ms]
4.31/1.85	(2) CSR
4.31/1.85	(3) CSRRRRProof [EQUIVALENT, 53 ms]
4.31/1.85	(4) CSR
4.31/1.85	(5) CSRRRRProof [EQUIVALENT, 0 ms]
4.31/1.85	(6) CSR
4.31/1.85	(7) CSRRRRProof [EQUIVALENT, 10 ms]
4.31/1.85	(8) CSR
4.31/1.85	(9) CSRRRRProof [EQUIVALENT, 0 ms]
4.31/1.85	(10) CSR
4.31/1.85	(11) CSRRRRProof [EQUIVALENT, 0 ms]
4.31/1.85	(12) CSR
4.31/1.85	(13) CSRRRRProof [EQUIVALENT, 3 ms]
4.31/1.85	(14) CSR
4.31/1.85	(15) CSRRRRProof [EQUIVALENT, 0 ms]
4.31/1.85	(16) CSR
4.31/1.85	(17) RisEmptyProof [EQUIVALENT, 0 ms]
4.31/1.85	(18) YES
4.31/1.85	
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(0)
4.31/1.85	Obligation:
4.31/1.85	Q restricted rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   active(U11(tt, N)) -> mark(N)
4.31/1.85	   active(U21(tt, M, N)) -> mark(s(plus(N, M)))
4.31/1.85	   active(and(tt, X)) -> mark(X)
4.31/1.85	   active(isNat(0)) -> mark(tt)
4.31/1.85	   active(isNat(plus(V1, V2))) -> mark(and(isNat(V1), isNat(V2)))
4.31/1.85	   active(isNat(s(V1))) -> mark(isNat(V1))
4.31/1.85	   active(plus(N, 0)) -> mark(U11(isNat(N), N))
4.31/1.85	   active(plus(N, s(M))) -> mark(U21(and(isNat(M), isNat(N)), M, N))
4.31/1.85	   active(U11(X1, X2)) -> U11(active(X1), X2)
4.31/1.85	   active(U21(X1, X2, X3)) -> U21(active(X1), X2, X3)
4.31/1.85	   active(s(X)) -> s(active(X))
4.31/1.85	   active(plus(X1, X2)) -> plus(active(X1), X2)
4.31/1.85	   active(plus(X1, X2)) -> plus(X1, active(X2))
4.31/1.85	   active(and(X1, X2)) -> and(active(X1), X2)
4.31/1.85	   U11(mark(X1), X2) -> mark(U11(X1, X2))
4.31/1.85	   U21(mark(X1), X2, X3) -> mark(U21(X1, X2, X3))
4.31/1.85	   s(mark(X)) -> mark(s(X))
4.31/1.85	   plus(mark(X1), X2) -> mark(plus(X1, X2))
4.31/1.85	   plus(X1, mark(X2)) -> mark(plus(X1, X2))
4.31/1.85	   and(mark(X1), X2) -> mark(and(X1, X2))
4.31/1.85	   proper(U11(X1, X2)) -> U11(proper(X1), proper(X2))
4.31/1.85	   proper(tt) -> ok(tt)
4.31/1.85	   proper(U21(X1, X2, X3)) -> U21(proper(X1), proper(X2), proper(X3))
4.31/1.85	   proper(s(X)) -> s(proper(X))
4.31/1.85	   proper(plus(X1, X2)) -> plus(proper(X1), proper(X2))
4.31/1.85	   proper(and(X1, X2)) -> and(proper(X1), proper(X2))
4.31/1.85	   proper(isNat(X)) -> isNat(proper(X))
4.31/1.85	   proper(0) -> ok(0)
4.31/1.85	   U11(ok(X1), ok(X2)) -> ok(U11(X1, X2))
4.31/1.85	   U21(ok(X1), ok(X2), ok(X3)) -> ok(U21(X1, X2, X3))
4.31/1.85	   s(ok(X)) -> ok(s(X))
4.31/1.85	   plus(ok(X1), ok(X2)) -> ok(plus(X1, X2))
4.31/1.85	   and(ok(X1), ok(X2)) -> ok(and(X1, X2))
4.31/1.85	   isNat(ok(X)) -> ok(isNat(X))
4.31/1.85	   top(mark(X)) -> top(proper(X))
4.31/1.85	   top(ok(X)) -> top(active(X))
4.31/1.85	
4.31/1.85	The set Q consists of the following terms:
4.31/1.85	
4.31/1.85	   active(isNat(0))
4.31/1.85	   active(isNat(plus(x0, x1)))
4.31/1.85	   active(isNat(s(x0)))
4.31/1.85	   active(U11(x0, x1))
4.31/1.85	   active(U21(x0, x1, x2))
4.31/1.85	   active(s(x0))
4.31/1.85	   active(plus(x0, x1))
4.31/1.85	   active(and(x0, x1))
4.31/1.85	   U11(mark(x0), x1)
4.31/1.85	   U21(mark(x0), x1, x2)
4.31/1.85	   s(mark(x0))
4.31/1.85	   plus(mark(x0), x1)
4.31/1.85	   plus(x0, mark(x1))
4.31/1.85	   and(mark(x0), x1)
4.31/1.85	   proper(U11(x0, x1))
4.31/1.85	   proper(tt)
4.31/1.85	   proper(U21(x0, x1, x2))
4.31/1.85	   proper(s(x0))
4.31/1.85	   proper(plus(x0, x1))
4.31/1.85	   proper(and(x0, x1))
4.31/1.85	   proper(isNat(x0))
4.31/1.85	   proper(0)
4.31/1.85	   U11(ok(x0), ok(x1))
4.31/1.85	   U21(ok(x0), ok(x1), ok(x2))
4.31/1.85	   s(ok(x0))
4.31/1.85	   plus(ok(x0), ok(x1))
4.31/1.85	   and(ok(x0), ok(x1))
4.31/1.85	   isNat(ok(x0))
4.31/1.85	   top(mark(x0))
4.31/1.85	   top(ok(x0))
4.31/1.85	
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(1) QTRSToCSRProof (SOUND)
4.31/1.85	The following Q TRS is given: Q restricted rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   active(U11(tt, N)) -> mark(N)
4.31/1.85	   active(U21(tt, M, N)) -> mark(s(plus(N, M)))
4.31/1.85	   active(and(tt, X)) -> mark(X)
4.31/1.85	   active(isNat(0)) -> mark(tt)
4.31/1.85	   active(isNat(plus(V1, V2))) -> mark(and(isNat(V1), isNat(V2)))
4.31/1.85	   active(isNat(s(V1))) -> mark(isNat(V1))
4.31/1.85	   active(plus(N, 0)) -> mark(U11(isNat(N), N))
4.31/1.85	   active(plus(N, s(M))) -> mark(U21(and(isNat(M), isNat(N)), M, N))
4.31/1.85	   active(U11(X1, X2)) -> U11(active(X1), X2)
4.31/1.85	   active(U21(X1, X2, X3)) -> U21(active(X1), X2, X3)
4.31/1.85	   active(s(X)) -> s(active(X))
4.31/1.85	   active(plus(X1, X2)) -> plus(active(X1), X2)
4.31/1.85	   active(plus(X1, X2)) -> plus(X1, active(X2))
4.31/1.85	   active(and(X1, X2)) -> and(active(X1), X2)
4.31/1.85	   U11(mark(X1), X2) -> mark(U11(X1, X2))
4.31/1.85	   U21(mark(X1), X2, X3) -> mark(U21(X1, X2, X3))
4.31/1.85	   s(mark(X)) -> mark(s(X))
4.31/1.85	   plus(mark(X1), X2) -> mark(plus(X1, X2))
4.31/1.85	   plus(X1, mark(X2)) -> mark(plus(X1, X2))
4.31/1.85	   and(mark(X1), X2) -> mark(and(X1, X2))
4.31/1.85	   proper(U11(X1, X2)) -> U11(proper(X1), proper(X2))
4.31/1.85	   proper(tt) -> ok(tt)
4.31/1.85	   proper(U21(X1, X2, X3)) -> U21(proper(X1), proper(X2), proper(X3))
4.31/1.85	   proper(s(X)) -> s(proper(X))
4.31/1.85	   proper(plus(X1, X2)) -> plus(proper(X1), proper(X2))
4.31/1.85	   proper(and(X1, X2)) -> and(proper(X1), proper(X2))
4.31/1.85	   proper(isNat(X)) -> isNat(proper(X))
4.31/1.85	   proper(0) -> ok(0)
4.31/1.85	   U11(ok(X1), ok(X2)) -> ok(U11(X1, X2))
4.31/1.85	   U21(ok(X1), ok(X2), ok(X3)) -> ok(U21(X1, X2, X3))
4.31/1.85	   s(ok(X)) -> ok(s(X))
4.31/1.85	   plus(ok(X1), ok(X2)) -> ok(plus(X1, X2))
4.31/1.85	   and(ok(X1), ok(X2)) -> ok(and(X1, X2))
4.31/1.85	   isNat(ok(X)) -> ok(isNat(X))
4.31/1.85	   top(mark(X)) -> top(proper(X))
4.31/1.85	   top(ok(X)) -> top(active(X))
4.31/1.85	
4.31/1.85	The set Q consists of the following terms:
4.31/1.85	
4.31/1.85	   active(isNat(0))
4.31/1.85	   active(isNat(plus(x0, x1)))
4.31/1.85	   active(isNat(s(x0)))
4.31/1.85	   active(U11(x0, x1))
4.31/1.85	   active(U21(x0, x1, x2))
4.31/1.85	   active(s(x0))
4.31/1.85	   active(plus(x0, x1))
4.31/1.85	   active(and(x0, x1))
4.31/1.85	   U11(mark(x0), x1)
4.31/1.85	   U21(mark(x0), x1, x2)
4.31/1.85	   s(mark(x0))
4.31/1.85	   plus(mark(x0), x1)
4.31/1.85	   plus(x0, mark(x1))
4.31/1.85	   and(mark(x0), x1)
4.31/1.85	   proper(U11(x0, x1))
4.31/1.85	   proper(tt)
4.31/1.85	   proper(U21(x0, x1, x2))
4.31/1.85	   proper(s(x0))
4.31/1.85	   proper(plus(x0, x1))
4.31/1.85	   proper(and(x0, x1))
4.31/1.85	   proper(isNat(x0))
4.31/1.85	   proper(0)
4.31/1.85	   U11(ok(x0), ok(x1))
4.31/1.85	   U21(ok(x0), ok(x1), ok(x2))
4.31/1.85	   s(ok(x0))
4.31/1.85	   plus(ok(x0), ok(x1))
4.31/1.85	   and(ok(x0), ok(x1))
4.31/1.85	   isNat(ok(x0))
4.31/1.85	   top(mark(x0))
4.31/1.85	   top(ok(x0))
4.31/1.85	
4.31/1.85	Special symbols used for the transformation (see [GM04]):
4.31/1.85	top: top_1, active: active_1, mark: mark_1, ok: ok_1, proper: proper_1
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	U11: {1}
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	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.
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(2)
4.31/1.85	Obligation:
4.31/1.85	Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   U11(tt, N) -> N
4.31/1.85	   U21(tt, M, N) -> s(plus(N, M))
4.31/1.85	   and(tt, X) -> X
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	   isNat(s(V1)) -> isNat(V1)
4.31/1.85	   plus(N, 0) -> U11(isNat(N), N)
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	U11: {1}
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(3) CSRRRRProof (EQUIVALENT)
4.31/1.85	The following CSR is given: Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   U11(tt, N) -> N
4.31/1.85	   U21(tt, M, N) -> s(plus(N, M))
4.31/1.85	   and(tt, X) -> X
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	   isNat(s(V1)) -> isNat(V1)
4.31/1.85	   plus(N, 0) -> U11(isNat(N), N)
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	U11: {1}
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	Used ordering:
4.31/1.85	Polynomial interpretation [POLO]:
4.31/1.85	
4.31/1.85	   POL(0) = 2
4.31/1.85	   POL(U11(x_1, x_2)) = 2*x_1 + x_2
4.31/1.85	   POL(U21(x_1, x_2, x_3)) = 2*x_1 + x_2 + x_3
4.31/1.85	   POL(and(x_1, x_2)) = 2*x_1 + 2*x_2
4.31/1.85	   POL(isNat(x_1)) = 0
4.31/1.85	   POL(plus(x_1, x_2)) = x_1 + x_2
4.31/1.85	   POL(s(x_1)) = x_1
4.31/1.85	   POL(tt) = 0
4.31/1.85	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
4.31/1.85	
4.31/1.85	   plus(N, 0) -> U11(isNat(N), N)
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(4)
4.31/1.85	Obligation:
4.31/1.85	Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   U11(tt, N) -> N
4.31/1.85	   U21(tt, M, N) -> s(plus(N, M))
4.31/1.85	   and(tt, X) -> X
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	   isNat(s(V1)) -> isNat(V1)
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	U11: {1}
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(5) CSRRRRProof (EQUIVALENT)
4.31/1.85	The following CSR is given: Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   U11(tt, N) -> N
4.31/1.85	   U21(tt, M, N) -> s(plus(N, M))
4.31/1.85	   and(tt, X) -> X
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	   isNat(s(V1)) -> isNat(V1)
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	U11: {1}
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	Used ordering:
4.31/1.85	Polynomial interpretation [POLO]:
4.31/1.85	
4.31/1.85	   POL(0) = 0
4.31/1.85	   POL(U11(x_1, x_2)) = 1 + x_1 + x_2
4.31/1.85	   POL(U21(x_1, x_2, x_3)) = 1 + x_1 + x_2 + x_3
4.31/1.85	   POL(and(x_1, x_2)) = x_1 + x_2
4.31/1.85	   POL(isNat(x_1)) = 0
4.31/1.85	   POL(plus(x_1, x_2)) = 1 + x_1 + x_2
4.31/1.85	   POL(s(x_1)) = x_1
4.31/1.85	   POL(tt) = 0
4.31/1.85	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
4.31/1.85	
4.31/1.85	   U11(tt, N) -> N
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(6)
4.31/1.85	Obligation:
4.31/1.85	Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   U21(tt, M, N) -> s(plus(N, M))
4.31/1.85	   and(tt, X) -> X
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	   isNat(s(V1)) -> isNat(V1)
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(7) CSRRRRProof (EQUIVALENT)
4.31/1.85	The following CSR is given: Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   U21(tt, M, N) -> s(plus(N, M))
4.31/1.85	   and(tt, X) -> X
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	   isNat(s(V1)) -> isNat(V1)
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	Used ordering:
4.31/1.85	Polynomial interpretation [POLO]:
4.31/1.85	
4.31/1.85	   POL(0) = 2
4.31/1.85	   POL(U21(x_1, x_2, x_3)) = 2 + 2*x_1 + 2*x_2 + x_3
4.31/1.85	   POL(and(x_1, x_2)) = 2*x_1 + 2*x_2
4.31/1.85	   POL(isNat(x_1)) = 0
4.31/1.85	   POL(plus(x_1, x_2)) = x_1 + 2*x_2
4.31/1.85	   POL(s(x_1)) = 1 + x_1
4.31/1.85	   POL(tt) = 0
4.31/1.85	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
4.31/1.85	
4.31/1.85	   U21(tt, M, N) -> s(plus(N, M))
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(8)
4.31/1.85	Obligation:
4.31/1.85	Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   and(tt, X) -> X
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	   isNat(s(V1)) -> isNat(V1)
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(9) CSRRRRProof (EQUIVALENT)
4.31/1.85	The following CSR is given: Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   and(tt, X) -> X
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	   isNat(s(V1)) -> isNat(V1)
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	Used ordering:
4.31/1.85	Polynomial interpretation [POLO]:
4.31/1.85	
4.31/1.85	   POL(0) = 1
4.31/1.85	   POL(U21(x_1, x_2, x_3)) = 1 + x_1
4.31/1.85	   POL(and(x_1, x_2)) = 1 + x_1 + x_2
4.31/1.85	   POL(isNat(x_1)) = x_1
4.31/1.85	   POL(plus(x_1, x_2)) = 1 + x_1 + x_2
4.31/1.85	   POL(s(x_1)) = 1 + x_1
4.31/1.85	   POL(tt) = 1
4.31/1.85	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
4.31/1.85	
4.31/1.85	   and(tt, X) -> X
4.31/1.85	   isNat(s(V1)) -> isNat(V1)
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(10)
4.31/1.85	Obligation:
4.31/1.85	Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(11) CSRRRRProof (EQUIVALENT)
4.31/1.85	The following CSR is given: Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	tt: empty set
4.31/1.85	U21: {1}
4.31/1.85	s: {1}
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	Used ordering:
4.31/1.85	Polynomial interpretation [POLO]:
4.31/1.85	
4.31/1.85	   POL(0) = 1
4.31/1.85	   POL(U21(x_1, x_2, x_3)) = x_1 + 2*x_3
4.31/1.85	   POL(and(x_1, x_2)) = 2*x_1
4.31/1.85	   POL(isNat(x_1)) = 0
4.31/1.85	   POL(plus(x_1, x_2)) = 1 + 2*x_1 + 2*x_2
4.31/1.85	   POL(s(x_1)) = 2 + 2*x_1
4.31/1.85	   POL(tt) = 0
4.31/1.85	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
4.31/1.85	
4.31/1.85	   plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N)
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(12)
4.31/1.85	Obligation:
4.31/1.85	Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	tt: empty set
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(13) CSRRRRProof (EQUIVALENT)
4.31/1.85	The following CSR is given: Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   isNat(0) -> tt
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	tt: empty set
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	0: empty set
4.31/1.85	Used ordering:
4.31/1.85	Polynomial interpretation [POLO]:
4.31/1.85	
4.31/1.85	   POL(0) = 1
4.31/1.85	   POL(and(x_1, x_2)) = x_1 + x_2
4.31/1.85	   POL(isNat(x_1)) = 1 + x_1
4.31/1.85	   POL(plus(x_1, x_2)) = 1 + x_1 + x_2
4.31/1.85	   POL(tt) = 0
4.31/1.85	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
4.31/1.85	
4.31/1.85	   isNat(0) -> tt
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(14)
4.31/1.85	Obligation:
4.31/1.85	Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(15) CSRRRRProof (EQUIVALENT)
4.31/1.85	The following CSR is given: Context-sensitive rewrite system:
4.31/1.85	The TRS R consists of the following rules:
4.31/1.85	
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	
4.31/1.85	The replacement map contains the following entries:
4.31/1.85	
4.31/1.85	plus: {1, 2}
4.31/1.85	and: {1}
4.31/1.85	isNat: empty set
4.31/1.85	Used ordering:
4.31/1.85	Polynomial interpretation [POLO]:
4.31/1.85	
4.31/1.85	   POL(and(x_1, x_2)) = x_1
4.31/1.85	   POL(isNat(x_1)) = 2*x_1
4.31/1.85	   POL(plus(x_1, x_2)) = 2 + x_1 + x_2
4.31/1.85	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
4.31/1.85	
4.31/1.85	   isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2))
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(16)
4.31/1.85	Obligation:
4.31/1.85	Context-sensitive rewrite system:
4.31/1.85	R is empty.
4.31/1.85	
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(17) RisEmptyProof (EQUIVALENT)
4.31/1.85	The CSR R is empty. Hence, termination is trivially proven.
4.31/1.85	----------------------------------------
4.31/1.85	
4.31/1.85	(18)
4.31/1.85	YES
4.42/1.88	EOF