SRS Standard pair #487512291

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	45.8377809525 seconds
cpu usage	180.664399657
max memory	1.7009664E9

stage attributes

key	value
output-size	5572
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(b(x1))
 a(b(x1)) -> c(c(x1))
 b(c(x1)) -> a(a(x1))

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

popout

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

job log

popout

actions all output return to SRS Standard