SRS Stand 10685 pair #381719988

details

property	value
status	complete
benchmark	z066.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n111.star.cs.uiowa.edu
space	Zantema_04

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	1.72430205345 seconds
cpu usage	5.61649139
max memory	8.37476352E8

stage attributes

key	value
output-size	2437
starexec-result	YES

output

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


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


YES

Problem:
 a(b(c(x1))) -> c(b(a(x1)))
 C(B(A(x1))) -> A(B(C(x1)))
 b(a(C(x1))) -> C(a(b(x1)))
 c(A(B(x1))) -> B(A(c(x1)))
 A(c(b(x1))) -> b(c(A(x1)))
 B(C(a(x1))) -> a(C(B(x1)))
 a(A(x1)) -> x1
 A(a(x1)) -> x1
 b(B(x1)) -> x1
 B(b(x1)) -> x1
 c(C(x1)) -> x1
 C(c(x1)) -> x1

Proof:
 String Reversal Processor:
  c(b(a(x1))) -> a(b(c(x1)))
  A(B(C(x1))) -> C(B(A(x1)))
  C(a(b(x1))) -> b(a(C(x1)))
  B(A(c(x1))) -> c(A(B(x1)))
  b(c(A(x1))) -> A(c(b(x1)))
  a(C(B(x1))) -> B(C(a(x1)))
  A(a(x1)) -> x1
  a(A(x1)) -> x1
  B(b(x1)) -> x1
  b(B(x1)) -> x1
  C(c(x1)) -> x1
  c(C(x1)) -> x1
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [C](x0) = 2x0 + 1,
    
    [B](x0) = 3x0 + 2,
    
    [A](x0) = x0,
    
    [a](x0) = 5x0 + 4,
    
    [b](x0) = x0,
    
    [c](x0) = x0
   orientation:
    c(b(a(x1))) = 5x1 + 4 >= 5x1 + 4 = a(b(c(x1)))
    
    A(B(C(x1))) = 6x1 + 5 >= 6x1 + 5 = C(B(A(x1)))
    
    C(a(b(x1))) = 10x1 + 9 >= 10x1 + 9 = b(a(C(x1)))
    
    B(A(c(x1))) = 3x1 + 2 >= 3x1 + 2 = c(A(B(x1)))
    
    b(c(A(x1))) = x1 >= x1 = A(c(b(x1)))
    
    a(C(B(x1))) = 30x1 + 29 >= 30x1 + 29 = B(C(a(x1)))
    
    A(a(x1)) = 5x1 + 4 >= x1 = x1
    
    a(A(x1)) = 5x1 + 4 >= x1 = x1
    
    B(b(x1)) = 3x1 + 2 >= x1 = x1
    
    b(B(x1)) = 3x1 + 2 >= x1 = x1
    
    C(c(x1)) = 2x1 + 1 >= x1 = x1
    
    c(C(x1)) = 2x1 + 1 >= x1 = x1
   problem:
    c(b(a(x1))) -> a(b(c(x1)))
    A(B(C(x1))) -> C(B(A(x1)))
    C(a(b(x1))) -> b(a(C(x1)))
    B(A(c(x1))) -> c(A(B(x1)))
    b(c(A(x1))) -> A(c(b(x1)))
    a(C(B(x1))) -> B(C(a(x1)))
   Bounds Processor:
    bound: 0
    enrichment: match
    automaton:
     final states: {17,14,11,8,5,1}
     transitions:
      f60() -> 2*
      a0(2) -> 18*
      a0(9) -> 10*
      a0(4) -> 1*
      b0(10) -> 8*
      b0(2) -> 15*
      b0(3) -> 4*
      c0(15) -> 16*
      c0(2) -> 3*
      c0(13) -> 11*
      C0(7) -> 5*
      C0(2) -> 9*
      C0(18) -> 19*

popout

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

job log

popout

actions all output return to SRS Stand 10685