/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 x:S y:S z:S)
(RULES
sub(s(z:S),s(y:S)) -> x:S | sub(z:S,y:S) ->* x:S
sub(z:S,0) -> z:S
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 sub(s(z:S),s(y:S)) -> x:S | sub(z:S,y:S) ->* x:S
 sub(z:S,0) -> z:S
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 sub(s(z:S),s(y:S)) -> x:S | sub(z:S,y:S) ->* x:S
 sub(z:S,0) -> z:S

Conditional Termination Problem 2:
-> Pairs:
 SUB(s(z:S),s(y:S)) -> SUB(z:S,y:S)
-> QPairs:
 Empty
-> Rules:
 sub(s(z:S),s(y:S)) -> x:S | sub(z:S,y:S) ->* x:S
 sub(z:S,0) -> z:S


The problem is decomposed in 2 subproblems.

Problem 1.1: 

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

The problem is finite.

Problem 1.2: 

SCC Processor:
-> Pairs:
 SUB(s(z:S),s(y:S)) -> SUB(z:S,y:S)
-> QPairs:
 Empty
-> Rules:
 sub(s(z:S),s(y:S)) -> x:S | sub(z:S,y:S) ->* x:S
 sub(z:S,0) -> z:S
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 SUB(s(z:S),s(y:S)) -> SUB(z:S,y:S)
-> QPairs:
 Empty
->->-> Rules:
 sub(s(z:S),s(y:S)) -> x:S | sub(z:S,y:S) ->* x:S
 sub(z:S,0) -> z:S

Problem 1.2: 

Conditional Subterm Processor:
-> Pairs:
 SUB(s(z:S),s(y:S)) -> SUB(z:S,y:S)
-> QPairs:
 Empty
-> Rules:
 sub(s(z:S),s(y:S)) -> x:S | sub(z:S,y:S) ->* x:S
 sub(z:S,0) -> z:S
->Projection:
 pi(SUB) = 1

Problem 1.2: 

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

The problem is finite.