/export/starexec/sandbox2/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 3 rules on 3 letters DP SRS with 6 strict rules and 3 weak rules on 6 letters weights SRS with 5 strict rules and 3 weak rules on 5 letters EDG SRS with 5 strict rules and 3 weak rules on 5 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 3 strict rules and 3 weak rules on 5 letters EDG SRS with 3 strict rules and 3 weak rules on 5 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 2 strict rules and 3 weak rules on 5 letters EDG SRS with 2 strict rules and 3 weak rules on 5 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 4, solver = Minisatapi, verbose = False, tracing = False} SRS with 1 strict rules and 3 weak rules on 5 letters weights SRS with 0 strict rules and 3 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a] -> [b, a, c, b] {- Input 0 -} [b, b] -> [a, a] {- Input 1 -} [c, a] -> [] {- Input 2 -} reason DP property Termination has value Just True for SRS [a, a] ->= [b, a, c, b] {- DP Nontop (Input 0) -} [b, b] ->= [a, a] {- DP Nontop (Input 1) -} [c, a] ->= [] {- DP Nontop (Input 2) -} [a#, a] |-> [a#, c, b] {- DP (Top 1) (Input 0) -} [a#, a] |-> [b#] {- DP (Top 3) (Input 0) -} [a#, a] |-> [b#, a, c, b] {- DP (Top 0) (Input 0) -} [a#, a] |-> [c#, b] {- DP (Top 2) (Input 0) -} [b#, b] |-> [a#] {- DP (Top 1) (Input 1) -} [b#, b] |-> [a#, a] {- DP (Top 0) (Input 1) -} reason (a#, 1/2) (b#, 1/2) property Termination has value Just True for SRS [a, a] ->= [b, a, c, b] {- DP Nontop (Input 0) -} [b, b] ->= [a, a] {- DP Nontop (Input 1) -} [c, a] ->= [] {- DP Nontop (Input 2) -} [a#, a] |-> [a#, c, b] {- DP (Top 1) (Input 0) -} [a#, a] |-> [b#] {- DP (Top 3) (Input 0) -} [a#, a] |-> [b#, a, c, b] {- DP (Top 0) (Input 0) -} [b#, b] |-> [a#] {- DP (Top 1) (Input 1) -} [b#, b] |-> [a#, a] {- DP (Top 0) (Input 1) -} reason EDG property Termination has value Just True for SRS [a#, a] |-> [a#, c, b] {- DP (Top 1) (Input 0) -} [a#, a] |-> [b#, a, c, b] {- DP (Top 0) (Input 0) -} [b#, b] |-> [a#, a] {- DP (Top 0) (Input 1) -} [a#, a] |-> [b#] {- DP (Top 3) (Input 0) -} [b#, b] |-> [a#] {- DP (Top 1) (Input 1) -} [a, a] ->= [b, a, c, b] {- DP Nontop (Input 0) -} [b, b] ->= [a, a] {- DP Nontop (Input 1) -} [c, a] ->= [] {- DP Nontop (Input 2) -} reason ( a , Wk / 0A 2A \ \ 0A 2A / ) ( b , Wk / 0A 2A \ \ 0A 2A / ) ( c , Wk / 0A 0A \ \ -2A -2A / ) ( a# , Wk / 5A 6A \ \ 5A 6A / ) ( b# , Wk / 6A 6A \ \ 6A 6A / ) property Termination has value Just True for SRS [a#, a] |-> [b#, a, c, b] {- DP (Top 0) (Input 0) -} [b#, b] |-> [a#, a] {- DP (Top 0) (Input 1) -} [a#, a] |-> [b#] {- DP (Top 3) (Input 0) -} [a, a] ->= [b, a, c, b] {- DP Nontop (Input 0) -} [b, b] ->= [a, a] {- DP Nontop (Input 1) -} [c, a] ->= [] {- DP Nontop (Input 2) -} reason EDG property Termination has value Just True for SRS [a#, a] |-> [b#, a, c, b] {- DP (Top 0) (Input 0) -} [b#, b] |-> [a#, a] {- DP (Top 0) (Input 1) -} [a#, a] |-> [b#] {- DP (Top 3) (Input 0) -} [a, a] ->= [b, a, c, b] {- DP Nontop (Input 0) -} [b, b] ->= [a, a] {- DP Nontop (Input 1) -} [c, a] ->= [] {- DP Nontop (Input 2) -} reason ( a , Wk / 0A 2A \ \ 0A 2A / ) ( b , Wk / 0A 2A \ \ 0A 2A / ) ( c , Wk / 0A 0A \ \ -2A -2A / ) ( a# , Wk / 3A 5A \ \ 3A 5A / ) ( b# , Wk / 3A 5A \ \ 3A 5A / ) property Termination has value Just True for SRS [a#, a] |-> [b#, a, c, b] {- DP (Top 0) (Input 0) -} [b#, b] |-> [a#, a] {- DP (Top 0) (Input 1) -} [a, a] ->= [b, a, c, b] {- DP Nontop (Input 0) -} [b, b] ->= [a, a] {- DP Nontop (Input 1) -} [c, a] ->= [] {- DP Nontop (Input 2) -} reason EDG property Termination has value Just True for SRS [a#, a] |-> [b#, a, c, b] {- DP (Top 0) (Input 0) -} [b#, b] |-> [a#, a] {- DP (Top 0) (Input 1) -} [a, a] ->= [b, a, c, b] {- DP Nontop (Input 0) -} [b, b] ->= [a, a] {- DP Nontop (Input 1) -} [c, a] ->= [] {- DP Nontop (Input 2) -} reason ( a , Wk / 0A 4A 4A 4A \ | 0A 0A 4A 4A | | -4A 0A 0A 0A | \ -4A 0A 0A 0A / ) ( b , Wk / 0A 0A 4A 4A \ | 0A 0A 4A 4A | | 0A 0A 4A 4A | \ -4A -4A 0A 0A / ) ( c , Wk / 0A 0A 0A 0A \ | -4A -4A -4A 0A | | -4A -4A -4A 0A | \ -4A -4A -4A 0A / ) ( a# , Wk / 9A 13A 13A 13A \ | 9A 13A 13A 13A | | 9A 13A 13A 13A | \ 9A 13A 13A 13A / ) ( b# , Wk / 13A 13A 17A 17A \ | 13A 13A 17A 17A | | 13A 13A 17A 17A | \ 13A 13A 17A 17A / ) property Termination has value Just True for SRS [a#, a] |-> [b#, a, c, b] {- DP (Top 0) (Input 0) -} [a, a] ->= [b, a, c, b] {- DP Nontop (Input 0) -} [b, b] ->= [a, a] {- DP Nontop (Input 1) -} [c, a] ->= [] {- DP Nontop (Input 2) -} reason (a#, 1/1) property Termination has value Just True for SRS [a, a] ->= [b, a, c, b] {- DP Nontop (Input 0) -} [b, b] ->= [a, a] {- DP Nontop (Input 1) -} [c, a] ->= [] {- DP Nontop (Input 2) -} reason EDG ************************************************** skeleton: (3,3)\Deepee(6/3,6)\Weight\EDG(5/3,5)\Matrix{\Arctic}{2}\EDG(3/3,5)\Matrix{\Arctic}{2}\EDG(2/3,5)\Matrix{\Arctic}{4}(1/3,5)\Weight(0/3,3)\EDG[] ************************************************** let {} in let {trac ?= False;loop_cap = 1;match_cap = 2;tile_cap = 3;matrix_cap = 4;mo = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;done = Worker No_Strict_Rules;dont = \ p -> Fail;tiling = \ m w -> On tile_cap (weighted (And_Then (Worker (Tiling {method = m,width = w,map_type = Enum,max_num_tiles = Just 1000,max_num_rules = Just 100000})) (Worker Remap)));tile_roc = Tree_Search_Preemptive 0 done let {ws = [ 2, 4, 8, 12]}in (for ws (\ w -> tiling Overlap w)) <> [ Worker Unlabel];mb = \ size -> On match_cap (Apply (Worker (Matchbound {method = RFC,max_size = Just size})) done);mbs = \ size -> First_Of [ mb size, Apply (Worker Mirror) (mb size)];tile_rfc = Tree_Search_Preemptive 0 done let {ws = [ 2, 4, 8, 12]}in (for ws (\ w -> tiling Forward w)) <> ((for ws (\ w -> tiling Backward w)) <> [ Worker Unlabel]);solver = Minisatapi;qpi = \ dim bits -> On matrix_cap (weighted (Worker (QPI {tracing = trac,dim = dim,bits = bits,solver = solver})));qpis = Seq [ Timeout 10 (qpi 2 3), Timeout 30 (qpi 4 3), Timeout 50 (qpi 6 3), qpi 8 3];kbo = \ b -> On matrix_cap (weighted (Worker (KBO {bits = b,solver = solver})));matrix = \ dom dim bits -> On matrix_cap (weighted (Worker (Matrix {monotone = Weak,domain = dom,dim = dim,bits = bits,encoding = Ersatz_Binary,tracing = trac,verbose = True,solver = solver})));arctics = Seq [ Timeout 10 (matrix Arctic 2 16), Timeout 30 (matrix Arctic 4 8), Timeout 50 (matrix Arctic 6 4), matrix Arctic 8 2];naturals = Seq [ Timeout 10 (matrix Natural 2 4), Timeout 30 (matrix Natural 4 3), Timeout 50 (matrix Natural 6 2), matrix Natural 8 1];remove = First_Of [ qpis, arctics, naturals, As_Transformer tile_roc];remove_wop = And_Then wop (Or_Else (As_Transformer (Worker No_Strict_Rules)) remove);deepee = Apply (And_Then (Worker DP) (Worker Remap)) (Apply wop (Branch (Worker (EDG {tracing = False,usable = True})) remove_wop));when_small = \ m -> Apply (Worker (SizeAtmost 1000)) m;yeah = First_Of [ when_small (First_Of [ deepee, Apply (Worker Mirror) deepee]), tile_rfc, mbs 100000];noh_for = \ side -> Worker (Simple (Config {closure = side,max_closure_width = Nothing,intermediates = All,priority = Linear [ ( 1, Log2 Steps), ( -1, Width_lhs), ( -2, Log2 Width_rhs)]}));noh = First_Of [ On loop_cap (noh_for Forward), On loop_cap (noh_for Backward), On loop_cap (Worker Transport)]} in Apply (Worker Remap) (Apply wop (Seq [ Worker KKST01, First_Of [ yeah, noh]])) ************************************************** statistics on proof search (nodes types that (together) took more than 1.000000000000) ************************************************** Fail : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 1.140315928000 min duration 0.940528162000 total durat. 2.080844090000 Info { what = Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 22} , self = 107 , parent = Just 76 , duration = 1.140315928000 , status = Fail , start = 2021-07-13 22:59:30.225635654 UTC , finish = 2021-07-13 22:59:31.365951582 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '2' , '7' ] , 0 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 3 max duration 0.464167627000 min duration 0.364342770000 total durat. 1.216148522000 Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} total number 4 max duration 1.387747327000 min duration 0.030254847000 total durat. 1.546645820000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 22} , self = 128 , parent = Just 76 , duration = 1.387747327000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:59:30.589128802 UTC , finish = 2021-07-13 22:59:31.976876129 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '7' , '1' ] , 0 , True )} Fail : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 5 max duration 0.434056155000 min duration 0.277392317000 total durat. 1.699707313000 Success : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 3 max duration 0.462559202000 min duration 0.361448333000 total durat. 1.209332454000 Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 1.380116380000 min duration 1.380116380000 total durat. 1.380116380000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 22} , self = 124 , parent = Just 76 , duration = 1.380116380000 , status = Success , start = 2021-07-13 22:59:30.593565395 UTC , finish = 2021-07-13 22:59:31.973681775 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '7' , '4' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 1.046680652000 min duration 1.046680652000 total durat. 1.046680652000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 4 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 16} , self = 106 , parent = Just 46 , duration = 1.046680652000 , status = Fail , start = 2021-07-13 22:59:30.027651227 UTC , finish = 2021-07-13 22:59:31.074331879 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' , '6' ] , 0 , True )} Success : Tiling { method = Backward , width = 2 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} total number 3 max duration 1.656105845000 min duration 0.063372364000 total durat. 2.226241065000 Info { what = Tiling { method = Backward , width = 2 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} , input_size = Size { num_rules = 24 , num_strict_rules = 24 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 10 , total_length = 160} , self = 120 , parent = Just 86 , duration = 1.656105845000 , status = Success , start = 2021-07-13 22:59:30.263759634 UTC , finish = 2021-07-13 22:59:31.919865479 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '5' , '3' ] , 3 , True )} Success : Tiling { method = Overlap , width = 2 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} total number 6 max duration 0.266134950000 min duration 0.131292748000 total durat. 1.178891360000 Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 11 max duration 1.881912012000 min duration 0.001201131000 total durat. 5.554222466000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 82 , num_strict_rules = 16 , num_top_rules = 16 , num_weak_rules = 66 , alphabet_size = 24 , total_length = 496} , self = 99 , parent = Just 32 , duration = 1.138999693000 , status = Success , start = 2021-07-13 22:59:29.505654043 UTC , finish = 2021-07-13 22:59:30.644653736 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '7' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 68 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 60 , alphabet_size = 20 , total_length = 440} , self = 116 , parent = Just 96 , duration = 1.248126193000 , status = Success , start = 2021-07-13 22:59:30.45753399 UTC , finish = 2021-07-13 22:59:31.705660183 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '6' , '9' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 88 , num_strict_rules = 20 , num_top_rules = 20 , num_weak_rules = 68 , alphabet_size = 24 , total_length = 540} , self = 110 , parent = Just 34 , duration = 1.881912012000 , status = Success , start = 2021-07-13 22:59:29.54344875 UTC , finish = 2021-07-13 22:59:31.425360762 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '8' ] , 3 , False )} **************************************************