details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.220832109451 seconds
cpu usage	0.173124662
max memory	1.1915264E7

stage attributes

key	value
output-size	5104
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(f(x)) -> mark(x) 2: top(active(c())) -> top(mark(c())) 3: top(mark(x)) -> top(check(x)) 4: check(f(x)) -> f(check(x)) 5: check(x) -> start(match(f(X()),x)) 6: match(f(x),f(y)) -> f(match(x,y)) 7: match(X(),x) -> proper(x) 8: proper(c()) -> ok(c()) 9: proper(f(x)) -> f(proper(x)) 10: f(ok(x)) -> ok(f(x)) 11: start(ok(x)) -> found(x) 12: f(found(x)) -> found(f(x)) 13: top(found(x)) -> top(active(x)) 14: active(f(x)) -> f(active(x)) 15: f(mark(x)) -> mark(f(x)) Number of strict rules: 15 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #top(active(c())) -> #top(mark(c())) #2: #match(f(x),f(y)) -> #f(match(x,y)) #3: #match(f(x),f(y)) -> #match(x,y) #4: #top(found(x)) -> #top(active(x)) #5: #top(found(x)) -> #active(x) #6: #proper(f(x)) -> #f(proper(x)) #7: #proper(f(x)) -> #proper(x) #8: #f(found(x)) -> #f(x) #9: #active(f(x)) -> #f(active(x)) #10: #active(f(x)) -> #active(x) #11: #match(X(),x) -> #proper(x) #12: #f(ok(x)) -> #f(x) #13: #check(x) -> #start(match(f(X()),x)) #14: #check(x) -> #match(f(X()),x) #15: #check(x) -> #f(X()) #16: #top(mark(x)) -> #top(check(x)) #17: #top(mark(x)) -> #check(x) #18: #f(mark(x)) -> #f(x) #19: #check(f(x)) -> #f(check(x)) #20: #check(f(x)) -> #check(x) Number of SCCs: 6, DPs: 10 SCC { #10 } Sum... succeeded. top(x1) w: (0) #check(x1) w: (0) #top(x1) w: (0) c() w: (0) f(x1) w: (1 + x1) check(x1) w: (0) proper(x1) w: (0) ok(x1) w: (0) #match(x1,x2) w: (0) mark(x1) w: (0) #f(x1) w: (0) found(x1) w: (0) #proper(x1) w: (0) match(x1,x2) w: (0) #start(x1) w: (0) active(x1) w: (0) #active(x1) w: (x1) start(x1) w: (0) X() w: (0) USABLE RULES: { } Removed DPs: #10 Number of SCCs: 5, DPs: 9 SCC { #20 } Sum... succeeded. top(x1) w: (0) #check(x1) w: (x1) #top(x1) w: (0) c() w: (0) f(x1) w: (1 + x1) check(x1) w: (0) proper(x1) w: (0) ok(x1) w: (0) #match(x1,x2) w: (0) mark(x1) w: (0) #f(x1) w: (0) found(x1) w: (0) #proper(x1) w: (0) match(x1,x2) w: (0) #start(x1) w: (0) active(x1) w: (0) #active(x1) w: (0) start(x1) w: (0) X() w: (0) USABLE RULES: { } Removed DPs: #20 Number of SCCs: 4, DPs: 8 SCC { #7 } Sum... succeeded. top(x1) w: (0) #check(x1) w: (0) popout

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

job log

popout

actions

all output return to TRS Standard