details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.731888 seconds
cpu usage	1.57586
user time	1.26682
system time	0.30904
max virtual memory	1659596.0
max residence set size	71748.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: app(app(.(),1()),x) -> x app(app(.(),x),1()) -> x app(app(.(),app(i(),x)),x) -> 1() app(app(.(),x),app(i(),x)) -> 1() app(app(.(),app(i(),y)),app(app(.(),y),z)) -> z app(app(.(),y),app(app(.(),app(i(),y)),z)) -> z app(i(),1()) -> 1() app(i(),app(i(),x)) -> x app(app(map(),f),nil()) -> nil() app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) app(app(filter(),f),nil()) -> nil() app(app(filter(),f),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(f,x)),f),x),xs) app(app(app(app(filter2(),true()),f),x),xs) -> app(app(cons(),x),app(app(filter(),f),xs)) app(app(app(app(filter2(),false()),f),x),xs) -> app(app(filter(),f),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 cons ==> cons0/0 cons1/1 cons2/2 nil ==> nil0/0 map ==> map0/0 map1/1 map2/2 i ==> i0/0 i1/1 1 ==> 10/0 . ==> .0/0 .1/1 .2/2 uncurry-rules: app(.1(x5),x6) -> .2(x5,x6) app(.0(),x5) -> .1(x5) app(i0(),x9) -> i1(x9) app(map1(x11),x12) -> map2(x11,x12) app(map0(),x11) -> map1(x11) app(cons1(x15),x16) -> cons2(x15,x16) app(cons0(),x15) -> cons1(x15) app(filter1(x18),x19) -> filter2(x18,x19) app(filter0(),x18) -> filter1(x18) app(filter23(x21,x22,x23),x24) -> filter24(x21,x22,x23,x24) app(filter22(x21,x22),x23) -> filter23(x21,x22,x23) app(filter21(x21),x22) -> filter22(x21,x22) app(filter20(),x21) -> filter21(x21) eta-rules: problem: .2(10(),x) -> x .2(x,10()) -> x .2(i1(x),x) -> 10() .2(x,i1(x)) -> 10() .2(i1(y),.2(y,z)) -> z .2(y,.2(i1(y),z)) -> z i1(10()) -> 10() i1(i1(x)) -> x map2(f,nil0()) -> nil0() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) filter2(f,nil0()) -> nil0() filter2(f,cons2(x,xs)) -> filter24(app(f,x),f,x,xs) filter24(true0(),f,x,xs) -> cons2(x,filter2(f,xs)) filter24(false0(),f,x,xs) -> filter2(f,xs) app(.1(x5),x6) -> .2(x5,x6) app(.0(),x5) -> .1(x5) app(i0(),x9) -> i1(x9) app(map1(x11),x12) -> map2(x11,x12) app(map0(),x11) -> map1(x11) app(cons1(x15),x16) -> cons2(x15,x16) app(cons0(),x15) -> cons1(x15) app(filter1(x18),x19) -> filter2(x18,x19) app(filter0(),x18) -> filter1(x18) app(filter23(x21,x22,x23),x24) -> filter24(x21,x22,x23,x24) app(filter22(x21,x22),x23) -> filter23(x21,x22,x23) app(filter21(x21),x22) -> filter22(x21,x22) app(filter20(),x21) -> filter21(x21) DP Processor: DPs: map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) map{2,#}(f,cons2(x,xs)) -> app#(f,x) filter{2,#}(f,cons2(x,xs)) -> app#(f,x) filter{2,#}(f,cons2(x,xs)) -> filter2{4,#}(app(f,x),f,x,xs) filter2{4,#}(true0(),f,x,xs) -> filter{2,#}(f,xs) filter2{4,#}(false0(),f,x,xs) -> filter{2,#}(f,xs) app#(.1(x5),x6) -> .{2,#}(x5,x6) app#(i0(),x9) -> i{1,#}(x9) app#(map1(x11),x12) -> map{2,#}(x11,x12) app#(filter1(x18),x19) -> filter{2,#}(x18,x19) app#(filter23(x21,x22,x23),x24) -> filter2{4,#}(x21,x22,x23,x24) TRS: .2(10(),x) -> x .2(x,10()) -> x .2(i1(x),x) -> 10() .2(x,i1(x)) -> 10() .2(i1(y),.2(y,z)) -> z .2(y,.2(i1(y),z)) -> z i1(10()) -> 10() i1(i1(x)) -> x map2(f,nil0()) -> nil0() popout

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

job log

popout

actions

all output return to TRS Standard