/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 4 rules on 3 letters mirror SRS with 4 rules on 3 letters DP SRS with 28 strict rules and 4 weak rules on 6 letters weights SRS with 2 strict rules and 4 weak rules on 5 letters EDG 2 sub-proofs 1 SRS with 1 strict rules and 2 weak rules on 3 letters Usable SRS with 1 strict rules and 2 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 2 weak rules on 2 letters EDG 2 SRS with 1 strict rules and 2 weak rules on 3 letters Usable SRS with 1 strict rules and 2 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 2 weak rules on 2 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a, s, s] -> [s, s, a, a] {- Input 0 -} [b, b, a, a, b, b, s, s] -> [a, a, b, b, s, s, a, a] {- Input 1 -} [b, b, a, a, b, b, b, b] -> [a, a, b, b, a, a, b, b] {- Input 2 -} [a, a, b, b, a, a, a, a] -> [b, b, a, a, b, b, a, a] {- Input 3 -} reason mirror property Termination has value Just True for SRS [s, s, a, a] -> [a, a, s, s] {- Mirror (Input 0) -} [s, s, b, b, a, a, b, b] -> [a, a, s, s, b, b, a, a] {- Mirror (Input 1) -} [b, b, b, b, a, a, b, b] -> [b, b, a, a, b, b, a, a] {- Mirror (Input 2) -} [a, a, a, a, b, b, a, a] -> [a, a, b, b, a, a, b, b] {- Mirror (Input 3) -} reason DP property Termination has value Just True for SRS [s, s, a, a] ->= [a, a, s, s] {- DP Nontop (Mirror (Input 0)) -} [s, s, b, b, a, a, b, b] ->= [ a , a , s , s , b , b , a , a ] {- DP Nontop (Mirror (Input 1)) -} [b, b, b, b, a, a, b, b] ->= [ b , b , a , a , b , b , a , a ] {- DP Nontop (Mirror (Input 2)) -} [a, a, a, a, b, b, a, a] ->= [ a , a , b , b , a , a , b , b ] {- DP Nontop (Mirror (Input 3)) -} [a#, a, a, a, b, b, a, a] |-> [a#, a, b, b] {- DP (Top 4) (Mirror (Input 3)) -} [a#, a, a, a, b, b, a, a] |-> [ a# , a , b , b , a , a , b , b ] {- DP (Top 0) (Mirror (Input 3)) -} [a#, a, a, a, b, b, a, a] |-> [a#, b, b] {- DP (Top 5) (Mirror (Input 3)) -} [a#, a, a, a, b, b, a, a] |-> [ a# , b , b , a , a , b , b ] {- DP (Top 1) (Mirror (Input 3)) -} [a#, a, a, a, b, b, a, a] |-> [b#] {- DP (Top 7) (Mirror (Input 3)) -} [a#, a, a, a, b, b, a, a] |-> [ b# , a , a , b , b ] {- DP (Top 3) (Mirror (Input 3)) -} [a#, a, a, a, b, b, a, a] |-> [b#, b] {- DP (Top 6) (Mirror (Input 3)) -} [a#, a, a, a, b, b, a, a] |-> [ b# , b , a , a , b , b ] {- DP (Top 2) (Mirror (Input 3)) -} [s#, s, a, a] |-> [a#, a, s, s] {- DP (Top 0) (Mirror (Input 0)) -} [s#, s, a, a] |-> [a#, s, s] {- DP (Top 1) (Mirror (Input 0)) -} [s#, s, a, a] |-> [s#] {- DP (Top 3) (Mirror (Input 0)) -} [s#, s, a, a] |-> [s#, s] {- DP (Top 2) (Mirror (Input 0)) -} [s#, s, b, b, a, a, b, b] |-> [a#] {- DP (Top 7) (Mirror (Input 1)) -} [s#, s, b, b, a, a, b, b] |-> [a#, a] {- DP (Top 6) (Mirror (Input 1)) -} [s#, s, b, b, a, a, b, b] |-> [ a# , a , s , s , b , b , a , a ] {- DP (Top 0) (Mirror (Input 1)) -} [s#, s, b, b, a, a, b, b] |-> [ a# , s , s , b , b , a , a ] {- DP (Top 1) (Mirror (Input 1)) -} [s#, s, b, b, a, a, b, b] |-> [ s# , s , b , b , a , a ] {- DP (Top 2) (Mirror (Input 1)) -} [s#, s, b, b, a, a, b, b] |-> [ s# , b , b , a , a ] {- DP (Top 3) (Mirror (Input 1)) -} [s#, s, b, b, a, a, b, b] |-> [b#, a, a] {- DP (Top 5) (Mirror (Input 1)) -} [s#, s, b, b, a, a, b, b] |-> [b#, b, a, a] {- DP (Top 4) (Mirror (Input 1)) -} [b#, b, b, b, a, a, b, b] |-> [a#] {- DP (Top 7) (Mirror (Input 2)) -} [b#, b, b, b, a, a, b, b] |-> [a#, a] {- DP (Top 6) (Mirror (Input 2)) -} [b#, b, b, b, a, a, b, b] |-> [ a# , a , b , b , a , a ] {- DP (Top 2) (Mirror (Input 2)) -} [b#, b, b, b, a, a, b, b] |-> [ a# , b , b , a , a ] {- DP (Top 3) (Mirror (Input 2)) -} [b#, b, b, b, a, a, b, b] |-> [b#, a, a] {- DP (Top 5) (Mirror (Input 2)) -} [b#, b, b, b, a, a, b, b] |-> [ b# , a , a , b , b , a , a ] {- DP (Top 1) (Mirror (Input 2)) -} [b#, b, b, b, a, a, b, b] |-> [b#, b, a, a] {- DP (Top 4) (Mirror (Input 2)) -} [b#, b, b, b, a, a, b, b] |-> [ b# , b , a , a , b , b , a , a ] {- DP (Top 0) (Mirror (Input 2)) -} reason (s, 1/1) (a, 1/2) (b, 1/2) (s#, 3/2) property Termination has value Just True for SRS [s, s, a, a] ->= [a, a, s, s] {- DP Nontop (Mirror (Input 0)) -} [s, s, b, b, a, a, b, b] ->= [ a , a , s , s , b , b , a , a ] {- DP Nontop (Mirror (Input 1)) -} [b, b, b, b, a, a, b, b] ->= [ b , b , a , a , b , b , a , a ] {- DP Nontop (Mirror (Input 2)) -} [a, a, a, a, b, b, a, a] ->= [ a , a , b , b , a , a , b , b ] {- DP Nontop (Mirror (Input 3)) -} [a#, a, a, a, b, b, a, a] |-> [ a# , a , b , b , a , a , b , b ] {- DP (Top 0) (Mirror (Input 3)) -} [b#, b, b, b, a, a, b, b] |-> [ b# , b , a , a , b , b , a , a ] {- DP (Top 0) (Mirror (Input 2)) -} reason EDG property Termination has value Just True for SRS [a#, a, a, a, b, b, a, a] |-> [ a# , a , b , b , a , a , b , b ] {- DP (Top 0) (Mirror (Input 3)) -} [b, b, b, b, a, a, b, b] ->= [ b , b , a , a , b , b , a , a ] {- DP Nontop (Mirror (Input 2)) -} [a, a, a, a, b, b, a, a] ->= [ a , a , b , b , a , a , b , b ] {- DP Nontop (Mirror (Input 3)) -} reason Usable property Termination has value Just True for SRS [a#, a, a, a, b, b, a, a] |-> [ a# , a , b , b , a , a , b , b ] {- DP (Top 0) (Mirror (Input 3)) -} [b, b, b, b, a, a, b, b] ->= [ b , b , a , a , b , b , a , a ] {- DP Nontop (Mirror (Input 2)) -} [a, a, a, a, b, b, a, a] ->= [ a , a , b , b , a , a , b , b ] {- DP Nontop (Mirror (Input 3)) -} reason ( a , Wk / 2 1 \ \ 0 1 / ) ( b , Wk / 0 0 \ \ 0 1 / ) ( a# , Wk / 6 2 \ \ 0 1 / ) property Termination has value Just True for SRS [b, b, b, b, a, a, b, b] ->= [ b , b , a , a , b , b , a , a ] {- DP Nontop (Mirror (Input 2)) -} [a, a, a, a, b, b, a, a] ->= [ a , a , b , b , a , a , b , b ] {- DP Nontop (Mirror (Input 3)) -} reason EDG property Termination has value Just True for SRS [b#, b, b, b, a, a, b, b] |-> [ b# , b , a , a , b , b , a , a ] {- DP (Top 0) (Mirror (Input 2)) -} [b, b, b, b, a, a, b, b] ->= [ b , b , a , a , b , b , a , a ] {- DP Nontop (Mirror (Input 2)) -} [a, a, a, a, b, b, a, a] ->= [ a , a , b , b , a , a , b , b ] {- DP Nontop (Mirror (Input 3)) -} reason Usable property Termination has value Just True for SRS [b#, b, b, b, a, a, b, b] |-> [ b# , b , a , a , b , b , a , a ] {- DP (Top 0) (Mirror (Input 2)) -} [b, b, b, b, a, a, b, b] ->= [ b , b , a , a , b , b , a , a ] {- DP Nontop (Mirror (Input 2)) -} [a, a, a, a, b, b, a, a] ->= [ a , a , b , b , a , a , b , b ] {- DP Nontop (Mirror (Input 3)) -} reason ( a , Wk / 0 0 \ \ 0 1 / ) ( b , Wk / 2 1 \ \ 0 1 / ) ( b# , Wk / 4 2 \ \ 0 1 / ) property Termination has value Just True for SRS [b, b, b, b, a, a, b, b] ->= [ b , b , a , a , b , b , a , a ] {- DP Nontop (Mirror (Input 2)) -} [a, a, a, a, b, b, a, a] ->= [ a , a , b , b , a , a , b , b ] {- DP Nontop (Mirror (Input 3)) -} reason EDG ************************************************** skeleton: \Mirror(4,3)\Deepee(28/4,6)\Weight(2/4,5)\EDG[\Usable(1/2,3)\Matrix{\Natural}{2}(0/2,2)\EDG[],\Usable(1/2,3)\Matrix{\Natural}{2}(0/2,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) ************************************************** 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 3 max duration 1.363768274000 min duration 0.571042729000 total durat. 2.715539452000 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 = 5 , total_length = 88} , self = 69 , parent = Just 14 , duration = 1.363768274000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:40:52.597575283 UTC , finish = 2021-07-13 23:40:53.961343557 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '1' ] , 0 , True )} Success : 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.775904236000 min duration 0.566872440000 total durat. 1.342776676000 Fail : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 1.047563954000 min duration 1.047563954000 total durat. 1.047563954000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , 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 = 5 , total_length = 88} , self = 55 , parent = Just 14 , duration = 1.047563954000 , status = Fail , start = 2021-07-13 23:40:52.597522085 UTC , finish = 2021-07-13 23:40:53.645086039 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '7' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 3 max duration 0.821359593000 min duration 0.479141097000 total durat. 1.893891306000 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 1.370499270000 min duration 1.370499270000 total durat. 1.370499270000 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 = 56} , self = 71 , parent = Just 0 , duration = 1.370499270000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:40:52.590913278 UTC , finish = 2021-07-13 23:40:53.961412548 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '8' ] , 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 1.370501857000 min duration 1.370501857000 total durat. 1.370501857000 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 = 56} , self = 70 , parent = Just 0 , duration = 1.370501857000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:40:52.590883361 UTC , finish = 2021-07-13 23:40:53.961385218 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' ] : Transport { mode = Standard, max_derivation_length = Nothing} total number 1 max duration 1.370503618000 min duration 1.370503618000 total durat. 1.370503618000 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 = 56} , self = 73 , parent = Just 0 , duration = 1.370503618000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:40:52.590927616 UTC , finish = 2021-07-13 23:40:53.961431234 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '2' ] , 1 , True )} **************************************************