/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
0 -> n__0
activate(n__0) -> 0
activate(n__s(X:S)) -> s(X:S)
activate(X:S) -> X:S
diff(X:S,Y:S) -> if(leq(X:S,Y:S),n__0,n__s(diff(p(X:S),Y:S)))
if(ffalse,X:S,Y:S) -> activate(Y:S)
if(ttrue,X:S,Y:S) -> activate(X:S)
leq(0,Y:S) -> ttrue
leq(s(X:S),0) -> ffalse
leq(s(X:S),s(Y:S)) -> leq(X:S,Y:S)
p(0) -> 0
p(s(X:S)) -> X:S
s(X:S) -> n__s(X:S)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__0) -> 0#
 ACTIVATE(n__s(X:S)) -> S(X:S)
 DIFF(X:S,Y:S) -> DIFF(p(X:S),Y:S)
 DIFF(X:S,Y:S) -> IF(leq(X:S,Y:S),n__0,n__s(diff(p(X:S),Y:S)))
 DIFF(X:S,Y:S) -> LEQ(X:S,Y:S)
 DIFF(X:S,Y:S) -> P(X:S)
 IF(ffalse,X:S,Y:S) -> ACTIVATE(Y:S)
 IF(ttrue,X:S,Y:S) -> ACTIVATE(X:S)
 LEQ(s(X:S),s(Y:S)) -> LEQ(X:S,Y:S)
-> Rules:
 0 -> n__0
 activate(n__0) -> 0
 activate(n__s(X:S)) -> s(X:S)
 activate(X:S) -> X:S
 diff(X:S,Y:S) -> if(leq(X:S,Y:S),n__0,n__s(diff(p(X:S),Y:S)))
 if(ffalse,X:S,Y:S) -> activate(Y:S)
 if(ttrue,X:S,Y:S) -> activate(X:S)
 leq(0,Y:S) -> ttrue
 leq(s(X:S),0) -> ffalse
 leq(s(X:S),s(Y:S)) -> leq(X:S,Y:S)
 p(0) -> 0
 p(s(X:S)) -> X:S
 s(X:S) -> n__s(X:S)

Problem 1: 

Infinite Processor:
-> Pairs:
 ACTIVATE(n__0) -> 0#
 ACTIVATE(n__s(X:S)) -> S(X:S)
 DIFF(X:S,Y:S) -> DIFF(p(X:S),Y:S)
 DIFF(X:S,Y:S) -> IF(leq(X:S,Y:S),n__0,n__s(diff(p(X:S),Y:S)))
 DIFF(X:S,Y:S) -> LEQ(X:S,Y:S)
 DIFF(X:S,Y:S) -> P(X:S)
 IF(ffalse,X:S,Y:S) -> ACTIVATE(Y:S)
 IF(ttrue,X:S,Y:S) -> ACTIVATE(X:S)
 LEQ(s(X:S),s(Y:S)) -> LEQ(X:S,Y:S)
-> Rules:
 0 -> n__0
 activate(n__0) -> 0
 activate(n__s(X:S)) -> s(X:S)
 activate(X:S) -> X:S
 diff(X:S,Y:S) -> if(leq(X:S,Y:S),n__0,n__s(diff(p(X:S),Y:S)))
 if(ffalse,X:S,Y:S) -> activate(Y:S)
 if(ttrue,X:S,Y:S) -> activate(X:S)
 leq(0,Y:S) -> ttrue
 leq(s(X:S),0) -> ffalse
 leq(s(X:S),s(Y:S)) -> leq(X:S,Y:S)
 p(0) -> 0
 p(s(X:S)) -> X:S
 s(X:S) -> n__s(X:S)
-> Pairs in cycle:
 DIFF(X:S,Y:S) -> DIFF(p(X:S),Y:S)

The problem is infinite.