/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 1 strict rules and 5 weak rules on 5 letters remove some, by Config { method = Overlap,width = 2,unlabel = True} SRS with 1 strict rules and 4 weak rules on 5 letters remove some, by Config { method = Overlap,width = 3,unlabel = True} SRS with 0 strict rules and 2 weak rules on 4 letters weights SRS with 0 strict rules and 1 weak rules on 3 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [b, q, b] -> [b, p, b] {- Input 0 -} [0, p, 0] ->= [q] {- Input 1 -} [1, p, 1] ->= [q] {- Input 2 -} [0, q, 0] ->= [q] {- Input 3 -} [1, q, 1] ->= [q] {- Input 4 -} [p] ->= [1, p, 1, 0, 1] {- 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 2 using 24 tiles remove some unmatched rules steps: 2 property Termination has value Just True for SRS [b, q, b] -> [b, p, b] {- Input 0 -} [1, p, 1] ->= [q] {- Input 2 -} [0, q, 0] ->= [q] {- Input 3 -} [1, q, 1] ->= [q] {- Input 4 -} [p] ->= [1, p, 1, 0, 1] {- 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 4 using 71 tiles remove some unmatched rules steps: 4 property Termination has value Just True for SRS [1, p, 1] ->= [q] {- Input 2 -} [p] ->= [1, p, 1, 0, 1] {- Input 5 -} reason (p, 1/1) property Termination has value Just True for SRS [p] ->= [1, p, 1, 0, 1] {- Input 5 -} reason no strict rules ************************************************** skeleton: (1/5,5)\TileRemoveROC{2}(1/4,5)\TileRemoveROC{3}(0/2,4)\Weight(0/1,3)[] ************************************************** 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))