/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 9 rules on 6 letters weights SRS with 8 rules on 6 letters mirror SRS with 8 rules on 6 letters DP SRS with 10 strict rules and 8 weak rules on 10 letters weights SRS with 4 strict rules and 8 weak rules on 10 letters EDG 4 sub-proofs 1 SRS with 1 rules on 2 letters Usable SRS with 1 rules on 2 letters weights SRS with 0 rules on 0 letters no strict rules 2 SRS with 1 rules on 2 letters Usable SRS with 1 rules on 2 letters weights SRS with 0 rules on 0 letters no strict rules 3 SRS with 1 rules on 2 letters Usable SRS with 1 rules on 2 letters weights SRS with 0 rules on 0 letters no strict rules 4 SRS with 1 strict rules and 7 weak rules on 6 letters Usable SRS with 1 strict rules and 7 weak rules on 6 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 7 weak rules on 5 letters weights SRS with 0 strict rules and 5 weak rules on 4 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [t, f] -> [t, c, n] {- Input 0 -} [n, f] -> [f, n] {- Input 1 -} [o, f] -> [f, o] {- Input 2 -} [n, s] -> [f, s] {- Input 3 -} [o, s] -> [f, s] {- Input 4 -} [c, f] -> [f, c] {- Input 5 -} [c, n] -> [n, c] {- Input 6 -} [c, o] -> [o, c] {- Input 7 -} [c, o] -> [o] {- Input 8 -} reason (o, 1/1) property Termination has value Just True for SRS [t, f] -> [t, c, n] {- Input 0 -} [n, f] -> [f, n] {- Input 1 -} [o, f] -> [f, o] {- Input 2 -} [n, s] -> [f, s] {- Input 3 -} [c, f] -> [f, c] {- Input 5 -} [c, n] -> [n, c] {- Input 6 -} [c, o] -> [o, c] {- Input 7 -} [c, o] -> [o] {- Input 8 -} reason mirror property Termination has value Just True for SRS [f, t] -> [n, c, t] {- Mirror (Input 0) -} [f, n] -> [n, f] {- Mirror (Input 1) -} [f, o] -> [o, f] {- Mirror (Input 2) -} [s, n] -> [s, f] {- Mirror (Input 3) -} [f, c] -> [c, f] {- Mirror (Input 5) -} [n, c] -> [c, n] {- Mirror (Input 6) -} [o, c] -> [c, o] {- Mirror (Input 7) -} [o, c] -> [o] {- Mirror (Input 8) -} reason DP property Termination has value Just True for SRS [f, t] ->= [n, c, t] {- DP Nontop (Mirror (Input 0)) -} [f, n] ->= [n, f] {- DP Nontop (Mirror (Input 1)) -} [f, o] ->= [o, f] {- DP Nontop (Mirror (Input 2)) -} [s, n] ->= [s, f] {- DP Nontop (Mirror (Input 3)) -} [f, c] ->= [c, f] {- DP Nontop (Mirror (Input 5)) -} [n, c] ->= [c, n] {- DP Nontop (Mirror (Input 6)) -} [o, c] ->= [c, o] {- DP Nontop (Mirror (Input 7)) -} [o, c] ->= [o] {- DP Nontop (Mirror (Input 8)) -} [f#, t] |-> [n#, c, t] {- DP (Top 0) (Mirror (Input 0)) -} [f#, c] |-> [f#] {- DP (Top 1) (Mirror (Input 5)) -} [f#, n] |-> [f#] {- DP (Top 1) (Mirror (Input 1)) -} [f#, n] |-> [n#, f] {- DP (Top 0) (Mirror (Input 1)) -} [f#, o] |-> [f#] {- DP (Top 1) (Mirror (Input 2)) -} [f#, o] |-> [o#, f] {- DP (Top 0) (Mirror (Input 2)) -} [n#, c] |-> [n#] {- DP (Top 1) (Mirror (Input 6)) -} [o#, c] |-> [o#] {- Many [ DP (Top 0) (Mirror (Input 8)) , DP (Top 1) (Mirror (Input 7)) ] -} [s#, n] |-> [f#] {- DP (Top 1) (Mirror (Input 3)) -} [s#, n] |-> [s#, f] {- DP (Top 0) (Mirror (Input 3)) -} reason (f, 1/2) (n, 1/2) (o, 3/1) (f#, 1/1) (s#, 3/2) property Termination has value Just True for SRS [f, t] ->= [n, c, t] {- DP Nontop (Mirror (Input 0)) -} [f, n] ->= [n, f] {- DP Nontop (Mirror (Input 1)) -} [f, o] ->= [o, f] {- DP Nontop (Mirror (Input 2)) -} [s, n] ->= [s, f] {- DP Nontop (Mirror (Input 3)) -} [f, c] ->= [c, f] {- DP Nontop (Mirror (Input 5)) -} [n, c] ->= [c, n] {- DP Nontop (Mirror (Input 6)) -} [o, c] ->= [c, o] {- DP Nontop (Mirror (Input 7)) -} [o, c] ->= [o] {- DP Nontop (Mirror (Input 8)) -} [f#, c] |-> [f#] {- DP (Top 1) (Mirror (Input 5)) -} [n#, c] |-> [n#] {- DP (Top 1) (Mirror (Input 6)) -} [o#, c] |-> [o#] {- Many [ DP (Top 0) (Mirror (Input 8)) , DP (Top 1) (Mirror (Input 7)) ] -} [s#, n] |-> [s#, f] {- DP (Top 0) (Mirror (Input 3)) -} reason EDG property Termination has value Just True for SRS [f#, c] |-> [f#] {- DP (Top 1) (Mirror (Input 5)) -} reason Usable property Termination has value Just True for SRS [f#, c] |-> [f#] {- DP (Top 1) (Mirror (Input 5)) -} reason (c, 1/1) property Termination has value Just True for SRS reason no strict rules property Termination has value Just True for SRS [n#, c] |-> [n#] {- DP (Top 1) (Mirror (Input 6)) -} reason Usable property Termination has value Just True for SRS [n#, c] |-> [n#] {- DP (Top 1) (Mirror (Input 6)) -} reason (c, 1/1) property Termination has value Just True for SRS reason no strict rules property Termination has value Just True for SRS [o#, c] |-> [o#] {- Many [ DP (Top 0) (Mirror (Input 8)) , DP (Top 1) (Mirror (Input 7)) ] -} reason Usable property Termination has value Just True for SRS [o#, c] |-> [o#] {- Many [ DP (Top 0) (Mirror (Input 8)) , DP (Top 1) (Mirror (Input 7)) ] -} reason (c, 1/1) property Termination has value Just True for SRS reason no strict rules property Termination has value Just True for SRS [s#, n] |-> [s#, f] {- DP (Top 0) (Mirror (Input 3)) -} [f, t] ->= [n, c, t] {- DP Nontop (Mirror (Input 0)) -} [f, n] ->= [n, f] {- DP Nontop (Mirror (Input 1)) -} [f, o] ->= [o, f] {- DP Nontop (Mirror (Input 2)) -} [f, c] ->= [c, f] {- DP Nontop (Mirror (Input 5)) -} [n, c] ->= [c, n] {- DP Nontop (Mirror (Input 6)) -} [o, c] ->= [c, o] {- DP Nontop (Mirror (Input 7)) -} [o, c] ->= [o] {- DP Nontop (Mirror (Input 8)) -} reason Usable property Termination has value Just True for SRS [s#, n] |-> [s#, f] {- DP (Top 0) (Mirror (Input 3)) -} [f, t] ->= [n, c, t] {- DP Nontop (Mirror (Input 0)) -} [f, n] ->= [n, f] {- DP Nontop (Mirror (Input 1)) -} [f, o] ->= [o, f] {- DP Nontop (Mirror (Input 2)) -} [f, c] ->= [c, f] {- DP Nontop (Mirror (Input 5)) -} [n, c] ->= [c, n] {- DP Nontop (Mirror (Input 6)) -} [o, c] ->= [c, o] {- DP Nontop (Mirror (Input 7)) -} [o, c] ->= [o] {- DP Nontop (Mirror (Input 8)) -} reason ( f , Wk / 1 0 \ \ 0 1 / ) ( t , Wk / 0 5 \ \ 0 1 / ) ( n , Wk / 2 1 \ \ 0 1 / ) ( c , Wk / 0 2 \ \ 0 1 / ) ( o , Wk / 0 2 \ \ 0 1 / ) ( s# , Wk / 4 8 \ \ 0 1 / ) property Termination has value Just True for SRS [f, t] ->= [n, c, t] {- DP Nontop (Mirror (Input 0)) -} [f, n] ->= [n, f] {- DP Nontop (Mirror (Input 1)) -} [f, o] ->= [o, f] {- DP Nontop (Mirror (Input 2)) -} [f, c] ->= [c, f] {- DP Nontop (Mirror (Input 5)) -} [n, c] ->= [c, n] {- DP Nontop (Mirror (Input 6)) -} [o, c] ->= [c, o] {- DP Nontop (Mirror (Input 7)) -} [o, c] ->= [o] {- DP Nontop (Mirror (Input 8)) -} reason (f, 2/1) (c, 1/1) property Termination has value Just True for SRS [f, n] ->= [n, f] {- DP Nontop (Mirror (Input 1)) -} [f, o] ->= [o, f] {- DP Nontop (Mirror (Input 2)) -} [f, c] ->= [c, f] {- DP Nontop (Mirror (Input 5)) -} [n, c] ->= [c, n] {- DP Nontop (Mirror (Input 6)) -} [o, c] ->= [c, o] {- DP Nontop (Mirror (Input 7)) -} reason EDG ************************************************** skeleton: (9,6)\Weight\Mirror(8,6)\Deepee(10/8,10)\Weight(4/8,10)\EDG[\Usable(1,2)\Weight(0,0)[],\Usable(1,2)\Weight(0,0)[],\Usable(1,2)\Weight(0,0)[],\Usable(1/7,6)\Matrix{\Natural}{2}(0/7,5)\Weight(0/5,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) ************************************************** **************************************************