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


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


NO

Problem 1: 

(VAR v_NonEmpty:S x:S y:S)
(RULES
pin(x:S) -> pout(f(y:S)) | pin(x:S) ->* pout(g(y:S))
pin(x:S) -> pout(g(x:S))
)

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

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 pin(x:S) -> pout(f(y:S)) | pin(x:S) ->* pout(g(y:S))
 pin(x:S) -> pout(g(x:S))

Conditional Termination Problem 2:
-> Pairs:
 PIN(x:S) -> PIN(x:S)
-> QPairs:
 Empty
-> Rules:
 pin(x:S) -> pout(f(y:S)) | pin(x:S) ->* pout(g(y:S))
 pin(x:S) -> pout(g(x:S))

Problem 1: 

SCC Processor:
-> Pairs:
 PIN(x:S) -> PIN(x:S)
-> QPairs:
 Empty
-> Rules:
 pin(x:S) -> pout(f(y:S)) | pin(x:S) ->* pout(g(y:S))
 pin(x:S) -> pout(g(x:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 PIN(x:S) -> PIN(x:S)
-> QPairs:
 Empty
->->-> Rules:
 pin(x:S) -> pout(f(y:S)) | pin(x:S) ->* pout(g(y:S))
 pin(x:S) -> pout(g(x:S))

Problem 1: 

Infinite Processor:
-> Pairs:
 PIN(x:S) -> PIN(x:S)
-> QPairs:
 Empty
-> Rules:
 pin(x:S) -> pout(f(y:S)) | pin(x:S) ->* pout(g(y:S))
 pin(x:S) -> pout(g(x:S))
-> Pairs in cycle:
 PIN(x:S) -> PIN(x:S)

The problem is infinite.