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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is finite.