/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Problem 1: 

(VAR x1)
(RULES
a(c(x1)) -> c(a(x1))
a(l(x1)) -> l(a(x1))
c(a(r(x1))) -> r(a(x1))
l(r(a(x1))) -> a(l(c(c(r(x1)))))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 A(c(x1)) -> A(x1)
 A(c(x1)) -> C(a(x1))
 A(l(x1)) -> A(x1)
 A(l(x1)) -> L(a(x1))
 C(a(r(x1))) -> A(x1)
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))

Problem 1: 

SCC Processor:
-> Pairs:
 A(c(x1)) -> A(x1)
 A(c(x1)) -> C(a(x1))
 A(l(x1)) -> A(x1)
 A(l(x1)) -> L(a(x1))
 C(a(r(x1))) -> A(x1)
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(c(x1)) -> A(x1)
 A(c(x1)) -> C(a(x1))
 A(l(x1)) -> A(x1)
 A(l(x1)) -> L(a(x1))
 C(a(r(x1))) -> A(x1)
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
->->-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 A(c(x1)) -> A(x1)
 A(c(x1)) -> C(a(x1))
 A(l(x1)) -> A(x1)
 A(l(x1)) -> L(a(x1))
 C(a(r(x1))) -> A(x1)
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
-> Usable rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a](X) = 2.X + 1
[c](X) = X
[l](X) = 2.X + 1
[r](X) = 2.X + 1
[A](X) = 2.X + 2
[C](X) = X
[L](X) = 2.X + 2

Problem 1: 

SCC Processor:
-> Pairs:
 A(c(x1)) -> A(x1)
 A(l(x1)) -> A(x1)
 A(l(x1)) -> L(a(x1))
 C(a(r(x1))) -> A(x1)
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(c(x1)) -> A(x1)
 A(l(x1)) -> A(x1)
 A(l(x1)) -> L(a(x1))
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
->->-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 A(c(x1)) -> A(x1)
 A(l(x1)) -> A(x1)
 A(l(x1)) -> L(a(x1))
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
-> Usable rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a](X) = 2.X + 1
[c](X) = X
[l](X) = 2.X + 1
[r](X) = 2.X + 1
[A](X) = 2.X + 2
[L](X) = 2.X + 2

Problem 1: 

SCC Processor:
-> Pairs:
 A(c(x1)) -> A(x1)
 A(l(x1)) -> L(a(x1))
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(l(x1)) -> L(a(x1))
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
->->-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
->->Cycle:
->->-> Pairs:
 A(c(x1)) -> A(x1)
->->-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 A(l(x1)) -> L(a(x1))
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
-> Usable rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a](X) = 2.X + 1/2
[c](X) = 1/2.X
[l](X) = 2.X + 1
[r](X) = 2
[A](X) = X + 1/2
[L](X) = X + 1/2

Problem 1.1: 

SCC Processor:
-> Pairs:
 L(r(a(x1))) -> A(l(c(c(r(x1)))))
-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 A(c(x1)) -> A(x1)
-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
->Projection:
 pi(A) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 a(c(x1)) -> c(a(x1))
 a(l(x1)) -> l(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(x1))) -> a(l(c(c(r(x1)))))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.