/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 3 letters mirror SRS with 3 rules on 3 letters DP SRS with 3 strict rules and 3 weak rules on 5 letters weights SRS with 2 strict rules and 3 weak rules on 4 letters EDG SRS with 2 strict rules and 3 weak rules on 4 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 4 letters EDG SRS with 1 rules on 2 letters Usable SRS with 1 rules on 2 letters weights SRS with 0 rules on 0 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a] -> [] {- Input 0 -} [a, b] -> [c, c] {- Input 1 -} [c, b] -> [b, b, a] {- Input 2 -} reason mirror property Termination has value Just True for SRS [a, a] -> [] {- Mirror (Input 0) -} [b, a] -> [c, c] {- Mirror (Input 1) -} [b, c] -> [a, b, b] {- Mirror (Input 2) -} reason DP property Termination has value Just True for SRS [a, a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, c] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [a, b, b] {- DP Nontop (Mirror (Input 2)) -} [b#, c] |-> [a#, b, b] {- DP (Top 0) (Mirror (Input 2)) -} [b#, c] |-> [b#] {- DP (Top 2) (Mirror (Input 2)) -} [b#, c] |-> [b#, b] {- DP (Top 1) (Mirror (Input 2)) -} reason (b#, 1/1) property Termination has value Just True for SRS [a, a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, c] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [a, b, b] {- DP Nontop (Mirror (Input 2)) -} [b#, c] |-> [b#] {- DP (Top 2) (Mirror (Input 2)) -} [b#, c] |-> [b#, b] {- DP (Top 1) (Mirror (Input 2)) -} reason EDG property Termination has value Just True for SRS [b#, c] |-> [b#] {- DP (Top 2) (Mirror (Input 2)) -} [b#, c] |-> [b#, b] {- DP (Top 1) (Mirror (Input 2)) -} [a, a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, c] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [a, b, b] {- DP Nontop (Mirror (Input 2)) -} reason ( a , Wk / - 0A 0A 2A \ | 4A 7A 0A 7A | | - 0A - 0A | \ - - - 0A / ) ( b , Wk / - - 3A 3A \ | - - 0A - | | - 0A - 0A | \ - - - 0A / ) ( c , Wk / - 0A - 0A \ | - 0A - 0A | | 4A 7A 0A 7A | \ - - - 0A / ) ( b# , Wk / - - 0A 1A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [b#, c] |-> [b#] {- DP (Top 2) (Mirror (Input 2)) -} [a, a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, c] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [a, b, b] {- DP Nontop (Mirror (Input 2)) -} reason EDG property Termination has value Just True for SRS [b#, c] |-> [b#] {- DP (Top 2) (Mirror (Input 2)) -} reason Usable property Termination has value Just True for SRS [b#, c] |-> [b#] {- DP (Top 2) (Mirror (Input 2)) -} reason (c, 1/1) property Termination has value Just True for SRS reason no strict rules ************************************************** skeleton: \Mirror(3,3)\Deepee(3/3,5)\Weight\EDG(2/3,4)\Matrix{\Arctic}{4}(1/3,4)\EDG\Usable(1,2)\Weight(0,0)[] ************************************************** 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.043905259000 min duration 0.897854883000 total durat. 1.941760142000 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 = 21} , self = 50 , parent = Just 16 , duration = 1.043905259000 , status = Fail , start = 2021-07-13 22:05:52.030754033 UTC , finish = 2021-07-13 22:05:53.074659292 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '6' ] , 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 6.211750738000 min duration 6.211750738000 total durat. 6.211750738000 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 = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 18} , self = 70 , parent = Just 11 , duration = 6.211750738000 , status = Success , start = 2021-07-13 22:05:52.928622443 UTC , finish = 2021-07-13 22:05:59.140373181 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '4' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.339743344000 min duration 1.167399470000 total durat. 2.507142814000 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 = 4 , total_length = 18} , self = 57 , parent = Just 11 , duration = 1.167399470000 , status = Fail , start = 2021-07-13 22:05:52.306013211 UTC , finish = 2021-07-13 22:05:53.473412681 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '7' ] , 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 = 21} , self = 60 , parent = Just 16 , duration = 1.339743344000 , status = Fail , start = 2021-07-13 22:05:52.38221773 UTC , finish = 2021-07-13 22:05:53.721961074 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '3' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 4.975808422000 min duration 4.975808422000 total durat. 4.975808422000 Info { what = QPI { dim = 6 , 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 = 4 , total_length = 18} , self = 69 , parent = Just 11 , duration = 4.975808422000 , status = Fail , start = 2021-07-13 22:05:53.47361637 UTC , finish = 2021-07-13 22:05:58.449424792 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '9' ] , 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 2 max duration 1.131589199000 min duration 0.042548723000 total durat. 1.174137922000 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 = 32 , num_strict_rules = 32 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 11 , total_length = 182} , self = 51 , parent = Just 35 , duration = 1.131589199000 , status = Success , start = 2021-07-13 22:05:52.257492337 UTC , finish = 2021-07-13 22:05:53.389081536 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '8' ] , 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 1 max duration 4.161719412000 min duration 4.161719412000 total durat. 4.161719412000 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 = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 11} , self = 65 , parent = Just 0 , duration = 4.161719412000 , status = Success , start = 2021-07-13 22:05:52.030425463 UTC , finish = 2021-07-13 22:05:56.192144875 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '9' ] , 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 1.233988866000 min duration 0.059543680000 total durat. 1.293532546000 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 = 32 , num_strict_rules = 32 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 11 , total_length = 182} , self = 58 , parent = Just 35 , duration = 1.233988866000 , status = Success , start = 2021-07-13 22:05:52.257533073 UTC , finish = 2021-07-13 22:05:53.491521939 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '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 1 max duration 4.086189325000 min duration 4.086189325000 total durat. 4.086189325000 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 = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 11} , self = 63 , parent = Just 0 , duration = 4.086189325000 , status = Success , start = 2021-07-13 22:05:52.036750392 UTC , finish = 2021-07-13 22:05:56.122939717 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '7' ] , 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 4 max duration 3.530486876000 min duration 0.126410051000 total durat. 5.825065216000 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 = 47 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 41 , alphabet_size = 15 , total_length = 266} , self = 61 , parent = Just 45 , duration = 2.018098739000 , status = Success , start = 2021-07-13 22:05:52.729508127 UTC , finish = 2021-07-13 22:05:54.747606866 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '8' ] , 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 = 61 , num_strict_rules = 9 , num_top_rules = 9 , num_weak_rules = 52 , alphabet_size = 19 , total_length = 346} , self = 67 , parent = Just 53 , duration = 3.530486876000 , status = Success , start = 2021-07-13 22:05:53.447670111 UTC , finish = 2021-07-13 22:05:56.978156987 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '6' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 6 max duration 1.230780490000 min duration 0.000159242000 total durat. 1.981666500000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 76 , num_strict_rules = 12 , num_top_rules = 12 , num_weak_rules = 64 , alphabet_size = 24 , total_length = 432} , self = 53 , parent = Just 34 , duration = 1.230780490000 , status = Success , start = 2021-07-13 22:05:52.18851802 UTC , finish = 2021-07-13 22:05:53.41929851 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '8' ] , 3 , False )} **************************************************