/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 mirror SRS with 3 rules on 3 letters DP SRS with 5 strict rules and 3 weak rules on 6 letters weights 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 = 8, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, 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] -> [a, b, c, b] {- Input 0 -} [b, c] -> [] {- Input 1 -} [c, b] -> [a, c] {- Input 2 -} reason mirror property Termination has value Just True for SRS [a, a] -> [b, c, b, a] {- Mirror (Input 0) -} [c, b] -> [] {- Mirror (Input 1) -} [b, c] -> [c, a] {- Mirror (Input 2) -} reason DP property Termination has value Just True for SRS [a, a] ->= [b, c, b, a] {- DP Nontop (Mirror (Input 0)) -} [c, b] ->= [] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [c, a] {- DP Nontop (Mirror (Input 2)) -} [a#, a] |-> [b#, a] {- DP (Top 2) (Mirror (Input 0)) -} [a#, a] |-> [b#, c, b, a] {- DP (Top 0) (Mirror (Input 0)) -} [a#, a] |-> [c#, b, a] {- DP (Top 1) (Mirror (Input 0)) -} [b#, c] |-> [a#] {- DP (Top 1) (Mirror (Input 2)) -} [b#, c] |-> [c#, a] {- DP (Top 0) (Mirror (Input 2)) -} reason (a#, 1/2) (b#, 1/2) property Termination has value Just True for SRS [a, a] ->= [b, c, b, a] {- DP Nontop (Mirror (Input 0)) -} [c, b] ->= [] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [c, a] {- DP Nontop (Mirror (Input 2)) -} [a#, a] |-> [b#, a] {- DP (Top 2) (Mirror (Input 0)) -} [a#, a] |-> [b#, c, b, a] {- DP (Top 0) (Mirror (Input 0)) -} [b#, c] |-> [a#] {- DP (Top 1) (Mirror (Input 2)) -} reason EDG property Termination has value Just True for SRS [a#, a] |-> [b#, a] {- DP (Top 2) (Mirror (Input 0)) -} [b#, c] |-> [a#] {- DP (Top 1) (Mirror (Input 2)) -} [a#, a] |-> [b#, c, b, a] {- DP (Top 0) (Mirror (Input 0)) -} [a, a] ->= [b, c, b, a] {- DP Nontop (Mirror (Input 0)) -} [c, b] ->= [] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [c, a] {- DP Nontop (Mirror (Input 2)) -} reason ( a , Wk / - - 0A 0A \ | - - 0A - | | - 0A 7A 7A | \ - - - 0A / ) ( b , Wk / - 7A 0A 7A \ | 5A 7A 0A 7A | | 0A 0A - - | \ - - - 0A / ) ( c , Wk / - - 0A 2A \ | - - 0A - | | - 0A - 0A | \ - - - 0A / ) ( a# , Wk / - - 0A 5A \ | - - - - | | - - - - | \ - - - 0A / ) ( b# , Wk / 0A - - 5A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [b#, c] |-> [a#] {- DP (Top 1) (Mirror (Input 2)) -} [a, a] ->= [b, c, b, a] {- DP Nontop (Mirror (Input 0)) -} [c, b] ->= [] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [c, a] {- DP Nontop (Mirror (Input 2)) -} reason (b#, 1/1) property Termination has value Just True for SRS [a, a] ->= [b, c, b, a] {- DP Nontop (Mirror (Input 0)) -} [c, b] ->= [] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [c, a] {- DP Nontop (Mirror (Input 2)) -} reason EDG ************************************************** skeleton: \Mirror(3,3)\Deepee(5/3,6)\Weight\EDG(3/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 3 max duration 1.636990985000 min duration 1.281118062000 total durat. 4.465669517000 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 = 4 , total_length = 18} , self = 78 , parent = Just 62 , duration = 1.281118062000 , status = Fail , start = 2021-07-13 23:29:08.585009154 UTC , finish = 2021-07-13 23:29:09.866127216 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '5' , '4' ] , 0 , True )} 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 = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 25} , self = 53 , parent = Just 12 , duration = 1.547560470000 , status = Fail , start = 2021-07-13 23:29:06.19887485 UTC , finish = 2021-07-13 23:29:07.74643532 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '9' , '6' ] , 0 , True )} 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 = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 29} , self = 54 , parent = Just 18 , duration = 1.636990985000 , status = Fail , start = 2021-07-13 23:29:06.204038793 UTC , finish = 2021-07-13 23:29:07.841029778 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '4' ] , 0 , True )} Success : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 8 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 7.516928296000 min duration 7.516928296000 total durat. 7.516928296000 Info { what = Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 8 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 25} , self = 85 , parent = Just 12 , duration = 7.516928296000 , status = Success , start = 2021-07-13 23:29:07.746710793 UTC , finish = 2021-07-13 23:29:15.263639089 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '0' ] , 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 1.843698295000 min duration 1.843698295000 total durat. 1.843698295000 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 = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 29} , self = 64 , parent = Just 18 , duration = 1.843698295000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:29:06.740487249 UTC , finish = 2021-07-13 23:29:08.584185544 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '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 3 max duration 0.536202998000 min duration 0.409410753000 total durat. 1.429187797000 Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 3 max duration 0.538613987000 min duration 0.409662950000 total durat. 1.441563372000 Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 1.835961784000 min duration 1.835961784000 total durat. 1.835961784000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 29} , self = 60 , parent = Just 18 , duration = 1.835961784000 , status = Success , start = 2021-07-13 23:29:06.742815748 UTC , finish = 2021-07-13 23:29:08.578777532 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '9' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.707076094000 min duration 1.344793157000 total durat. 3.051869251000 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 = 18} , self = 79 , parent = Just 62 , duration = 1.344793157000 , status = Fail , start = 2021-07-13 23:29:08.994873597 UTC , finish = 2021-07-13 23:29:10.339666754 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '3' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 25} , self = 59 , parent = Just 12 , duration = 1.707076094000 , status = Fail , start = 2021-07-13 23:29:06.694093359 UTC , finish = 2021-07-13 23:29:08.401169453 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '7' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 6.881225895000 min duration 6.881225895000 total durat. 6.881225895000 Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 25} , self = 88 , parent = Just 12 , duration = 6.881225895000 , status = Fail , start = 2021-07-13 23:29:08.40139624 UTC , finish = 2021-07-13 23:29:15.282622135 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '0' ] , 0 , True )} Fail : Tiling { method = Backward , width = 12 , 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 5.783055389000 min duration 5.783055389000 total durat. 5.783055389000 Info { what = Tiling { method = Backward , width = 12 , 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 = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 84 , parent = Just 0 , duration = 5.783055389000 , status = Fail , start = 2021-07-13 23:29:06.198994444 UTC , finish = 2021-07-13 23:29:11.982049833 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '1' ] , 3 , 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 2 max duration 1.613843154000 min duration 0.037616521000 total durat. 1.651459675000 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 = 40 , num_strict_rules = 40 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 13 , total_length = 248} , self = 55 , parent = Just 28 , duration = 1.613843154000 , status = Success , start = 2021-07-13 23:29:06.376277824 UTC , finish = 2021-07-13 23:29:07.990120978 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '7' ] , 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 2 max duration 2.030691681000 min duration 0.058817744000 total durat. 2.089509425000 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 = 40 , num_strict_rules = 40 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 13 , total_length = 248} , self = 57 , parent = Just 28 , duration = 2.030691681000 , status = Success , start = 2021-07-13 23:29:06.365134882 UTC , finish = 2021-07-13 23:29:08.395826563 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '1' ] , 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 5 max duration 4.747093934000 min duration 0.113076178000 total durat. 9.767981933000 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 = 71 , num_strict_rules = 11 , num_top_rules = 11 , num_weak_rules = 60 , alphabet_size = 21 , total_length = 443} , self = 80 , parent = Just 34 , duration = 4.643705358000 , status = Success , start = 2021-07-13 23:29:06.701540799 UTC , finish = 2021-07-13 23:29:11.345246157 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '1' ] , 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 = 69 , num_strict_rules = 13 , num_top_rules = 13 , num_weak_rules = 56 , alphabet_size = 20 , total_length = 437} , self = 82 , parent = Just 49 , duration = 4.747093934000 , status = Success , start = 2021-07-13 23:29:07.047748572 UTC , finish = 2021-07-13 23:29:11.794842506 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '3' ] , 3 , True )} **************************************************