TRS Stand 20472 pair #381716754

details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	1.28177881241 seconds
cpu usage	3.745332242
max memory	3.45145344E8

stage attributes

key	value
output-size	19719
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 active(and(tt(),X)) -> mark(X)
 active(plus(N,0())) -> mark(N)
 active(plus(N,s(M))) -> mark(s(plus(N,M)))
 mark(and(X1,X2)) -> active(and(mark(X1),X2))
 mark(tt()) -> active(tt())
 mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2)))
 mark(0()) -> active(0())
 mark(s(X)) -> active(s(mark(X)))
 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)
 plus(mark(X1),X2) -> plus(X1,X2)
 plus(X1,mark(X2)) -> plus(X1,X2)
 plus(active(X1),X2) -> plus(X1,X2)
 plus(X1,active(X2)) -> plus(X1,X2)
 s(mark(X)) -> s(X)
 s(active(X)) -> s(X)

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [s](x0) = x0 + 5,
   
   [plus](x0, x1) = x0 + x1 + 3,
   
   [0] = 6,
   
   [mark](x0) = x0,
   
   [active](x0) = x0,
   
   [and](x0, x1) = x0 + 4x1,
   
   [tt] = 0
  orientation:
   active(and(tt(),X)) = 4X >= X = mark(X)
   
   active(plus(N,0())) = N + 9 >= N = mark(N)
   
   active(plus(N,s(M))) = M + N + 8 >= M + N + 8 = mark(s(plus(N,M)))
   
   mark(and(X1,X2)) = X1 + 4X2 >= X1 + 4X2 = active(and(mark(X1),X2))
   
   mark(tt()) = 0 >= 0 = active(tt())
   
   mark(plus(X1,X2)) = X1 + X2 + 3 >= X1 + X2 + 3 = active(plus(mark(X1),mark(X2)))
   
   mark(0()) = 6 >= 6 = active(0())
   
   mark(s(X)) = X + 5 >= X + 5 = active(s(mark(X)))
   
   and(mark(X1),X2) = X1 + 4X2 >= X1 + 4X2 = and(X1,X2)
   
   and(X1,mark(X2)) = X1 + 4X2 >= X1 + 4X2 = and(X1,X2)
   
   and(active(X1),X2) = X1 + 4X2 >= X1 + 4X2 = and(X1,X2)
   
   and(X1,active(X2)) = X1 + 4X2 >= X1 + 4X2 = and(X1,X2)
   
   plus(mark(X1),X2) = X1 + X2 + 3 >= X1 + X2 + 3 = plus(X1,X2)
   
   plus(X1,mark(X2)) = X1 + X2 + 3 >= X1 + X2 + 3 = plus(X1,X2)
   
   plus(active(X1),X2) = X1 + X2 + 3 >= X1 + X2 + 3 = plus(X1,X2)
   
   plus(X1,active(X2)) = X1 + X2 + 3 >= X1 + X2 + 3 = plus(X1,X2)
   
   s(mark(X)) = X + 5 >= X + 5 = s(X)
   
   s(active(X)) = X + 5 >= X + 5 = s(X)
  problem:
   active(and(tt(),X)) -> mark(X)
   active(plus(N,s(M))) -> mark(s(plus(N,M)))
   mark(and(X1,X2)) -> active(and(mark(X1),X2))
   mark(tt()) -> active(tt())
   mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2)))
   mark(0()) -> active(0())
   mark(s(X)) -> active(s(mark(X)))
   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)
   plus(mark(X1),X2) -> plus(X1,X2)
   plus(X1,mark(X2)) -> plus(X1,X2)
   plus(active(X1),X2) -> plus(X1,X2)
   plus(X1,active(X2)) -> plus(X1,X2)
   s(mark(X)) -> s(X)
   s(active(X)) -> s(X)
  Matrix Interpretation Processor: dim=3

popout

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

job log

popout

actions all output return to TRS Stand 20472