details

property	value
status	complete
benchmark	list-sum-prod-assoc.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n072.star.cs.uiowa.edu
space	CiME_04

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.0866780281067 seconds
cpu usage	0.052920657
max memory	1.097728E7

stage attributes

key	value
output-size	2560
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: +(x,0()) -> x 2: +(0(),x) -> x 3: +(s(x),s(y)) -> s(s(+(x,y))) 4: +(+(x,y),z) -> +(x,+(y,z)) 5: *(x,0()) -> 0() 6: *(0(),x) -> 0() 7: *(s(x),s(y)) -> s(+(*(x,y),+(x,y))) 8: *(*(x,y),z) -> *(x,*(y,z)) 9: sum(nil()) -> 0() 10: sum(cons(x,l)) -> +(x,sum(l)) 11: prod(nil()) -> s(0()) 12: prod(cons(x,l)) -> *(x,prod(l)) Number of strict rules: 12 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #prod(cons(x,l)) -> #*(x,prod(l)) #2: #prod(cons(x,l)) -> #prod(l) #3: #*(s(x),s(y)) -> #+(*(x,y),+(x,y)) #4: #*(s(x),s(y)) -> #*(x,y) #5: #*(s(x),s(y)) -> #+(x,y) #6: #sum(cons(x,l)) -> #+(x,sum(l)) #7: #sum(cons(x,l)) -> #sum(l) #8: #+(s(x),s(y)) -> #+(x,y) #9: #*(*(x,y),z) -> #*(x,*(y,z)) #10: #*(*(x,y),z) -> #*(y,z) #11: #+(+(x,y),z) -> #+(x,+(y,z)) #12: #+(+(x,y),z) -> #+(y,z) Number of SCCs: 4, DPs: 8 SCC { #7 } Sum... succeeded. prod(x1) w: (0) s(x1) w: (0) #prod(x1) w: (0) #*(x1,x2) w: (0) sum(x1) w: (0) 0() w: (0) nil() w: (0) cons(x1,x2) w: (1 + x2) +(x1,x2) w: (0) #sum(x1) w: (x1) #+(x1,x2) w: (0) *(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #7 Number of SCCs: 3, DPs: 7 SCC { #2 } Sum... succeeded. prod(x1) w: (0) s(x1) w: (0) #prod(x1) w: (x1) #*(x1,x2) w: (0) sum(x1) w: (0) 0() w: (0) nil() w: (0) cons(x1,x2) w: (1 + x2) +(x1,x2) w: (0) #sum(x1) w: (0) #+(x1,x2) w: (0) *(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #2 Number of SCCs: 2, DPs: 6 SCC { #4 #9 #10 } Sum... succeeded. prod(x1) w: (0) s(x1) w: (42477 + x1) #prod(x1) w: (0) #*(x1,x2) w: (x1) sum(x1) w: (0) 0() w: (7720) nil() w: (0) cons(x1,x2) w: (1) +(x1,x2) w: (21239 + x2 + x1) #sum(x1) w: (0) #+(x1,x2) w: (0) *(x1,x2) w: (39 + x2 + x1) USABLE RULES: { } Removed DPs: #4 #9 #10 Number of SCCs: 1, DPs: 3 SCC { #8 #11 #12 } Sum... succeeded. prod(x1) w: (0) s(x1) w: (60187 + x1) #prod(x1) w: (0) #*(x1,x2) w: (0) sum(x1) w: (0) 0() w: (1) nil() w: (0) cons(x1,x2) w: (1) +(x1,x2) w: (30094 + x2 + x1) #sum(x1) w: (0) popout

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

job log

popout

actions

all output return to TRS Standard