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


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


YES

Problem 1: 

(VAR v_NonEmpty:S X:S Y:S)
(RULES
div(0,s(Y:S)) -> 0
div(s(X:S),s(Y:S)) -> s(div(minus(X:S,Y:S),s(Y:S)))
minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
minus(X:S,0) -> X:S
p(s(X:S)) -> X:S
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 div(0,s(Y:S)) -> 0
 div(s(X:S),s(Y:S)) -> s(div(minus(X:S,Y:S),s(Y:S)))
 minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
 minus(X:S,0) -> X:S
 p(s(X:S)) -> X:S
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 DIV(s(X:S),s(Y:S)) -> DIV(minus(X:S,Y:S),s(Y:S))
 DIV(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S)
 MINUS(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S)
 MINUS(s(X:S),s(Y:S)) -> P(minus(X:S,Y:S))
-> Rules:
 div(0,s(Y:S)) -> 0
 div(s(X:S),s(Y:S)) -> s(div(minus(X:S,Y:S),s(Y:S)))
 minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
 minus(X:S,0) -> X:S
 p(s(X:S)) -> X:S

Problem 1: 

SCC Processor:
-> Pairs:
 DIV(s(X:S),s(Y:S)) -> DIV(minus(X:S,Y:S),s(Y:S))
 DIV(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S)
 MINUS(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S)
 MINUS(s(X:S),s(Y:S)) -> P(minus(X:S,Y:S))
-> Rules:
 div(0,s(Y:S)) -> 0
 div(s(X:S),s(Y:S)) -> s(div(minus(X:S,Y:S),s(Y:S)))
 minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
 minus(X:S,0) -> X:S
 p(s(X:S)) -> X:S
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 MINUS(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S)
->->-> Rules:
 div(0,s(Y:S)) -> 0
 div(s(X:S),s(Y:S)) -> s(div(minus(X:S,Y:S),s(Y:S)))
 minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
 minus(X:S,0) -> X:S
 p(s(X:S)) -> X:S
->->Cycle:
->->-> Pairs:
 DIV(s(X:S),s(Y:S)) -> DIV(minus(X:S,Y:S),s(Y:S))
->->-> Rules:
 div(0,s(Y:S)) -> 0
 div(s(X:S),s(Y:S)) -> s(div(minus(X:S,Y:S),s(Y:S)))
 minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
 minus(X:S,0) -> X:S
 p(s(X:S)) -> X:S


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 MINUS(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S)
-> Rules:
 div(0,s(Y:S)) -> 0
 div(s(X:S),s(Y:S)) -> s(div(minus(X:S,Y:S),s(Y:S)))
 minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
 minus(X:S,0) -> X:S
 p(s(X:S)) -> X:S
->Projection:
 pi(MINUS) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 div(0,s(Y:S)) -> 0
 div(s(X:S),s(Y:S)) -> s(div(minus(X:S,Y:S),s(Y:S)))
 minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
 minus(X:S,0) -> X:S
 p(s(X:S)) -> X:S
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Reduction Pairs Processor:
-> Pairs:
 DIV(s(X:S),s(Y:S)) -> DIV(minus(X:S,Y:S),s(Y:S))
-> Rules:
 div(0,s(Y:S)) -> 0
 div(s(X:S),s(Y:S)) -> s(div(minus(X:S,Y:S),s(Y:S)))
 minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
 minus(X:S,0) -> X:S
 p(s(X:S)) -> X:S
-> Usable rules:
 minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
 minus(X:S,0) -> X:S
 p(s(X:S)) -> X:S
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[div](X1,X2) = 0
[minus](X1,X2) = X1 + 1
[p](X) = 2.X + 1
[0] = 0
[fSNonEmpty] = 0
[s](X) = 2.X + 2
[DIV](X1,X2) = 2.X1
[MINUS](X1,X2) = 0
[P](X) = 0

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 div(0,s(Y:S)) -> 0
 div(s(X:S),s(Y:S)) -> s(div(minus(X:S,Y:S),s(Y:S)))
 minus(s(X:S),s(Y:S)) -> p(minus(X:S,Y:S))
 minus(X:S,0) -> X:S
 p(s(X:S)) -> X:S
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.