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

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [0, 1, 2, 3, 4] -> [0, 2, 3, 1, 4] {- Input 0 -}
  [0, 5, 1, 2, 3, 4] -> [0, 1, 2, 5, 3, 4] {- Input 1 -}
  [0, 5, 1, 2, 3, 4] -> [0, 5, 2, 1, 3, 4] {- Input 2 -}
  [0, 5, 1, 2, 3, 4] -> [5, 0, 2, 3, 1, 4] {- Input 3 -}
  [0, 5, 2, 3, 1, 4] -> [0, 1, 5, 2, 3, 4] {- Input 4 -}
reason
  mirror
   property Termination
has value Just True
for SRS
  [4, 3, 2, 1, 0] -> [4, 1, 3, 2, 0] {- Mirror (Input 0) -}
  [4, 3, 2, 1, 5, 0] -> [4, 3, 5, 2, 1, 0] {- Mirror (Input 1) -}
  [4, 3, 2, 1, 5, 0] -> [4, 3, 1, 2, 5, 0] {- Mirror (Input 2) -}
  [4, 3, 2, 1, 5, 0] -> [4, 1, 3, 2, 0, 5] {- Mirror (Input 3) -}
  [4, 1, 3, 2, 5, 0] -> [4, 3, 2, 5, 1, 0] {- Mirror (Input 4) -}
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 0
  using 18 tiles
  tile all rules
  steps: 0
  
   property Termination
has value Just True
for SRS
  [[<, 4], [4, 3], [3, 2], [2, 1], [1, 0], [0, >]] -> [ [<, 4] , [4, 1] , [1, 3] , [3, 2] , [2, 0] , [ 0 , > ] ] {- Semlab 0 (Concon 0 (Mirror (Input 0))) -}
  [[<, 4], [4, 3], [3, 2], [2, 1], [1, 0], [0, 5]] -> [ [<, 4] , [4, 1] , [1, 3] , [3, 2] , [2, 0] , [ 0 , 5 ] ] {- Semlab 0 (Concon 1 (Mirror (Input 0))) -}
  [[<, 4], [4, 1], [1, 3], [3, 2], [2, 5], [5, 0], [0, >]] -> [ [<, 4] , [4, 3] , [3, 2] , [2, 5] , [5, 1] , [1, 0] , [ 0 , > ] ] {- Semlab 0 (Concon 0 (Mirror (Input 4))) -}
  [[<, 4], [4, 1], [1, 3], [3, 2], [2, 5], [5, 0], [0, 5]] -> [ [<, 4] , [4, 3] , [3, 2] , [2, 5] , [5, 1] , [1, 0] , [ 0 , 5 ] ] {- Semlab 0 (Concon 1 (Mirror (Input 4))) -}
reason
  ([2, 1], 2/1)
  ([5, 0], 2/1)
   property Termination
has value Just True
for SRS
  
reason
  no strict rules

**************************************************
skeleton: \Mirror(5,6)\TileAllRFC{2}(4,13)\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)])