details

property	value
status	complete
benchmark	#3.45.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	Applicative_first_order_05

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.718929 seconds
cpu usage	1.65199
user time	1.35526
system time	0.296734
max virtual memory	1766656.0
max residence set size	72136.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: app(f(),app(s(),x)) -> app(f(),x) app(g(),app(app(cons(),0()),y)) -> app(g(),y) app(g(),app(app(cons(),app(s(),x)),y)) -> app(s(),x) app(h(),app(app(cons(),x),y)) -> app(h(),app(g(),app(app(cons(),x),y))) app(app(map(),fun),nil()) -> nil() app(app(map(),fun),app(app(cons(),x),xs)) -> app(app(cons(),app(fun,x)),app(app(map(),fun),xs)) app(app(filter(),fun),nil()) -> nil() app(app(filter(),fun),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(fun,x)),fun),x),xs) app(app(app(app(filter2(),true()),fun),x),xs) -> app(app(cons(),x),app(app(filter(),fun),xs)) app(app(app(app(filter2(),false()),fun),x),xs) -> app(app(filter(),fun),xs) Proof: Extended Uncurrying Processor: application symbol: app symbol table: false ==> false0/0 true ==> true0/0 filter2 ==> filter20/0 filter21/1 filter22/2 filter23/3 filter24/4 filter ==> filter0/0 filter1/1 filter2/2 nil ==> nil0/0 map ==> map0/0 map1/1 map2/2 h ==> h0/0 h1/1 0 ==> 00/0 cons ==> cons0/0 cons1/1 cons2/2 g ==> g0/0 g1/1 s ==> s0/0 s1/1 f ==> f0/0 f1/1 uncurry-rules: app(f0(),x4) -> f1(x4) app(s0(),x6) -> s1(x6) app(g0(),x8) -> g1(x8) app(cons1(x10),x11) -> cons2(x10,x11) app(cons0(),x10) -> cons1(x10) app(h0(),x14) -> h1(x14) app(map1(x16),x17) -> map2(x16,x17) app(map0(),x16) -> map1(x16) app(filter1(x20),x21) -> filter2(x20,x21) app(filter0(),x20) -> filter1(x20) app(filter23(x23,x24,x25),x26) -> filter24(x23,x24,x25,x26) app(filter22(x23,x24),x25) -> filter23(x23,x24,x25) app(filter21(x23),x24) -> filter22(x23,x24) app(filter20(),x23) -> filter21(x23) eta-rules: problem: f1(s1(x)) -> f1(x) g1(cons2(00(),y)) -> g1(y) g1(cons2(s1(x),y)) -> s1(x) h1(cons2(x,y)) -> h1(g1(cons2(x,y))) map2(fun,nil0()) -> nil0() map2(fun,cons2(x,xs)) -> cons2(app(fun,x),map2(fun,xs)) filter2(fun,nil0()) -> nil0() filter2(fun,cons2(x,xs)) -> filter24(app(fun,x),fun,x,xs) filter24(true0(),fun,x,xs) -> cons2(x,filter2(fun,xs)) filter24(false0(),fun,x,xs) -> filter2(fun,xs) app(f0(),x4) -> f1(x4) app(s0(),x6) -> s1(x6) app(g0(),x8) -> g1(x8) app(cons1(x10),x11) -> cons2(x10,x11) app(cons0(),x10) -> cons1(x10) app(h0(),x14) -> h1(x14) app(map1(x16),x17) -> map2(x16,x17) app(map0(),x16) -> map1(x16) app(filter1(x20),x21) -> filter2(x20,x21) app(filter0(),x20) -> filter1(x20) app(filter23(x23,x24,x25),x26) -> filter24(x23,x24,x25,x26) app(filter22(x23,x24),x25) -> filter23(x23,x24,x25) app(filter21(x23),x24) -> filter22(x23,x24) app(filter20(),x23) -> filter21(x23) DP Processor: DPs: f{1,#}(s1(x)) -> f{1,#}(x) g{1,#}(cons2(00(),y)) -> g{1,#}(y) h{1,#}(cons2(x,y)) -> g{1,#}(cons2(x,y)) h{1,#}(cons2(x,y)) -> h{1,#}(g1(cons2(x,y))) map{2,#}(fun,cons2(x,xs)) -> map{2,#}(fun,xs) map{2,#}(fun,cons2(x,xs)) -> app#(fun,x) filter{2,#}(fun,cons2(x,xs)) -> app#(fun,x) filter{2,#}(fun,cons2(x,xs)) -> filter2{4,#}(app(fun,x),fun,x,xs) filter2{4,#}(true0(),fun,x,xs) -> filter{2,#}(fun,xs) filter2{4,#}(false0(),fun,x,xs) -> filter{2,#}(fun,xs) app#(f0(),x4) -> f{1,#}(x4) app#(g0(),x8) -> g{1,#}(x8) app#(h0(),x14) -> h{1,#}(x14) app#(map1(x16),x17) -> map{2,#}(x16,x17) app#(filter1(x20),x21) -> filter{2,#}(x20,x21) app#(filter23(x23,x24,x25),x26) -> filter2{4,#}(x23,x24,x25,x26) TRS: f1(s1(x)) -> f1(x) g1(cons2(00(),y)) -> g1(y) g1(cons2(s1(x),y)) -> s1(x) h1(cons2(x,y)) -> h1(g1(cons2(x,y))) map2(fun,nil0()) -> nil0() map2(fun,cons2(x,xs)) -> cons2(app(fun,x),map2(fun,xs)) filter2(fun,nil0()) -> nil0() filter2(fun,cons2(x,xs)) -> filter24(app(fun,x),fun,x,xs) popout

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

job log

popout

actions

all output return to TRS Standard