TRS Standard pair #487068587

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.886919 seconds
cpu usage	2.24227
user time	1.42521
system time	0.817056
max virtual memory	3882700.0
max residence set size	70404.0

stage attributes

key	value
starexec-result	YES

output

YES

Problem:
 f(f(a(),x),a()) -> f(f(x,f(a(),f(a(),a()))),a())

Proof:
 Extended Uncurrying Processor:
  application symbol: f
  symbol table:
   a ==> a0/0 a1/1 a2/2
   
  uncurry-rules:
   f(a1(x1),x2) -> a2(x1,x2)
   f(a0(),x1) -> a1(x1)
  eta-rules:
   
  problem:
   a2(x,a0()) -> f(f(x,a1(a1(a0()))),a0())
   f(a1(x1),x2) -> a2(x1,x2)
   f(a0(),x1) -> a1(x1)
  DP Processor:
   DPs:
    a{2,#}(x,a0()) -> f#(x,a1(a1(a0())))
    a{2,#}(x,a0()) -> f#(f(x,a1(a1(a0()))),a0())
    f#(a1(x1),x2) -> a{2,#}(x1,x2)
   TRS:
    a2(x,a0()) -> f(f(x,a1(a1(a0()))),a0())
    f(a1(x1),x2) -> a2(x1,x2)
    f(a0(),x1) -> a1(x1)
   TDG Processor:
    DPs:
     a{2,#}(x,a0()) -> f#(x,a1(a1(a0())))
     a{2,#}(x,a0()) -> f#(f(x,a1(a1(a0()))),a0())
     f#(a1(x1),x2) -> a{2,#}(x1,x2)
    TRS:
     a2(x,a0()) -> f(f(x,a1(a1(a0()))),a0())
     f(a1(x1),x2) -> a2(x1,x2)
     f(a0(),x1) -> a1(x1)
    graph:
     f#(a1(x1),x2) -> a{2,#}(x1,x2) ->
     a{2,#}(x,a0()) -> f#(f(x,a1(a1(a0()))),a0())
     f#(a1(x1),x2) -> a{2,#}(x1,x2) ->
     a{2,#}(x,a0()) -> f#(x,a1(a1(a0())))
     a{2,#}(x,a0()) -> f#(f(x,a1(a1(a0()))),a0()) ->
     f#(a1(x1),x2) -> a{2,#}(x1,x2)
     a{2,#}(x,a0()) -> f#(x,a1(a1(a0()))) -> f#(a1(x1),x2) -> a{2,#}(x1,x2)
    Bounds Processor:
     bound: 0
     enrichment: match-dp
     automaton:
      final states: {1}
      transitions:
       f70() -> 5*
       a{2,#,0}(5,4) -> 1*
       f{#,0}(5,4) -> 1*
       a{0,0}() -> 2*
       a{1,0}(2) -> 3*
       a{1,0}(3) -> 4*
     problem:
      DPs:
       a{2,#}(x,a0()) -> f#(f(x,a1(a1(a0()))),a0())
       f#(a1(x1),x2) -> a{2,#}(x1,x2)
      TRS:
       a2(x,a0()) -> f(f(x,a1(a1(a0()))),a0())
       f(a1(x1),x2) -> a2(x1,x2)
       f(a0(),x1) -> a1(x1)
     Bounds Processor:
      bound: 1
      enrichment: match-dp
      automaton:
       final states: {1}
       transitions:
        a{1,1}(13) -> 14*
        a{1,1}(14) -> 15*
        a{0,1}() -> 13*
        a{2,0}(5,4) -> 6*
        f150() -> 5*
        a{2,#,0}(4,2) -> 1*
        f0(5,4) -> 6*
        f{#,0}(6,2) -> 1*
        a{0,0}() -> 2*
        a{1,0}(2) -> 3*
        a{1,0}(4) -> 6*
        a{1,0}(3) -> 4*
        f{#,1}(16,13) -> 1*
        f1(4,15) -> 16*
        a{2,1}(3,15) -> 16*
      problem:
       DPs:
        f#(a1(x1),x2) -> a{2,#}(x1,x2)
       TRS:
        a2(x,a0()) -> f(f(x,a1(a1(a0()))),a0())
        f(a1(x1),x2) -> a2(x1,x2)
        f(a0(),x1) -> a1(x1)
      SCC Processor:
       #sccs: 0
       #rules: 0
       #arcs: 4/1

popout

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

job log

popout

actions all output return to TRS Standard