details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	1.9270029068 seconds
cpu usage	6.293307016
max memory	4.74877952E8

stage attributes

key	value
output-size	18306
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: app(app(plus(),0()),y) -> y app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y)) app(app(times(),0()),y) -> 0() app(app(times(),app(s(),x)),y) -> app(app(plus(),app(app(times(),x),y)),y) app(app(app(curry(),g),x),y) -> app(app(g,x),y) 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)) inc() -> app(map(),app(app(curry(),plus()),app(s(),0()))) double() -> app(map(),app(app(curry(),times()),app(s(),app(s(),0())))) Proof: Extended Uncurrying Processor: application symbol: app symbol table: double ==> double0/0 inc ==> inc0/0 cons ==> cons0/0 cons1/1 cons2/2 nil ==> nil0/0 map ==> map0/0 map1/1 map2/2 curry ==> curry0/0 curry1/1 curry2/2 curry3/3 times ==> times0/0 times1/1 times2/2 s ==> s0/0 s1/1 0 ==> 00/0 plus ==> plus0/0 plus1/1 plus2/2 uncurry-rules: app(plus1(x5),x6) -> plus2(x5,x6) app(plus0(),x5) -> plus1(x5) app(s0(),x9) -> s1(x9) app(times1(x11),x12) -> times2(x11,x12) app(times0(),x11) -> times1(x11) app(curry2(x14,x15),x16) -> curry3(x14,x15,x16) app(curry1(x14),x15) -> curry2(x14,x15) app(curry0(),x14) -> curry1(x14) app(map1(x18),x19) -> map2(x18,x19) app(map0(),x18) -> map1(x18) app(cons1(x22),x23) -> cons2(x22,x23) app(cons0(),x22) -> cons1(x22) eta-rules: problem: plus2(00(),y) -> y plus2(s1(x),y) -> s1(plus2(x,y)) times2(00(),y) -> 00() times2(s1(x),y) -> plus2(times2(x,y),y) curry3(g,x,y) -> app(app(g,x),y) map2(f,nil0()) -> nil0() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) inc0() -> map1(curry2(plus0(),s1(00()))) double0() -> map1(curry2(times0(),s1(s1(00())))) app(plus1(x5),x6) -> plus2(x5,x6) app(plus0(),x5) -> plus1(x5) app(s0(),x9) -> s1(x9) app(times1(x11),x12) -> times2(x11,x12) app(times0(),x11) -> times1(x11) app(curry2(x14,x15),x16) -> curry3(x14,x15,x16) app(curry1(x14),x15) -> curry2(x14,x15) app(curry0(),x14) -> curry1(x14) app(map1(x18),x19) -> map2(x18,x19) app(map0(),x18) -> map1(x18) app(cons1(x22),x23) -> cons2(x22,x23) app(cons0(),x22) -> cons1(x22) DP Processor: DPs: plus{2,#}(s1(x),y) -> plus{2,#}(x,y) times{2,#}(s1(x),y) -> times{2,#}(x,y) times{2,#}(s1(x),y) -> plus{2,#}(times2(x,y),y) curry{3,#}(g,x,y) -> app#(g,x) curry{3,#}(g,x,y) -> app#(app(g,x),y) map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) map{2,#}(f,cons2(x,xs)) -> app#(f,x) app#(plus1(x5),x6) -> plus{2,#}(x5,x6) app#(times1(x11),x12) -> times{2,#}(x11,x12) app#(curry2(x14,x15),x16) -> curry{3,#}(x14,x15,x16) app#(map1(x18),x19) -> map{2,#}(x18,x19) TRS: plus2(00(),y) -> y plus2(s1(x),y) -> s1(plus2(x,y)) times2(00(),y) -> 00() times2(s1(x),y) -> plus2(times2(x,y),y) curry3(g,x,y) -> app(app(g,x),y) map2(f,nil0()) -> nil0() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) inc0() -> map1(curry2(plus0(),s1(00()))) double0() -> map1(curry2(times0(),s1(s1(00())))) app(plus1(x5),x6) -> plus2(x5,x6) app(plus0(),x5) -> plus1(x5) app(s0(),x9) -> s1(x9) app(times1(x11),x12) -> times2(x11,x12) app(times0(),x11) -> times1(x11) app(curry2(x14,x15),x16) -> curry3(x14,x15,x16) popout

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

job log

popout

actions

all output return to TRS Stand 20472