/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 16 rules on 10 letters       weights
SRS with 9 rules on 6 letters       DP
SRS with 12 strict rules and 9 weak rules on 11 letters       weights
SRS with 0 strict rules and 9 weak rules on 6 letters       EDG

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [q0, 0] -> [0', q1] {- Input 0 -}
  [q1, 0] -> [0, q1] {- Input 1 -}
  [q1, 1'] -> [1', q1] {- Input 2 -}
  [0, q1, 1] -> [q2, 0, 1'] {- Input 3 -}
  [0', q1, 1] -> [q2, 0', 1'] {- Input 4 -}
  [1', q1, 1] -> [q2, 1', 1'] {- Input 5 -}
  [0, q2, 0] -> [q2, 0, 0] {- Input 6 -}
  [0', q2, 0] -> [q2, 0', 0] {- Input 7 -}
  [1', q2, 0] -> [q2, 1', 0] {- Input 8 -}
  [0, q2, 1'] -> [q2, 0, 1'] {- Input 9 -}
  [0', q2, 1'] -> [q2, 0', 1'] {- Input 10 -}
  [1', q2, 1'] -> [q2, 1', 1'] {- Input 11 -}
  [q2, 0'] -> [0', q0] {- Input 12 -}
  [q0, 1'] -> [1', q3] {- Input 13 -}
  [q3, 1'] -> [1', q3] {- Input 14 -}
  [q3, b] -> [b, q4] {- Input 15 -}
reason
  (q0, 2/1)
  (0, 4/1)
  (1, 4/1)
  (q2, 3/1)
  (q3, 1/1)
   property Termination
has value Just True
for SRS
  [q1, 0] -> [0, q1] {- Input 1 -}
  [q1, 1'] -> [1', q1] {- Input 2 -}
  [0, q2, 0] -> [q2, 0, 0] {- Input 6 -}
  [0', q2, 0] -> [q2, 0', 0] {- Input 7 -}
  [1', q2, 0] -> [q2, 1', 0] {- Input 8 -}
  [0, q2, 1'] -> [q2, 0, 1'] {- Input 9 -}
  [0', q2, 1'] -> [q2, 0', 1'] {- Input 10 -}
  [1', q2, 1'] -> [q2, 1', 1'] {- Input 11 -}
  [q3, 1'] -> [1', q3] {- Input 14 -}
reason
  DP
   property Termination
has value Just True
for SRS
  [q1, 0] ->= [0, q1] {- DP Nontop (Input 1) -}
  [q1, 1'] ->= [1', q1] {- DP Nontop (Input 2) -}
  [0, q2, 0] ->= [q2, 0, 0] {- DP Nontop (Input 6) -}
  [0', q2, 0] ->= [q2, 0', 0] {- DP Nontop (Input 7) -}
  [1', q2, 0] ->= [q2, 1', 0] {- DP Nontop (Input 8) -}
  [0, q2, 1'] ->= [q2, 0, 1'] {- DP Nontop (Input 9) -}
  [0', q2, 1'] ->= [q2, 0', 1'] {- DP Nontop (Input 10) -}
  [1', q2, 1'] ->= [q2, 1', 1'] {- DP Nontop (Input 11) -}
  [q3, 1'] ->= [1', q3] {- DP Nontop (Input 14) -}
  [0#, q2, 0] |-> [0#, 0] {- DP (Top 1) (Input 6) -}
  [0#, q2, 1'] |-> [0#, 1'] {- DP (Top 1) (Input 9) -}
  [0'#, q2, 0] |-> [0'#, 0] {- DP (Top 1) (Input 7) -}
  [0'#, q2, 1'] |-> [0'#, 1'] {- DP (Top 1) (Input 10) -}
  [q1#, 0] |-> [0#, q1] {- DP (Top 0) (Input 1) -}
  [q1#, 0] |-> [q1#] {- DP (Top 1) (Input 1) -}
  [q1#, 1'] |-> [q1#] {- DP (Top 1) (Input 2) -}
  [q1#, 1'] |-> [1'#, q1] {- DP (Top 0) (Input 2) -}
  [1'#, q2, 0] |-> [1'#, 0] {- DP (Top 1) (Input 8) -}
  [1'#, q2, 1'] |-> [1'#, 1'] {- DP (Top 1) (Input 11) -}
  [q3#, 1'] |-> [1'#, q3] {- DP (Top 0) (Input 14) -}
  [q3#, 1'] |-> [q3#] {- DP (Top 1) (Input 14) -}
reason
  (0, 2/1)
  (1', 3/1)
  (q2, 1/1)
  (q1#, 2/1)
  (q3#, 1/1)
   property Termination
has value Just True
for SRS
  [q1, 0] ->= [0, q1] {- DP Nontop (Input 1) -}
  [q1, 1'] ->= [1', q1] {- DP Nontop (Input 2) -}
  [0, q2, 0] ->= [q2, 0, 0] {- DP Nontop (Input 6) -}
  [0', q2, 0] ->= [q2, 0', 0] {- DP Nontop (Input 7) -}
  [1', q2, 0] ->= [q2, 1', 0] {- DP Nontop (Input 8) -}
  [0, q2, 1'] ->= [q2, 0, 1'] {- DP Nontop (Input 9) -}
  [0', q2, 1'] ->= [q2, 0', 1'] {- DP Nontop (Input 10) -}
  [1', q2, 1'] ->= [q2, 1', 1'] {- DP Nontop (Input 11) -}
  [q3, 1'] ->= [1', q3] {- DP Nontop (Input 14) -}
reason
  EDG

**************************************************
skeleton: (16,10)\Weight(9,6)\Deepee(12/9,11)\Weight(0/9,6)\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)
**************************************************

**************************************************