details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.138331 seconds
cpu usage	0.054196
user time	0.025447
system time	0.028749
max virtual memory	113188.0
max residence set size	6516.0

stage attributes

key	value
starexec-result	YES

output

YES Input TRS: 1: ap(ap(map(),f),xs) -> ap(ap(ap(if(),ap(isEmpty(),xs)),f),xs) 2: ap(ap(ap(if(),true()),f),xs) -> nil() 3: ap(ap(ap(if(),false()),f),xs) -> ap(ap(cons(),ap(f,ap(last(),xs))),ap(ap(map(),f),ap(dropLast(),xs))) 4: ap(isEmpty(),nil()) -> true() 5: ap(isEmpty(),ap(ap(cons(),x),xs)) -> false() 6: ap(last(),ap(ap(cons(),x),nil())) -> x 7: ap(last(),ap(ap(cons(),x),ap(ap(cons(),y),ys))) -> ap(last(),ap(ap(cons(),y),ys)) 8: ap(dropLast(),nil()) -> nil() 9: ap(dropLast(),ap(ap(cons(),x),nil())) -> nil() 10: ap(dropLast(),ap(ap(cons(),x),ap(ap(cons(),y),ys))) -> ap(ap(cons(),x),ap(dropLast(),ap(ap(cons(),y),ys))) Number of strict rules: 10 Direct POLO(bPol) ... failed. Uncurrying ap^1_last ap 1: ap^2_map(f,xs) -> ap^3_if(ap^1_isEmpty(xs),f,xs) 2: ap^3_if(true(),f,xs) -> nil() 3: ap^3_if(false(),f,xs) -> ap^2_cons(ap(f,ap^1_last(xs)),ap^2_map(f,ap^1_dropLast(xs))) 4: ap^1_isEmpty(nil()) -> true() 5: ap^1_isEmpty(ap^2_cons(x,xs)) -> false() 6: ap^1_last^1_ap^2_cons(x,nil()) -> x 7: ap^1_last^1_ap^2_cons(x,ap^2_cons(y,ys)) -> ap^1_last^1_ap^2_cons(y,ys) 8: ap^1_dropLast(nil()) -> nil() 9: ap^1_dropLast(ap^2_cons(x,nil())) -> nil() 10: ap^1_dropLast(ap^2_cons(x,ap^2_cons(y,ys))) -> ap^2_cons(x,ap^1_dropLast(ap^2_cons(y,ys))) 11: ap(if(),_1) ->= ap^1_if(_1) 12: ap(ap^1_if(_1),_2) ->= ap^2_if(_1,_2) 13: ap(ap^2_if(_1,_2),_3) ->= ap^3_if(_1,_2,_3) 14: ap(cons(),_1) ->= ap^1_cons(_1) 15: ap(ap^1_cons(_1),_2) ->= ap^2_cons(_1,_2) 16: ap(isEmpty(),_1) ->= ap^1_isEmpty(_1) 17: ap(dropLast(),_1) ->= ap^1_dropLast(_1) 18: ap(last(),_1) ->= ap^1_last(_1) 19: ap(map(),_1) ->= ap^1_map(_1) 20: ap(ap^1_map(_1),_2) ->= ap^2_map(_1,_2) 21: ap^1_last(ap^2_cons(_1,_2)) ->= ap^1_last^1_ap^2_cons(_1,_2) Number of strict rules: 10 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #ap(ap^2_if(_1,_2),_3) ->? #ap^3_if(_1,_2,_3) #2: #ap(ap^1_map(_1),_2) ->? #ap^2_map(_1,_2) #3: #ap^1_last^1_ap^2_cons(x,ap^2_cons(y,ys)) -> #ap^1_last^1_ap^2_cons(y,ys) #4: #ap^1_dropLast(ap^2_cons(x,ap^2_cons(y,ys))) -> #ap^1_dropLast(ap^2_cons(y,ys)) #5: #ap(dropLast(),_1) ->? #ap^1_dropLast(_1) #6: #ap^1_last(ap^2_cons(_1,_2)) ->? #ap^1_last^1_ap^2_cons(_1,_2) #7: #ap(isEmpty(),_1) ->? #ap^1_isEmpty(_1) #8: #ap^3_if(false(),f,xs) -> #ap(f,ap^1_last(xs)) #9: #ap^3_if(false(),f,xs) -> #ap^1_last(xs) #10: #ap^3_if(false(),f,xs) -> #ap^2_map(f,ap^1_dropLast(xs)) #11: #ap^3_if(false(),f,xs) -> #ap^1_dropLast(xs) #12: #ap^2_map(f,xs) -> #ap^3_if(ap^1_isEmpty(xs),f,xs) #13: #ap^2_map(f,xs) -> #ap^1_isEmpty(xs) #14: #ap(last(),_1) ->? #ap^1_last(_1) Number of SCCs: 3, DPs: 7 SCC { #3 } POLO(Sum)... succeeded. ap^2_if w: 0 #ap^1_last w: 0 ap^2_map w: 0 ap^1_last w: 0 ap^1_last^1_ap^2_cons w: 0 ap^2_cons w: x2 + 1 ap^1_isEmpty w: 0 ap w: 0 false w: 0 isEmpty w: 0 ap^1_map w: 0 #ap^1_last^1_ap^2_cons w: x2 true w: 0 #ap^3_if w: 0 if w: 0 #ap^2_map w: 0 dropLast w: 0 last w: 0 nil w: 0 map w: 0 #ap^1_dropLast w: 0 #ap w: 0 ap^1_dropLast w: 0 cons w: 0 ap^3_if w: 0 ap^1_cons w: 0 ap^1_if w: 0 #ap^1_isEmpty w: 0 USABLE RULES: { } Removed DPs: #3 Number of SCCs: 2, DPs: 6 SCC { #4 } POLO(Sum)... succeeded. ap^2_if w: 0 #ap^1_last w: 0 ap^2_map w: 0 ap^1_last w: 0 ap^1_last^1_ap^2_cons w: 0 ap^2_cons w: x2 + 1 ap^1_isEmpty w: 0 ap w: 0 false w: 0 isEmpty w: 0 ap^1_map w: 0 popout

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

job log

popout

actions

all output return to TRS Standard