SRS Standard pair #487085414

details

property	value
status	complete
benchmark	size-12-alpha-3-num-448.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)	44.8403 seconds
cpu usage	175.615
user time	171.7
system time	3.91513
max virtual memory	1.1642808E7
max residence set size	101948.0

stage attributes

key	value
starexec-result	YES

output

YES

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

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

popout

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

job log

popout

actions all output return to SRS Standard