/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 4 letters DP SRS with 8 strict rules and 4 weak rules on 7 letters weights SRS with 6 strict rules and 4 weak rules on 7 letters EDG SRS with 6 strict rules and 4 weak rules on 7 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 5 strict rules and 4 weak rules on 7 letters EDG SRS with 5 strict rules and 4 weak rules on 7 letters Matrix { monotone = Weak, domain = Natural, shape = Full, bits = 4, encoding = Ersatz_Binary, dim = 2, solver = Minisatapi, verbose = True, tracing = False} SRS with 1 strict rules and 4 weak rules on 6 letters weights SRS with 0 strict rules and 4 weak rules on 4 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [d, a] -> [b, d] {- Input 0 -} [b] -> [a, a, a] {- Input 1 -} [c, d, c] -> [a, d] {- Input 2 -} [b, d, d] -> [c, c, d, d, c] {- Input 3 -} reason DP property Termination has value Just True for SRS [d, a] ->= [b, d] {- DP Nontop (Input 0) -} [b] ->= [a, a, a] {- DP Nontop (Input 1) -} [c, d, c] ->= [a, d] {- DP Nontop (Input 2) -} [b, d, d] ->= [c, c, d, d, c] {- DP Nontop (Input 3) -} [d#, a] |-> [d#] {- DP (Top 1) (Input 0) -} [d#, a] |-> [b#, d] {- DP (Top 0) (Input 0) -} [b#, d, d] |-> [d#, d, c] {- DP (Top 2) (Input 3) -} [b#, d, d] |-> [d#, c] {- DP (Top 3) (Input 3) -} [b#, d, d] |-> [c#] {- DP (Top 4) (Input 3) -} [b#, d, d] |-> [c#, d, d, c] {- DP (Top 1) (Input 3) -} [b#, d, d] |-> [c#, c, d, d, c] {- DP (Top 0) (Input 3) -} [c#, d, c] |-> [d#] {- DP (Top 1) (Input 2) -} reason (d, 1/2) (d#, 1/2) property Termination has value Just True for SRS [d, a] ->= [b, d] {- DP Nontop (Input 0) -} [b] ->= [a, a, a] {- DP Nontop (Input 1) -} [c, d, c] ->= [a, d] {- DP Nontop (Input 2) -} [b, d, d] ->= [c, c, d, d, c] {- DP Nontop (Input 3) -} [d#, a] |-> [d#] {- DP (Top 1) (Input 0) -} [d#, a] |-> [b#, d] {- DP (Top 0) (Input 0) -} [b#, d, d] |-> [d#, d, c] {- DP (Top 2) (Input 3) -} [b#, d, d] |-> [c#, d, d, c] {- DP (Top 1) (Input 3) -} [b#, d, d] |-> [c#, c, d, d, c] {- DP (Top 0) (Input 3) -} [c#, d, c] |-> [d#] {- DP (Top 1) (Input 2) -} reason EDG property Termination has value Just True for SRS [d#, a] |-> [d#] {- DP (Top 1) (Input 0) -} [d#, a] |-> [b#, d] {- DP (Top 0) (Input 0) -} [b#, d, d] |-> [c#, c, d, d, c] {- DP (Top 0) (Input 3) -} [c#, d, c] |-> [d#] {- DP (Top 1) (Input 2) -} [b#, d, d] |-> [c#, d, d, c] {- DP (Top 1) (Input 3) -} [b#, d, d] |-> [d#, d, c] {- DP (Top 2) (Input 3) -} [d, a] ->= [b, d] {- DP Nontop (Input 0) -} [b] ->= [a, a, a] {- DP Nontop (Input 1) -} [c, d, c] ->= [a, d] {- DP Nontop (Input 2) -} [b, d, d] ->= [c, c, d, d, c] {- DP Nontop (Input 3) -} reason ( d , Wk / 0A 0A \ \ 0A 0A / ) ( a , Wk / 0A 0A \ \ -2A -2A / ) ( b , Wk / 0A 0A \ \ -2A -2A / ) ( c , Wk / 0A 0A \ \ -2A -2A / ) ( d# , Wk / 2A 2A \ \ 2A 2A / ) ( b# , Wk / 2A 2A \ \ 2A 2A / ) ( c# , Wk / 1A 2A \ \ 1A 2A / ) property Termination has value Just True for SRS [d#, a] |-> [d#] {- DP (Top 1) (Input 0) -} [d#, a] |-> [b#, d] {- DP (Top 0) (Input 0) -} [c#, d, c] |-> [d#] {- DP (Top 1) (Input 2) -} [b#, d, d] |-> [c#, d, d, c] {- DP (Top 1) (Input 3) -} [b#, d, d] |-> [d#, d, c] {- DP (Top 2) (Input 3) -} [d, a] ->= [b, d] {- DP Nontop (Input 0) -} [b] ->= [a, a, a] {- DP Nontop (Input 1) -} [c, d, c] ->= [a, d] {- DP Nontop (Input 2) -} [b, d, d] ->= [c, c, d, d, c] {- DP Nontop (Input 3) -} reason EDG property Termination has value Just True for SRS [d#, a] |-> [d#] {- DP (Top 1) (Input 0) -} [d#, a] |-> [b#, d] {- DP (Top 0) (Input 0) -} [b#, d, d] |-> [d#, d, c] {- DP (Top 2) (Input 3) -} [b#, d, d] |-> [c#, d, d, c] {- DP (Top 1) (Input 3) -} [c#, d, c] |-> [d#] {- DP (Top 1) (Input 2) -} [d, a] ->= [b, d] {- DP Nontop (Input 0) -} [b] ->= [a, a, a] {- DP Nontop (Input 1) -} [c, d, c] ->= [a, d] {- DP Nontop (Input 2) -} [b, d, d] ->= [c, c, d, d, c] {- DP Nontop (Input 3) -} reason ( d , Wk / 3 0 \ \ 0 1 / ) ( a , Wk / 1 4 \ \ 0 1 / ) ( b , Wk / 1 12 \ \ 0 1 / ) ( c , Wk / 1 1 \ \ 0 1 / ) ( d# , Wk / 3 2 \ \ 0 1 / ) ( b# , Wk / 1 11 \ \ 0 1 / ) ( c# , Wk / 1 0 \ \ 0 1 / ) property Termination has value Just True for SRS [b#, d, d] |-> [d#, d, c] {- DP (Top 2) (Input 3) -} [d, a] ->= [b, d] {- DP Nontop (Input 0) -} [b] ->= [a, a, a] {- DP Nontop (Input 1) -} [c, d, c] ->= [a, d] {- DP Nontop (Input 2) -} [b, d, d] ->= [c, c, d, d, c] {- DP Nontop (Input 3) -} reason (d, 1/1) (b#, 1/1) property Termination has value Just True for SRS [d, a] ->= [b, d] {- DP Nontop (Input 0) -} [b] ->= [a, a, a] {- DP Nontop (Input 1) -} [c, d, c] ->= [a, d] {- DP Nontop (Input 2) -} [b, d, d] ->= [c, c, d, d, c] {- DP Nontop (Input 3) -} reason EDG ************************************************** skeleton: (4,4)\Deepee(8/4,7)\Weight\EDG(6/4,7)\Matrix{\Arctic}{2}\EDG(5/4,7)\Matrix{\Natural}{2}(1/4,6)\Weight(0/4,4)\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 : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 0.739898619000 min duration 0.524933717000 total durat. 1.264832336000 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 3 max duration 0.548079031000 min duration 0.236597231000 total durat. 1.180557779000 Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 6 max duration 0.630633779000 min duration 0.002060865000 total durat. 1.306969044000 **************************************************