SRS Standard pair #487085240

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	48.8374 seconds
cpu usage	191.393
user time	187.24
system time	4.15323
max virtual memory	1.125434E7
max residence set size	116640.0

stage attributes

key	value
starexec-result	YES

output

YES

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

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

popout

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

job log

popout

actions all output return to SRS Standard