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


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


YES

Problem 1: 

(VAR X Y)
(STRATEGY CONTEXTSENSITIVE
(f 1)
(if 1 2)
(c)
(false)
(true)
)
(RULES
f(X) -> if(X,c,f(true))
if(false,X,Y) -> Y
if(true,X,Y) -> X
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(X) -> if(X,c,f(true))
 if(false,X,Y) -> Y
 if(true,X,Y) -> X
-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(X) -> IF(X,c,f(true))
 IF(false,X,Y) -> Y
-> Rules:
 f(X) -> if(X,c,f(true))
 if(false,X,Y) -> Y
 if(true,X,Y) -> X
-> Unhiding Rules:
 f(true) -> F(true)

Problem 1: 

SCC Processor:
-> Pairs:
 F(X) -> IF(X,c,f(true))
 IF(false,X,Y) -> Y
-> Rules:
 f(X) -> if(X,c,f(true))
 if(false,X,Y) -> Y
 if(true,X,Y) -> X
-> Unhiding rules:
 f(true) -> F(true)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(X) -> IF(X,c,f(true))
 IF(false,X,Y) -> Y
->->-> Rules:
 f(X) -> if(X,c,f(true))
 if(false,X,Y) -> Y
 if(true,X,Y) -> X
->->-> Unhiding rules:
 f(true) -> F(true)

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 F(X) -> IF(X,c,f(true))
 IF(false,X,Y) -> Y
-> Rules:
 f(X) -> if(X,c,f(true))
 if(false,X,Y) -> Y
 if(true,X,Y) -> X
-> Unhiding rules:
 f(true) -> F(true)
-> Usable rules:
 Empty
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[f](X) = 2.X
[c] = 0
[false] = 2
[true] = 0
[F](X) = 2.X
[IF](X1,X2,X3) = 2.X1 + 2.X3

Problem 1: 

SCC Processor:
-> Pairs:
 F(X) -> IF(X,c,f(true))
-> Rules:
 f(X) -> if(X,c,f(true))
 if(false,X,Y) -> Y
 if(true,X,Y) -> X
-> Unhiding rules:
 f(true) -> F(true)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.