details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	2.53654 seconds
cpu usage	2.44
user time	2.4
system time	0.04
max virtual memory	369052.0
max residence set size	6456.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: 1: fstsplit(0(),x) -> nil() 2: fstsplit(s(n),nil()) -> nil() 3: fstsplit(s(n),cons(h,t)) -> cons(h,fstsplit(n,t)) 4: sndsplit(0(),x) -> x 5: sndsplit(s(n),nil()) -> nil() 6: sndsplit(s(n),cons(h,t)) -> sndsplit(n,t) 7: empty(nil()) -> true() 8: empty(cons(h,t)) -> false() 9: leq(0(),m) -> true() 10: leq(s(n),0()) -> false() 11: leq(s(n),s(m)) -> leq(n,m) 12: length(nil()) -> 0() 13: length(cons(h,t)) -> s(length(t)) 14: app(nil(),x) -> x 15: app(cons(h,t),x) -> cons(h,app(t,x)) 16: map_f(pid,nil()) -> nil() 17: map_f(pid,cons(h,t)) -> app(f(pid,h),map_f(pid,t)) 18: process(store,m) -> if1(store,m,leq(m,length(store))) 19: if1(store,m,true()) -> if2(store,m,empty(fstsplit(m,store))) 20: if1(store,m,false()) -> if3(store,m,empty(fstsplit(m,app(map_f(self(),nil()),store)))) 21: if2(store,m,false()) -> process(app(map_f(self(),nil()),sndsplit(m,store)),m) 22: if3(store,m,false()) -> process(sndsplit(m,app(map_f(self(),nil()),store)),m) Number of strict rules: 22 Direct POLO(bPol) ... failed. Uncurrying app 1: fstsplit(0(),x) -> nil() 2: fstsplit(s(n),nil()) -> nil() 3: fstsplit(s(n),cons(h,t)) -> cons(h,fstsplit(n,t)) 4: sndsplit(0(),x) -> x 5: sndsplit(s(n),nil()) -> nil() 6: sndsplit(s(n),cons(h,t)) -> sndsplit(n,t) 7: empty(nil()) -> true() 8: empty(cons(h,t)) -> false() 9: leq(0(),m) -> true() 10: leq(s(n),0()) -> false() 11: leq(s(n),s(m)) -> leq(n,m) 12: length(nil()) -> 0() 13: length(cons(h,t)) -> s(length(t)) 14: app^1_nil(x) -> x 15: app^1_cons(h,t,x) -> cons(h,app(t,x)) 16: map_f(pid,nil()) -> nil() 17: map_f(pid,cons(h,t)) -> app^1_f(pid,h,map_f(pid,t)) 18: process(store,m) -> if1(store,m,leq(m,length(store))) 19: if1(store,m,true()) -> if2(store,m,empty(fstsplit(m,store))) 20: if1(store,m,false()) -> if3(store,m,empty(fstsplit(m,app(map_f(self(),nil()),store)))) 21: if2(store,m,false()) -> process(app(map_f(self(),nil()),sndsplit(m,store)),m) 22: if3(store,m,false()) -> process(sndsplit(m,app(map_f(self(),nil()),store)),m) 23: app(cons(_1,_2),_3) ->= app^1_cons(_1,_2,_3) 24: app(nil(),_1) ->= app^1_nil(_1) 25: app(f(_1,_2),_3) ->= app^1_f(_1,_2,_3) Number of strict rules: 22 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #sndsplit(s(n),cons(h,t)) -> #sndsplit(n,t) #2: #length(cons(h,t)) -> #length(t) #3: #leq(s(n),s(m)) -> #leq(n,m) #4: #app(nil(),_1) ->? #app^1_nil(_1) #5: #app(cons(_1,_2),_3) ->? #app^1_cons(_1,_2,_3) #6: #if1(store,m,false()) -> #if3(store,m,empty(fstsplit(m,app(map_f(self(),nil()),store)))) #7: #if1(store,m,false()) -> #empty(fstsplit(m,app(map_f(self(),nil()),store))) #8: #if1(store,m,false()) -> #fstsplit(m,app(map_f(self(),nil()),store)) #9: #if1(store,m,false()) -> #app(map_f(self(),nil()),store) #10: #if1(store,m,false()) -> #map_f(self(),nil()) #11: #if3(store,m,false()) -> #process(sndsplit(m,app(map_f(self(),nil()),store)),m) #12: #if3(store,m,false()) -> #sndsplit(m,app(map_f(self(),nil()),store)) #13: #if3(store,m,false()) -> #app(map_f(self(),nil()),store) #14: #if3(store,m,false()) -> #map_f(self(),nil()) #15: #map_f(pid,cons(h,t)) -> #map_f(pid,t) #16: #if1(store,m,true()) -> #if2(store,m,empty(fstsplit(m,store))) #17: #if1(store,m,true()) -> #empty(fstsplit(m,store)) #18: #if1(store,m,true()) -> #fstsplit(m,store) #19: #if2(store,m,false()) -> #process(app(map_f(self(),nil()),sndsplit(m,store)),m) #20: #if2(store,m,false()) -> #app(map_f(self(),nil()),sndsplit(m,store)) #21: #if2(store,m,false()) -> #map_f(self(),nil()) #22: #if2(store,m,false()) -> #sndsplit(m,store) #23: #fstsplit(s(n),cons(h,t)) -> #fstsplit(n,t) #24: #app^1_cons(h,t,x) -> #app(t,x) #25: #process(store,m) -> #if1(store,m,leq(m,length(store))) #26: #process(store,m) -> #leq(m,length(store)) #27: #process(store,m) -> #length(store) Number of SCCs: 7, DPs: 12 SCC { #2 } POLO(Sum)... succeeded. #empty w: 0 s w: 0 app^1_cons w: 0 #sndsplit w: 0 #process w: 0 sndsplit w: 0 if1 w: 0 false w: 0 #app^1_nil w: 0 leq w: 0 true w: 0 f w: 0 #leq w: 0 #if1 w: 0 if2 w: 0 popout

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

job log

popout

actions

all output return to TRS Standard