/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)
(RULES
U11(tt) -> U12(tt)
U12(tt) -> tt
__(__(X,Y),Z) -> __(X,__(Y,Z))
__(nil,X) -> X
__(X,nil) -> X
isNePal(__(I,__(P,I))) -> U11(tt)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 U11#(tt) -> U12#(tt)
 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
 __#(__(X,Y),Z) -> __#(Y,Z)
 ISNEPAL(__(I,__(P,I))) -> U11#(tt)
-> Rules:
 U11(tt) -> U12(tt)
 U12(tt) -> tt
 __(__(X,Y),Z) -> __(X,__(Y,Z))
 __(nil,X) -> X
 __(X,nil) -> X
 isNePal(__(I,__(P,I))) -> U11(tt)

Problem 1: 

SCC Processor:
-> Pairs:
 U11#(tt) -> U12#(tt)
 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
 __#(__(X,Y),Z) -> __#(Y,Z)
 ISNEPAL(__(I,__(P,I))) -> U11#(tt)
-> Rules:
 U11(tt) -> U12(tt)
 U12(tt) -> tt
 __(__(X,Y),Z) -> __(X,__(Y,Z))
 __(nil,X) -> X
 __(X,nil) -> X
 isNePal(__(I,__(P,I))) -> U11(tt)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
 __#(__(X,Y),Z) -> __#(Y,Z)
->->-> Rules:
 U11(tt) -> U12(tt)
 U12(tt) -> tt
 __(__(X,Y),Z) -> __(X,__(Y,Z))
 __(nil,X) -> X
 __(X,nil) -> X
 isNePal(__(I,__(P,I))) -> U11(tt)

Problem 1: 

Subterm Processor:
-> Pairs:
 __#(__(X,Y),Z) -> __#(X,__(Y,Z))
 __#(__(X,Y),Z) -> __#(Y,Z)
-> Rules:
 U11(tt) -> U12(tt)
 U12(tt) -> tt
 __(__(X,Y),Z) -> __(X,__(Y,Z))
 __(nil,X) -> X
 __(X,nil) -> X
 isNePal(__(I,__(P,I))) -> U11(tt)
->Projection:
 pi(__#) = 1

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 U11(tt) -> U12(tt)
 U12(tt) -> tt
 __(__(X,Y),Z) -> __(X,__(Y,Z))
 __(nil,X) -> X
 __(X,nil) -> X
 isNePal(__(I,__(P,I))) -> U11(tt)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.