/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 6 strict rules and 3 weak rules on 5 letters weights SRS with 4 strict rules and 3 weak rules on 5 letters EDG 2 sub-proofs 1 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 2 SRS with 3 strict rules and 3 weak rules on 4 letters Matrix { monotone = Weak, domain = Natural, shape = Full, bits = 3, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 0 strict rules and 3 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a, b, b] -> [b, b, b, a, a, a] {- Input 0 -} [a, c] -> [c, a] {- Input 1 -} [c, b] -> [b, c] {- Input 2 -} reason mirror property Termination has value Just True for SRS [b, b, a, a] -> [a, a, a, b, b, b] {- Mirror (Input 0) -} [c, a] -> [a, c] {- Mirror (Input 1) -} [b, c] -> [c, b] {- Mirror (Input 2) -} reason DP property Termination has value Just True for SRS [b, b, a, a] ->= [a, a, a, b, b, b] {- DP Nontop (Mirror (Input 0)) -} [c, a] ->= [a, c] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [c, b] {- DP Nontop (Mirror (Input 2)) -} [b#, b, a, a] |-> [b#] {- DP (Top 5) (Mirror (Input 0)) -} [b#, b, a, a] |-> [b#, b] {- DP (Top 4) (Mirror (Input 0)) -} [b#, b, a, a] |-> [b#, b, b] {- DP (Top 3) (Mirror (Input 0)) -} [b#, c] |-> [b#] {- DP (Top 1) (Mirror (Input 2)) -} [b#, c] |-> [c#, b] {- DP (Top 0) (Mirror (Input 2)) -} [c#, a] |-> [c#] {- DP (Top 1) (Mirror (Input 1)) -} reason (c, 2/1) (b#, 1/1) property Termination has value Just True for SRS [b, b, a, a] ->= [a, a, a, b, b, b] {- DP Nontop (Mirror (Input 0)) -} [c, a] ->= [a, c] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [c, b] {- DP Nontop (Mirror (Input 2)) -} [b#, b, a, a] |-> [b#] {- DP (Top 5) (Mirror (Input 0)) -} [b#, b, a, a] |-> [b#, b] {- DP (Top 4) (Mirror (Input 0)) -} [b#, b, a, a] |-> [b#, b, b] {- DP (Top 3) (Mirror (Input 0)) -} [c#, a] |-> [c#] {- DP (Top 1) (Mirror (Input 1)) -} reason EDG property Termination has value Just True for SRS [c#, a] |-> [c#] {- DP (Top 1) (Mirror (Input 1)) -} reason Usable property Termination has value Just True for SRS [c#, a] |-> [c#] {- DP (Top 1) (Mirror (Input 1)) -} reason (a, 1/1) property Termination has value Just True for SRS reason no strict rules property Termination has value Just True for SRS [b#, b, a, a] |-> [b#] {- DP (Top 5) (Mirror (Input 0)) -} [b#, b, a, a] |-> [b#, b, b] {- DP (Top 3) (Mirror (Input 0)) -} [b#, b, a, a] |-> [b#, b] {- DP (Top 4) (Mirror (Input 0)) -} [b, b, a, a] ->= [a, a, a, b, b, b] {- DP Nontop (Mirror (Input 0)) -} [c, a] ->= [a, c] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [c, b] {- DP Nontop (Mirror (Input 2)) -} reason ( b , Wk / 0 0 1 0 \ | 2 0 0 0 | | 1 0 0 0 | \ 0 0 0 1 / ) ( a , Wk / 0 0 0 0 \ | 2 0 1 1 | | 1 1 0 0 | \ 0 0 0 1 / ) ( c , Wk / 2 0 0 0 \ | 0 2 0 0 | | 0 0 2 0 | \ 0 0 0 1 / ) ( b# , Wk / 1 0 0 6 \ | 0 0 0 0 | | 0 0 0 0 | \ 0 0 0 1 / ) property Termination has value Just True for SRS [b, b, a, a] ->= [a, a, a, b, b, b] {- DP Nontop (Mirror (Input 0)) -} [c, a] ->= [a, c] {- DP Nontop (Mirror (Input 1)) -} [b, c] ->= [c, b] {- DP Nontop (Mirror (Input 2)) -} reason EDG ************************************************** skeleton: \Mirror(3,3)\Deepee(6/3,5)\Weight(4/3,5)\EDG[\Usable(1,2)\Weight(0,0)[],(3/3,4)\Matrix{\Natural}{4}(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 2 max duration 2.337360002000 min duration 2.334627171000 total durat. 4.671987173000 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 = 4 , total_length = 36} , self = 64 , parent = Just 11 , duration = 2.334627171000 , status = Fail , start = 2021-07-13 23:34:23.243503682 UTC , finish = 2021-07-13 23:34:25.578130853 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '9' ] , 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 = 4 , total_length = 36} , self = 65 , parent = Just 21 , duration = 2.337360002000 , status = Fail , start = 2021-07-13 23:34:23.247815403 UTC , finish = 2021-07-13 23:34:25.585175405 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '6' ] , 0 , True )} Success : 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 8.433822879000 min duration 8.433822879000 total durat. 8.433822879000 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 = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 36} , self = 89 , parent = Just 11 , duration = 8.433822879000 , status = Success , start = 2021-07-13 23:34:23.779626199 UTC , finish = 2021-07-13 23:34:32.213449078 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '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.535934554000 min duration 0.534501755000 total durat. 1.070436309000 Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 0.508008092000 min duration 0.498541609000 total durat. 1.006549701000 Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 2.351391249000 min duration 2.337664427000 total durat. 4.689055676000 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 = 4 , total_length = 36} , self = 74 , parent = Just 21 , duration = 2.337664427000 , status = Fail , start = 2021-07-13 23:34:23.756021759 UTC , finish = 2021-07-13 23:34:26.093686186 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '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 = 4 , total_length = 36} , self = 73 , parent = Just 11 , duration = 2.351391249000 , status = Fail , start = 2021-07-13 23:34:23.742289913 UTC , finish = 2021-07-13 23:34:26.093681162 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '0' ] , 0 , True )} Fail : Tiling { method = Overlap , 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 2 max duration 4.085779927000 min duration 4.083401770000 total durat. 8.169181697000 Info { what = Tiling { method = Overlap , 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 = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 36} , self = 79 , parent = Just 11 , duration = 4.083401770000 , status = Fail , start = 2021-07-13 23:34:23.247441621 UTC , finish = 2021-07-13 23:34:27.330843391 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '8' ] , 3 , True )} Info { what = Tiling { method = Overlap , 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 = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 36} , self = 80 , parent = Just 21 , duration = 4.085779927000 , status = Fail , start = 2021-07-13 23:34:23.255628334 UTC , finish = 2021-07-13 23:34:27.341408261 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '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 2.098102947000 min duration 0.173512195000 total durat. 4.541238712000 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 = 34 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 27 , alphabet_size = 11 , total_length = 274} , self = 67 , parent = Just 47 , duration = 2.095042322000 , status = Success , start = 2021-07-13 23:34:23.541512647 UTC , finish = 2021-07-13 23:34:25.636554969 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '5' ] , 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 = 34 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 27 , alphabet_size = 11 , total_length = 274} , self = 69 , parent = Just 49 , duration = 2.098102947000 , status = Success , start = 2021-07-13 23:34:23.559831467 UTC , finish = 2021-07-13 23:34:25.657934414 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '1' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 12 max duration 3.365469126000 min duration 0.000136274000 total durat. 9.634067993000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 297 , num_strict_rules = 297 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 39 , total_length = 2862} , self = 71 , parent = Just 62 , duration = 1.392612943000 , status = Success , start = 2021-07-13 23:34:24.302360646 UTC , finish = 2021-07-13 23:34:25.694973589 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '2' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 297 , num_strict_rules = 297 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 39 , total_length = 2862} , self = 63 , parent = Just 60 , duration = 1.481816198000 , status = Success , start = 2021-07-13 23:34:24.087740497 UTC , finish = 2021-07-13 23:34:25.569556695 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '1' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 348 , num_strict_rules = 21 , num_top_rules = 21 , num_weak_rules = 327 , alphabet_size = 44 , total_length = 3372} , self = 81 , parent = Just 70 , duration = 3.226190709000 , status = Success , start = 2021-07-13 23:34:25.658025238 UTC , finish = 2021-07-13 23:34:28.884215947 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '4' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 348 , num_strict_rules = 21 , num_top_rules = 21 , num_weak_rules = 327 , alphabet_size = 44 , total_length = 3372} , self = 83 , parent = Just 68 , duration = 3.365469126000 , status = Success , start = 2021-07-13 23:34:25.636722071 UTC , finish = 2021-07-13 23:34:29.002191197 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '3' ] , 3 , False )} **************************************************