SRS Stand 10685 pair #381719327

details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	21.7521579266 seconds
cpu usage	85.61371456
max memory	7.45689088E8

stage attributes

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

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

popout

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

job log

popout

actions all output return to SRS Stand 10685