Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487070077
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
n183.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
1.04785 seconds
cpu usage
5.37128
user time
4.26438
system time
1.1069
max virtual memory
1957856.0
max residence set size
73336.0
stage attributes
key
value
starexec-result
YES
output
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: [0] = 0, [and](x0, x1) = 4x0 + 4x1, [mark](x0) = x0, [plus](x0, x1) = x0 + x1, [tt] = 6, [s](x0) = x0, [active](x0) = x0 orientation: active(and(tt(),X)) = 4X + 24 >= X = mark(X) active(plus(N,0())) = N >= N = mark(N) active(plus(N,s(M))) = M + N >= M + N = mark(s(plus(N,M))) mark(and(X1,X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = active(and(mark(X1),X2)) mark(tt()) = 6 >= 6 = active(tt()) mark(plus(X1,X2)) = X1 + X2 >= X1 + X2 = active(plus(mark(X1),mark(X2))) mark(0()) = 0 >= 0 = active(0()) mark(s(X)) = X >= X = active(s(mark(X))) and(mark(X1),X2) = 4X1 + 4X2 >= 4X1 + 4X2 = and(X1,X2) and(X1,mark(X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = and(X1,X2) and(active(X1),X2) = 4X1 + 4X2 >= 4X1 + 4X2 = and(X1,X2) and(X1,active(X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = and(X1,X2) plus(mark(X1),X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) plus(X1,mark(X2)) = X1 + X2 >= X1 + X2 = plus(X1,X2) plus(active(X1),X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) plus(X1,active(X2)) = X1 + X2 >= X1 + X2 = plus(X1,X2) s(mark(X)) = X >= X = s(X) s(active(X)) = X >= X = s(X) problem: 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) Matrix Interpretation Processor: dim=1 interpretation: [0] = 0, [and](x0, x1) = x0 + 2x1,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard