/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 1 rules on 2 letters mirror SRS with 1 rules on 2 letters DP SRS with 6 strict rules and 1 weak rules on 3 letters EDG SRS with 3 strict rules and 1 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 1 weak rules on 2 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [b, a, b, a, b, b, a, b, a, b, a] -> [ a , b , a , b , a , b , b , a , b , a , b , b , a ] {- Input 0 -} reason mirror property Termination has value Just True for SRS [a, b, a, b, a, b, b, a, b, a, b] -> [ a , b , b , a , b , a , b , b , a , b , a , b , a ] {- Mirror (Input 0) -} reason DP property Termination has value Just True for SRS [a, b, a, b, a, b, b, a, b, a, b] ->= [ a , b , b , a , b , a , b , b , a , b , a , b , a ] {- DP Nontop (Mirror (Input 0)) -} [a#, b, a, b, a, b, b, a, b, a, b] |-> [a#] {- DP (Top 12) (Mirror (Input 0)) -} [a#, b, a, b, a, b, b, a, b, a, b] |-> [ a# , b , b , a , b , a , b , b , a , b , a , b , a ] {- DP (Top 0) (Mirror (Input 0)) -} [a#, b, a, b, a, b, b, a, b, a, b] |-> [ a# , b , b , a , b , a , b , a ] {- DP (Top 5) (Mirror (Input 0)) -} [a#, b, a, b, a, b, b, a, b, a, b] |-> [ a# , b , a ] {- DP (Top 10) (Mirror (Input 0)) -} [a#, b, a, b, a, b, b, a, b, a, b] |-> [ a# , b , a , b , b , a , b , a , b , a ] {- DP (Top 3) (Mirror (Input 0)) -} [a#, b, a, b, a, b, b, a, b, a, b] |-> [ a# , b , a , b , a ] {- DP (Top 8) (Mirror (Input 0)) -} reason EDG property Termination has value Just True for SRS [a#, b, a, b, a, b, b, a, b, a, b] |-> [a#] {- DP (Top 12) (Mirror (Input 0)) -} [a#, b, a, b, a, b, b, a, b, a, b] |-> [ a# , b , a , b , a ] {- DP (Top 8) (Mirror (Input 0)) -} [a#, b, a, b, a, b, b, a, b, a, b] |-> [ a# , b , a ] {- DP (Top 10) (Mirror (Input 0)) -} [a, b, a, b, a, b, b, a, b, a, b] ->= [ a , b , b , a , b , a , b , b , a , b , a , b , a ] {- DP Nontop (Mirror (Input 0)) -} reason ( a , Wk / 0A 0A 0A 0A \ | -4A 0A 0A 0A | | -4A -4A -4A 0A | \ -4A -4A -4A 0A / ) ( b , Wk / 0A 0A 0A 4A \ | 0A 0A 0A 0A | | -4A 0A 0A 0A | \ -4A -4A 0A 0A / ) ( a# , Wk / 17A 17A 20A 21A \ | 17A 17A 20A 21A | | 17A 17A 20A 21A | \ 17A 17A 20A 21A / ) property Termination has value Just True for SRS [a, b, a, b, a, b, b, a, b, a, b] ->= [ a , b , b , a , b , a , b , b , a , b , a , b , a ] {- DP Nontop (Mirror (Input 0)) -} reason EDG ************************************************** skeleton: \Mirror(1,2)\Deepee(6/1,3)\EDG(3/1,3)\Matrix{\Arctic}{4}(0/1,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.934818756000 min duration 2.934818756000 total durat. 2.934818756000 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 = 3 , num_top_rules = 3 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 66} , self = 106 , parent = Just 14 , duration = 2.934818756000 , status = Fail , start = 2021-07-13 23:54:22.726014998 UTC , finish = 2021-07-13 23:54:25.660833754 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '5' ] , 0 , True )} 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 1 max duration 2.469470334000 min duration 2.469470334000 total durat. 2.469470334000 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 = 4 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 66} , self = 114 , parent = Just 14 , duration = 2.469470334000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:54:23.250743489 UTC , finish = 2021-07-13 23:54:25.720213823 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '7' ] , 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 1.236825816000 min duration 0.524644006000 total durat. 1.761469822000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 7 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 135} , self = 76 , parent = Just 13 , duration = 1.236825816000 , status = Fail , start = 2021-07-13 23:54:22.726003919 UTC , finish = 2021-07-13 23:54:23.962829735 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '3' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 0.847083503000 min duration 0.454469910000 total durat. 1.301553413000 Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.539060308000 min duration 2.539060308000 total durat. 2.539060308000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 4 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 66} , self = 110 , parent = Just 14 , duration = 2.539060308000 , status = Success , start = 2021-07-13 23:54:23.180525332 UTC , finish = 2021-07-13 23:54:25.71958564 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '4' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.147741326000 min duration 2.147741326000 total durat. 2.147741326000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 7 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 135} , self = 115 , parent = Just 13 , duration = 2.147741326000 , status = Fail , start = 2021-07-13 23:54:23.572551945 UTC , finish = 2021-07-13 23:54:25.720293271 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '8' ] , 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 6 max duration 1.104819620000 min duration 0.037431826000 total durat. 3.334966541000 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 = 18 , num_strict_rules = 18 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 9 , total_length = 504} , self = 99 , parent = Just 73 , duration = 1.008201246000 , status = Success , start = 2021-07-13 23:54:23.999939507 UTC , finish = 2021-07-13 23:54:25.008140753 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '6' ] , 3 , True )} 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 = 18 , num_strict_rules = 18 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 9 , total_length = 504} , self = 107 , parent = Just 73 , duration = 1.104819620000 , status = Success , start = 2021-07-13 23:54:24.571602983 UTC , finish = 2021-07-13 23:54:25.676422603 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '1' ] , 3 , True )} 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 2 max duration 0.724650311000 min duration 0.318547303000 total durat. 1.043197614000 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.320241609000 min duration 0.050454846000 total durat. 3.169884620000 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 = 21 , num_strict_rules = 21 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 11 , total_length = 588} , self = 88 , parent = Just 42 , duration = 1.212325427000 , status = Success , start = 2021-07-13 23:54:23.199989331 UTC , finish = 2021-07-13 23:54:24.412314758 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '4' ] , 3 , True )} 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 = 18 , num_strict_rules = 18 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 9 , total_length = 504} , self = 104 , parent = Just 73 , duration = 1.320241609000 , status = Success , start = 2021-07-13 23:54:24.071425307 UTC , finish = 2021-07-13 23:54:25.391666916 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '5' , '0' ] , 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 2 max duration 0.942354584000 min duration 0.320593788000 total durat. 1.262948372000 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 2 max duration 0.932158670000 min duration 0.534364081000 total durat. 1.466522751000 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 1 max duration 2.314507954000 min duration 2.314507954000 total durat. 2.314507954000 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 = 3 , num_top_rules = 3 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 66} , self = 101 , parent = Just 14 , duration = 2.314507954000 , status = Success , start = 2021-07-13 23:54:22.728883748 UTC , finish = 2021-07-13 23:54:25.043391702 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '1' ] , 3 , True )} **************************************************