/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 x0:S x1:S x2:S)
(RULES
p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(a(x1:S)),x2:S)
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
-> Rules:
 p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))

Problem 1: 

SCC Processor:
-> Pairs:
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(a(x1:S)),x2:S)
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
-> Rules:
 p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(a(x1:S)),x2:S)
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
->->-> Rules:
 p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(a(x1:S)),x2:S)
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
-> Rules:
 p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
-> Usable rules:
 p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[p](X1,X2) = 2.X1 + 2.X2 + 2
[a](X) = 2
[b](X) = 2
[P](X1,X2) = X1 + 2.X2

Problem 1: 

SCC Processor:
-> Pairs:
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
-> Rules:
 p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
->->-> Rules:
 p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 P(a(x0:S),p(a(b(x1:S)),x2:S)) -> P(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
-> Rules:
 p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
-> Usable rules:
 p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 2
->Bound:
 1
->Interpretation:
 
[p](X1,X2) = [0 1;0 0].X1 + [1 1;1 1].X2
[a](X) = [0 0;1 0].X + [0;1]
[b](X) = [1 0;1 0].X + [1;0]
[P](X1,X2) = [1 0;1 1].X1 + [1 0;1 1].X2

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 p(a(x0:S),p(a(b(x1:S)),x2:S)) -> p(a(b(a(x2:S))),p(a(a(x1:S)),x2:S))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.