/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 15 rules on 8 letters DP SRS with 25 strict rules and 15 weak rules on 14 letters weights SRS with 6 strict rules and 15 weak rules on 11 letters EDG 3 sub-proofs 1 SRS with 2 rules on 3 letters Usable SRS with 2 rules on 3 letters weights SRS with 0 rules on 0 letters no strict rules 2 SRS with 2 rules on 3 letters Usable SRS with 2 rules on 3 letters weights SRS with 0 rules on 0 letters no strict rules 3 SRS with 2 strict rules and 15 weak rules on 9 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 15 weak rules on 8 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [r0, 0] -> [0, r0] {- Input 0 -} [r0, 1] -> [1, r0] {- Input 1 -} [r0, m] -> [m, r0] {- Input 2 -} [r1, 0] -> [0, r1] {- Input 3 -} [r1, 1] -> [1, r1] {- Input 4 -} [r1, m] -> [m, r1] {- Input 5 -} [r0, b] -> [qr, 0, b] {- Input 6 -} [r1, b] -> [qr, 1, b] {- Input 7 -} [0, qr] -> [qr, 0] {- Input 8 -} [1, qr] -> [qr, 1] {- Input 9 -} [m, qr] -> [ql, m] {- Input 10 -} [0, ql] -> [ql, 0] {- Input 11 -} [1, ql] -> [ql, 1] {- Input 12 -} [b, ql, 0] -> [0, b, r0] {- Input 13 -} [b, ql, 1] -> [1, b, r1] {- Input 14 -} reason DP property Termination has value Just True for SRS [r0, 0] ->= [0, r0] {- DP Nontop (Input 0) -} [r0, 1] ->= [1, r0] {- DP Nontop (Input 1) -} [r0, m] ->= [m, r0] {- DP Nontop (Input 2) -} [r1, 0] ->= [0, r1] {- DP Nontop (Input 3) -} [r1, 1] ->= [1, r1] {- DP Nontop (Input 4) -} [r1, m] ->= [m, r1] {- DP Nontop (Input 5) -} [r0, b] ->= [qr, 0, b] {- DP Nontop (Input 6) -} [r1, b] ->= [qr, 1, b] {- DP Nontop (Input 7) -} [0, qr] ->= [qr, 0] {- DP Nontop (Input 8) -} [1, qr] ->= [qr, 1] {- DP Nontop (Input 9) -} [m, qr] ->= [ql, m] {- DP Nontop (Input 10) -} [0, ql] ->= [ql, 0] {- DP Nontop (Input 11) -} [1, ql] ->= [ql, 1] {- DP Nontop (Input 12) -} [b, ql, 0] ->= [0, b, r0] {- DP Nontop (Input 13) -} [b, ql, 1] ->= [1, b, r1] {- DP Nontop (Input 14) -} [r0#, 0] |-> [r0#] {- DP (Top 1) (Input 0) -} [r0#, 0] |-> [0#, r0] {- DP (Top 0) (Input 0) -} [r0#, 1] |-> [r0#] {- DP (Top 1) (Input 1) -} [r0#, 1] |-> [1#, r0] {- DP (Top 0) (Input 1) -} [r0#, m] |-> [r0#] {- DP (Top 1) (Input 2) -} [r0#, m] |-> [m#, r0] {- DP (Top 0) (Input 2) -} [r0#, b] |-> [0#, b] {- DP (Top 1) (Input 6) -} [0#, qr] |-> [0#] {- DP (Top 1) (Input 8) -} [0#, ql] |-> [0#] {- DP (Top 1) (Input 11) -} [1#, qr] |-> [1#] {- DP (Top 1) (Input 9) -} [1#, ql] |-> [1#] {- DP (Top 1) (Input 12) -} [m#, qr] |-> [m#] {- DP (Top 1) (Input 10) -} [r1#, 0] |-> [0#, r1] {- DP (Top 0) (Input 3) -} [r1#, 0] |-> [r1#] {- DP (Top 1) (Input 3) -} [r1#, 1] |-> [1#, r1] {- DP (Top 0) (Input 4) -} [r1#, 1] |-> [r1#] {- DP (Top 1) (Input 4) -} [r1#, m] |-> [m#, r1] {- DP (Top 0) (Input 5) -} [r1#, m] |-> [r1#] {- DP (Top 1) (Input 5) -} [r1#, b] |-> [1#, b] {- DP (Top 1) (Input 7) -} [b#, ql, 0] |-> [r0#] {- DP (Top 2) (Input 13) -} [b#, ql, 0] |-> [0#, b, r0] {- DP (Top 0) (Input 13) -} [b#, ql, 0] |-> [b#, r0] {- DP (Top 1) (Input 13) -} [b#, ql, 1] |-> [1#, b, r1] {- DP (Top 0) (Input 14) -} [b#, ql, 1] |-> [r1#] {- DP (Top 2) (Input 14) -} [b#, ql, 1] |-> [b#, r1] {- DP (Top 1) (Input 14) -} reason (r0, 1/4) (m, 2/1) (r1, 1/4) (qr, 1/4) (ql, 1/4) (r0#, 5/4) (r1#, 5/4) (b#, 8/3) property Termination has value Just True for SRS [r0, 0] ->= [0, r0] {- DP Nontop (Input 0) -} [r0, 1] ->= [1, r0] {- DP Nontop (Input 1) -} [r0, m] ->= [m, r0] {- DP Nontop (Input 2) -} [r1, 0] ->= [0, r1] {- DP Nontop (Input 3) -} [r1, 1] ->= [1, r1] {- DP Nontop (Input 4) -} [r1, m] ->= [m, r1] {- DP Nontop (Input 5) -} [r0, b] ->= [qr, 0, b] {- DP Nontop (Input 6) -} [r1, b] ->= [qr, 1, b] {- DP Nontop (Input 7) -} [0, qr] ->= [qr, 0] {- DP Nontop (Input 8) -} [1, qr] ->= [qr, 1] {- DP Nontop (Input 9) -} [m, qr] ->= [ql, m] {- DP Nontop (Input 10) -} [0, ql] ->= [ql, 0] {- DP Nontop (Input 11) -} [1, ql] ->= [ql, 1] {- DP Nontop (Input 12) -} [b, ql, 0] ->= [0, b, r0] {- DP Nontop (Input 13) -} [b, ql, 1] ->= [1, b, r1] {- DP Nontop (Input 14) -} [r0#, 0] |-> [r0#] {- DP (Top 1) (Input 0) -} [r0#, 1] |-> [r0#] {- DP (Top 1) (Input 1) -} [r1#, 0] |-> [r1#] {- DP (Top 1) (Input 3) -} [r1#, 1] |-> [r1#] {- DP (Top 1) (Input 4) -} [b#, ql, 0] |-> [b#, r0] {- DP (Top 1) (Input 13) -} [b#, ql, 1] |-> [b#, r1] {- DP (Top 1) (Input 14) -} reason EDG property Termination has value Just True for SRS [r0#, 0] |-> [r0#] {- DP (Top 1) (Input 0) -} [r0#, 1] |-> [r0#] {- DP (Top 1) (Input 1) -} reason Usable property Termination has value Just True for SRS [r0#, 0] |-> [r0#] {- DP (Top 1) (Input 0) -} [r0#, 1] |-> [r0#] {- DP (Top 1) (Input 1) -} reason (0, 1/1) (1, 1/1) property Termination has value Just True for SRS reason no strict rules property Termination has value Just True for SRS [r1#, 0] |-> [r1#] {- DP (Top 1) (Input 3) -} [r1#, 1] |-> [r1#] {- DP (Top 1) (Input 4) -} reason Usable property Termination has value Just True for SRS [r1#, 0] |-> [r1#] {- DP (Top 1) (Input 3) -} [r1#, 1] |-> [r1#] {- DP (Top 1) (Input 4) -} reason (0, 1/1) (1, 1/1) property Termination has value Just True for SRS reason no strict rules property Termination has value Just True for SRS [b#, ql, 0] |-> [b#, r0] {- DP (Top 1) (Input 13) -} [b#, ql, 1] |-> [b#, r1] {- DP (Top 1) (Input 14) -} [r0, 0] ->= [0, r0] {- DP Nontop (Input 0) -} [r0, 1] ->= [1, r0] {- DP Nontop (Input 1) -} [r0, m] ->= [m, r0] {- DP Nontop (Input 2) -} [r1, 0] ->= [0, r1] {- DP Nontop (Input 3) -} [r1, 1] ->= [1, r1] {- DP Nontop (Input 4) -} [r1, m] ->= [m, r1] {- DP Nontop (Input 5) -} [r0, b] ->= [qr, 0, b] {- DP Nontop (Input 6) -} [r1, b] ->= [qr, 1, b] {- DP Nontop (Input 7) -} [0, qr] ->= [qr, 0] {- DP Nontop (Input 8) -} [1, qr] ->= [qr, 1] {- DP Nontop (Input 9) -} [m, qr] ->= [ql, m] {- DP Nontop (Input 10) -} [0, ql] ->= [ql, 0] {- DP Nontop (Input 11) -} [1, ql] ->= [ql, 1] {- DP Nontop (Input 12) -} [b, ql, 0] ->= [0, b, r0] {- DP Nontop (Input 13) -} [b, ql, 1] ->= [1, b, r1] {- DP Nontop (Input 14) -} reason ( r0 , Wk / 1 1 \ \ 0 1 / ) ( 0 , Wk / 1 2 \ \ 0 1 / ) ( 1 , Wk / 1 6 \ \ 0 1 / ) ( m , Wk / 0 8 \ \ 0 1 / ) ( r1 , Wk / 1 2 \ \ 0 1 / ) ( b , Wk / 2 3 \ \ 0 1 / ) ( qr , Wk / 0 4 \ \ 0 1 / ) ( ql , Wk / 1 0 \ \ 0 1 / ) ( b# , Wk / 4 6 \ \ 0 1 / ) property Termination has value Just True for SRS [r0, 0] ->= [0, r0] {- DP Nontop (Input 0) -} [r0, 1] ->= [1, r0] {- DP Nontop (Input 1) -} [r0, m] ->= [m, r0] {- DP Nontop (Input 2) -} [r1, 0] ->= [0, r1] {- DP Nontop (Input 3) -} [r1, 1] ->= [1, r1] {- DP Nontop (Input 4) -} [r1, m] ->= [m, r1] {- DP Nontop (Input 5) -} [r0, b] ->= [qr, 0, b] {- DP Nontop (Input 6) -} [r1, b] ->= [qr, 1, b] {- DP Nontop (Input 7) -} [0, qr] ->= [qr, 0] {- DP Nontop (Input 8) -} [1, qr] ->= [qr, 1] {- DP Nontop (Input 9) -} [m, qr] ->= [ql, m] {- DP Nontop (Input 10) -} [0, ql] ->= [ql, 0] {- DP Nontop (Input 11) -} [1, ql] ->= [ql, 1] {- DP Nontop (Input 12) -} [b, ql, 0] ->= [0, b, r0] {- DP Nontop (Input 13) -} [b, ql, 1] ->= [1, b, r1] {- DP Nontop (Input 14) -} reason EDG ************************************************** skeleton: (15,8)\Deepee(25/15,14)\Weight(6/15,11)\EDG[\Usable(2,3)\Weight(0,0)[],\Usable(2,3)\Weight(0,0)[],(2/15,9)\Matrix{\Natural}{2}(0/15,8)\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 2 max duration 1.555918696000 min duration 1.554678692000 total durat. 3.110597388000 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 = 17 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 15 , alphabet_size = 9 , total_length = 76} , self = 48 , parent = Just 15 , duration = 1.554678692000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 15:53:54.102459621 UTC , finish = 2021-07-13 15:53:55.657138313 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '4' , '3' ] , 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 = 17 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 15 , alphabet_size = 9 , total_length = 76} , self = 49 , parent = Just 16 , duration = 1.555918696000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 15:53:54.101231021 UTC , finish = 2021-07-13 15:53:55.657149717 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '0' ] , 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 1 max duration 1.541678123000 min duration 1.541678123000 total durat. 1.541678123000 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 = 17 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 15 , alphabet_size = 9 , total_length = 76} , self = 43 , parent = Just 15 , duration = 1.541678123000 , status = Success , start = 2021-07-13 15:53:54.102421635 UTC , finish = 2021-07-13 15:53:55.644099758 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '9' ] , 0 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : 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.556804198000 min duration 1.556804198000 total durat. 1.556804198000 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 = 17 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 15 , alphabet_size = 9 , total_length = 76} , self = 50 , parent = Just 16 , duration = 1.556804198000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 15:53:54.101178184 UTC , finish = 2021-07-13 15:53:55.657982382 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '6' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.555905743000 min duration 1.554619159000 total durat. 3.110524902000 Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 17 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 15 , alphabet_size = 9 , total_length = 76} , self = 46 , parent = Just 15 , duration = 1.554619159000 , status = Fail , start = 2021-07-13 15:53:54.102406219 UTC , finish = 2021-07-13 15:53:55.657025378 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '6' ] , 0 , True )} Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 17 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 15 , alphabet_size = 9 , total_length = 76} , self = 47 , parent = Just 16 , duration = 1.555905743000 , status = Fail , start = 2021-07-13 15:53:54.101141344 UTC , finish = 2021-07-13 15:53:55.657047087 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '3' ] , 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 1 max duration 1.115424139000 min duration 1.115424139000 total durat. 1.115424139000 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 = 15 , num_strict_rules = 15 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 8 , total_length = 66} , self = 41 , parent = Just 0 , duration = 1.115424139000 , status = Success , start = 2021-07-13 15:53:54.096770341 UTC , finish = 2021-07-13 15:53:55.21219448 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '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 1 max duration 1.064825077000 min duration 1.064825077000 total durat. 1.064825077000 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 = 15 , num_strict_rules = 15 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 8 , total_length = 66} , self = 39 , parent = Just 0 , duration = 1.064825077000 , status = Success , start = 2021-07-13 15:53:54.096939904 UTC , finish = 2021-07-13 15:53:55.161764981 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '9' ] , 3 , True )} **************************************************