details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.110193967819 seconds
cpu usage	0.064041431
max memory	9240576.0

stage attributes

key	value
output-size	2260
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: C symbols: eq 1: eq(0(),0()) -> true() 2: eq(0(),s(x)) -> false() 3: eq(s(x),0()) -> false() 4: eq(s(x),s(y)) -> eq(x,y) 5: rm(n,nil()) -> nil() 6: rm(n,add(m,x)) -> if_rm(eq(n,m),n,add(m,x)) 7: if_rm(true(),n,add(m,x)) -> rm(n,x) 8: if_rm(false(),n,add(m,x)) -> add(m,rm(n,x)) 9: purge(nil()) -> nil() 10: purge(add(n,x)) -> add(n,purge(rm(n,x))) Number of strict rules: 10 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #rm(n,add(m,x)) -> #if_rm(eq(n,m),n,add(m,x)) #2: #rm(n,add(m,x)) -> #eq(n,m) #3: #if_rm(true(),n,add(m,x)) -> #rm(n,x) #4: #purge(add(n,x)) -> #purge(rm(n,x)) #5: #purge(add(n,x)) -> #rm(n,x) #6: #if_rm(false(),n,add(m,x)) -> #rm(n,x) #7: #eq(s(x),s(y)) -> #eq(x,y) Number of SCCs: 3, DPs: 5 SCC { #4 } POLO(Sum)... succeeded. if_rm w: x3 + 30613 s w: 1 #if_rm w: 0 #purge w: x1 eq w: 1 false w: 2 true w: 2 purge w: 0 #eq w: 0 0 w: 1 nil w: 1 add w: x1 + x2 + 30614 rm w: x2 + 30613 #rm w: 0 USABLE RULES: { 5..8 } Removed DPs: #4 Number of SCCs: 2, DPs: 4 SCC { #7 } POLO(Sum)... succeeded. if_rm w: x3 + 33954 s w: x1 + 1 #if_rm w: 0 #purge w: x1 eq w: 1 false w: 2 true w: 2 purge w: 0 #eq w: x1 + x2 0 w: 1 nil w: 1 add w: x1 + x2 + 30614 rm w: x2 + 33954 #rm w: 0 USABLE RULES: { 5..8 } Removed DPs: #7 Number of SCCs: 1, DPs: 3 SCC { #1 #3 #6 } POLO(Sum)... succeeded. if_rm w: x3 + 1 s w: x1 + 1 #if_rm w: x3 #purge w: x1 eq w: 1 false w: 2 true w: 2 purge w: 0 #eq w: 0 0 w: 1 nil w: 1 add w: x1 + x2 + 30614 rm w: x2 + 1 #rm w: x2 + 30613 USABLE RULES: { 5..8 } Removed DPs: #1 #3 #6 Number of SCCs: 0, DPs: 0 Next Dependency Pairs: 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 Equational