/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 4 rules on 4 letters mirror SRS with 4 rules on 4 letters DP SRS with 10 strict rules and 4 weak rules on 8 letters weights SRS with 7 strict rules and 4 weak rules on 8 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 6 strict rules and 3 weak rules on 6 letters Usable SRS with 6 strict rules and 3 weak rules on 6 letters weights SRS with 1 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 0 strict rules and 3 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, b, a] -> [b, c] {- Input 0 -} [b, b, b] -> [c, b] {- Input 1 -} [c] -> [a, b] {- Input 2 -} [c, d] -> [d, c, b, a] {- Input 3 -} reason mirror property Termination has value Just True for SRS [a, b, a] -> [c, b] {- Mirror (Input 0) -} [b, b, b] -> [b, c] {- Mirror (Input 1) -} [c] -> [b, a] {- Mirror (Input 2) -} [d, c] -> [a, b, c, d] {- Mirror (Input 3) -} reason DP property Termination has value Just True for SRS [a, b, a] ->= [c, b] {- DP Nontop (Mirror (Input 0)) -} [b, b, b] ->= [b, c] {- DP Nontop (Mirror (Input 1)) -} [c] ->= [b, a] {- DP Nontop (Mirror (Input 2)) -} [d, c] ->= [a, b, c, d] {- DP Nontop (Mirror (Input 3)) -} [a#, b, a] |-> [b#] {- DP (Top 1) (Mirror (Input 0)) -} [a#, b, a] |-> [c#, b] {- DP (Top 0) (Mirror (Input 0)) -} [b#, b, b] |-> [b#, c] {- DP (Top 0) (Mirror (Input 1)) -} [b#, b, b] |-> [c#] {- DP (Top 1) (Mirror (Input 1)) -} [c#] |-> [a#] {- DP (Top 1) (Mirror (Input 2)) -} [c#] |-> [b#, a] {- DP (Top 0) (Mirror (Input 2)) -} [d#, c] |-> [a#, b, c, d] {- DP (Top 0) (Mirror (Input 3)) -} [d#, c] |-> [b#, c, d] {- DP (Top 1) (Mirror (Input 3)) -} [d#, c] |-> [c#, d] {- DP (Top 2) (Mirror (Input 3)) -} [d#, c] |-> [d#] {- DP (Top 3) (Mirror (Input 3)) -} reason (d#, 3/1) property Termination has value Just True for SRS [a, b, a] ->= [c, b] {- DP Nontop (Mirror (Input 0)) -} [b, b, b] ->= [b, c] {- DP Nontop (Mirror (Input 1)) -} [c] ->= [b, a] {- DP Nontop (Mirror (Input 2)) -} [d, c] ->= [a, b, c, d] {- DP Nontop (Mirror (Input 3)) -} [a#, b, a] |-> [b#] {- DP (Top 1) (Mirror (Input 0)) -} [a#, b, a] |-> [c#, b] {- DP (Top 0) (Mirror (Input 0)) -} [b#, b, b] |-> [b#, c] {- DP (Top 0) (Mirror (Input 1)) -} [b#, b, b] |-> [c#] {- DP (Top 1) (Mirror (Input 1)) -} [c#] |-> [a#] {- DP (Top 1) (Mirror (Input 2)) -} [c#] |-> [b#, a] {- DP (Top 0) (Mirror (Input 2)) -} [d#, c] |-> [d#] {- DP (Top 3) (Mirror (Input 3)) -} reason EDG property Termination has value Just True for SRS [d#, c] |-> [d#] {- DP (Top 3) (Mirror (Input 3)) -} reason Usable property Termination has value Just True for SRS [d#, c] |-> [d#] {- DP (Top 3) (Mirror (Input 3)) -} reason (c, 1/1) property Termination has value Just True for SRS reason no strict rules property Termination has value Just True for SRS [a#, b, a] |-> [b#] {- DP (Top 1) (Mirror (Input 0)) -} [b#, b, b] |-> [c#] {- DP (Top 1) (Mirror (Input 1)) -} [c#] |-> [b#, a] {- DP (Top 0) (Mirror (Input 2)) -} [b#, b, b] |-> [b#, c] {- DP (Top 0) (Mirror (Input 1)) -} [c#] |-> [a#] {- DP (Top 1) (Mirror (Input 2)) -} [a#, b, a] |-> [c#, b] {- DP (Top 0) (Mirror (Input 0)) -} [a, b, a] ->= [c, b] {- DP Nontop (Mirror (Input 0)) -} [b, b, b] ->= [b, c] {- DP Nontop (Mirror (Input 1)) -} [c] ->= [b, a] {- DP Nontop (Mirror (Input 2)) -} reason Usable property Termination has value Just True for SRS [a#, b, a] |-> [b#] {- DP (Top 1) (Mirror (Input 0)) -} [b#, b, b] |-> [c#] {- DP (Top 1) (Mirror (Input 1)) -} [c#] |-> [b#, a] {- DP (Top 0) (Mirror (Input 2)) -} [b#, b, b] |-> [b#, c] {- DP (Top 0) (Mirror (Input 1)) -} [c#] |-> [a#] {- DP (Top 1) (Mirror (Input 2)) -} [a#, b, a] |-> [c#, b] {- DP (Top 0) (Mirror (Input 0)) -} [a, b, a] ->= [c, b] {- DP Nontop (Mirror (Input 0)) -} [b, b, b] ->= [b, c] {- DP Nontop (Mirror (Input 1)) -} [c] ->= [b, a] {- DP Nontop (Mirror (Input 2)) -} reason (a, 3/1) (b, 3/1) (c, 6/1) (a#, 3/1) (c#, 5/1) property Termination has value Just True for SRS [b#, b, b] |-> [b#, c] {- DP (Top 0) (Mirror (Input 1)) -} [a, b, a] ->= [c, b] {- DP Nontop (Mirror (Input 0)) -} [b, b, b] ->= [b, c] {- DP Nontop (Mirror (Input 1)) -} [c] ->= [b, a] {- DP Nontop (Mirror (Input 2)) -} reason ( a , Wk / 1A 2A - - \ | - 3A - 3A | | 0A 0A - 0A | \ - - - 0A / ) ( b , Wk / - 3A - 3A \ | - - - 0A | | 1A 0A 3A 1A | \ - - - 0A / ) ( c , Wk / - 6A - 6A \ | - - - 0A | | 3A 3A - 3A | \ - - - 0A / ) ( b# , Wk / 1A 7A 4A 7A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a, b, a] ->= [c, b] {- DP Nontop (Mirror (Input 0)) -} [b, b, b] ->= [b, c] {- DP Nontop (Mirror (Input 1)) -} [c] ->= [b, a] {- DP Nontop (Mirror (Input 2)) -} reason EDG ************************************************** skeleton: \Mirror(4,4)\Deepee(10/4,8)\Weight(7/4,8)\EDG[\Usable(1,2)\Weight(0,0)[],\Usable(6/3,6)\Weight(1/3,4)\Matrix{\Arctic}{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 3.069414148000 min duration 1.255569319000 total durat. 4.324983467000 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 = 70 , parent = Just 22 , duration = 1.255569319000 , status = Fail , start = 2021-07-13 23:35:51.436192184 UTC , finish = 2021-07-13 23:35:52.691761503 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '5' ] , 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 = 3 , num_top_rules = 3 , num_weak_rules = 4 , alphabet_size = 7 , total_length = 32} , self = 81 , parent = Just 60 , duration = 3.069414148000 , status = Fail , start = 2021-07-13 23:35:52.091444794 UTC , finish = 2021-07-13 23:35:55.160858942 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '6' , '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 8.109522783000 min duration 8.109522783000 total durat. 8.109522783000 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 = 4 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 18} , self = 85 , parent = Just 22 , duration = 8.109522783000 , status = Success , start = 2021-07-13 23:35:52.693997936 UTC , finish = 2021-07-13 23:36:00.803520719 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' , '3' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 3 max duration 0.658173477000 min duration 0.296685065000 total durat. 1.602540080000 Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 3.185034576000 min duration 1.504326034000 total durat. 4.689360610000 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 = 75 , parent = Just 22 , duration = 1.504326034000 , status = Fail , start = 2021-07-13 23:35:51.733095763 UTC , finish = 2021-07-13 23:35:53.237421797 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '3' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 7 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 4 , alphabet_size = 7 , total_length = 32} , self = 84 , parent = Just 60 , duration = 3.185034576000 , status = Fail , start = 2021-07-13 23:35:52.742473721 UTC , finish = 2021-07-13 23:35:55.927508297 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' , '7' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 7.628376498000 min duration 4.932705956000 total durat. 12.561082454000 Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 7 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 4 , alphabet_size = 7 , total_length = 32} , self = 88 , parent = Just 60 , duration = 4.932705956000 , status = Fail , start = 2021-07-13 23:35:55.933581665 UTC , finish = 2021-07-13 23:36:00.866287621 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '2' , '0' ] , 0 , True )} Info { what = QPI { dim = 6 , 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 = 89 , parent = Just 22 , duration = 7.628376498000 , status = Fail , start = 2021-07-13 23:35:53.237889189 UTC , finish = 2021-07-13 23:36:00.866265687 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '0' , '4' ] , 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 3.377040222000 min duration 0.050950807000 total durat. 3.549808535000 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 = 256} , self = 82 , parent = Just 46 , duration = 3.377040222000 , status = Success , start = 2021-07-13 23:35:51.883181284 UTC , finish = 2021-07-13 23:35:55.260221506 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '4' ] , 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 0.715765509000 min duration 0.170262296000 total durat. 1.503544824000 Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 9 max duration 2.317649929000 min duration 0.000573075000 total durat. 5.181701851000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 95 , num_strict_rules = 95 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 23 , total_length = 635} , self = 76 , parent = Just 43 , duration = 2.132760878000 , status = Success , start = 2021-07-13 23:35:51.626460062 UTC , finish = 2021-07-13 23:35:53.75922094 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '7' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 95 , num_strict_rules = 95 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 23 , total_length = 635} , self = 77 , parent = Just 69 , duration = 2.317649929000 , status = Success , start = 2021-07-13 23:35:52.160360748 UTC , finish = 2021-07-13 23:35:54.478010677 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '8' ] , 3 , False )} **************************************************