TRS Standard pair #487073677

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.528604 seconds
cpu usage	1.00811
user time	0.794951
system time	0.213158
max virtual memory	96176.0
max residence set size	64904.0

stage attributes

key	value
starexec-result	YES

output

YES

Problem:
 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(treemap(),f),app(app(node(),x),xs)) ->
 app(app(node(),app(f,x)),app(app(map(),app(treemap(),f)),xs))

Proof:
 Extended Uncurrying Processor:
  application symbol: app
  symbol table:
   node ==> node0/0 node1/1 node2/2
   treemap ==> treemap0/0 treemap1/1 treemap2/2
   cons ==> cons0/0 cons1/1 cons2/2
   nil ==> nil0/0
   map ==> map0/0 map1/1 map2/2
   
  uncurry-rules:
   app(map1(x3),x4) -> map2(x3,x4)
   app(map0(),x3) -> map1(x3)
   app(cons1(x7),x8) -> cons2(x7,x8)
   app(cons0(),x7) -> cons1(x7)
   app(treemap1(x10),x11) -> treemap2(x10,x11)
   app(treemap0(),x10) -> treemap1(x10)
   app(node1(x13),x14) -> node2(x13,x14)
   app(node0(),x13) -> node1(x13)
  eta-rules:
   
  problem:
   map2(f,nil0()) -> nil0()
   map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs))
   treemap2(f,node2(x,xs)) -> node2(app(f,x),map2(treemap1(f),xs))
   app(map1(x3),x4) -> map2(x3,x4)
   app(map0(),x3) -> map1(x3)
   app(cons1(x7),x8) -> cons2(x7,x8)
   app(cons0(),x7) -> cons1(x7)
   app(treemap1(x10),x11) -> treemap2(x10,x11)
   app(treemap0(),x10) -> treemap1(x10)
   app(node1(x13),x14) -> node2(x13,x14)
   app(node0(),x13) -> node1(x13)
  DP Processor:
   DPs:
    map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs)
    map{2,#}(f,cons2(x,xs)) -> app#(f,x)
    treemap{2,#}(f,node2(x,xs)) -> map{2,#}(treemap1(f),xs)
    treemap{2,#}(f,node2(x,xs)) -> app#(f,x)
    app#(map1(x3),x4) -> map{2,#}(x3,x4)
    app#(treemap1(x10),x11) -> treemap{2,#}(x10,x11)
   TRS:
    map2(f,nil0()) -> nil0()
    map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs))
    treemap2(f,node2(x,xs)) -> node2(app(f,x),map2(treemap1(f),xs))
    app(map1(x3),x4) -> map2(x3,x4)
    app(map0(),x3) -> map1(x3)
    app(cons1(x7),x8) -> cons2(x7,x8)
    app(cons0(),x7) -> cons1(x7)
    app(treemap1(x10),x11) -> treemap2(x10,x11)
    app(treemap0(),x10) -> treemap1(x10)
    app(node1(x13),x14) -> node2(x13,x14)
    app(node0(),x13) -> node1(x13)
   TDG Processor:
    DPs:
     map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs)
     map{2,#}(f,cons2(x,xs)) -> app#(f,x)
     treemap{2,#}(f,node2(x,xs)) -> map{2,#}(treemap1(f),xs)
     treemap{2,#}(f,node2(x,xs)) -> app#(f,x)
     app#(map1(x3),x4) -> map{2,#}(x3,x4)
     app#(treemap1(x10),x11) -> treemap{2,#}(x10,x11)
    TRS:
     map2(f,nil0()) -> nil0()
     map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs))
     treemap2(f,node2(x,xs)) -> node2(app(f,x),map2(treemap1(f),xs))
     app(map1(x3),x4) -> map2(x3,x4)
     app(map0(),x3) -> map1(x3)
     app(cons1(x7),x8) -> cons2(x7,x8)
     app(cons0(),x7) -> cons1(x7)
     app(treemap1(x10),x11) -> treemap2(x10,x11)
     app(treemap0(),x10) -> treemap1(x10)
     app(node1(x13),x14) -> node2(x13,x14)
     app(node0(),x13) -> node1(x13)
    graph:
     treemap{2,#}(f,node2(x,xs)) -> app#(f,x) ->
     app#(treemap1(x10),x11) -> treemap{2,#}(x10,x11)
     treemap{2,#}(f,node2(x,xs)) -> app#(f,x) ->
     app#(map1(x3),x4) -> map{2,#}(x3,x4)
     treemap{2,#}(f,node2(x,xs)) -> map{2,#}(treemap1(f),xs) ->
     map{2,#}(f,cons2(x,xs)) -> app#(f,x)
     treemap{2,#}(f,node2(x,xs)) -> map{2,#}(treemap1(f),xs) ->
     map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs)
     app#(treemap1(x10),x11) -> treemap{2,#}(x10,x11) ->
     treemap{2,#}(f,node2(x,xs)) -> app#(f,x)
     app#(treemap1(x10),x11) -> treemap{2,#}(x10,x11) ->
     treemap{2,#}(f,node2(x,xs)) -> map{2,#}(treemap1(f),xs)
     app#(map1(x3),x4) -> map{2,#}(x3,x4) ->
     map{2,#}(f,cons2(x,xs)) -> app#(f,x)
     app#(map1(x3),x4) -> map{2,#}(x3,x4) ->
     map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs)
     map{2,#}(f,cons2(x,xs)) -> app#(f,x) ->
     app#(treemap1(x10),x11) -> treemap{2,#}(x10,x11)

popout

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

job log

popout

actions all output return to TRS Standard