Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516962198
details
property
value
status
complete
benchmark
MYNAT_nosorts_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n119.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
0.617213010788 seconds
cpu usage
0.594790463
max memory
1.81248E7
stage attributes
key
value
output-size
9373
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(and(tt(),X)) -> mark(X) 2: active(plus(N,0())) -> mark(N) 3: active(plus(N,s(M))) -> mark(s(plus(N,M))) 4: active(x(N,0())) -> mark(0()) 5: active(x(N,s(M))) -> mark(plus(x(N,M),N)) 6: active(and(X1,X2)) -> and(active(X1),X2) 7: active(plus(X1,X2)) -> plus(active(X1),X2) 8: active(plus(X1,X2)) -> plus(X1,active(X2)) 9: active(s(X)) -> s(active(X)) 10: active(x(X1,X2)) -> x(active(X1),X2) 11: active(x(X1,X2)) -> x(X1,active(X2)) 12: and(mark(X1),X2) -> mark(and(X1,X2)) 13: plus(mark(X1),X2) -> mark(plus(X1,X2)) 14: plus(X1,mark(X2)) -> mark(plus(X1,X2)) 15: s(mark(X)) -> mark(s(X)) 16: x(mark(X1),X2) -> mark(x(X1,X2)) 17: x(X1,mark(X2)) -> mark(x(X1,X2)) 18: proper(and(X1,X2)) -> and(proper(X1),proper(X2)) 19: proper(tt()) -> ok(tt()) 20: proper(plus(X1,X2)) -> plus(proper(X1),proper(X2)) 21: proper(0()) -> ok(0()) 22: proper(s(X)) -> s(proper(X)) 23: proper(x(X1,X2)) -> x(proper(X1),proper(X2)) 24: and(ok(X1),ok(X2)) -> ok(and(X1,X2)) 25: plus(ok(X1),ok(X2)) -> ok(plus(X1,X2)) 26: s(ok(X)) -> ok(s(X)) 27: x(ok(X1),ok(X2)) -> ok(x(X1,X2)) 28: top(mark(X)) -> top(proper(X)) 29: top(ok(X)) -> top(active(X)) Number of strict rules: 29 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #top(ok(X)) -> #top(active(X)) #2: #top(ok(X)) -> #active(X) #3: #active(and(X1,X2)) -> #and(active(X1),X2) #4: #active(and(X1,X2)) -> #active(X1) #5: #plus(mark(X1),X2) -> #plus(X1,X2) #6: #active(s(X)) -> #s(active(X)) #7: #active(s(X)) -> #active(X) #8: #active(x(X1,X2)) -> #x(X1,active(X2)) #9: #active(x(X1,X2)) -> #active(X2) #10: #and(ok(X1),ok(X2)) -> #and(X1,X2) #11: #proper(x(X1,X2)) -> #x(proper(X1),proper(X2)) #12: #proper(x(X1,X2)) -> #proper(X1) #13: #proper(x(X1,X2)) -> #proper(X2) #14: #and(mark(X1),X2) -> #and(X1,X2) #15: #plus(X1,mark(X2)) -> #plus(X1,X2) #16: #plus(ok(X1),ok(X2)) -> #plus(X1,X2) #17: #proper(plus(X1,X2)) -> #plus(proper(X1),proper(X2)) #18: #proper(plus(X1,X2)) -> #proper(X1) #19: #proper(plus(X1,X2)) -> #proper(X2) #20: #active(plus(X1,X2)) -> #plus(active(X1),X2) #21: #active(plus(X1,X2)) -> #active(X1) #22: #active(x(X1,X2)) -> #x(active(X1),X2) #23: #active(x(X1,X2)) -> #active(X1) #24: #active(x(N,s(M))) -> #plus(x(N,M),N) #25: #active(x(N,s(M))) -> #x(N,M) #26: #top(mark(X)) -> #top(proper(X)) #27: #top(mark(X)) -> #proper(X) #28: #proper(s(X)) -> #s(proper(X)) #29: #proper(s(X)) -> #proper(X) #30: #x(ok(X1),ok(X2)) -> #x(X1,X2) #31: #x(X1,mark(X2)) -> #x(X1,X2) #32: #s(ok(X)) -> #s(X) #33: #x(mark(X1),X2) -> #x(X1,X2) #34: #active(plus(N,s(M))) -> #s(plus(N,M)) #35: #active(plus(N,s(M))) -> #plus(N,M) #36: #active(plus(X1,X2)) -> #plus(X1,active(X2)) #37: #active(plus(X1,X2)) -> #active(X2) #38: #s(mark(X)) -> #s(X) #39: #proper(and(X1,X2)) -> #and(proper(X1),proper(X2)) #40: #proper(and(X1,X2)) -> #proper(X1) #41: #proper(and(X1,X2)) -> #proper(X2) Number of SCCs: 7, DPs: 25 SCC { #32 #38 } Sum... succeeded. s(x1) w: (0) top(x1) w: (0) and(x1,x2) w: (0) #plus(x1,x2) w: (0) #top(x1) w: (0) x(x1,x2) w: (0) proper(x1) w: (0) ok(x1) w: (1 + x1) 0() w: (0) #x(x1,x2) w: (0) #s(x1) w: (x1) mark(x1) w: (1 + x1) #proper(x1) w: (0) plus(x1,x2) w: (0) active(x1) w: (0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard