/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 2 letters DP SRS with 11 strict rules and 3 weak rules on 4 letters weights SRS with 2 strict rules and 3 weak rules on 4 letters EDG 2 sub-proofs 1 SRS with 1 strict rules and 3 weak rules on 3 letters remove some, by Config { method = Overlap,width = 2,unlabel = True} SRS with 0 strict rules and 3 weak rules on 2 letters no strict rules 2 SRS with 1 strict rules and 3 weak rules on 3 letters remove some, by Config { method = Overlap,width = 4,unlabel = True} SRS with 0 strict rules and 3 weak rules on 2 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, b, a, a] -> [a, a, b, a] {- Input 0 -} [b, b, a, a] -> [a, a, a, b] {- Input 1 -} [b, a, a, b] -> [b, b, b, a] {- Input 2 -} reason DP property Termination has value Just True for SRS [a, b, a, a] ->= [a, a, b, a] {- DP Nontop (Input 0) -} [b, b, a, a] ->= [a, a, a, b] {- DP Nontop (Input 1) -} [b, a, a, b] ->= [b, b, b, a] {- DP Nontop (Input 2) -} [a#, b, a, a] |-> [a#, a, b, a] {- DP (Top 0) (Input 0) -} [a#, b, a, a] |-> [a#, b, a] {- DP (Top 1) (Input 0) -} [a#, b, a, a] |-> [b#, a] {- DP (Top 2) (Input 0) -} [b#, a, a, b] |-> [a#] {- DP (Top 3) (Input 2) -} [b#, a, a, b] |-> [b#, a] {- DP (Top 2) (Input 2) -} [b#, a, a, b] |-> [b#, b, a] {- DP (Top 1) (Input 2) -} [b#, a, a, b] |-> [b#, b, b, a] {- DP (Top 0) (Input 2) -} [b#, b, a, a] |-> [a#, a, a, b] {- DP (Top 0) (Input 1) -} [b#, b, a, a] |-> [a#, a, b] {- DP (Top 1) (Input 1) -} [b#, b, a, a] |-> [a#, b] {- DP (Top 2) (Input 1) -} [b#, b, a, a] |-> [b#] {- DP (Top 3) (Input 1) -} reason (a, 2/1) (b, 2/1) (b#, 1/1) property Termination has value Just True for SRS [a, b, a, a] ->= [a, a, b, a] {- DP Nontop (Input 0) -} [b, b, a, a] ->= [a, a, a, b] {- DP Nontop (Input 1) -} [b, a, a, b] ->= [b, b, b, a] {- DP Nontop (Input 2) -} [a#, b, a, a] |-> [a#, a, b, a] {- DP (Top 0) (Input 0) -} [b#, a, a, b] |-> [b#, b, b, a] {- DP (Top 0) (Input 2) -} reason EDG property Termination has value Just True for SRS [a#, b, a, a] |-> [a#, a, b, a] {- DP (Top 0) (Input 0) -} [a, b, a, a] ->= [a, a, b, a] {- DP Nontop (Input 0) -} [b, b, a, a] ->= [a, a, a, b] {- DP Nontop (Input 1) -} [b, a, a, b] ->= [b, b, b, a] {- DP Nontop (Input 2) -} reason Tiling { method = Overlap, width = 2, state_type = Bit64, 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} steps 0 using 10 tiles remove some unmatched rules steps: 0 property Termination has value Just True for SRS [a, b, a, a] ->= [a, a, b, a] {- DP Nontop (Input 0) -} [b, b, a, a] ->= [a, a, a, b] {- DP Nontop (Input 1) -} [b, a, a, b] ->= [b, b, b, a] {- DP Nontop (Input 2) -} reason no strict rules property Termination has value Just True for SRS [b#, a, a, b] |-> [b#, b, b, a] {- DP (Top 0) (Input 2) -} [a, b, a, a] ->= [a, a, b, a] {- DP Nontop (Input 0) -} [b, b, a, a] ->= [a, a, a, b] {- DP Nontop (Input 1) -} [b, a, a, b] ->= [b, b, b, a] {- DP Nontop (Input 2) -} reason Tiling { method = Overlap, width = 4, state_type = Bit64, 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} steps 2 using 44 tiles remove some unmatched rules steps: 2 property Termination has value Just True for SRS [a, b, a, a] ->= [a, a, b, a] {- DP Nontop (Input 0) -} [b, b, a, a] ->= [a, a, a, b] {- DP Nontop (Input 1) -} [b, a, a, b] ->= [b, b, b, a] {- DP Nontop (Input 2) -} reason no strict rules ************************************************** skeleton: (3,2)\Deepee(11/3,4)\Weight(2/3,4)\EDG[(1/3,3)\TileRemoveROC{2}(0/3,2)[],(1/3,3)\TileRemoveROC{4}(0/3,2)[]] ************************************************** 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 2 max duration 1.012187462000 min duration 1.012127250000 total durat. 2.024314712000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 24} , self = 86 , parent = Just 0 , duration = 1.012127250000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:45:07.739553663 UTC , finish = 2021-07-13 23:45:08.751680913 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '5' , '4' ] , 2 , True )} Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 24} , self = 87 , parent = Just 9 , duration = 1.012187462000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:45:07.739603447 UTC , finish = 2021-07-13 23:45:08.751790909 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '5' , '6' ] , 2 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : 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 0.936397172000 min duration 0.071928754000 total durat. 1.008325926000 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.850654510000 min duration 0.567628644000 total durat. 1.418283154000 Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 3 max duration 0.670993412000 min duration 0.071785025000 total durat. 1.180922295000 Success : Tiling { method = Overlap , 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 2 max duration 0.920730469000 min duration 0.917062071000 total durat. 1.837792540000 **************************************************