/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Problem 1: 

(VAR v_NonEmpty:S l:S x:S y:S)
(RULES
rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
rev(nil) -> nil
rev1(0,nil) -> 0
rev1(s(x:S),nil) -> s(x:S)
rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
rev2(x:S,nil) -> nil
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 REV(cons(x:S,l:S)) -> REV1(x:S,l:S)
 REV(cons(x:S,l:S)) -> REV2(x:S,l:S)
 REV1(x:S,cons(y:S,l:S)) -> REV1(y:S,l:S)
 REV2(x:S,cons(y:S,l:S)) -> REV(cons(x:S,rev2(y:S,l:S)))
 REV2(x:S,cons(y:S,l:S)) -> REV2(y:S,l:S)
-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil

Problem 1: 

SCC Processor:
-> Pairs:
 REV(cons(x:S,l:S)) -> REV1(x:S,l:S)
 REV(cons(x:S,l:S)) -> REV2(x:S,l:S)
 REV1(x:S,cons(y:S,l:S)) -> REV1(y:S,l:S)
 REV2(x:S,cons(y:S,l:S)) -> REV(cons(x:S,rev2(y:S,l:S)))
 REV2(x:S,cons(y:S,l:S)) -> REV2(y:S,l:S)
-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 REV1(x:S,cons(y:S,l:S)) -> REV1(y:S,l:S)
->->-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil
->->Cycle:
->->-> Pairs:
 REV(cons(x:S,l:S)) -> REV2(x:S,l:S)
 REV2(x:S,cons(y:S,l:S)) -> REV(cons(x:S,rev2(y:S,l:S)))
 REV2(x:S,cons(y:S,l:S)) -> REV2(y:S,l:S)
->->-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 REV1(x:S,cons(y:S,l:S)) -> REV1(y:S,l:S)
-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil
->Projection:
 pi(REV1) = 2

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Reduction Pairs Processor:
-> Pairs:
 REV(cons(x:S,l:S)) -> REV2(x:S,l:S)
 REV2(x:S,cons(y:S,l:S)) -> REV(cons(x:S,rev2(y:S,l:S)))
 REV2(x:S,cons(y:S,l:S)) -> REV2(y:S,l:S)
-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil
-> Usable rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[rev](X) = X
[rev1](X1,X2) = X2 + 2
[rev2](X1,X2) = X2
[0] = 2
[cons](X1,X2) = 2.X2 + 2
[fSNonEmpty] = 0
[nil] = 1
[s](X) = 2
[REV](X) = 2.X
[REV1](X1,X2) = 0
[REV2](X1,X2) = 2.X2

Problem 1.2: 

SCC Processor:
-> Pairs:
 REV2(x:S,cons(y:S,l:S)) -> REV(cons(x:S,rev2(y:S,l:S)))
 REV2(x:S,cons(y:S,l:S)) -> REV2(y:S,l:S)
-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 REV2(x:S,cons(y:S,l:S)) -> REV2(y:S,l:S)
->->-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil

Problem 1.2: 

Subterm Processor:
-> Pairs:
 REV2(x:S,cons(y:S,l:S)) -> REV2(y:S,l:S)
-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil
->Projection:
 pi(REV2) = 2

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S))
 rev(nil) -> nil
 rev1(0,nil) -> 0
 rev1(s(x:S),nil) -> s(x:S)
 rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S)
 rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S)))
 rev2(x:S,nil) -> nil
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.