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


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


YES

Problem 1: 

(VAR u x y z)
(RULES
-(s(x),s(y)) -> -(x,y)
-(x,0) -> x
<=(0,y) -> true
<=(s(x),0) -> false
<=(s(x),s(y)) -> <=(x,y)
f(0,y,0,u) -> true
f(0,y,s(z),u) -> false
f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
if(false,x,y) -> y
if(true,x,y) -> x
perfectp(0) -> false
perfectp(s(x)) -> f(x,s(0),s(x),s(x))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 -#(s(x),s(y)) -> -#(x,y)
 <=#(s(x),s(y)) -> <=#(x,y)
 F(s(x),0,z,u) -> -#(z,s(x))
 F(s(x),0,z,u) -> F(x,u,-(z,s(x)),u)
 F(s(x),s(y),z,u) -> -#(y,x)
 F(s(x),s(y),z,u) -> <=#(x,y)
 F(s(x),s(y),z,u) -> F(s(x),-(y,x),z,u)
 F(s(x),s(y),z,u) -> F(x,u,z,u)
 F(s(x),s(y),z,u) -> IF(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 PERFECTP(s(x)) -> F(x,s(0),s(x),s(x))
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))

Problem 1: 

SCC Processor:
-> Pairs:
 -#(s(x),s(y)) -> -#(x,y)
 <=#(s(x),s(y)) -> <=#(x,y)
 F(s(x),0,z,u) -> -#(z,s(x))
 F(s(x),0,z,u) -> F(x,u,-(z,s(x)),u)
 F(s(x),s(y),z,u) -> -#(y,x)
 F(s(x),s(y),z,u) -> <=#(x,y)
 F(s(x),s(y),z,u) -> F(s(x),-(y,x),z,u)
 F(s(x),s(y),z,u) -> F(x,u,z,u)
 F(s(x),s(y),z,u) -> IF(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 PERFECTP(s(x)) -> F(x,s(0),s(x),s(x))
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 <=#(s(x),s(y)) -> <=#(x,y)
->->-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
->->Cycle:
->->-> Pairs:
 -#(s(x),s(y)) -> -#(x,y)
->->-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
->->Cycle:
->->-> Pairs:
 F(s(x),0,z,u) -> F(x,u,-(z,s(x)),u)
 F(s(x),s(y),z,u) -> F(s(x),-(y,x),z,u)
 F(s(x),s(y),z,u) -> F(x,u,z,u)
->->-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))


The problem is decomposed in 3 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 <=#(s(x),s(y)) -> <=#(x,y)
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
->Projection:
 pi(<=#) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 -#(s(x),s(y)) -> -#(x,y)
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
->Projection:
 pi(-#) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.3: 

Subterm Processor:
-> Pairs:
 F(s(x),0,z,u) -> F(x,u,-(z,s(x)),u)
 F(s(x),s(y),z,u) -> F(s(x),-(y,x),z,u)
 F(s(x),s(y),z,u) -> F(x,u,z,u)
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
->Projection:
 pi(F) = 1

Problem 1.3: 

SCC Processor:
-> Pairs:
 F(s(x),s(y),z,u) -> F(s(x),-(y,x),z,u)
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(s(x),s(y),z,u) -> F(s(x),-(y,x),z,u)
->->-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))

Problem 1.3: 

Reduction Pairs Processor:
-> Pairs:
 F(s(x),s(y),z,u) -> F(s(x),-(y,x),z,u)
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
-> Usable rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[-](X1,X2) = X1
[0] = 0
[s](X) = X + 2
[F](X1,X2,X3,X4) = 2.X2

Problem 1.3: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 -(s(x),s(y)) -> -(x,y)
 -(x,0) -> x
 <=(0,y) -> true
 <=(s(x),0) -> false
 <=(s(x),s(y)) -> <=(x,y)
 f(0,y,0,u) -> true
 f(0,y,s(z),u) -> false
 f(s(x),0,z,u) -> f(x,u,-(z,s(x)),u)
 f(s(x),s(y),z,u) -> if(<=(x,y),f(s(x),-(y,x),z,u),f(x,u,z,u))
 if(false,x,y) -> y
 if(true,x,y) -> x
 perfectp(0) -> false
 perfectp(s(x)) -> f(x,s(0),s(x),s(x))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.