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


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


NO

Problem 1: 

(VAR v_NonEmpty:S x:S y:S)
(RULES
b -> f(a)
f(x:S) -> y:S | g(x:S) ->* c(y:S)
g(a) -> c(b)
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 b -> f(a)
 f(x:S) -> y:S | g(x:S) ->* c(y:S)
 g(a) -> c(b)
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 B -> F(a)
 G(a) -> B
-> QPairs:
 Empty
-> Rules:
 b -> f(a)
 f(x:S) -> y:S | g(x:S) ->* c(y:S)
 g(a) -> c(b)

Conditional Termination Problem 2:
-> Pairs:
 F(x:S) -> G(x:S)
-> QPairs:
 B -> F(a)
 G(a) -> B
-> Rules:
 b -> f(a)
 f(x:S) -> y:S | g(x:S) ->* c(y:S)
 g(a) -> c(b)

Problem 1: 

SCC Processor:
-> Pairs:
 F(x:S) -> G(x:S)
-> QPairs:
 B -> F(a)
 G(a) -> B
-> Rules:
 b -> f(a)
 f(x:S) -> y:S | g(x:S) ->* c(y:S)
 g(a) -> c(b)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(x:S) -> G(x:S)
-> QPairs:
 B -> F(a)
 G(a) -> B
->->-> Rules:
 b -> f(a)
 f(x:S) -> y:S | g(x:S) ->* c(y:S)
 g(a) -> c(b)

Problem 1: 

Conditional Narrowing using Q Processor:
-> Pairs:
 F(x:S) -> G(x:S)
-> QPairs:
 B -> F(a)
 G(a) -> B
-> Rules:
 b -> f(a)
 f(x:S) -> y:S | g(x:S) ->* c(y:S)
 g(a) -> c(b)
->Narrowed Pairs:
->->Original Pair:
 F(x:S) -> G(x:S)
->-> Narrowed pairs:
 F(a) -> B

Problem 1: 

SCC Processor:
-> Pairs:
 F(a) -> B
-> QPairs:
 B -> F(a)
 G(a) -> B
-> Rules:
 b -> f(a)
 f(x:S) -> y:S | g(x:S) ->* c(y:S)
 g(a) -> c(b)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(a) -> B
-> QPairs:
 B -> F(a)
->->-> Rules:
 b -> f(a)
 f(x:S) -> y:S | g(x:S) ->* c(y:S)
 g(a) -> c(b)

Problem 1: 

Conditional Narrowing using Q Processor:
-> Pairs:
 F(a) -> B
-> QPairs:
 B -> F(a)
-> Rules:
 b -> f(a)
 f(x:S) -> y:S | g(x:S) ->* c(y:S)
 g(a) -> c(b)
->Narrowed Pairs:
->->Original Pair:
 F(a) -> B
->-> Narrowed pairs:
 F(a) -> F(a)

Problem 1: 

Infinite Processor:
-> Pairs:
 F(a) -> F(a)
-> QPairs:
 B -> F(a)
-> Rules:
 b -> f(a)
 f(x:S) -> y:S | g(x:S) ->* c(y:S)
 g(a) -> c(b)
-> Pairs in cycle:
 F(a) -> F(a)

The problem is infinite.