/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 35 rules on 15 letters weights SRS with 6 rules on 5 letters DP SRS with 7 strict rules and 6 weak rules on 8 letters weights SRS with 0 strict rules and 6 weak rules on 5 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a12, a12] -> [] {- Input 0 -} [a13, a13] -> [] {- Input 1 -} [a14, a14] -> [] {- Input 2 -} [a15, a15] -> [] {- Input 3 -} [a16, a16] -> [] {- Input 4 -} [a23, a23] -> [] {- Input 5 -} [a24, a24] -> [] {- Input 6 -} [a25, a25] -> [] {- Input 7 -} [a26, a26] -> [] {- Input 8 -} [a34, a34] -> [] {- Input 9 -} [a35, a35] -> [] {- Input 10 -} [a36, a36] -> [] {- Input 11 -} [a45, a45] -> [] {- Input 12 -} [a46, a46] -> [] {- Input 13 -} [a56, a56] -> [] {- Input 14 -} [a13] -> [a12, a23, a12] {- Input 15 -} [a14] -> [a12, a23, a34, a23, a12] {- Input 16 -} [a15] -> [a12, a23, a34, a45, a34, a23, a12] {- Input 17 -} [a16] -> [a12, a23, a34, a45, a56, a45, a34, a23, a12] {- Input 18 -} [a24] -> [a23, a34, a23] {- Input 19 -} [a25] -> [a23, a34, a45, a34, a23] {- Input 20 -} [a26] -> [a23, a34, a45, a56, a45, a34, a23] {- Input 21 -} [a35] -> [a34, a45, a34] {- Input 22 -} [a36] -> [a34, a45, a56, a45, a34] {- Input 23 -} [a46] -> [a45, a56, a45] {- Input 24 -} [a12, a23, a12, a23, a12, a23] -> [] {- Input 25 -} [a23, a34, a23, a34, a23, a34] -> [] {- Input 26 -} [a34, a45, a34, a45, a34, a45] -> [] {- Input 27 -} [a45, a56, a45, a56, a45, a56] -> [] {- Input 28 -} [a12, a34] -> [a34, a12] {- Input 29 -} [a12, a45] -> [a45, a12] {- Input 30 -} [a12, a56] -> [a56, a12] {- Input 31 -} [a23, a45] -> [a45, a23] {- Input 32 -} [a23, a56] -> [a56, a23] {- Input 33 -} [a34, a56] -> [a56, a34] {- Input 34 -} reason (a12, 2/1) (a13, 25/1) (a14, 25/1) (a15, 25/1) (a16, 25/1) (a23, 3/1) (a24, 25/1) (a25, 25/1) (a26, 25/1) (a34, 3/1) (a35, 25/1) (a36, 25/1) (a45, 3/1) (a46, 25/1) (a56, 2/1) property Termination has value Just True for SRS [a12, a34] -> [a34, a12] {- Input 29 -} [a12, a45] -> [a45, a12] {- Input 30 -} [a12, a56] -> [a56, a12] {- Input 31 -} [a23, a45] -> [a45, a23] {- Input 32 -} [a23, a56] -> [a56, a23] {- Input 33 -} [a34, a56] -> [a56, a34] {- Input 34 -} reason DP property Termination has value Just True for SRS [a12, a34] ->= [a34, a12] {- DP Nontop (Input 29) -} [a12, a45] ->= [a45, a12] {- DP Nontop (Input 30) -} [a12, a56] ->= [a56, a12] {- DP Nontop (Input 31) -} [a23, a45] ->= [a45, a23] {- DP Nontop (Input 32) -} [a23, a56] ->= [a56, a23] {- DP Nontop (Input 33) -} [a34, a56] ->= [a56, a34] {- DP Nontop (Input 34) -} [a12#, a34] |-> [a12#] {- DP (Top 1) (Input 29) -} [a12#, a34] |-> [a34#, a12] {- DP (Top 0) (Input 29) -} [a12#, a45] |-> [a12#] {- DP (Top 1) (Input 30) -} [a12#, a56] |-> [a12#] {- DP (Top 1) (Input 31) -} [a23#, a45] |-> [a23#] {- DP (Top 1) (Input 32) -} [a23#, a56] |-> [a23#] {- DP (Top 1) (Input 33) -} [a34#, a56] |-> [a34#] {- DP (Top 1) (Input 34) -} reason (a34, 2/1) (a45, 1/1) (a56, 1/1) (a12#, 1/1) property Termination has value Just True for SRS [a12, a34] ->= [a34, a12] {- DP Nontop (Input 29) -} [a12, a45] ->= [a45, a12] {- DP Nontop (Input 30) -} [a12, a56] ->= [a56, a12] {- DP Nontop (Input 31) -} [a23, a45] ->= [a45, a23] {- DP Nontop (Input 32) -} [a23, a56] ->= [a56, a23] {- DP Nontop (Input 33) -} [a34, a56] ->= [a56, a34] {- DP Nontop (Input 34) -} reason EDG ************************************************** skeleton: (35,15)\Weight(6,5)\Deepee(7/6,8)\Weight(0/6,5)\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) ************************************************** **************************************************