/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 DP SRS with 6 strict rules and 3 weak rules on 6 letters weights SRS with 4 strict rules and 3 weak rules on 5 letters EDG SRS with 4 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 2 strict rules and 3 weak rules on 5 letters EDG SRS with 2 rules on 4 letters Usable SRS with 2 rules on 4 letters weights SRS with 0 rules on 0 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [b] {- Input 0 -} [b, b, c] -> [c, b, c, a, a] {- Input 1 -} [c, c] -> [] {- Input 2 -} reason DP property Termination has value Just True for SRS [a] ->= [b] {- DP Nontop (Input 0) -} [b, b, c] ->= [c, b, c, a, a] {- DP Nontop (Input 1) -} [c, c] ->= [] {- DP Nontop (Input 2) -} [a#] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, b, c] |-> [a#] {- DP (Top 4) (Input 1) -} [b#, b, c] |-> [a#, a] {- DP (Top 3) (Input 1) -} [b#, b, c] |-> [b#, c, a, a] {- DP (Top 1) (Input 1) -} [b#, b, c] |-> [c#, a, a] {- DP (Top 2) (Input 1) -} [b#, b, c] |-> [c#, b, c, a, a] {- DP (Top 0) (Input 1) -} reason (a#, 1/2) (b#, 1/2) property Termination has value Just True for SRS [a] ->= [b] {- DP Nontop (Input 0) -} [b, b, c] ->= [c, b, c, a, a] {- DP Nontop (Input 1) -} [c, c] ->= [] {- DP Nontop (Input 2) -} [a#] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, b, c] |-> [a#] {- DP (Top 4) (Input 1) -} [b#, b, c] |-> [a#, a] {- DP (Top 3) (Input 1) -} [b#, b, c] |-> [b#, c, a, a] {- DP (Top 1) (Input 1) -} reason EDG property Termination has value Just True for SRS [a#] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, b, c] |-> [b#, c, a, a] {- DP (Top 1) (Input 1) -} [b#, b, c] |-> [a#, a] {- DP (Top 3) (Input 1) -} [b#, b, c] |-> [a#] {- DP (Top 4) (Input 1) -} [a] ->= [b] {- DP Nontop (Input 0) -} [b, b, c] ->= [c, b, c, a, a] {- DP Nontop (Input 1) -} [c, c] ->= [] {- DP Nontop (Input 2) -} reason ( a , Wk / - 0A - 0A \ | 0A - - - | | - 1A - 0A | \ - - - 0A / ) ( b , Wk / - 0A - 0A \ | 0A - - - | | - 1A - 0A | \ - - - 0A / ) ( c , Wk / 7A 0A 6A 7A \ | 0A - - - | | 2A 0A 0A - | \ - - - 0A / ) ( a# , Wk / 0A 3A 0A 1A \ | - - - - | | - - - - | \ - - - 0A / ) ( b# , Wk / - 3A - 1A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a#] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, b, c] |-> [a#] {- DP (Top 4) (Input 1) -} [a] ->= [b] {- DP Nontop (Input 0) -} [b, b, c] ->= [c, b, c, a, a] {- DP Nontop (Input 1) -} [c, c] ->= [] {- DP Nontop (Input 2) -} reason EDG property Termination has value Just True for SRS [a#] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, b, c] |-> [a#] {- DP (Top 4) (Input 1) -} reason Usable property Termination has value Just True for SRS [a#] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, b, c] |-> [a#] {- DP (Top 4) (Input 1) -} reason (b, 1/1) (c, 1/1) (a#, 1/1) property Termination has value Just True for SRS reason no strict rules ************************************************** skeleton: (3,3)\Deepee(6/3,6)\Weight\EDG(4/3,5)\Matrix{\Arctic}{4}(2/3,5)\EDG\Usable(2,4)\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.598661596000 min duration 1.292405121000 total durat. 2.891066717000 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 = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 22} , self = 59 , parent = Just 11 , duration = 1.292405121000 , status = Fail , start = 2021-07-13 23:00:40.675663207 UTC , finish = 2021-07-13 23:00:41.968068328 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '7' ] , 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 = 30} , self = 60 , parent = Just 15 , duration = 1.598661596000 , status = Fail , start = 2021-07-13 23:00:40.676188966 UTC , finish = 2021-07-13 23:00:42.274850562 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '3' ] , 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 8.543768227000 min duration 8.543768227000 total durat. 8.543768227000 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 = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 30} , self = 76 , parent = Just 15 , duration = 8.543768227000 , status = Success , start = 2021-07-13 23:00:42.275190663 UTC , finish = 2021-07-13 23:00:50.81895889 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '5' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 2.008226799000 min duration 1.516117310000 total durat. 3.524344109000 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 = 22} , self = 61 , parent = Just 11 , duration = 1.516117310000 , status = Fail , start = 2021-07-13 23:00:40.972203921 UTC , finish = 2021-07-13 23:00:42.488321231 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '6' ] , 0 , True )} 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 = 30} , self = 64 , parent = Just 15 , duration = 2.008226799000 , status = Fail , start = 2021-07-13 23:00:41.102288809 UTC , finish = 2021-07-13 23:00:43.110515608 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 2 max duration 7.750423323000 min duration 5.795105144000 total durat. 13.545528467000 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 = 22} , self = 73 , parent = Just 11 , duration = 5.795105144000 , status = Fail , start = 2021-07-13 23:00:42.488602585 UTC , finish = 2021-07-13 23:00:48.283707729 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '8' ] , 0 , True )} Info { what = QPI { dim = 6 , 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 = 30} , self = 83 , parent = Just 15 , duration = 7.750423323000 , status = Fail , start = 2021-07-13 23:00:43.110815844 UTC , finish = 2021-07-13 23:00:50.861239167 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '3' ] , 0 , True )} Fail : QPI { dim = 8, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.545029505000 min duration 2.545029505000 total durat. 2.545029505000 Info { what = QPI { dim = 8 , 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 = 22} , self = 82 , parent = Just 11 , duration = 2.545029505000 , status = Fail , start = 2021-07-13 23:00:48.316198759 UTC , finish = 2021-07-13 23:00:50.861228264 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '5' , '5' ] , 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 3 max duration 1.141643497000 min duration 0.058682797000 total durat. 2.121474531000 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 = 29 , num_strict_rules = 29 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 11 , total_length = 188} , self = 62 , parent = Just 55 , duration = 1.141643497000 , status = Success , start = 2021-07-13 23:00:41.836388243 UTC , finish = 2021-07-13 23:00:42.97803174 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '2' ] , 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 9.534748053000 min duration 9.534748053000 total durat. 9.534748053000 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 = 12} , self = 74 , parent = Just 0 , duration = 9.534748053000 , status = Success , start = 2021-07-13 23:00:40.684186384 UTC , finish = 2021-07-13 23:00:50.218934437 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '5' ] , 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 3 max duration 2.295471647000 min duration 0.063288653000 total durat. 3.754700366000 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 = 29 , num_strict_rules = 29 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 11 , total_length = 188} , self = 67 , parent = Just 55 , duration = 1.395940066000 , status = Success , start = 2021-07-13 23:00:41.842281652 UTC , finish = 2021-07-13 23:00:43.238221718 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '8' ] , 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 = 36 , num_strict_rules = 36 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 12 , total_length = 216} , self = 65 , parent = Just 35 , duration = 2.295471647000 , status = Success , start = 2021-07-13 23:00:40.861169932 UTC , finish = 2021-07-13 23:00:43.156641579 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '7' ] , 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 6.448814291000 min duration 6.448814291000 total durat. 6.448814291000 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 = 12} , self = 71 , parent = Just 0 , duration = 6.448814291000 , status = Success , start = 2021-07-13 23:00:40.68404953 UTC , finish = 2021-07-13 23:00:47.132863821 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '5' ] , 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 3 max duration 5.964674254000 min duration 0.105708209000 total durat. 6.225207462000 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 = 54 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 47 , alphabet_size = 16 , total_length = 334} , self = 69 , parent = Just 43 , duration = 5.964674254000 , status = Success , start = 2021-07-13 23:00:41.119692012 UTC , finish = 2021-07-13 23:00:47.084366266 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '7' ] , 3 , True )} **************************************************