/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 3 rules on 2 letters       tile all, by Config   { method = Forward,width = 2,unlabel = False}
SRS with 27 rules on 9 letters       weights
SRS with 0 rules on 0 letters       no strict rules

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [b, b] -> [c, c, c, c] {- Input 0 -}
  [c] -> [] {- Input 1 -}
  [b, c, b] -> [b, b, b] {- Input 2 -}
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 1
  using 9 tiles
  tile all rules
  steps: 1
  
   property Termination
has value Just True
for SRS
  [[<, b], [b, b], [b, >]] -> [ [<, c] , [c, c] , [c, c] , [c, c] , [c, >] ] {- Semlab 0 (Concon 0 (Input 0)) -}
  [[<, b], [b, b], [b, b]] -> [ [<, c] , [c, c] , [c, c] , [c, c] , [c, b] ] {- Semlab 0 (Concon 1 (Input 0)) -}
  [[<, b], [b, b], [b, c]] -> [ [<, c] , [c, c] , [c, c] , [c, c] , [c, c] ] {- Semlab 0 (Concon 2 (Input 0)) -}
  [[b, b], [b, b], [b, >]] -> [ [b, c] , [c, c] , [c, c] , [c, c] , [c, >] ] {- Semlab 1 (Concon 0 (Input 0)) -}
  [[b, b], [b, b], [b, b]] -> [ [b, c] , [c, c] , [c, c] , [c, c] , [c, b] ] {- Semlab 1 (Concon 1 (Input 0)) -}
  [[b, b], [b, b], [b, c]] -> [ [b, c] , [c, c] , [c, c] , [c, c] , [c, c] ] {- Semlab 1 (Concon 2 (Input 0)) -}
  [[c, b], [b, b], [b, >]] -> [ [c, c] , [c, c] , [c, c] , [c, c] , [c, >] ] {- Semlab 2 (Concon 0 (Input 0)) -}
  [[c, b], [b, b], [b, b]] -> [ [c, c] , [c, c] , [c, c] , [c, c] , [c, b] ] {- Semlab 2 (Concon 1 (Input 0)) -}
  [[c, b], [b, b], [b, c]] -> [ [c, c] , [c, c] , [c, c] , [c, c] , [c, c] ] {- Semlab 2 (Concon 2 (Input 0)) -}
  [[<, c], [c, >]] -> [[<, >]] {- Semlab 0 (Concon 0 (Input 1)) -}
  [[<, c], [c, b]] -> [[<, b]] {- Semlab 0 (Concon 1 (Input 1)) -}
  [[<, c], [c, c]] -> [[<, c]] {- Semlab 0 (Concon 2 (Input 1)) -}
  [[b, c], [c, >]] -> [[b, >]] {- Semlab 1 (Concon 0 (Input 1)) -}
  [[b, c], [c, b]] -> [[b, b]] {- Semlab 1 (Concon 1 (Input 1)) -}
  [[b, c], [c, c]] -> [[b, c]] {- Semlab 1 (Concon 2 (Input 1)) -}
  [[c, c], [c, >]] -> [[c, >]] {- Semlab 2 (Concon 0 (Input 1)) -}
  [[c, c], [c, b]] -> [[c, b]] {- Semlab 2 (Concon 1 (Input 1)) -}
  [[c, c], [c, c]] -> [[c, c]] {- Semlab 2 (Concon 2 (Input 1)) -}
  [[<, b], [b, c], [c, b], [b, >]] -> [ [<, b] , [b, b] , [b, b] , [ b , > ] ] {- Semlab 0 (Concon 0 (Input 2)) -}
  [[<, b], [b, c], [c, b], [b, b]] -> [ [<, b] , [b, b] , [b, b] , [ b , b ] ] {- Semlab 0 (Concon 1 (Input 2)) -}
  [[<, b], [b, c], [c, b], [b, c]] -> [ [<, b] , [b, b] , [b, b] , [ b , c ] ] {- Semlab 0 (Concon 2 (Input 2)) -}
  [[b, b], [b, c], [c, b], [b, >]] -> [ [b, b] , [b, b] , [b, b] , [ b , > ] ] {- Semlab 1 (Concon 0 (Input 2)) -}
  [[b, b], [b, c], [c, b], [b, b]] -> [ [b, b] , [b, b] , [b, b] , [ b , b ] ] {- Semlab 1 (Concon 1 (Input 2)) -}
  [[b, b], [b, c], [c, b], [b, c]] -> [ [b, b] , [b, b] , [b, b] , [ b , c ] ] {- Semlab 1 (Concon 2 (Input 2)) -}
  [[c, b], [b, c], [c, b], [b, >]] -> [ [c, b] , [b, b] , [b, b] , [ b , > ] ] {- Semlab 2 (Concon 0 (Input 2)) -}
  [[c, b], [b, c], [c, b], [b, b]] -> [ [c, b] , [b, b] , [b, b] , [ b , b ] ] {- Semlab 2 (Concon 1 (Input 2)) -}
  [[c, b], [b, c], [c, b], [b, c]] -> [ [c, b] , [b, b] , [b, b] , [ b , c ] ] {- Semlab 2 (Concon 2 (Input 2)) -}
reason
  ([b, b], 97/1)
  ([b, >], 16/1)
  ([<, c], 16/1)
  ([c, c], 5/1)
  ([c, b], 65/1)
  ([b, c], 130/1)
   property Termination
has value Just True
for SRS
  
reason
  no strict rules

**************************************************
skeleton: (3,2)\TileAllRFC{2}(27,9)\Weight(0,0)[]
**************************************************
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)])