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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

Subterm Processor:
-> Pairs:
 B(a(a(x1))) -> B(x1)
-> Rules:
 a(a(b(x1))) -> b(a(x1))
 a(c(x1)) -> c(b(x1))
 b(a(a(x1))) -> a(a(a(b(x1))))
->Projection:
 pi(B) = 1

Problem 1: 

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

The problem is finite.