details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.327742099762 seconds
cpu usage	0.345203485
max memory	1.37216E7

stage attributes

key	value
output-size	9717
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(incr(nil())) -> mark(nil()) 2: active(incr(cons(X,L))) -> mark(cons(s(X),incr(L))) 3: active(adx(nil())) -> mark(nil()) 4: active(adx(cons(X,L))) -> mark(incr(cons(X,adx(L)))) 5: active(nats()) -> mark(adx(zeros())) 6: active(zeros()) -> mark(cons(0(),zeros())) 7: active(head(cons(X,L))) -> mark(X) 8: active(tail(cons(X,L))) -> mark(L) 9: active(incr(X)) -> incr(active(X)) 10: active(cons(X1,X2)) -> cons(active(X1),X2) 11: active(s(X)) -> s(active(X)) 12: active(adx(X)) -> adx(active(X)) 13: active(head(X)) -> head(active(X)) 14: active(tail(X)) -> tail(active(X)) 15: incr(mark(X)) -> mark(incr(X)) 16: cons(mark(X1),X2) -> mark(cons(X1,X2)) 17: s(mark(X)) -> mark(s(X)) 18: adx(mark(X)) -> mark(adx(X)) 19: head(mark(X)) -> mark(head(X)) 20: tail(mark(X)) -> mark(tail(X)) 21: proper(incr(X)) -> incr(proper(X)) 22: proper(nil()) -> ok(nil()) 23: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 24: proper(s(X)) -> s(proper(X)) 25: proper(adx(X)) -> adx(proper(X)) 26: proper(nats()) -> ok(nats()) 27: proper(zeros()) -> ok(zeros()) 28: proper(0()) -> ok(0()) 29: proper(head(X)) -> head(proper(X)) 30: proper(tail(X)) -> tail(proper(X)) 31: incr(ok(X)) -> ok(incr(X)) 32: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 33: s(ok(X)) -> ok(s(X)) 34: adx(ok(X)) -> ok(adx(X)) 35: head(ok(X)) -> ok(head(X)) 36: tail(ok(X)) -> ok(tail(X)) 37: top(mark(X)) -> top(proper(X)) 38: top(ok(X)) -> top(active(X)) Number of strict rules: 38 Direct POLO(bPol) ... removes: 8 3 5 7 incr w: x1 s w: x1 top w: x1 adx w: x1 + 1 zeros w: 1 tail w: x1 + 1 proper w: x1 ok w: x1 0 w: 0 nil w: 1 mark w: x1 nats w: 4 active w: x1 head w: x1 + 1 cons w: x1 + x2 Number of strict rules: 34 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(incr(cons(X,L))) -> #cons(s(X),incr(L)) #2: #active(incr(cons(X,L))) -> #s(X) #3: #active(incr(cons(X,L))) -> #incr(L) #4: #proper(head(X)) -> #head(proper(X)) #5: #proper(head(X)) -> #proper(X) #6: #head(ok(X)) -> #head(X) #7: #top(mark(X)) -> #top(proper(X)) #8: #top(mark(X)) -> #proper(X) #9: #top(ok(X)) -> #top(active(X)) #10: #top(ok(X)) -> #active(X) #11: #active(zeros()) -> #cons(0(),zeros()) #12: #active(head(X)) -> #head(active(X)) #13: #active(head(X)) -> #active(X) #14: #active(incr(X)) -> #incr(active(X)) #15: #active(incr(X)) -> #active(X) #16: #active(s(X)) -> #s(active(X)) #17: #active(s(X)) -> #active(X) #18: #proper(s(X)) -> #s(proper(X)) #19: #proper(s(X)) -> #proper(X) #20: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #21: #proper(cons(X1,X2)) -> #proper(X1) #22: #proper(cons(X1,X2)) -> #proper(X2) #23: #active(adx(X)) -> #adx(active(X)) #24: #active(adx(X)) -> #active(X) #25: #incr(ok(X)) -> #incr(X) #26: #active(tail(X)) -> #tail(active(X)) #27: #active(tail(X)) -> #active(X) #28: #proper(tail(X)) -> #tail(proper(X)) #29: #proper(tail(X)) -> #proper(X) #30: #proper(adx(X)) -> #adx(proper(X)) #31: #proper(adx(X)) -> #proper(X) #32: #tail(mark(X)) -> #tail(X) #33: #active(cons(X1,X2)) -> #cons(active(X1),X2) popout

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

job log

popout

actions

all output return to TRS Stand 20472