/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(b(b(a(x1)))) -> b(a(a(b(x1))))
b(a(b(x1))) -> a(b(b(b(x1))))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> A(b(x1))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 A(b(b(a(x1)))) -> B(x1)
 B(a(b(x1))) -> A(b(b(b(x1))))
 B(a(b(x1))) -> B(b(b(x1)))
 B(a(b(x1))) -> B(b(x1))
-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))

Problem 1: 

SCC Processor:
-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> A(b(x1))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 A(b(b(a(x1)))) -> B(x1)
 B(a(b(x1))) -> A(b(b(b(x1))))
 B(a(b(x1))) -> B(b(b(x1)))
 B(a(b(x1))) -> B(b(x1))
-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> A(b(x1))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 A(b(b(a(x1)))) -> B(x1)
 B(a(b(x1))) -> A(b(b(b(x1))))
 B(a(b(x1))) -> B(b(b(x1)))
 B(a(b(x1))) -> B(b(x1))
->->-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 A(b(b(a(x1)))) -> B(x1)
 B(a(b(x1))) -> A(b(b(b(x1))))
 B(a(b(x1))) -> B(b(b(x1)))
 B(a(b(x1))) -> B(b(x1))
-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 A(b(b(a(x1)))) -> B(x1)
 B(a(b(x1))) -> A(b(b(b(x1))))
 B(a(b(x1))) -> B(b(b(x1)))
 B(a(b(x1))) -> B(b(x1))
->->-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 B(a(b(x1))) -> A(b(b(b(x1))))
 B(a(b(x1))) -> B(b(b(x1)))
 B(a(b(x1))) -> B(b(x1))
-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 B(a(b(x1))) -> A(b(b(b(x1))))
 B(a(b(x1))) -> B(b(b(x1)))
 B(a(b(x1))) -> B(b(x1))
->->-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 B(a(b(x1))) -> A(b(b(b(x1))))
 B(a(b(x1))) -> B(b(x1))
-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 B(a(b(x1))) -> A(b(b(b(x1))))
 B(a(b(x1))) -> B(b(x1))
->->-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 B(a(b(x1))) -> A(b(b(b(x1))))
-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 B(a(b(x1))) -> A(b(b(b(x1))))
->->-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 A(b(b(a(x1)))) -> B(a(a(b(x1))))
 B(a(b(x1))) -> A(b(b(b(x1))))
-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))
-> Usable rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))
->Interpretation type:
 Simple mixed
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a](X) = 1/2.X.X + 1/2.X
[b](X) = 1
[A](X) = 2.X.X + 2.X + 1
[B](X) = X.X + 2.X + 2

Problem 1: 

SCC Processor:
-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
 B(a(b(x1))) -> A(b(b(b(x1))))
-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(b(b(a(x1)))) -> A(a(b(x1)))
->->-> Rules:
 a(b(b(a(x1)))) -> b(a(a(b(x1))))
 b(a(b(x1))) -> a(b(b(b(x1))))

Problem 1: 

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

Problem 1: 

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

The problem is finite.