SRS Stand 10685 pair #381720387

details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	22.1104011536 seconds
cpu usage	87.045125444
max memory	8.12023808E8

stage attributes

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

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

popout

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

job log

popout

actions all output return to SRS Stand 10685