Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714970
details
property
value
status
complete
benchmark
Ex1_Luc04b_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.27105307579 seconds
cpu usage
0.283959393
max memory
9846784.0
stage attributes
key
value
output-size
7936
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(nats()) -> mark(cons(0(),incr(nats()))) 2: active(pairs()) -> mark(cons(0(),incr(odds()))) 3: active(odds()) -> mark(incr(pairs())) 4: active(incr(cons(X,XS))) -> mark(cons(s(X),incr(XS))) 5: active(head(cons(X,XS))) -> mark(X) 6: active(tail(cons(X,XS))) -> mark(XS) 7: active(cons(X1,X2)) -> cons(active(X1),X2) 8: active(incr(X)) -> incr(active(X)) 9: active(s(X)) -> s(active(X)) 10: active(head(X)) -> head(active(X)) 11: active(tail(X)) -> tail(active(X)) 12: cons(mark(X1),X2) -> mark(cons(X1,X2)) 13: incr(mark(X)) -> mark(incr(X)) 14: s(mark(X)) -> mark(s(X)) 15: head(mark(X)) -> mark(head(X)) 16: tail(mark(X)) -> mark(tail(X)) 17: proper(nats()) -> ok(nats()) 18: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 19: proper(0()) -> ok(0()) 20: proper(incr(X)) -> incr(proper(X)) 21: proper(pairs()) -> ok(pairs()) 22: proper(odds()) -> ok(odds()) 23: proper(s(X)) -> s(proper(X)) 24: proper(head(X)) -> head(proper(X)) 25: proper(tail(X)) -> tail(proper(X)) 26: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 27: incr(ok(X)) -> ok(incr(X)) 28: s(ok(X)) -> ok(s(X)) 29: head(ok(X)) -> ok(head(X)) 30: tail(ok(X)) -> ok(tail(X)) 31: top(mark(X)) -> top(proper(X)) 32: top(ok(X)) -> top(active(X)) Number of strict rules: 32 Direct POLO(bPol) ... removes: 5 6 incr w: x1 s w: x1 top w: x1 pairs w: 6 tail w: x1 + 5 proper w: x1 ok w: x1 0 w: 0 odds w: 6 mark w: x1 nats w: 3 active w: x1 head w: x1 + 3 cons w: x1 + x2 Number of strict rules: 30 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(pairs()) -> #cons(0(),incr(odds())) #2: #active(pairs()) -> #incr(odds()) #3: #head(ok(X)) -> #head(X) #4: #incr(mark(X)) -> #incr(X) #5: #active(s(X)) -> #s(active(X)) #6: #active(s(X)) -> #active(X) #7: #active(tail(X)) -> #tail(active(X)) #8: #active(tail(X)) -> #active(X) #9: #proper(head(X)) -> #head(proper(X)) #10: #proper(head(X)) -> #proper(X) #11: #proper(s(X)) -> #s(proper(X)) #12: #proper(s(X)) -> #proper(X) #13: #cons(mark(X1),X2) -> #cons(X1,X2) #14: #top(mark(X)) -> #top(proper(X)) #15: #top(mark(X)) -> #proper(X) #16: #s(mark(X)) -> #s(X) #17: #tail(ok(X)) -> #tail(X) #18: #proper(tail(X)) -> #tail(proper(X)) #19: #proper(tail(X)) -> #proper(X) #20: #proper(incr(X)) -> #incr(proper(X)) #21: #proper(incr(X)) -> #proper(X) #22: #active(cons(X1,X2)) -> #cons(active(X1),X2) #23: #active(cons(X1,X2)) -> #active(X1) #24: #active(head(X)) -> #head(active(X)) #25: #active(head(X)) -> #active(X) #26: #s(ok(X)) -> #s(X) #27: #incr(ok(X)) -> #incr(X) #28: #top(ok(X)) -> #top(active(X)) #29: #top(ok(X)) -> #active(X) #30: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) #31: #tail(mark(X)) -> #tail(X) #32: #active(odds()) -> #incr(pairs()) #33: #active(nats()) -> #cons(0(),incr(nats())) #34: #active(nats()) -> #incr(nats()) #35: #active(incr(X)) -> #incr(active(X)) #36: #active(incr(X)) -> #active(X) #37: #head(mark(X)) -> #head(X) #38: #active(incr(cons(X,XS))) -> #cons(s(X),incr(XS)) #39: #active(incr(cons(X,XS))) -> #s(X) #40: #active(incr(cons(X,XS))) -> #incr(XS)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472