/export/starexec/sandbox/solver/bin/starexec_run_tc20-rel.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES
**************************************************
summary
**************************************************
SRS with 54 strict rules and 6 weak rules on 6 letters       remove some, by Config   { method = Overlap,width = 5,unlabel = True}
SRS with 6 strict rules and 2 weak rules on 6 letters       weights
SRS with 2 strict rules and 2 weak rules on 6 letters       remove some, by Config   { method = Overlap,width = 3,unlabel = True}
SRS with 0 strict rules and 1 weak rules on 4 letters       no strict rules

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [3, 3, 0] -> [1, 4, 1, 4, 5, 4, 3, 4, 1, 5] {- Input 0 -}
  [3, 3, 3] -> [1, 1, 3, 3, 1, 1, 1, 0, 1, 5] {- Input 1 -}
  [0, 4, 3, 0] -> [3, 1, 2, 5, 5, 2, 1, 5, 1, 0] {- Input 2 -}
  [2, 4, 0, 3] -> [2, 5, 2, 5, 2, 5, 1, 1, 2, 0] {- Input 3 -}
  [3, 0, 0, 0] -> [3, 3, 1, 0, 1, 5, 4, 5, 2, 4] {- Input 4 -}
  [3, 3, 0, 2] -> [3, 3, 4, 1, 0, 4, 3, 1, 1, 5] {- Input 5 -}
  [3, 3, 0, 5] -> [1, 3, 2, 5, 0, 1, 1, 5, 0, 5] {- Input 6 -}
  [5, 4, 3, 0] -> [1, 2, 5, 2, 4, 1, 4, 4, 2, 4] {- Input 7 -}
  [0, 2, 4, 3, 2] -> [0, 2, 2, 3, 1, 2, 0, 0, 4, 1] {- Input 8 -}
  [0, 5, 4, 3, 2] -> [3, 1, 5, 5, 0, 1, 5, 2, 0, 2] {- Input 9 -}
  [2, 0, 3, 5, 5] -> [1, 5, 4, 2, 1, 0, 2, 2, 4, 5] {- Input 10 -}
  [3, 3, 3, 3, 0] -> [1, 3, 0, 0, 0, 4, 0, 4, 1, 0] {- Input 11 -}
  [3, 3, 5, 5, 5] -> [4, 1, 2, 0, 5, 1, 2, 3, 1, 3] {- Input 12 -}
  [4, 5, 3, 5, 3] -> [4, 3, 1, 5, 1, 2, 4, 2, 1, 3] {- Input 13 -}
  [5, 2, 4, 3, 0] -> [2, 4, 2, 5, 4, 0, 1, 1, 0, 1] {- Input 14 -}
  [5, 3, 3, 2, 2] -> [2, 5, 1, 4, 0, 3, 1, 0, 1, 5] {- Input 15 -}
  [0, 0, 3, 2, 0, 3] -> [1, 2, 5, 4, 5, 4, 2, 5, 1, 3] {- Input 16 -}
  [0, 2, 2, 2, 3, 0] -> [0, 2, 5, 4, 5, 1, 5, 4, 4, 2] {- Input 17 -}
  [0, 3, 0, 3, 3, 5] -> [0, 3, 2, 4, 2, 3, 5, 1, 5, 0] {- Input 18 -}
  [0, 4, 3, 0, 3, 3] -> [0, 0, 1, 3, 5, 4, 1, 5, 5, 5] {- Input 19 -}
  [0, 5, 0, 0, 3, 5] -> [1, 3, 0, 3, 1, 3, 5, 1, 3, 5] {- Input 20 -}
  [0, 5, 4, 5, 4, 0] -> [0, 2, 1, 2, 5, 4, 5, 1, 5, 5] {- Input 21 -}
  [2, 0, 3, 5, 3, 0] -> [2, 4, 5, 2, 0, 1, 2, 2, 3, 1] {- Input 22 -}
  [2, 2, 3, 3, 4, 3] -> [5, 2, 5, 4, 5, 5, 1, 3, 1, 4] {- Input 23 -}
  [3, 3, 0, 5, 3, 2] -> [3, 5, 5, 4, 1, 0, 5, 1, 0, 4] {- Input 24 -}
  [3, 4, 0, 3, 0, 2] -> [3, 2, 0, 1, 1, 3, 4, 1, 1, 2] {- Input 25 -}
  [4, 0, 2, 3, 5, 5] -> [5, 1, 2, 1, 1, 1, 1, 0, 2, 4] {- Input 26 -}
  [4, 0, 3, 0, 2, 2] -> [4, 1, 1, 5, 2, 0, 5, 4, 1, 1] {- Input 27 -}
  [4, 3, 4, 0, 3, 3] -> [1, 5, 2, 4, 2, 4, 2, 4, 0, 3] {- Input 28 -}
  [4, 5, 0, 0, 3, 2] -> [4, 4, 2, 1, 1, 5, 2, 5, 0, 2] {- Input 29 -}
  [4, 5, 3, 5, 2, 0] -> [5, 0, 2, 5, 5, 5, 4, 5, 0, 1] {- Input 30 -}
  [5, 3, 3, 0, 3, 2] -> [2, 5, 4, 1, 5, 3, 4, 2, 5, 1] {- Input 31 -}
  [5, 5, 0, 2, 0, 3] -> [4, 1, 5, 4, 4, 5, 0, 2, 5, 3] {- Input 32 -}
  [0, 2, 0, 3, 3, 5, 5] -> [3, 2, 2, 5, 4, 4, 3, 3, 1, 4] {- Input 33 -}
  [0, 2, 1, 4, 3, 3, 5] -> [0, 5, 5, 1, 0, 5, 3, 1, 1, 4] {- Input 34 -}
  [0, 3, 0, 3, 2, 3, 0] -> [2, 3, 0, 0, 4, 1, 3, 1, 1, 2] {- Input 35 -}
  [0, 3, 4, 0, 3, 0, 3] -> [0, 4, 1, 1, 5, 1, 0, 3, 5, 3] {- Input 36 -}
  [0, 3, 4, 5, 3, 4, 4] -> [2, 3, 5, 0, 1, 0, 1, 4, 5, 0] {- Input 37 -}
  [0, 4, 3, 0, 3, 3, 2] -> [3, 1, 4, 5, 3, 4, 1, 1, 0, 2] {- Input 38 -}
  [0, 5, 1, 0, 3, 3, 2] -> [2, 0, 4, 5, 1, 1, 4, 5, 5, 1] {- Input 39 -}
  [0, 5, 3, 2, 2, 4, 5] -> [0, 0, 0, 1, 3, 1, 1, 0, 5, 3] {- Input 40 -}
  [2, 2, 3, 3, 3, 3, 5] -> [2, 2, 3, 5, 4, 5, 5, 1, 2, 5] {- Input 41 -}
  [2, 2, 3, 5, 5, 0, 0] -> [1, 5, 3, 2, 2, 3, 5, 4, 3, 1] {- Input 42 -}
  [2, 4, 3, 2, 3, 3, 2] -> [2, 5, 4, 0, 2, 5, 4, 4, 1, 1] {- Input 43 -}
  [3, 3, 0, 4, 3, 0, 5] -> [4, 1, 2, 0, 2, 1, 1, 4, 3, 4] {- Input 44 -}
  [3, 3, 5, 2, 4, 3, 2] -> [3, 0, 4, 1, 1, 5, 0, 3, 1, 1] {- Input 45 -}
  [3, 3, 5, 5, 4, 2, 2] -> [3, 4, 4, 4, 1, 3, 4, 1, 0, 2] {- Input 46 -}
  [4, 2, 3, 0, 3, 3, 2] -> [5, 5, 0, 4, 1, 1, 0, 4, 5, 2] {- Input 47 -}
  [4, 2, 3, 3, 5, 1, 3] -> [0, 2, 5, 5, 2, 4, 1, 0, 2, 3] {- Input 48 -}
  [5, 0, 4, 5, 4, 3, 0] -> [5, 1, 0, 1, 1, 3, 4, 0, 2, 5] {- Input 49 -}
  [5, 3, 2, 4, 3, 1, 5] -> [3, 2, 3, 3, 1, 5, 1, 2, 1, 5] {- Input 50 -}
  [5, 3, 3, 3, 0, 3, 0] -> [3, 5, 3, 0, 1, 3, 0, 4, 1, 0] {- Input 51 -}
  [5, 3, 3, 5, 0, 4, 3] -> [1, 2, 0, 1, 3, 5, 3, 4, 1, 4] {- Input 52 -}
  [5, 5, 0, 3, 4, 3, 3] -> [1, 5, 5, 0, 5, 0, 1, 5, 5, 3] {- Input 53 -}
  [0] ->= [1, 0, 1, 1, 1, 1, 2, 3, 1, 1] {- Input 54 -}
  [2, 5, 3, 2] ->= [2, 1, 5, 4, 2, 4, 2, 1, 3, 2] {- Input 55 -}
  [4, 0, 2, 4, 0] ->= [4, 0, 2, 5, 3, 1, 4, 1, 5, 4] {- Input 56 -}
  [5, 2, 0, 0, 3] ->= [5, 2, 0, 2, 0, 0, 1, 3, 1, 5] {- Input 57 -}
  [5, 0, 5, 3, 2, 5] ->= [5, 0, 5, 4, 4, 5, 1, 5, 5, 1] {- Input 58 -}
  [0, 4, 3, 0, 0, 4, 2] ->= [0, 2, 1, 4, 2, 0, 4, 1, 4, 4] {- Input 59 -}
reason
  Tiling   { method = Overlap, width = 5, state_type = Seq, map_type = Enum, unlabel = True, print_completion_steps = False, print_tiles = False, verbose = False, tracing = True}
  steps 11
  using 4626 tiles
  remove some unmatched rules
  steps: 11
  
   property Termination
has value Just True
for SRS
  [0, 4, 3, 0] -> [3, 1, 2, 5, 5, 2, 1, 5, 1, 0] {- Input 2 -}
  [2, 4, 0, 3] -> [2, 5, 2, 5, 2, 5, 1, 1, 2, 0] {- Input 3 -}
  [3, 0, 0, 0] -> [3, 3, 1, 0, 1, 5, 4, 5, 2, 4] {- Input 4 -}
  [2, 0, 3, 5, 3, 0] -> [2, 4, 5, 2, 0, 1, 2, 2, 3, 1] {- Input 22 -}
  [4, 0, 2, 3, 5, 5] -> [5, 1, 2, 1, 1, 1, 1, 0, 2, 4] {- Input 26 -}
  [0, 5, 1, 0, 3, 3, 2] -> [2, 0, 4, 5, 1, 1, 4, 5, 5, 1] {- Input 39 -}
  [0] ->= [1, 0, 1, 1, 1, 1, 2, 3, 1, 1] {- Input 54 -}
  [2, 5, 3, 2] ->= [2, 1, 5, 4, 2, 4, 2, 1, 3, 2] {- Input 55 -}
reason
  (0, 4/1)
   property Termination
has value Just True
for SRS
  [2, 4, 0, 3] -> [2, 5, 2, 5, 2, 5, 1, 1, 2, 0] {- Input 3 -}
  [4, 0, 2, 3, 5, 5] -> [5, 1, 2, 1, 1, 1, 1, 0, 2, 4] {- Input 26 -}
  [0] ->= [1, 0, 1, 1, 1, 1, 2, 3, 1, 1] {- Input 54 -}
  [2, 5, 3, 2] ->= [2, 1, 5, 4, 2, 4, 2, 1, 3, 2] {- Input 55 -}
reason
  Tiling   { method = Overlap, width = 3, state_type = Bit64, map_type = Enum, unlabel = True, print_completion_steps = False, print_tiles = False, verbose = False, tracing = True}
  steps 2
  using 48 tiles
  remove some unmatched rules
  steps: 2
  
   property Termination
has value Just True
for SRS
  [0] ->= [1, 0, 1, 1, 1, 1, 2, 3, 1, 1] {- Input 54 -}
reason
  no strict rules

**************************************************
skeleton: (54/6,6)\TileRemoveROC{5}(6/2,6)\Weight(2/2,6)\TileRemoveROC{3}(0/1,4)[]
**************************************************
let {}
in let {done = Worker No_Strict_Rules;mo = Pre (Or_Else Count (IfSizeLeq 100000 GLPK Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;when_small = \ m -> And_Then (Worker (SizeAtmost 100)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;tiling = \ m w -> weighted (And_Then (Worker (Tiling {method = m,width = w,tracing = True})) (Worker Remap));matrix = \ mo dom dim bits -> when_small (weighted (Worker (Matrix {monotone = mo,domain = dom,dim = dim,bits = bits,shape = Corner})));kbo = \ b -> when_medium (weighted (Worker (KBO {bits = b,solver = Minisatapi})));yeah = Apply wop (Tree_Search_Preemptive 0 done ([ ] <> ([ kbo 1, And_Then (Worker Mirror) (kbo 1)] <> ((for [ 3, 4] (\ d -> matrix Strict Natural d 3)) <> (for [ 2, 3, 5] (\ w -> tiling Overlap w))))));noh = [ Timeout 5 (Worker (Enumerate {closure = Forward})), Timeout 5 (Worker (Enumerate {closure = Backward}))]}
  in Apply (Worker Remap) (First_Of ([ yeah] <> noh))