SRS Stand 10685 pair #381722807

details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	23.7150177956 seconds
cpu usage	93.436531475
max memory	1.200549888E9

stage attributes

key	value
output-size	4478
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

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

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

popout

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

job log

popout

actions all output return to SRS Stand 10685