/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 3 letters mirror SRS with 4 rules on 3 letters DP SRS with 5 strict rules and 4 weak rules on 6 letters weights SRS with 2 strict rules and 4 weak rules on 4 letters EDG SRS with 2 strict rules and 4 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 4 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [] {- Input 0 -} [a, b] -> [] {- Input 1 -} [a, c] -> [c, c, a, a, b] {- Input 2 -} [b, b] -> [] {- Input 3 -} reason mirror property Termination has value Just True for SRS [a] -> [] {- Mirror (Input 0) -} [b, a] -> [] {- Mirror (Input 1) -} [c, a] -> [b, a, a, c, c] {- Mirror (Input 2) -} [b, b] -> [] {- Mirror (Input 3) -} reason DP property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [] {- DP Nontop (Mirror (Input 1)) -} [c, a] ->= [b, a, a, c, c] {- DP Nontop (Mirror (Input 2)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 3)) -} [c#, a] |-> [a#, a, c, c] {- DP (Top 1) (Mirror (Input 2)) -} [c#, a] |-> [a#, c, c] {- DP (Top 2) (Mirror (Input 2)) -} [c#, a] |-> [b#, a, a, c, c] {- DP (Top 0) (Mirror (Input 2)) -} [c#, a] |-> [c#] {- DP (Top 4) (Mirror (Input 2)) -} [c#, a] |-> [c#, c] {- DP (Top 3) (Mirror (Input 2)) -} reason (c#, 3/1) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [] {- DP Nontop (Mirror (Input 1)) -} [c, a] ->= [b, a, a, c, c] {- DP Nontop (Mirror (Input 2)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 3)) -} [c#, a] |-> [c#] {- DP (Top 4) (Mirror (Input 2)) -} [c#, a] |-> [c#, c] {- DP (Top 3) (Mirror (Input 2)) -} reason EDG property Termination has value Just True for SRS [c#, a] |-> [c#] {- DP (Top 4) (Mirror (Input 2)) -} [c#, a] |-> [c#, c] {- DP (Top 3) (Mirror (Input 2)) -} [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [] {- DP Nontop (Mirror (Input 1)) -} [c, a] ->= [b, a, a, c, c] {- DP Nontop (Mirror (Input 2)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 3)) -} reason ( a , Wk / 0A 0A - 1A \ | 0A 3A - 4A | | - - 0A - | \ - - - 0A / ) ( b , Wk / 0A 0A 0A - \ | 0A - - - | | - - 0A - | \ - - - 0A / ) ( c , Wk / - 3A - 0A \ | - 0A - 0A | | - - - 7A | \ - - - 0A / ) ( c# , Wk / 0A 2A - 0A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [] {- DP Nontop (Mirror (Input 1)) -} [c, a] ->= [b, a, a, c, c] {- DP Nontop (Mirror (Input 2)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 3)) -} reason EDG ************************************************** skeleton: \Mirror(4,3)\Deepee(5/4,6)\Weight\EDG(2/4,4)\Matrix{\Arctic}{4}(0/4,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) ************************************************** Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} total number 1 max duration 7.973690346000 min duration 7.973690346000 total durat. 7.973690346000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 76 , parent = Just 0 , duration = 7.973690346000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:08:05.553792098 UTC , finish = 2021-07-13 23:08:13.527482444 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '5' , '0' ] , 2 , True )} 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.168691798000 min duration 0.934386897000 total durat. 2.103078695000 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 = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 21} , self = 54 , parent = Just 12 , duration = 1.168691798000 , status = Fail , start = 2021-07-13 23:08:05.554628459 UTC , finish = 2021-07-13 23:08:06.723320257 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '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 7.028253837000 min duration 7.028253837000 total durat. 7.028253837000 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 = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 68 , parent = Just 16 , duration = 7.028253837000 , status = Success , start = 2021-07-13 23:08:06.49172303 UTC , finish = 2021-07-13 23:08:13.519976867 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '0' ] , 0 , True )} Fail : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 6.637852531000 min duration 5.932838980000 total durat. 12.570691511000 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 = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 65 , parent = Just 16 , duration = 5.932838980000 , status = Fail , start = 2021-07-13 23:08:05.810335807 UTC , finish = 2021-07-13 23:08:11.743174787 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '0' ] , 0 , True )} 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 = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 21} , self = 66 , parent = Just 12 , duration = 6.637852531000 , status = Fail , start = 2021-07-13 23:08:05.918694522 UTC , finish = 2021-07-13 23:08:12.556547053 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '2' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.488588037000 min duration 1.293307872000 total durat. 2.781895909000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 55 , parent = Just 16 , duration = 1.293307872000 , status = Fail , start = 2021-07-13 23:08:05.8812072 UTC , finish = 2021-07-13 23:08:07.174515072 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '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 = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 21} , self = 58 , parent = Just 12 , duration = 1.488588037000 , status = Fail , start = 2021-07-13 23:08:05.92409819 UTC , finish = 2021-07-13 23:08:07.412686227 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '5' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 6.113259971000 min duration 5.791330602000 total durat. 11.904590573000 Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 67 , parent = Just 16 , duration = 5.791330602000 , status = Fail , start = 2021-07-13 23:08:07.17462669 UTC , finish = 2021-07-13 23:08:12.965957292 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '8' ] , 0 , True )} Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 21} , self = 75 , parent = Just 12 , duration = 6.113259971000 , status = Fail , start = 2021-07-13 23:08:07.414032235 UTC , finish = 2021-07-13 23:08:13.527292206 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '2' ] , 0 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Simple (Config { tracing = False , verbose = False , closure = Backward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) total number 1 max duration 7.969157531000 min duration 7.969157531000 total durat. 7.969157531000 Info { what = Simple (Config { tracing = False , verbose = False , closure = Backward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) , input_size = Size { num_rules = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 72 , parent = Just 0 , duration = 7.969157531000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:08:05.553802783 UTC , finish = 2021-07-13 23:08:13.522960314 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '5' ] , 1 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Simple (Config { tracing = False , verbose = False , closure = Forward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) total number 1 max duration 7.969137711000 min duration 7.969137711000 total durat. 7.969137711000 Info { what = Simple (Config { tracing = False , verbose = False , closure = Forward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) , input_size = Size { num_rules = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 71 , parent = Just 0 , duration = 7.969137711000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:08:05.553777671 UTC , finish = 2021-07-13 23:08:13.522915382 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' ] , 1 , 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.541653604000 min duration 0.045530021000 total durat. 1.587183625000 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 = 48 , num_strict_rules = 48 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 12 , total_length = 240} , self = 56 , parent = Just 30 , duration = 1.541653604000 , status = Success , start = 2021-07-13 23:08:05.674341733 UTC , finish = 2021-07-13 23:08:07.215995337 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '3' ] , 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.916670276000 min duration 0.048810232000 total durat. 1.965480508000 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 = 48 , num_strict_rules = 48 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 12 , total_length = 240} , self = 59 , parent = Just 30 , duration = 1.916670276000 , status = Success , start = 2021-07-13 23:08:05.649205132 UTC , finish = 2021-07-13 23:08:07.565875408 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '9' ] , 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.675955178000 min duration 0.114908946000 total durat. 7.009125037000 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 = 8 , num_top_rules = 8 , num_weak_rules = 61 , alphabet_size = 16 , total_length = 361} , self = 61 , parent = Just 45 , duration = 3.101704121000 , status = Success , start = 2021-07-13 23:08:05.887246169 UTC , finish = 2021-07-13 23:08:08.98895029 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '9' ] , 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 = 66 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 60 , alphabet_size = 16 , total_length = 333} , self = 63 , parent = Just 36 , duration = 3.675955178000 , status = Success , start = 2021-07-13 23:08:05.753804177 UTC , finish = 2021-07-13 23:08:09.429759355 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '2' ] , 3 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Transport { mode = Standard, max_derivation_length = Nothing} total number 1 max duration 7.969158199000 min duration 7.969158199000 total durat. 7.969158199000 Info { what = Transport { mode = Standard, max_derivation_length = Nothing} , input_size = Size { num_rules = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 73 , parent = Just 0 , duration = 7.969158199000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:08:05.553817533 UTC , finish = 2021-07-13 23:08:13.522975732 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '0' ] , 1 , True )} **************************************************