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


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


YES

Problem 1: 

(VAR X Y)
(RULES
activate(n__f(X)) -> f(X)
activate(X) -> X
f(X) -> if(X,c,n__f(true))
f(X) -> n__f(X)
if(false,X,Y) -> activate(Y)
if(true,X,Y) -> X
)

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is finite.