SRS Standard pair #487084250

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	46.6558 seconds
cpu usage	182.524
user time	178.313
system time	4.21104
max virtual memory	1.1571552E7
max residence set size	101992.0

stage attributes

key	value
starexec-result	YES

output

YES

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

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

popout

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

job log

popout

actions all output return to SRS Standard