SRS Standard pair #487083794

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	45.8834 seconds
cpu usage	179.976
user time	176.159
system time	3.81726
max virtual memory	1.1829852E7
max residence set size	101984.0

stage attributes

key	value
starexec-result	YES

output

YES

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

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

popout

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

job log

popout

actions all output return to SRS Standard