/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 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 Matrix { monotone = Weak, domain = Natural, shape = Full, bits = 4, encoding = Ersatz_Binary, dim = 2, solver = Minisatapi, verbose = True, tracing = False} SRS with 0 strict rules and 3 weak rules on 2 letters EDG 2 SRS with 1 strict rules and 3 weak rules on 3 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 4, solver = Minisatapi, verbose = False, tracing = False} SRS with 0 strict rules and 3 weak rules on 2 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, b, a, b] -> [b, b, a, a] {- Input 0 -} [a, a, a, b] -> [a, a, b, a] {- Input 1 -} [b, b, a, b] -> [b, a, b, b] {- Input 2 -} reason DP property Termination has value Just True for SRS [a, b, a, b] ->= [b, b, a, a] {- DP Nontop (Input 0) -} [a, a, a, b] ->= [a, a, b, a] {- DP Nontop (Input 1) -} [b, b, a, b] ->= [b, a, b, b] {- DP Nontop (Input 2) -} [a#, a, a, b] |-> [a#] {- DP (Top 3) (Input 1) -} [a#, a, a, b] |-> [a#, a, b, a] {- DP (Top 0) (Input 1) -} [a#, a, a, b] |-> [a#, b, a] {- DP (Top 1) (Input 1) -} [a#, a, a, b] |-> [b#, a] {- DP (Top 2) (Input 1) -} [a#, b, a, b] |-> [a#] {- DP (Top 3) (Input 0) -} [a#, b, a, b] |-> [a#, a] {- DP (Top 2) (Input 0) -} [a#, b, a, b] |-> [b#, a, a] {- DP (Top 1) (Input 0) -} [a#, b, a, b] |-> [b#, b, a, a] {- DP (Top 0) (Input 0) -} [b#, b, a, b] |-> [a#, b, b] {- DP (Top 1) (Input 2) -} [b#, b, a, b] |-> [b#, a, b, b] {- DP (Top 0) (Input 2) -} [b#, b, a, b] |-> [b#, b] {- DP (Top 2) (Input 2) -} reason (a, 2/1) (b, 4/1) (b#, 1/1) property Termination has value Just True for SRS [a, b, a, b] ->= [b, b, a, a] {- DP Nontop (Input 0) -} [a, a, a, b] ->= [a, a, b, a] {- DP Nontop (Input 1) -} [b, b, a, b] ->= [b, a, b, b] {- DP Nontop (Input 2) -} [a#, a, a, b] |-> [a#, a, b, a] {- DP (Top 0) (Input 1) -} [b#, b, a, b] |-> [b#, a, b, b] {- DP (Top 0) (Input 2) -} reason EDG property Termination has value Just True for SRS [a#, a, a, b] |-> [a#, a, b, a] {- DP (Top 0) (Input 1) -} [a, b, a, b] ->= [b, b, a, a] {- DP Nontop (Input 0) -} [a, a, a, b] ->= [a, a, b, a] {- DP Nontop (Input 1) -} [b, b, a, b] ->= [b, a, b, b] {- DP Nontop (Input 2) -} reason ( a , Wk / 1 2 \ \ 0 1 / ) ( b , Wk / 0 1 \ \ 0 1 / ) ( a# , Wk / 2 0 \ \ 0 1 / ) property Termination has value Just True for SRS [a, b, a, b] ->= [b, b, a, a] {- DP Nontop (Input 0) -} [a, a, a, b] ->= [a, a, b, a] {- DP Nontop (Input 1) -} [b, b, a, b] ->= [b, a, b, b] {- DP Nontop (Input 2) -} reason EDG property Termination has value Just True for SRS [b#, b, a, b] |-> [b#, a, b, b] {- DP (Top 0) (Input 2) -} [a, b, a, b] ->= [b, b, a, a] {- DP Nontop (Input 0) -} [a, a, a, b] ->= [a, a, b, a] {- DP Nontop (Input 1) -} [b, b, a, b] ->= [b, a, b, b] {- DP Nontop (Input 2) -} reason ( a , Wk / 4A 4A 4A 8A \ | 4A 4A 4A 8A | | 4A 4A 4A 4A | \ 0A 4A 4A 4A / ) ( b , Wk / 4A 4A 8A 8A \ | 4A 4A 4A 4A | | 0A 0A 4A 4A | \ 0A 0A 4A 4A / ) ( b# , Wk / 1A 2A 3A 3A \ | 1A 2A 3A 3A | | 1A 2A 3A 3A | \ 1A 2A 3A 3A / ) property Termination has value Just True for SRS [a, b, a, b] ->= [b, b, a, a] {- DP Nontop (Input 0) -} [a, a, a, b] ->= [a, a, b, a] {- DP Nontop (Input 1) -} [b, b, a, b] ->= [b, a, b, b] {- DP Nontop (Input 2) -} reason EDG ************************************************** skeleton: (3,2)\Deepee(11/3,4)\Weight(2/3,4)\EDG[(1/3,3)\Matrix{\Natural}{2}(0/3,2)\EDG[],(1/3,3)\Matrix{\Arctic}{4}(0/3,2)\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 1 max duration 2.654724442000 min duration 2.654724442000 total durat. 2.654724442000 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 = 3 , total_length = 32} , self = 88 , parent = Just 11 , duration = 2.654724442000 , status = Fail , start = 2021-07-13 23:44:54.009788602 UTC , finish = 2021-07-13 23:44:56.664513044 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '8' ] , 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.549228282000 min duration 0.510111816000 total durat. 1.059340098000 Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 3 max duration 0.449002313000 min duration 0.423476970000 total durat. 1.314378249000 Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.236405868000 min duration 2.236405868000 total durat. 2.236405868000 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 = 3 , total_length = 32} , self = 90 , parent = Just 21 , duration = 2.236405868000 , status = Success , start = 2021-07-13 23:44:55.034295879 UTC , finish = 2021-07-13 23:44:57.270701747 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '7' , '5' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 2.498336893000 min duration 0.127866222000 total durat. 2.626203115000 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 = 3 , total_length = 32} , self = 89 , parent = Just 11 , duration = 2.498336893000 , status = Fail , start = 2021-07-13 23:44:54.433610004 UTC , finish = 2021-07-13 23:44:56.931946897 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '7' ] , 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 3.264676372000 min duration 3.264676372000 total durat. 3.264676372000 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 = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 24} , self = 94 , parent = Just 0 , duration = 3.264676372000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:44:54.008766374 UTC , finish = 2021-07-13 23:44:57.273442746 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '5' , '1' ] , 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 3.264650788000 min duration 3.264650788000 total durat. 3.264650788000 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 = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 24} , self = 93 , parent = Just 0 , duration = 3.264650788000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:44:54.008739685 UTC , finish = 2021-07-13 23:44:57.273390473 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '8' ] , 1 , 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 2.300086104000 min duration 2.300086104000 total durat. 2.300086104000 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 = 2 , total_length = 24} , self = 86 , parent = Just 0 , duration = 2.300086104000 , status = Success , start = 2021-07-13 23:44:54.014234604 UTC , finish = 2021-07-13 23:44:56.314320708 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '2' ] , 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 2.203314501000 min duration 2.203314501000 total durat. 2.203314501000 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 = 2 , total_length = 24} , self = 84 , parent = Just 0 , duration = 2.203314501000 , status = Success , start = 2021-07-13 23:44:54.011558142 UTC , finish = 2021-07-13 23:44:56.214872643 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '6' ] , 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 3.264681886000 min duration 3.264681886000 total durat. 3.264681886000 Info { what = Transport { mode = Standard, max_derivation_length = Nothing} , 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 = 95 , parent = Just 0 , duration = 3.264681886000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:44:54.008779858 UTC , finish = 2021-07-13 23:44:57.273461744 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '5' , '4' ] , 1 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 9 max duration 0.579380791000 min duration 0.000245571000 total durat. 1.299969475000 **************************************************