SRS Standard pair #487084874

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	42.2775 seconds
cpu usage	165.583
user time	162.662
system time	2.92141
max virtual memory	1.0188836E7
max residence set size	101936.0

stage attributes

key	value
starexec-result	YES

output

YES

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

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

popout

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

job log

popout

actions all output return to SRS Standard