/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 z)
(RULES
++(++(x,y),z) -> ++(x,++(y,z))
++(.(x,y),z) -> .(x,++(y,z))
++(nil,y) -> y
++(x,nil) -> x
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ++#(++(x,y),z) -> ++#(x,++(y,z))
 ++#(++(x,y),z) -> ++#(y,z)
 ++#(.(x,y),z) -> ++#(y,z)
-> Rules:
 ++(++(x,y),z) -> ++(x,++(y,z))
 ++(.(x,y),z) -> .(x,++(y,z))
 ++(nil,y) -> y
 ++(x,nil) -> x

Problem 1: 

SCC Processor:
-> Pairs:
 ++#(++(x,y),z) -> ++#(x,++(y,z))
 ++#(++(x,y),z) -> ++#(y,z)
 ++#(.(x,y),z) -> ++#(y,z)
-> Rules:
 ++(++(x,y),z) -> ++(x,++(y,z))
 ++(.(x,y),z) -> .(x,++(y,z))
 ++(nil,y) -> y
 ++(x,nil) -> x
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ++#(++(x,y),z) -> ++#(x,++(y,z))
 ++#(++(x,y),z) -> ++#(y,z)
 ++#(.(x,y),z) -> ++#(y,z)
->->-> Rules:
 ++(++(x,y),z) -> ++(x,++(y,z))
 ++(.(x,y),z) -> .(x,++(y,z))
 ++(nil,y) -> y
 ++(x,nil) -> x

Problem 1: 

Subterm Processor:
-> Pairs:
 ++#(++(x,y),z) -> ++#(x,++(y,z))
 ++#(++(x,y),z) -> ++#(y,z)
 ++#(.(x,y),z) -> ++#(y,z)
-> Rules:
 ++(++(x,y),z) -> ++(x,++(y,z))
 ++(.(x,y),z) -> .(x,++(y,z))
 ++(nil,y) -> y
 ++(x,nil) -> x
->Projection:
 pi(++#) = 1

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 ++(++(x,y),z) -> ++(x,++(y,z))
 ++(.(x,y),z) -> .(x,++(y,z))
 ++(nil,y) -> y
 ++(x,nil) -> x
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.