SRS Standard pair #487513017

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	48.5420751572 seconds
cpu usage	192.393983348
max memory	1.652543488E9

stage attributes

key	value
output-size	8365
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

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

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

popout

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

job log

popout

actions all output return to SRS Standard