/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)
(RULES
a -> x:S | b ->* g(x:S)
b -> g(d)
f(d) -> f(a)
)

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

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 F(d) -> A
 F(d) -> F(a)
-> QPairs:
 Empty
-> Rules:
 a -> x:S | b ->* g(x:S)
 b -> g(d)
 f(d) -> f(a)

Conditional Termination Problem 2:
-> Pairs:
 A -> B
-> QPairs:
 Empty
-> Rules:
 a -> x:S | b ->* g(x:S)
 b -> g(d)
 f(d) -> f(a)

Problem 1: 

SCC Processor:
-> Pairs:
 F(d) -> A
 F(d) -> F(a)
-> QPairs:
 Empty
-> Rules:
 a -> x:S | b ->* g(x:S)
 b -> g(d)
 f(d) -> f(a)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(d) -> F(a)
-> QPairs:
 Empty
->->-> Rules:
 a -> x:S | b ->* g(x:S)
 b -> g(d)
 f(d) -> f(a)

Problem 1: 

Conditional Narrowing Processor:
-> Pairs:
 F(d) -> F(a)
-> QPairs:
 Empty
-> Rules:
 a -> x:S | b ->* g(x:S)
 b -> g(d)
 f(d) -> f(a)
->Narrowed Pairs:
->->Original Pair:
 F(d) -> F(a)
->-> Narrowed pairs:
 F(d) -> F(d) | b ->* g(d)

Problem 1: 

SCC Processor:
-> Pairs:
 F(d) -> F(d) | b ->* g(d)
-> QPairs:
 Empty
-> Rules:
 a -> x:S | b ->* g(x:S)
 b -> g(d)
 f(d) -> f(a)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(d) -> F(d) | b ->* g(d)
-> QPairs:
 Empty
->->-> Rules:
 a -> x:S | b ->* g(x:S)
 b -> g(d)
 f(d) -> f(a)

Problem 1: 

Narrowing on Condition Processor:
-> Pairs:
 F(d) -> F(d) | b ->* g(d)
-> QPairs:
 Empty
-> Rules:
 a -> x:S | b ->* g(x:S)
 b -> g(d)
 f(d) -> f(a)
->Narrowed Pairs:
->->Original Pair:
 F(d) -> F(d) | b ->* g(d)
->-> Narrowed pairs:
 F(d) -> F(d) | g(d) ->* g(d)

Problem 1: 

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

The problem is infinite.