/export/starexec/sandbox/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 2 rules on 2 letters mirror SRS with 2 rules on 2 letters DP SRS with 4 strict rules and 2 weak rules on 3 letters weights SRS with 2 strict rules and 2 weak rules on 3 letters EDG SRS with 2 strict rules and 2 weak rules on 3 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 4, solver = Minisatapi, verbose = False, tracing = False} SRS with 0 strict rules and 2 weak rules on 2 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [b, b, b, b] -> [b, b, b, a, b] {- Input 0 -} [b, a, b, b, a, b] -> [b, b, a, b, b] {- Input 1 -} reason mirror property Termination has value Just True for SRS [b, b, b, b] -> [b, a, b, b, b] {- Mirror (Input 0) -} [b, a, b, b, a, b] -> [b, b, a, b, b] {- Mirror (Input 1) -} reason DP property Termination has value Just True for SRS [b, b, b, b] ->= [b, a, b, b, b] {- DP Nontop (Mirror (Input 0)) -} [b, a, b, b, a, b] ->= [b, b, a, b, b] {- DP Nontop (Mirror (Input 1)) -} [b#, b, b, b] |-> [b#, a, b, b, b] {- DP (Top 0) (Mirror (Input 0)) -} [b#, a, b, b, a, b] |-> [b#, b] {- DP (Top 3) (Mirror (Input 1)) -} [b#, a, b, b, a, b] |-> [b#, b, a, b, b] {- DP (Top 0) (Mirror (Input 1)) -} [b#, a, b, b, a, b] |-> [b#, a, b, b] {- DP (Top 1) (Mirror (Input 1)) -} reason (b, 2/1) property Termination has value Just True for SRS [b, b, b, b] ->= [b, a, b, b, b] {- DP Nontop (Mirror (Input 0)) -} [b, a, b, b, a, b] ->= [b, b, a, b, b] {- DP Nontop (Mirror (Input 1)) -} [b#, b, b, b] |-> [b#, a, b, b, b] {- DP (Top 0) (Mirror (Input 0)) -} [b#, a, b, b, a, b] |-> [b#, b, a, b, b] {- DP (Top 0) (Mirror (Input 1)) -} reason EDG property Termination has value Just True for SRS [b#, b, b, b] |-> [b#, a, b, b, b] {- DP (Top 0) (Mirror (Input 0)) -} [b#, a, b, b, a, b] |-> [b#, b, a, b, b] {- DP (Top 0) (Mirror (Input 1)) -} [b, b, b, b] ->= [b, a, b, b, b] {- DP Nontop (Mirror (Input 0)) -} [b, a, b, b, a, b] ->= [b, b, a, b, b] {- DP Nontop (Mirror (Input 1)) -} reason ( b , Wk / 0A 4A 4A 4A \ | 0A 0A 4A 4A | | 0A 0A 4A 4A | \ 0A 0A 0A 0A / ) ( a , Wk / 0A 0A 0A 4A \ | 0A 0A 0A 4A | | -4A -4A -4A 0A | \ -4A -4A -4A 0A / ) ( b# , Wk / 16A 17A 20A 20A \ | 16A 17A 20A 20A | | 16A 17A 20A 20A | \ 16A 17A 20A 20A / ) property Termination has value Just True for SRS [b, b, b, b] ->= [b, a, b, b, b] {- DP Nontop (Mirror (Input 0)) -} [b, a, b, b, a, b] ->= [b, b, a, b, b] {- DP Nontop (Mirror (Input 1)) -} reason EDG ************************************************** skeleton: \Mirror(2,2)\Deepee(4/2,3)\Weight\EDG(2/2,3)\Matrix{\Arctic}{4}(0/2,2)\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 = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 0.608718408000 min duration 0.608080662000 total durat. 1.216799070000 Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 0.535485360000 min duration 0.504201858000 total durat. 1.039687218000 Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.057619936000 min duration 2.057619936000 total durat. 2.057619936000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 3 , total_length = 40} , self = 135 , parent = Just 11 , duration = 2.057619936000 , status = Success , start = 2021-07-13 23:40:55.049503617 UTC , finish = 2021-07-13 23:40:57.107123553 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '8' ] , 0 , True )} Success : Tiling { method = Forward , 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 4 max duration 0.501398428000 min duration 0.046517531000 total durat. 1.288513359000 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 7 max duration 1.556568613000 min duration 0.092960965000 total durat. 4.997836966000 Info { what = 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} , input_size = Size { num_rules = 27 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 24 , alphabet_size = 7 , total_length = 321} , self = 106 , parent = Just 50 , duration = 1.328408734000 , status = Success , start = 2021-07-13 23:40:54.876836994 UTC , finish = 2021-07-13 23:40:56.205245728 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '9' ] , 3 , True )} Info { what = 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} , input_size = Size { num_rules = 27 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 24 , alphabet_size = 7 , total_length = 321} , self = 129 , parent = Just 86 , duration = 1.532293423000 , status = Success , start = 2021-07-13 23:40:55.37058173 UTC , finish = 2021-07-13 23:40:56.902875153 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' , '3' ] , 3 , True )} Info { what = 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} , input_size = Size { num_rules = 30 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 24 , alphabet_size = 8 , total_length = 360} , self = 119 , parent = Just 44 , duration = 1.556568613000 , status = Success , start = 2021-07-13 23:40:54.776423121 UTC , finish = 2021-07-13 23:40:56.332991734 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '9' ] , 3 , True )} Success : Tiling { method = Overlap , width = 4 , 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 4 max duration 1.906292413000 min duration 0.413509482000 total durat. 5.098555028000 Info { what = Tiling { method = Overlap , width = 4 , 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 = 3 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 2 , alphabet_size = 3 , total_length = 29} , self = 101 , parent = Just 38 , duration = 1.200906971000 , status = Success , start = 2021-07-13 23:40:54.64658001 UTC , finish = 2021-07-13 23:40:55.847486981 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '4' ] , 3 , True )} Info { what = Tiling { method = Overlap , width = 4 , 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 = 3 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 2 , alphabet_size = 3 , total_length = 29} , self = 127 , parent = Just 72 , duration = 1.577846162000 , status = Success , start = 2021-07-13 23:40:55.109631406 UTC , finish = 2021-07-13 23:40:56.687477568 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '7' , '9' ] , 3 , True )} Info { what = Tiling { method = Overlap , width = 4 , 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 = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 3 , total_length = 40} , self = 124 , parent = Just 11 , duration = 1.906292413000 , status = Success , start = 2021-07-13 23:40:54.522311836 UTC , finish = 2021-07-13 23:40:56.428604249 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '4' , '9' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 4 max duration 0.967823983000 min duration 0.000235307000 total durat. 1.777112561000 **************************************************