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


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


YES

Problem 1: 

(VAR I P X Y Z)
(STRATEGY CONTEXTSENSITIVE
(__ 1 2)
(and 1)
(isNePal 1)
(nil)
(tt)
)
(RULES
__(__(X,Y),Z) -> __(X,__(Y,Z))
__(nil,X) -> X
__(X,nil) -> X
and(tt,X) -> X
isNePal(__(I,__(P,I))) -> tt
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
 __#(__(X,Y),Z) -> __#(Y,Z)
 AND(tt,X) -> X
-> Rules:
 __(__(X,Y),Z) -> __(X,__(Y,Z))
 __(nil,X) -> X
 __(X,nil) -> X
 and(tt,X) -> X
 isNePal(__(I,__(P,I))) -> tt
-> Unhiding Rules:
 Empty

Problem 1: 

SCC Processor:
-> Pairs:
 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
 __#(__(X,Y),Z) -> __#(Y,Z)
 AND(tt,X) -> X
-> Rules:
 __(__(X,Y),Z) -> __(X,__(Y,Z))
 __(nil,X) -> X
 __(X,nil) -> X
 and(tt,X) -> X
 isNePal(__(I,__(P,I))) -> tt
-> Unhiding rules:
 Empty
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
 __#(__(X,Y),Z) -> __#(Y,Z)
->->-> Rules:
 __(__(X,Y),Z) -> __(X,__(Y,Z))
 __(nil,X) -> X
 __(X,nil) -> X
 and(tt,X) -> X
 isNePal(__(I,__(P,I))) -> tt
->->-> Unhiding rules:
 Empty

Problem 1: 

SubNColl Processor:
-> Pairs:
 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
 __#(__(X,Y),Z) -> __#(Y,Z)
-> Rules:
 __(__(X,Y),Z) -> __(X,__(Y,Z))
 __(nil,X) -> X
 __(X,nil) -> X
 and(tt,X) -> X
 isNePal(__(I,__(P,I))) -> tt
-> Unhiding rules:
 Empty
->Projection:
 pi(__#) = 1

Problem 1: 

Basic Processor:
-> Pairs:
 Empty
-> Rules:
 __(__(X,Y),Z) -> __(X,__(Y,Z))
 __(nil,X) -> X
 __(X,nil) -> X
 and(tt,X) -> X
 isNePal(__(I,__(P,I))) -> tt
-> Unhiding rules:
 Empty
-> Result:
 Set P is empty

The problem is finite.