/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)
(RULES
f(f(x:S,a),y:S) -> f(f(a,y:S),f(a,x:S))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(f(x:S,a),y:S) -> F(f(a,y:S),f(a,x:S))
-> Rules:
 f(f(x:S,a),y:S) -> f(f(a,y:S),f(a,x:S))

Problem 1: 

SCC Processor:
-> Pairs:
 F(f(x:S,a),y:S) -> F(f(a,y:S),f(a,x:S))
-> Rules:
 f(f(x:S,a),y:S) -> f(f(a,y:S),f(a,x:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(f(x:S,a),y:S) -> F(f(a,y:S),f(a,x:S))
->->-> Rules:
 f(f(x:S,a),y:S) -> f(f(a,y:S),f(a,x:S))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 F(f(x:S,a),y:S) -> F(f(a,y:S),f(a,x:S))
-> Rules:
 f(f(x:S,a),y:S) -> f(f(a,y:S),f(a,x:S))
-> Usable rules:
 f(f(x:S,a),y:S) -> f(f(a,y:S),f(a,x:S))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 2
->Bound:
 1
->Interpretation:
 
[f](X1,X2) = [0 1;0 0].X2
[a] = [0;1]
[F](X1,X2) = [1 1;1 1].X1 + [0 1;0 1].X2

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f(f(x:S,a),y:S) -> f(f(a,y:S),f(a,x:S))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.