details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.124231100082 seconds
cpu usage	0.051554767
max memory	8785920.0

stage attributes

key	value
output-size	3126
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: app(app(append(),nil()),l) -> l 2: app(app(append(),app(app(cons(),h),t)),l) -> app(app(cons(),h),app(app(append(),t),l)) 3: app(app(map(),f),nil()) -> nil() 4: app(app(map(),f),app(app(cons(),h),t)) -> app(app(cons(),app(f,h)),app(app(map(),f),t)) 5: app(app(append(),app(app(append(),l1),l2)),l3) -> app(app(append(),l1),app(app(append(),l2),l3)) 6: app(app(map(),f),app(app(append(),l1),l2)) -> app(app(append(),app(app(map(),f),l1)),app(app(map(),f),l2)) Number of strict rules: 6 Direct poly ... failed. Freezing app 1: app❆2_append(nil(),l) -> l 2: app❆2_append(app❆2_cons(h,t),l) -> app❆2_cons(h,app❆2_append(t,l)) 3: app❆2_map(f,nil()) -> nil() 4: app❆2_map(f,app❆2_cons(h,t)) -> app❆2_cons(app(f,h),app❆2_map(f,t)) 5: app❆2_append(app❆2_append(l1,l2),l3) -> app❆2_append(l1,app❆2_append(l2,l3)) 6: app❆2_map(f,app❆2_append(l1,l2)) -> app❆2_append(app❆2_map(f,l1),app❆2_map(f,l2)) 7: app(append(),_1) ->= app❆1_append(_1) 8: app(app❆1_append(_1),_2) ->= app❆2_append(_1,_2) 9: app(cons(),_1) ->= app❆1_cons(_1) 10: app(app❆1_cons(_1),_2) ->= app❆2_cons(_1,_2) 11: app(map(),_1) ->= app❆1_map(_1) 12: app(app❆1_map(_1),_2) ->= app❆2_map(_1,_2) Number of strict rules: 6 Direct poly ... failed. Dependency Pairs: #1: #app❆2_append(app❆2_cons(h,t),l) -> #app❆2_append(t,l) #2: #app❆2_map(f,app❆2_append(l1,l2)) -> #app❆2_append(app❆2_map(f,l1),app❆2_map(f,l2)) #3: #app❆2_map(f,app❆2_append(l1,l2)) -> #app❆2_map(f,l1) #4: #app❆2_map(f,app❆2_append(l1,l2)) -> #app❆2_map(f,l2) #5: #app(app❆1_map(_1),_2) ->? #app❆2_map(_1,_2) #6: #app❆2_append(app❆2_append(l1,l2),l3) -> #app❆2_append(l1,app❆2_append(l2,l3)) #7: #app❆2_append(app❆2_append(l1,l2),l3) -> #app❆2_append(l2,l3) #8: #app(app❆1_append(_1),_2) ->? #app❆2_append(_1,_2) #9: #app❆2_map(f,app❆2_cons(h,t)) -> #app(f,h) #10: #app❆2_map(f,app❆2_cons(h,t)) -> #app❆2_map(f,t) Number of SCCs: 2, DPs: 8 SCC { #1 #6 #7 } Sum... succeeded. #app❆2_map(x1,x2) w: (0) app❆1_map(x1) w: (0) app❆2_map(x1,x2) w: (0) app❆1_append(x1) w: (0) append() w: (0) #app❆2_append(x1,x2) w: (2 + x1) nil() w: (2438) #app(x1,x2) w: (0) map() w: (0) cons() w: (0) app❆2_cons(x1,x2) w: (8856 + x2 + x1) app❆2_append(x1,x2) w: (1 + x2 + x1) app❆1_cons(x1) w: (0) app(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #1 #6 #7 Number of SCCs: 1, DPs: 5 SCC { #3..5 #9 #10 } Sum... succeeded. #app❆2_map(x1,x2) w: (x2) app❆1_map(x1) w: (1) app❆2_map(x1,x2) w: (0) app❆1_append(x1) w: (0) append() w: (0) #app❆2_append(x1,x2) w: (2) nil() w: (1) #app(x1,x2) w: (1 + x2) map() w: (0) cons() w: (0) app❆2_cons(x1,x2) w: (8856 + x2 + x1) app❆2_append(x1,x2) w: (1 + x2 + x1) app❆1_cons(x1) w: (0) app(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #3..5 #9 #10 Number of SCCs: 0, DPs: 0 popout

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

job log

popout

actions

all output return to TRS Standard