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


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


NO

Problem 1: 

(VAR x y z)
(RULES
between(x,y,z) -> true | up(x) -> y, down(z) -> y
down(s(x)) -> down(x)
down(x) -> x
up(x) -> up(s(x))
up(x) -> x
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 between(x,y,z) -> true | up(x) -> y, down(z) -> y
 down(s(x)) -> down(x)
 down(x) -> x
 up(x) -> up(s(x))
 up(x) -> x
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 DOWN(s(x)) -> DOWN(x)
 UP(x) -> UP(s(x))
-> QPairs:
 Empty
-> Rules:
 between(x,y,z) -> true | up(x) -> y, down(z) -> y
 down(s(x)) -> down(x)
 down(x) -> x
 up(x) -> up(s(x))
 up(x) -> x

Conditional Termination Problem 2:
-> Pairs:
 BETWEEN(x,y,z) -> DOWN(z) | up(x) -> y
 BETWEEN(x,y,z) -> UP(x)
-> QPairs:
 DOWN(s(x)) -> DOWN(x)
 UP(x) -> UP(s(x))
-> Rules:
 between(x,y,z) -> true | up(x) -> y, down(z) -> y
 down(s(x)) -> down(x)
 down(x) -> x
 up(x) -> up(s(x))
 up(x) -> x

Problem 1: 

SCC Processor:
-> Pairs:
 DOWN(s(x)) -> DOWN(x)
 UP(x) -> UP(s(x))
-> QPairs:
 Empty
-> Rules:
 between(x,y,z) -> true | up(x) -> y, down(z) -> y
 down(s(x)) -> down(x)
 down(x) -> x
 up(x) -> up(s(x))
 up(x) -> x
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 UP(x) -> UP(s(x))
->->-> Rules:
 between(x,y,z) -> true | up(x) -> y, down(z) -> y
 down(s(x)) -> down(x)
 down(x) -> x
 up(x) -> up(s(x))
 up(x) -> x
->->Cycle:
->->-> Pairs:
 DOWN(s(x)) -> DOWN(x)
->->-> Rules:
 between(x,y,z) -> true | up(x) -> y, down(z) -> y
 down(s(x)) -> down(x)
 down(x) -> x
 up(x) -> up(s(x))
 up(x) -> x

Problem 1: 

Conditional Narrowing Processor:
-> Pairs:
 UP(x) -> UP(s(x))
-> QPairs:
 Empty
-> Rules:
 between(x,y,z) -> true | up(x) -> y, down(z) -> y
 down(s(x)) -> down(x)
 down(x) -> x
 up(x) -> up(s(x))
 up(x) -> x
->Narrowed Pairs:
->->Original Pair:
 UP(x3) -> UP(s(x3))
->-> Narrowed pairs:
 Empty

Problem 1: 

Infinite Processor:
-> Pairs:
 UP(x) -> UP(s(x))
-> QPairs:
 Empty
-> Rules:
 between(x,y,z) -> true | up(x) -> y, down(z) -> y
 down(s(x)) -> down(x)
 down(x) -> x
 up(x) -> up(s(x))
 up(x) -> x
-> Pairs in cycle:
 UP(x) -> UP(s(x))

The problem is infinite.