/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 4 strict rules and 2 weak rules on 3 letters       remove some, by Config   { method = Overlap,width = 3,unlabel = True}
SRS with 4 strict rules and 1 weak rules on 3 letters       remove some, by Config   { method = Overlap,width = 2,unlabel = True}
SRS with 3 rules on 3 letters       weights
SRS with 2 rules on 3 letters       remove some, by Config   { method = Overlap,width = 2,unlabel = True}
SRS with 0 rules on 0 letters       no strict rules

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [a, b, c] -> [c, b, c] {- Input 0 -}
  [c, b, c] -> [a, c, b] {- Input 1 -}
  [b, c, c] -> [b, b, b] {- Input 2 -}
  [b, b, a] -> [b, c, a] {- Input 3 -}
  [a, c, a] ->= [a, b, a] {- Input 4 -}
  [a, b, b] ->= [c, c, c] {- Input 5 -}
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 42 tiles
  remove some unmatched rules
  steps: 2
  
   property Termination
has value Just True
for SRS
  [a, b, c] -> [c, b, c] {- Input 0 -}
  [c, b, c] -> [a, c, b] {- Input 1 -}
  [b, c, c] -> [b, b, b] {- Input 2 -}
  [b, b, a] -> [b, c, a] {- Input 3 -}
  [a, b, b] ->= [c, c, c] {- Input 5 -}
reason
  Tiling   { method = Overlap, width = 2, state_type = Bit64, map_type = Enum, unlabel = True, print_completion_steps = False, print_tiles = False, verbose = False, tracing = True}
  steps 1
  using 14 tiles
  remove some unmatched rules
  steps: 1
  
   property Termination
has value Just True
for SRS
  [c, b, c] -> [a, c, b] {- Input 1 -}
  [b, c, c] -> [b, b, b] {- Input 2 -}
  [b, b, a] -> [b, c, a] {- Input 3 -}
reason
  (c, 1/1)
  (b, 1/1)
   property Termination
has value Just True
for SRS
  [b, c, c] -> [b, b, b] {- Input 2 -}
  [b, b, a] -> [b, c, a] {- Input 3 -}
reason
  Tiling   { method = Overlap, width = 2, state_type = Bit64, map_type = Enum, unlabel = True, print_completion_steps = False, print_tiles = False, verbose = False, tracing = True}
  steps 0
  using 6 tiles
  remove some unmatched rules
  steps: 0
  
   property Termination
has value Just True
for SRS
  
reason
  no strict rules

**************************************************
skeleton: (4/2,3)\TileRemoveROC{3}(4/1,3)\TileRemoveROC{2}(3,3)\Weight(2,3)\TileRemoveROC{2}(0,0)[]
**************************************************
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))