TRS Standard pair #516962119

details

property	value
status	complete
benchmark	PALINDROME_nosorts_iGM.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n070.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.990310907364 seconds
cpu usage	2.530300623
max memory	3.0900224E8

stage attributes

key	value
output-size	7323
starexec-result	YES

output

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


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


YES

Problem:
 active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
 active(__(X,nil())) -> mark(X)
 active(__(nil(),X)) -> mark(X)
 active(and(tt(),X)) -> mark(X)
 active(isNePal(__(I,__(P,I)))) -> mark(tt())
 mark(__(X1,X2)) -> active(__(mark(X1),mark(X2)))
 mark(nil()) -> active(nil())
 mark(and(X1,X2)) -> active(and(mark(X1),X2))
 mark(tt()) -> active(tt())
 mark(isNePal(X)) -> active(isNePal(mark(X)))
 __(mark(X1),X2) -> __(X1,X2)
 __(X1,mark(X2)) -> __(X1,X2)
 __(active(X1),X2) -> __(X1,X2)
 __(X1,active(X2)) -> __(X1,X2)
 and(mark(X1),X2) -> and(X1,X2)
 and(X1,mark(X2)) -> and(X1,X2)
 and(active(X1),X2) -> and(X1,X2)
 and(X1,active(X2)) -> and(X1,X2)
 isNePal(mark(X)) -> isNePal(X)
 isNePal(active(X)) -> isNePal(X)

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [tt] = 2,
   
   [active](x0) = x0,
   
   [nil] = 3,
   
   [and](x0, x1) = 4x0 + x1 + 4,
   
   [__](x0, x1) = x0 + x1 + 1,
   
   [isNePal](x0) = x0,
   
   [mark](x0) = x0
  orientation:
   active(__(__(X,Y),Z)) = X + Y + Z + 2 >= X + Y + Z + 2 = mark(__(X,__(Y,Z)))
   
   active(__(X,nil())) = X + 4 >= X = mark(X)
   
   active(__(nil(),X)) = X + 4 >= X = mark(X)
   
   active(and(tt(),X)) = X + 12 >= X = mark(X)
   
   active(isNePal(__(I,__(P,I)))) = 2I + P + 2 >= 2 = mark(tt())
   
   mark(__(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = active(__(mark(X1),mark(X2)))
   
   mark(nil()) = 3 >= 3 = active(nil())
   
   mark(and(X1,X2)) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = active(and(mark(X1),X2))
   
   mark(tt()) = 2 >= 2 = active(tt())
   
   mark(isNePal(X)) = X >= X = active(isNePal(mark(X)))
   
   __(mark(X1),X2) = X1 + X2 + 1 >= X1 + X2 + 1 = __(X1,X2)
   
   __(X1,mark(X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = __(X1,X2)
   
   __(active(X1),X2) = X1 + X2 + 1 >= X1 + X2 + 1 = __(X1,X2)
   
   __(X1,active(X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = __(X1,X2)
   
   and(mark(X1),X2) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = and(X1,X2)
   
   and(X1,mark(X2)) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = and(X1,X2)
   
   and(active(X1),X2) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = and(X1,X2)
   
   and(X1,active(X2)) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = and(X1,X2)
   
   isNePal(mark(X)) = X >= X = isNePal(X)
   
   isNePal(active(X)) = X >= X = isNePal(X)
  problem:
   active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
   active(isNePal(__(I,__(P,I)))) -> mark(tt())
   mark(__(X1,X2)) -> active(__(mark(X1),mark(X2)))
   mark(nil()) -> active(nil())
   mark(and(X1,X2)) -> active(and(mark(X1),X2))
   mark(tt()) -> active(tt())
   mark(isNePal(X)) -> active(isNePal(mark(X)))
   __(mark(X1),X2) -> __(X1,X2)
   __(X1,mark(X2)) -> __(X1,X2)
   __(active(X1),X2) -> __(X1,X2)
   __(X1,active(X2)) -> __(X1,X2)
   and(mark(X1),X2) -> and(X1,X2)

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to TRS Standard