SRS Standard pair #516973148

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	47.5584030151 seconds
cpu usage	188.643882164
max memory	1.659445248E9

stage attributes

key	value
output-size	4312
starexec-result	YES

output

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


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


YES

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

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

popout

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

job log

popout

actions all output return to SRS Standard