Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710843
details
property
value
status
complete
benchmark
aprove10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
Secret_07_TRS
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.422358989716 seconds
cpu usage
0.477175214
max memory
2.453504E7
stage attributes
key
value
output-size
3995
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: lessElements(l,t) -> lessE(l,t,0()) 2: lessE(l,t,n) -> if(le(length(l),n),le(length(toList(t)),n),l,t,n) 3: if(true(),b,l,t,n) -> l 4: if(false(),true(),l,t,n) -> t 5: if(false(),false(),l,t,n) -> lessE(l,t,s(n)) 6: length(nil()) -> 0() 7: length(cons(n,l)) -> s(length(l)) 8: toList(leaf()) -> nil() 9: toList(node(t1,n,t2)) -> append(toList(t1),cons(n,toList(t2))) 10: append(nil(),l2) -> l2 11: append(cons(n,l1),l2) -> cons(n,append(l1,l2)) 12: le(s(n),0()) -> false() 13: le(0(),m) -> true() 14: le(s(n),s(m)) -> le(n,m) 15: a() -> c() 16: a() -> d() Number of strict rules: 16 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #lessE(l,t,n) -> #if(le(length(l),n),le(length(toList(t)),n),l,t,n) #2: #lessE(l,t,n) -> #le(length(l),n) #3: #lessE(l,t,n) -> #length(l) #4: #lessE(l,t,n) -> #le(length(toList(t)),n) #5: #lessE(l,t,n) -> #length(toList(t)) #6: #lessE(l,t,n) -> #toList(t) #7: #toList(node(t1,n,t2)) -> #append(toList(t1),cons(n,toList(t2))) #8: #toList(node(t1,n,t2)) -> #toList(t1) #9: #toList(node(t1,n,t2)) -> #toList(t2) #10: #append(cons(n,l1),l2) -> #append(l1,l2) #11: #le(s(n),s(m)) -> #le(n,m) #12: #length(cons(n,l)) -> #length(l) #13: #if(false(),false(),l,t,n) -> #lessE(l,t,s(n)) #14: #lessElements(l,t) -> #lessE(l,t,0()) Number of SCCs: 5, DPs: 7 SCC { #12 } POLO(Sum)... succeeded. a w: 0 le w: 0 d w: 0 s w: 0 #le w: 0 #append w: 0 lessE w: 0 false w: 0 c w: 0 true w: 0 toList w: 0 lessElements w: 0 append w: 0 0 w: 0 if w: 0 #toList w: 0 nil w: 0 #lessE w: 0 #lessElements w: 0 cons w: x2 + 1 #if w: 0 #a w: 0 leaf w: 0 length w: 0 #length w: x1 node w: 0 USABLE RULES: { } Removed DPs: #12 Number of SCCs: 4, DPs: 6 SCC { #10 } POLO(Sum)... succeeded. a w: 0 le w: 0 d w: 0 s w: 0 #le w: 0 #append w: x1 lessE w: 0 false w: 0 c w: 0 true w: 0 toList w: 0 lessElements w: 0 append w: 0 0 w: 0 if w: 0 #toList w: 0 nil w: 0 #lessE w: 0 #lessElements w: 0 cons w: x2 + 1 #if w: 0 #a w: 0 leaf w: 0 length w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472