/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 13 rules on 10 letters weights SRS with 7 rules on 5 letters DP SRS with 10 strict rules and 7 weak rules on 9 letters weights SRS with 0 strict rules and 7 weak rules on 5 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [q0, a] -> [x, q1] {- Input 0 -} [q1, a] -> [a, q1] {- Input 1 -} [q1, y] -> [y, q1] {- Input 2 -} [a, q1, b] -> [q2, a, y] {- Input 3 -} [a, q2, a] -> [q2, a, a] {- Input 4 -} [a, q2, y] -> [q2, a, y] {- Input 5 -} [y, q1, b] -> [q2, y, y] {- Input 6 -} [y, q2, a] -> [q2, y, a] {- Input 7 -} [y, q2, y] -> [q2, y, y] {- Input 8 -} [q2, x] -> [x, q0] {- Input 9 -} [q0, y] -> [y, q3] {- Input 10 -} [q3, y] -> [y, q3] {- Input 11 -} [q3, bl] -> [bl, q4] {- Input 12 -} reason (q0, 2/1) (a, 4/1) (b, 4/1) (q2, 3/1) (q3, 1/1) property Termination has value Just True for SRS [q1, a] -> [a, q1] {- Input 1 -} [q1, y] -> [y, q1] {- Input 2 -} [a, q2, a] -> [q2, a, a] {- Input 4 -} [a, q2, y] -> [q2, a, y] {- Input 5 -} [y, q2, a] -> [q2, y, a] {- Input 7 -} [y, q2, y] -> [q2, y, y] {- Input 8 -} [q3, y] -> [y, q3] {- Input 11 -} reason DP property Termination has value Just True for SRS [q1, a] ->= [a, q1] {- DP Nontop (Input 1) -} [q1, y] ->= [y, q1] {- DP Nontop (Input 2) -} [a, q2, a] ->= [q2, a, a] {- DP Nontop (Input 4) -} [a, q2, y] ->= [q2, a, y] {- DP Nontop (Input 5) -} [y, q2, a] ->= [q2, y, a] {- DP Nontop (Input 7) -} [y, q2, y] ->= [q2, y, y] {- DP Nontop (Input 8) -} [q3, y] ->= [y, q3] {- DP Nontop (Input 11) -} [a#, q2, a] |-> [a#, a] {- DP (Top 1) (Input 4) -} [a#, q2, y] |-> [a#, y] {- DP (Top 1) (Input 5) -} [q1#, a] |-> [a#, q1] {- DP (Top 0) (Input 1) -} [q1#, a] |-> [q1#] {- DP (Top 1) (Input 1) -} [q1#, y] |-> [q1#] {- DP (Top 1) (Input 2) -} [q1#, y] |-> [y#, q1] {- DP (Top 0) (Input 2) -} [y#, q2, a] |-> [y#, a] {- DP (Top 1) (Input 7) -} [y#, q2, y] |-> [y#, y] {- DP (Top 1) (Input 8) -} [q3#, y] |-> [y#, q3] {- DP (Top 0) (Input 11) -} [q3#, y] |-> [q3#] {- DP (Top 1) (Input 11) -} reason (a, 2/1) (y, 3/1) (q2, 1/1) (q1#, 2/1) (q3#, 1/1) property Termination has value Just True for SRS [q1, a] ->= [a, q1] {- DP Nontop (Input 1) -} [q1, y] ->= [y, q1] {- DP Nontop (Input 2) -} [a, q2, a] ->= [q2, a, a] {- DP Nontop (Input 4) -} [a, q2, y] ->= [q2, a, y] {- DP Nontop (Input 5) -} [y, q2, a] ->= [q2, y, a] {- DP Nontop (Input 7) -} [y, q2, y] ->= [q2, y, y] {- DP Nontop (Input 8) -} [q3, y] ->= [y, q3] {- DP Nontop (Input 11) -} reason EDG ************************************************** skeleton: (13,10)\Weight(7,5)\Deepee(10/7,9)\Weight(0/7,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) ************************************************** **************************************************