/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 3 rules on 2 letters DP SRS with 4 strict rules and 3 weak rules on 3 letters weights SRS with 2 strict rules and 3 weak rules on 3 letters EDG SRS with 2 strict rules and 3 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 3 weak rules on 2 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a, b, a] -> [a, b, a, b] {- Input 0 -} [a, b, a, a] -> [a, a, a, a] {- Input 1 -} [a, a, a, b] -> [b, b, b, b] {- Input 2 -} reason DP property Termination has value Just True for SRS [a, a, b, a] ->= [a, b, a, b] {- DP Nontop (Input 0) -} [a, b, a, a] ->= [a, a, a, a] {- DP Nontop (Input 1) -} [a, a, a, b] ->= [b, b, b, b] {- DP Nontop (Input 2) -} [a#, a, b, a] |-> [a#, b] {- DP (Top 2) (Input 0) -} [a#, a, b, a] |-> [a#, b, a, b] {- DP (Top 0) (Input 0) -} [a#, b, a, a] |-> [a#, a, a] {- DP (Top 1) (Input 1) -} [a#, b, a, a] |-> [a#, a, 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] ->= [a, b, a, b] {- DP Nontop (Input 0) -} [a, b, a, a] ->= [a, a, a, a] {- DP Nontop (Input 1) -} [a, a, a, b] ->= [b, b, b, b] {- DP Nontop (Input 2) -} [a#, a, b, a] |-> [a#, b, a, b] {- DP (Top 0) (Input 0) -} [a#, b, a, a] |-> [a#, a, a, a] {- DP (Top 0) (Input 1) -} reason EDG property Termination has value Just True for SRS [a#, a, b, a] |-> [a#, b, a, b] {- DP (Top 0) (Input 0) -} [a#, b, a, a] |-> [a#, a, a, a] {- DP (Top 0) (Input 1) -} [a, a, b, a] ->= [a, b, a, b] {- DP Nontop (Input 0) -} [a, b, a, a] ->= [a, a, a, a] {- DP Nontop (Input 1) -} [a, a, a, b] ->= [b, b, b, b] {- DP Nontop (Input 2) -} reason ( a , Wk / 4A 4A 4A 8A \ | 0A 4A 4A 4A | | 0A 4A 4A 4A | \ 0A 0A 4A 4A / ) ( b , Wk / 4A 4A 4A 8A \ | 4A 4A 4A 8A | | 0A 0A 0A 4A | \ 0A 0A 0A 4A / ) ( a# , Wk / 13A 14A 15A 16A \ | 13A 14A 15A 16A | | 13A 14A 15A 16A | \ 13A 14A 15A 16A / ) property Termination has value Just True for SRS [a, a, b, a] ->= [a, b, a, b] {- DP Nontop (Input 0) -} [a, b, a, a] ->= [a, a, a, a] {- DP Nontop (Input 1) -} [a, a, a, b] ->= [b, b, b, b] {- DP Nontop (Input 2) -} reason EDG ************************************************** skeleton: (3,2)\Deepee(4/3,3)\Weight\EDG(2/3,3)\Matrix{\Arctic}{4}(0/3,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 = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 2.513254194000 min duration 2.513254194000 total durat. 2.513254194000 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 = 4 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 32} , self = 104 , parent = Just 12 , duration = 2.513254194000 , status = Fail , start = 2021-07-13 23:43:39.78125129 UTC , finish = 2021-07-13 23:43:42.294505484 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '9' , '6' ] , 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 2 max duration 0.698780870000 min duration 0.510798932000 total durat. 1.209579802000 Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 0.630856467000 min duration 0.470669776000 total durat. 1.101526243000 Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.737777283000 min duration 2.737777283000 total durat. 2.737777283000 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 = 3 , total_length = 40} , self = 112 , parent = Just 21 , duration = 2.737777283000 , status = Success , start = 2021-07-13 23:43:40.419497306 UTC , finish = 2021-07-13 23:43:43.157274589 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' , '6' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.164156838000 min duration 2.164156838000 total durat. 2.164156838000 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 = 3 , total_length = 32} , self = 105 , parent = Just 12 , duration = 2.164156838000 , status = Fail , start = 2021-07-13 23:43:40.252060488 UTC , finish = 2021-07-13 23:43:42.416217326 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '7' ] , 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 5 max duration 0.622633280000 min duration 0.045131325000 total durat. 1.850496874000 Success : Tiling { method = Backward , 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 1 max duration 1.949891269000 min duration 1.949891269000 total durat. 1.949891269000 Info { what = Tiling { method = Backward , 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 = 2 , num_strict_rules = 2 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 16} , self = 98 , parent = Just 38 , duration = 1.949891269000 , status = Success , start = 2021-07-13 23:43:39.930827906 UTC , finish = 2021-07-13 23:43:41.880719175 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '2' ] , 3 , 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 5 max duration 1.031909745000 min duration 0.057718838000 total durat. 2.869234574000 Info { what = 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} , input_size = Size { num_rules = 12 , num_strict_rules = 12 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 5 , total_length = 120} , self = 102 , parent = Just 34 , duration = 1.031909745000 , status = Success , start = 2021-07-13 23:43:41.228175767 UTC , finish = 2021-07-13 23:43:42.260085512 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '2' , '2' ] , 3 , True )} Success : Tiling { method = Forward , 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 1 max duration 2.241939286000 min duration 2.241939286000 total durat. 2.241939286000 Info { what = Tiling { method = Forward , 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 = 2 , num_strict_rules = 2 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 16} , self = 100 , parent = Just 38 , duration = 2.241939286000 , status = Success , start = 2021-07-13 23:43:39.930718783 UTC , finish = 2021-07-13 23:43:42.172658069 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '8' ] , 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 2.963844067000 min duration 0.177375146000 total durat. 6.534884662000 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 = 18 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 15 , alphabet_size = 7 , total_length = 180} , self = 108 , parent = Just 56 , duration = 2.438096983000 , status = Success , start = 2021-07-13 23:43:40.218021374 UTC , finish = 2021-07-13 23:43:42.656118357 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '6' , '0' ] , 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 = 20 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 16 , alphabet_size = 8 , total_length = 200} , self = 110 , parent = Just 53 , duration = 2.963844067000 , status = Success , start = 2021-07-13 23:43:40.192698736 UTC , finish = 2021-07-13 23:43:43.156542803 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '0' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 17 max duration 0.298052500000 min duration 0.000037437000 total durat. 1.901021730000 **************************************************