SRS Relative pair #487521249

details

property	value
status	complete
benchmark	random-93.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n142.star.cs.uiowa.edu
space	Waldmann_19

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	5.8313639164 seconds
cpu usage	11.844465077
max memory	1.300553728E9

stage attributes

key	value
output-size	3752
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:
 strict:
  c(a(b(x1))) -> c(a(c(x1)))
  a(a(a(x1))) -> c(a(a(x1)))
  a(b(a(x1))) -> c(a(c(x1)))
  a(b(b(x1))) -> a(c(b(x1)))
 weak:
  a(b(b(x1))) -> a(a(c(x1)))
  b(c(c(x1))) -> b(a(b(x1)))

Proof:
 String Reversal Processor:
  strict:
   b(a(c(x1))) -> c(a(c(x1)))
   a(a(a(x1))) -> a(a(c(x1)))
   a(b(a(x1))) -> c(a(c(x1)))
   b(b(a(x1))) -> b(c(a(x1)))
  weak:
   b(b(a(x1))) -> c(a(a(x1)))
   c(c(b(x1))) -> b(a(b(x1)))
  Matrix Interpretation Processor: dim=2
   
   interpretation:
              [1 0]  
    [a](x0) = [0 0]x0,
    
              [1 1]     [0]
    [b](x0) = [0 0]x0 + [2],
    
                
    [c](x0) = x0
   orientation:
                  [1 0]     [0]    [1 0]                
    b(a(c(x1))) = [0 0]x1 + [2] >= [0 0]x1 = c(a(c(x1)))
    
                  [1 0]      [1 0]                
    a(a(a(x1))) = [0 0]x1 >= [0 0]x1 = a(a(c(x1)))
    
                  [1 0]      [1 0]                
    a(b(a(x1))) = [0 0]x1 >= [0 0]x1 = c(a(c(x1)))
    
                  [1 0]     [2]    [1 0]     [0]              
    b(b(a(x1))) = [0 0]x1 + [2] >= [0 0]x1 + [2] = b(c(a(x1)))
    
                  [1 0]     [2]    [1 0]                
    b(b(a(x1))) = [0 0]x1 + [2] >= [0 0]x1 = c(a(a(x1)))
    
                  [1 1]     [0]    [1 1]     [0]              
    c(c(b(x1))) = [0 0]x1 + [2] >= [0 0]x1 + [2] = b(a(b(x1)))
   problem:
    strict:
     b(a(c(x1))) -> c(a(c(x1)))
     a(a(a(x1))) -> a(a(c(x1)))
     a(b(a(x1))) -> c(a(c(x1)))
    weak:
     c(c(b(x1))) -> b(a(b(x1)))
   Bounds Processor:
    bound: 2
    enrichment: match-rt
    automaton:
     final states: {4}
     transitions:
      c1(11) -> 12*
      c1(9) -> 10*
      c1(84) -> 85*
      c1(82) -> 83*
      b1(45) -> 46*
      b1(43) -> 44*
      a1(83) -> 84*
      a1(10) -> 11*
      a1(37) -> 38*
      a1(44) -> 45*
      b0(4) -> 4*
      c0(4) -> 4*
      a0(4) -> 4*
      c2(68) -> 69*
      c2(70) -> 71*
      a2(69) -> 70*
      46 -> 10*
      85 -> 11*
      12 -> 45,44,37,4
      4 -> 43,9
      11 -> 68*
      38 -> 11*
      44 -> 82*
      71 -> 46*
    problem:
     strict:
      a(a(a(x1))) -> a(a(c(x1)))
      a(b(a(x1))) -> c(a(c(x1)))
     weak:
      c(c(b(x1))) -> b(a(b(x1)))

popout

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

job log

popout

actions all output return to SRS Relative