/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
gcd(0,s(y:S)) -> s(y:S)
gcd(s(x:S),0) -> s(x:S)
gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
gcd(x:S,x:S) -> x:S
less(0,s(x:S)) -> ttrue
less(s(x:S),s(y:S)) -> less(x:S,y:S)
less(x:S,0) -> ffalse
minus(0,s(y:S)) -> 0
minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
minus(x:S,0) -> x:S
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 GCD(s(x:S),s(y:S)) -> GCD(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 GCD(s(x:S),s(y:S)) -> GCD(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 GCD(s(x:S),s(y:S)) -> MINUS(x:S,y:S) | less(y:S,x:S) ->* ttrue
 GCD(s(x:S),s(y:S)) -> MINUS(y:S,x:S) | less(x:S,y:S) ->* ttrue
 LESS(s(x:S),s(y:S)) -> LESS(x:S,y:S)
 MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S)
-> QPairs:
 Empty
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S

Conditional Termination Problem 2:
-> Pairs:
 GCD(s(x:S),s(y:S)) -> LESS(x:S,y:S)
 GCD(s(x:S),s(y:S)) -> LESS(y:S,x:S)
-> QPairs:
 LESS(s(x:S),s(y:S)) -> LESS(x:S,y:S)
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S


The problem is decomposed in 2 subproblems.

Problem 1.1: 

SCC Processor:
-> Pairs:
 GCD(s(x:S),s(y:S)) -> GCD(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 GCD(s(x:S),s(y:S)) -> GCD(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 GCD(s(x:S),s(y:S)) -> MINUS(x:S,y:S) | less(y:S,x:S) ->* ttrue
 GCD(s(x:S),s(y:S)) -> MINUS(y:S,x:S) | less(x:S,y:S) ->* ttrue
 LESS(s(x:S),s(y:S)) -> LESS(x:S,y:S)
 MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S)
-> QPairs:
 Empty
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S)
-> QPairs:
 Empty
->->-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->->Cycle:
->->-> Pairs:
 LESS(s(x:S),s(y:S)) -> LESS(x:S,y:S)
-> QPairs:
 Empty
->->-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->->Cycle:
->->-> Pairs:
 GCD(s(x:S),s(y:S)) -> GCD(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 GCD(s(x:S),s(y:S)) -> GCD(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
-> QPairs:
 Empty
->->-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S


The problem is decomposed in 3 subproblems.

Problem 1.1.1: 

Conditional Subterm Processor:
-> Pairs:
 MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S)
-> QPairs:
 Empty
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->Projection:
 pi(MINUS) = 1

Problem 1.1.1: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.1.2: 

Conditional Subterm Processor:
-> Pairs:
 LESS(s(x:S),s(y:S)) -> LESS(x:S,y:S)
-> QPairs:
 Empty
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->Projection:
 pi(LESS) = 1

Problem 1.1.2: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.1.3: 

Reduction Triple Processor:
-> Pairs:
 GCD(s(x:S),s(y:S)) -> GCD(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 GCD(s(x:S),s(y:S)) -> GCD(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
-> QPairs:
 Empty
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
-> Usable rules:
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[gcd](X1,X2) = 0
[less](X1,X2) = 2.X1 + 2
[minus](X1,X2) = X1 + 1
[0] = 0
[fSNonEmpty] = 0
[false] = 2
[s](X) = X + 2
[true] = 0
[GCD](X1,X2) = 2.X1 + 2.X2
[LESS](X1,X2) = 0
[MINUS](X1,X2) = 0

Problem 1.1.3: 

SCC Processor:
-> Pairs:
 GCD(s(x:S),s(y:S)) -> GCD(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
-> QPairs:
 Empty
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 GCD(s(x:S),s(y:S)) -> GCD(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
-> QPairs:
 Empty
->->-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S

Problem 1.1.3: 

Reduction Triple Processor:
-> Pairs:
 GCD(s(x:S),s(y:S)) -> GCD(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
-> QPairs:
 Empty
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
-> Usable rules:
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[gcd](X1,X2) = 0
[less](X1,X2) = 2
[minus](X1,X2) = X1 + 1
[0] = 1
[fSNonEmpty] = 0
[false] = 2
[s](X) = 2.X + 2
[true] = 1
[GCD](X1,X2) = 2.X2
[LESS](X1,X2) = 0
[MINUS](X1,X2) = 0

Problem 1.1.3: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

SCC Processor:
-> Pairs:
 GCD(s(x:S),s(y:S)) -> LESS(x:S,y:S)
 GCD(s(x:S),s(y:S)) -> LESS(y:S,x:S)
-> QPairs:
 LESS(s(x:S),s(y:S)) -> LESS(x:S,y:S)
-> Rules:
 gcd(0,s(y:S)) -> s(y:S)
 gcd(s(x:S),0) -> s(x:S)
 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue
 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue
 gcd(x:S,x:S) -> x:S
 less(0,s(x:S)) -> ttrue
 less(s(x:S),s(y:S)) -> less(x:S,y:S)
 less(x:S,0) -> ffalse
 minus(0,s(y:S)) -> 0
 minus(s(x:S),s(y:S)) -> minus(x:S,y:S)
 minus(x:S,0) -> x:S
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.