/export/starexec/sandbox2/solver/bin/starexec_run_tc20-std.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES
**************************************************
summary
**************************************************
SRS with 7 rules on 5 letters       tile all, by Config   { method = Forward,width = 2,unlabel = False}
SRS with 35 rules on 19 letters       weights
SRS with 4 rules on 4 letters       unlabel
SRS with 1 rules on 2 letters       Matchbound   { method = RFC, max_size = Nothing, max_bound = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 7 states

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [1, q0, 1] -> [0, 1, q1] {- Input 0 -}
  [1, q0, 0] -> [0, 0, q1] {- Input 1 -}
  [1, q1, 1] -> [1, 1, q1] {- Input 2 -}
  [1, q1, 0] -> [1, 0, q1] {- Input 3 -}
  [0, q1] -> [q2, 1] {- Input 4 -}
  [1, q2] -> [q2, 1] {- Input 5 -}
  [0, q2] -> [0, q0] {- Input 6 -}
reason
  Tiling   { method = Forward, width = 2, state_type = Bit64, map_type = Enum, unlabel = False, print_completion_steps = False, print_tiles = False, verbose = False, tracing = False}
  steps 2
  using 21 tiles
  tile all rules
  steps: 2
  
   property Termination
has value Just True
for SRS
  [[<, 0], [0, q1], [q1, >]] -> [ [<, q2] , [q2, 1] , [1, >] ] {- Semlab 0 (Concon 0 (Input 4)) -}
  [[1, 0], [0, q1], [q1, >]] -> [ [1, q2] , [q2, 1] , [1, >] ] {- Semlab 1 (Concon 0 (Input 4)) -}
  [[q0, 0], [0, q1], [q1, >]] -> [ [q0, q2] , [q2, 1] , [1, >] ] {- Semlab 2 (Concon 0 (Input 4)) -}
  [[0, 0], [0, q1], [q1, >]] -> [ [0, q2] , [q2, 1] , [1, >] ] {- Semlab 3 (Concon 0 (Input 4)) -}
  [[q2, 0], [0, q1], [q1, >]] -> [ [q2, q2] , [q2, 1] , [1, >] ] {- Semlab 4 (Concon 0 (Input 4)) -}
  [[<, 1], [1, q2], [q2, 1]] -> [ [<, q2] , [q2, 1] , [1, 1] ] {- Semlab 0 (Concon 0 (Input 5)) -}
  [[<, 1], [1, q2], [q2, 0]] -> [ [<, q2] , [q2, 1] , [1, 0] ] {- Semlab 0 (Concon 1 (Input 5)) -}
  [[<, 1], [1, q2], [q2, q2]] -> [ [<, q2] , [q2, 1] , [1, q2] ] {- Semlab 0 (Concon 2 (Input 5)) -}
  [[1, 1], [1, q2], [q2, 1]] -> [ [1, q2] , [q2, 1] , [1, 1] ] {- Semlab 1 (Concon 0 (Input 5)) -}
  [[1, 1], [1, q2], [q2, 0]] -> [ [1, q2] , [q2, 1] , [1, 0] ] {- Semlab 1 (Concon 1 (Input 5)) -}
  [[1, 1], [1, q2], [q2, q2]] -> [ [1, q2] , [q2, 1] , [1, q2] ] {- Semlab 1 (Concon 2 (Input 5)) -}
  [[q0, 1], [1, q2], [q2, 1]] -> [ [q0, q2] , [q2, 1] , [1, 1] ] {- Semlab 2 (Concon 0 (Input 5)) -}
  [[q0, 1], [1, q2], [q2, 0]] -> [ [q0, q2] , [q2, 1] , [1, 0] ] {- Semlab 2 (Concon 1 (Input 5)) -}
  [[q0, 1], [1, q2], [q2, q2]] -> [ [q0, q2] , [q2, 1] , [1, q2] ] {- Semlab 2 (Concon 2 (Input 5)) -}
  [[0, 1], [1, q2], [q2, 1]] -> [ [0, q2] , [q2, 1] , [1, 1] ] {- Semlab 3 (Concon 0 (Input 5)) -}
  [[0, 1], [1, q2], [q2, 0]] -> [ [0, q2] , [q2, 1] , [1, 0] ] {- Semlab 3 (Concon 1 (Input 5)) -}
  [[0, 1], [1, q2], [q2, q2]] -> [ [0, q2] , [q2, 1] , [1, q2] ] {- Semlab 3 (Concon 2 (Input 5)) -}
  [[q2, 1], [1, q2], [q2, 1]] -> [ [q2, q2] , [q2, 1] , [1, 1] ] {- Semlab 4 (Concon 0 (Input 5)) -}
  [[q2, 1], [1, q2], [q2, 0]] -> [ [q2, q2] , [q2, 1] , [1, 0] ] {- Semlab 4 (Concon 1 (Input 5)) -}
  [[q2, 1], [1, q2], [q2, q2]] -> [ [q2, q2] , [q2, 1] , [1, q2] ] {- Semlab 4 (Concon 2 (Input 5)) -}
  [[<, 0], [0, q2], [q2, 1]] -> [ [<, 0] , [0, q0] , [q0, 1] ] {- Semlab 0 (Concon 0 (Input 6)) -}
  [[<, 0], [0, q2], [q2, 0]] -> [ [<, 0] , [0, q0] , [q0, 0] ] {- Semlab 0 (Concon 1 (Input 6)) -}
  [[<, 0], [0, q2], [q2, q2]] -> [ [<, 0] , [0, q0] , [q0, q2] ] {- Semlab 0 (Concon 2 (Input 6)) -}
  [[1, 0], [0, q2], [q2, 1]] -> [ [1, 0] , [0, q0] , [q0, 1] ] {- Semlab 1 (Concon 0 (Input 6)) -}
  [[1, 0], [0, q2], [q2, 0]] -> [ [1, 0] , [0, q0] , [q0, 0] ] {- Semlab 1 (Concon 1 (Input 6)) -}
  [[1, 0], [0, q2], [q2, q2]] -> [ [1, 0] , [0, q0] , [q0, q2] ] {- Semlab 1 (Concon 2 (Input 6)) -}
  [[q0, 0], [0, q2], [q2, 1]] -> [ [q0, 0] , [0, q0] , [q0, 1] ] {- Semlab 2 (Concon 0 (Input 6)) -}
  [[q0, 0], [0, q2], [q2, 0]] -> [ [q0, 0] , [0, q0] , [q0, 0] ] {- Semlab 2 (Concon 1 (Input 6)) -}
  [[q0, 0], [0, q2], [q2, q2]] -> [ [q0, 0] , [0, q0] , [q0, q2] ] {- Semlab 2 (Concon 2 (Input 6)) -}
  [[0, 0], [0, q2], [q2, 1]] -> [ [0, 0] , [0, q0] , [q0, 1] ] {- Semlab 3 (Concon 0 (Input 6)) -}
  [[0, 0], [0, q2], [q2, 0]] -> [ [0, 0] , [0, q0] , [q0, 0] ] {- Semlab 3 (Concon 1 (Input 6)) -}
  [[0, 0], [0, q2], [q2, q2]] -> [ [0, 0] , [0, q0] , [q0, q2] ] {- Semlab 3 (Concon 2 (Input 6)) -}
  [[q2, 0], [0, q2], [q2, 1]] -> [ [q2, 0] , [0, q0] , [q0, 1] ] {- Semlab 4 (Concon 0 (Input 6)) -}
  [[q2, 0], [0, q2], [q2, 0]] -> [ [q2, 0] , [0, q0] , [q0, 0] ] {- Semlab 4 (Concon 1 (Input 6)) -}
  [[q2, 0], [0, q2], [q2, q2]] -> [ [q2, 0] , [0, q0] , [q0, q2] ] {- Semlab 4 (Concon 2 (Input 6)) -}
reason
  ([<, 0], 4/3)
  ([0, q1], 20/3)
  ([q1, >], 20/3)
  ([0, 0], 4/3)
  ([0, q2], 3/1)
  ([q2, 0], 44/3)
  ([<, 1], 4/1)
  ([q0, 1], 2/1)
  ([0, 1], 4/1)
   property Termination
has value Just True
for SRS
  [[1, 1], [1, q2], [q2, 1]] -> [ [1, q2] , [q2, 1] , [1, 1] ] {- Semlab 1 (Concon 0 (Input 5)) -}
  [[1, 1], [1, q2], [q2, q2]] -> [ [1, q2] , [q2, 1] , [1, q2] ] {- Semlab 1 (Concon 2 (Input 5)) -}
  [[q2, 1], [1, q2], [q2, 1]] -> [ [q2, q2] , [q2, 1] , [1, 1] ] {- Semlab 4 (Concon 0 (Input 5)) -}
  [[q2, 1], [1, q2], [q2, q2]] -> [ [q2, q2] , [q2, 1] , [1, q2] ] {- Semlab 4 (Concon 2 (Input 5)) -}
reason
  unlabel
   property Termination
has value Just True
for SRS
  [0, 4] -> [4, 0] {- Input 5 -}
reason
  Matchbound
    Matchbound   { method = RFC, max_size = Nothing, max_bound = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 7 states

**************************************************
skeleton: (7,5)\TileAllRFC{2}(35,19)\Weight(4,4)\Unlabel(1,2)\Rfcmatchbound{1}[]
**************************************************
let {}
in let {trac = False;done = Worker No_Strict_Rules;mo = Pre (Or_Else Count (IfSizeLeq 10000 GLPK Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;tiling = \ m w -> weighted (And_Then (Worker (Tiling {method = m,width = w,unlabel = False})) (Worker Remap));when_small = \ m -> And_Then (Worker (SizeAtmost 1000)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;solver = Minisatapi;qpi = \ dim bits -> weighted (when_small (Worker (QPI {tracing = trac,dim = dim,bits = bits,solver = solver})));matrix = \ dom dim bits -> weighted (when_small (Worker (Matrix {monotone = Weak,domain = dom,dim = dim,bits = bits,tracing = trac,solver = solver})));kbo = \ b -> weighted (when_small (Worker (KBO {bits = b,solver = solver})));mb = Worker (Matchbound {method = RFC,max_size = 100000});remove = First_Of ([ Worker (Weight {modus = mo})] <> ([ Seq [ qpi 2 4, qpi 3 4, qpi 4 4], Seq [ qpi 5 4, qpi 6 3, qpi 7 3]] <> ([ Seq [ matrix Arctic 2 5, matrix Arctic 3 4, matrix Arctic 4 3], Seq [ matrix Natural 2 5, matrix Natural 3 4, matrix Natural 4 3]] <> [ kbo 1, And_Then (Worker Mirror) (And_Then (kbo 1) (Worker Mirror))])));dp = As_Transformer (Apply (And_Then (Worker (DP {tracing = True})) (Worker Remap)) (Apply wop (Branch (Worker (EDG {tracing = True})) remove)));noh = [ Worker (Enumerate {closure = Forward}), Worker (Enumerate {closure = Backward})];yeah = Tree_Search_Preemptive 0 done ([ Worker (Weight {modus = mo}), mb, And_Then (Worker Mirror) mb, dp, And_Then (Worker Mirror) dp, tiling Forward 2, And_Then (Worker Mirror) (tiling Forward 2)] <> [ Worker (Unlabel {verbose = True})])}
  in Apply (Worker Remap) (Seq [ Worker KKST01, First_Of ([ yeah] <> noh)])