YES

Problem 1: 

(VAR v_NonEmpty:S X:S X1:S X2:S Y:S Z:S)
(RULES
a__first(0,X:S) -> nil
a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
a__first(X1:S,X2:S) -> first(X1:S,X2:S)
a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
a__from(X:S) -> from(X:S)
mark(0) -> 0
mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
mark(from(X:S)) -> a__from(mark(X:S))
mark(nil) -> nil
mark(s(X:S)) -> s(mark(X:S))
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 A__FIRST(s(X:S),cons(Y:S,Z:S)) -> MARK(Y:S)
 A__FROM(X:S) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S))
 MARK(first(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X2:S)
 MARK(from(X:S)) -> A__FROM(mark(X:S))
 MARK(from(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))

Problem 1: 

SCC Processor:
-> Pairs:
 A__FIRST(s(X:S),cons(Y:S,Z:S)) -> MARK(Y:S)
 A__FROM(X:S) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S))
 MARK(first(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X2:S)
 MARK(from(X:S)) -> A__FROM(mark(X:S))
 MARK(from(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__FIRST(s(X:S),cons(Y:S,Z:S)) -> MARK(Y:S)
 A__FROM(X:S) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S))
 MARK(first(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X2:S)
 MARK(from(X:S)) -> A__FROM(mark(X:S))
 MARK(from(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
->->-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__FIRST(s(X:S),cons(Y:S,Z:S)) -> MARK(Y:S)
 A__FROM(X:S) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S))
 MARK(first(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X2:S)
 MARK(from(X:S)) -> A__FROM(mark(X:S))
 MARK(from(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
-> Usable rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a__first](X1,X2) = 2.X1 + 2.X2 + 2
[a__from](X) = 2.X + 2
[mark](X) = 2.X
[0] = 2
[cons](X1,X2) = X1 + 2
[fSNonEmpty] = 0
[first](X1,X2) = 2.X1 + 2.X2 + 1
[from](X) = 2.X + 2
[nil] = 0
[s](X) = X + 2
[A__FIRST](X1,X2) = 2.X1 + 2.X2 + 2
[A__FROM](X) = 2.X + 2
[MARK](X) = 2.X + 2

Problem 1: 

SCC Processor:
-> Pairs:
 A__FROM(X:S) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S))
 MARK(first(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X2:S)
 MARK(from(X:S)) -> A__FROM(mark(X:S))
 MARK(from(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__FROM(X:S) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X2:S)
 MARK(from(X:S)) -> A__FROM(mark(X:S))
 MARK(from(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
->->-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__FROM(X:S) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X2:S)
 MARK(from(X:S)) -> A__FROM(mark(X:S))
 MARK(from(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
-> Usable rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a__first](X1,X2) = X1 + 2.X2 + 2
[a__from](X) = 2.X + 2
[mark](X) = 2.X + 1
[0] = 2
[cons](X1,X2) = X1
[fSNonEmpty] = 0
[first](X1,X2) = X1 + 2.X2 + 2
[from](X) = 2.X + 2
[nil] = 2
[s](X) = X
[A__FIRST](X1,X2) = 0
[A__FROM](X) = 2.X + 2
[MARK](X) = 2.X + 1

Problem 1: 

SCC Processor:
-> Pairs:
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X2:S)
 MARK(from(X:S)) -> A__FROM(mark(X:S))
 MARK(from(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X2:S)
 MARK(from(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
->->-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))

Problem 1: 

Subterm Processor:
-> Pairs:
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X1:S)
 MARK(first(X1:S,X2:S)) -> MARK(X2:S)
 MARK(from(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
->Projection:
 pi(MARK) = 1

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 a__first(0,X:S) -> nil
 a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S))
 a__first(X1:S,X2:S) -> first(X1:S,X2:S)
 a__from(X:S) -> cons(mark(X:S),from(s(X:S)))
 a__from(X:S) -> from(X:S)
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S))
 mark(from(X:S)) -> a__from(mark(X:S))
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.