SRS Standard pair #487083926

details

property	value
status	complete
benchmark	size-12-alpha-3-num-299.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n140.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	46.8558 seconds
cpu usage	183.673
user time	179.114
system time	4.5592
max virtual memory	1.18309E7
max residence set size	116456.0

stage attributes

key	value
starexec-result	YES

output

YES

Problem:
 a(x1) -> x1
 a(b(b(x1))) -> b(b(b(c(x1))))
 b(c(x1)) -> a(a(x1))

Proof:
 String Reversal Processor:
  a(x1) -> x1
  b(b(a(x1))) -> c(b(b(b(x1))))
  c(b(x1)) -> a(a(x1))
  DP Processor:
   DPs:
    b#(b(a(x1))) -> b#(x1)
    b#(b(a(x1))) -> b#(b(x1))
    b#(b(a(x1))) -> b#(b(b(x1)))
    b#(b(a(x1))) -> c#(b(b(b(x1))))
    c#(b(x1)) -> a#(x1)
    c#(b(x1)) -> a#(a(x1))
   TRS:
    a(x1) -> x1
    b(b(a(x1))) -> c(b(b(b(x1))))
    c(b(x1)) -> a(a(x1))
   TDG Processor:
    DPs:
     b#(b(a(x1))) -> b#(x1)
     b#(b(a(x1))) -> b#(b(x1))
     b#(b(a(x1))) -> b#(b(b(x1)))
     b#(b(a(x1))) -> c#(b(b(b(x1))))
     c#(b(x1)) -> a#(x1)
     c#(b(x1)) -> a#(a(x1))
    TRS:
     a(x1) -> x1
     b(b(a(x1))) -> c(b(b(b(x1))))
     c(b(x1)) -> a(a(x1))
    graph:
     b#(b(a(x1))) -> c#(b(b(b(x1)))) -> c#(b(x1)) -> a#(a(x1))
     b#(b(a(x1))) -> c#(b(b(b(x1)))) -> c#(b(x1)) -> a#(x1)
     b#(b(a(x1))) -> b#(b(b(x1))) -> b#(b(a(x1))) -> c#(b(b(b(x1))))
     b#(b(a(x1))) -> b#(b(b(x1))) -> b#(b(a(x1))) -> b#(b(b(x1)))
     b#(b(a(x1))) -> b#(b(b(x1))) -> b#(b(a(x1))) -> b#(b(x1))
     b#(b(a(x1))) -> b#(b(b(x1))) -> b#(b(a(x1))) -> b#(x1)
     b#(b(a(x1))) -> b#(b(x1)) -> b#(b(a(x1))) -> c#(b(b(b(x1))))
     b#(b(a(x1))) -> b#(b(x1)) -> b#(b(a(x1))) -> b#(b(b(x1)))
     b#(b(a(x1))) -> b#(b(x1)) -> b#(b(a(x1))) -> b#(b(x1))
     b#(b(a(x1))) -> b#(b(x1)) -> b#(b(a(x1))) -> b#(x1)
     b#(b(a(x1))) -> b#(x1) -> b#(b(a(x1))) -> c#(b(b(b(x1))))
     b#(b(a(x1))) -> b#(x1) -> b#(b(a(x1))) -> b#(b(b(x1)))
     b#(b(a(x1))) -> b#(x1) -> b#(b(a(x1))) -> b#(b(x1))
     b#(b(a(x1))) -> b#(x1) -> b#(b(a(x1))) -> b#(x1)
    SCC Processor:
     #sccs: 1
     #rules: 3
     #arcs: 14/36
     DPs:
      b#(b(a(x1))) -> b#(b(b(x1)))
      b#(b(a(x1))) -> b#(x1)
      b#(b(a(x1))) -> b#(b(x1))
     TRS:
      a(x1) -> x1
      b(b(a(x1))) -> c(b(b(b(x1))))
      c(b(x1)) -> a(a(x1))
     Arctic Interpretation Processor:
      dimension: 2
      usable rules:
       a(x1) -> x1
       b(b(a(x1))) -> c(b(b(b(x1))))
       c(b(x1)) -> a(a(x1))
      interpretation:
       [b#](x0) = [0 0]x0,
       
                 [0 0]     [-&]
       [b](x0) = [1 0]x0 + [0 ],
       
                 [0 0]     [-&]
       [a](x0) = [0 0]x0 + [0 ],
       
                 [0  -&]     [0]
       [c](x0) = [0  -&]x0 + [0]
      orientation:
       b#(b(a(x1))) = [1 1]x1 + [0] >= [1 1]x1 + [0] = b#(b(b(x1)))
       
       b#(b(a(x1))) = [1 1]x1 + [0] >= [0 0]x1 = b#(x1)
       
       b#(b(a(x1))) = [1 1]x1 + [0] >= [1 0]x1 + [0] = b#(b(x1))
       
               [0 0]     [-&]           
       a(x1) = [0 0]x1 + [0 ] >= x1 = x1
       
                     [1 1]     [0]    [1 1]     [0]                 
       b(b(a(x1))) = [1 1]x1 + [1] >= [1 1]x1 + [0] = c(b(b(b(x1))))
       
                  [0 0]     [0]    [0 0]     [0]           
       c(b(x1)) = [0 0]x1 + [0] >= [0 0]x1 + [0] = a(a(x1))
      problem:
       DPs:
        b#(b(a(x1))) -> b#(b(b(x1)))
        b#(b(a(x1))) -> b#(b(x1))
       TRS:

popout

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

job log

popout

actions all output return to SRS Standard