SRS Relative pair #487082015

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	3.29465 seconds
cpu usage	11.8838
user time	9.93092
system time	1.95286
max virtual memory	7306016.0
max residence set size	76788.0

stage attributes

key	value
starexec-result	YES

output

YES

Problem:
 strict:
  n(s(x1)) -> s(x1)
  o(s(x1)) -> s(x1)
  n(o(p(x1))) -> o(n(x1))
 weak:
  t(x1) -> t(c(n(x1)))
  p(s(x1)) -> s(x1)
  o(n(x1)) -> n(o(x1))
  p(n(x1)) -> m(p(x1))
  p(m(x1)) -> m(p(x1))
  o(m(x1)) -> n(o(x1))
  n(p(x1)) -> p(n(x1))
  c(p(x1)) -> p(c(x1))
  c(m(x1)) -> m(c(x1))
  c(n(x1)) -> n(c(x1))
  c(o(x1)) -> o(c(x1))
  c(o(x1)) -> o(x1)

Proof:
 String Reversal Processor:
  strict:
   s(n(x1)) -> s(x1)
   s(o(x1)) -> s(x1)
   p(o(n(x1))) -> n(o(x1))
  weak:
   t(x1) -> n(c(t(x1)))
   s(p(x1)) -> s(x1)
   n(o(x1)) -> o(n(x1))
   n(p(x1)) -> p(m(x1))
   m(p(x1)) -> p(m(x1))
   m(o(x1)) -> o(n(x1))
   p(n(x1)) -> n(p(x1))
   p(c(x1)) -> c(p(x1))
   m(c(x1)) -> c(m(x1))
   n(c(x1)) -> c(n(x1))
   o(c(x1)) -> c(o(x1))
   o(c(x1)) -> o(x1)
  Arctic Interpretation Processor:
   dimension: 1
   interpretation:
    [t](x0) = x0,
    
    [n](x0) = x0,
    
    [p](x0) = 4x0,
    
    [c](x0) = x0,
    
    [s](x0) = x0,
    
    [m](x0) = x0,
    
    [o](x0) = 8x0
   orientation:
    s(n(x1)) = x1 >= x1 = s(x1)
    
    s(o(x1)) = 8x1 >= x1 = s(x1)
    
    p(o(n(x1))) = 12x1 >= 8x1 = n(o(x1))
    
    t(x1) = x1 >= x1 = n(c(t(x1)))
    
    s(p(x1)) = 4x1 >= x1 = s(x1)
    
    n(o(x1)) = 8x1 >= 8x1 = o(n(x1))
    
    n(p(x1)) = 4x1 >= 4x1 = p(m(x1))
    
    m(p(x1)) = 4x1 >= 4x1 = p(m(x1))
    
    m(o(x1)) = 8x1 >= 8x1 = o(n(x1))
    
    p(n(x1)) = 4x1 >= 4x1 = n(p(x1))
    
    p(c(x1)) = 4x1 >= 4x1 = c(p(x1))
    
    m(c(x1)) = x1 >= x1 = c(m(x1))
    
    n(c(x1)) = x1 >= x1 = c(n(x1))
    
    o(c(x1)) = 8x1 >= 8x1 = c(o(x1))
    
    o(c(x1)) = 8x1 >= 8x1 = o(x1)
   problem:
    strict:
     s(n(x1)) -> s(x1)
    weak:
     t(x1) -> n(c(t(x1)))
     n(o(x1)) -> o(n(x1))
     n(p(x1)) -> p(m(x1))
     m(p(x1)) -> p(m(x1))
     m(o(x1)) -> o(n(x1))
     p(n(x1)) -> n(p(x1))
     p(c(x1)) -> c(p(x1))
     m(c(x1)) -> c(m(x1))
     n(c(x1)) -> c(n(x1))
     o(c(x1)) -> c(o(x1))

popout

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

job log

popout

actions all output return to SRS Relative