/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 5 rules on 5 letters       DP
SRS with 15 strict rules and 5 weak rules on 9 letters       weights
SRS with 4 strict rules and 5 weak rules on 9 letters       EDG
2 sub-proofs
  1 SRS with 1 rules on 3 letters       Usable
  SRS with 1 rules on 3 letters       weights
  SRS with 0 rules on 0 letters       no strict rules
  
  2 SRS with 3 strict rules and 2 weak rules on 5 letters       Usable
  SRS with 3 strict rules and 2 weak rules on 5 letters       remove some, by Config   { method = Overlap,width = 4,unlabel = True}
  SRS with 0 strict rules and 2 weak rules on 2 letters       weights
  SRS with 0 rules on 0 letters       no strict rules
  
**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [a, s] -> [s, s, s, p, s, b, p, p, s, s] {- Input 0 -}
  [b, s] -> [s, s, s, p, p, s, s, c, p, s, p, s] {- Input 1 -}
  [c, s] -> [p, s, p, s, a, p, s, p, s] {- Input 2 -}
  [p, p, s] -> [p] {- Input 3 -}
  [p, s] -> [] {- Input 4 -}
reason
  DP
   property Termination
has value Just True
for SRS
  [a, s] ->= [s, s, s, p, s, b, p, p, s, s] {- DP Nontop (Input 0) -}
  [b, s] ->= [s, s, s, p, p, s, s, c, p, s, p, s] {- DP Nontop (Input 1) -}
  [c, s] ->= [p, s, p, s, a, p, s, p, s] {- DP Nontop (Input 2) -}
  [p, p, s] ->= [p] {- DP Nontop (Input 3) -}
  [p, s] ->= [] {- DP Nontop (Input 4) -}
  [a#, s] |-> [p#, s, s] {- DP (Top 7) (Input 0) -}
  [a#, s] |-> [p#, s, b, p, p, s, s] {- DP (Top 3) (Input 0) -}
  [a#, s] |-> [p#, p, s, s] {- DP (Top 6) (Input 0) -}
  [a#, s] |-> [b#, p, p, s, s] {- DP (Top 5) (Input 0) -}
  [p#, p, s] |-> [p#] {- DP (Top 0) (Input 3) -}
  [b#, s] |-> [p#, s] {- DP (Top 10) (Input 1) -}
  [b#, s] |-> [p#, s, s, c, p, s, p, s] {- DP (Top 4) (Input 1) -}
  [b#, s] |-> [p#, s, p, s] {- DP (Top 8) (Input 1) -}
  [b#, s] |-> [p#, p, s, s, c, p, s, p, s] {- DP (Top 3) (Input 1) -}
  [b#, s] |-> [c#, p, s, p, s] {- DP (Top 7) (Input 1) -}
  [c#, s] |-> [a#, p, s, p, s] {- DP (Top 4) (Input 2) -}
  [c#, s] |-> [p#, s] {- DP (Top 7) (Input 2) -}
  [c#, s] |-> [p#, s, a, p, s, p, s] {- DP (Top 2) (Input 2) -}
  [c#, s] |-> [p#, s, p, s] {- DP (Top 5) (Input 2) -}
  [c#, s] |-> [p#, s, p, s, a, p, s, p, s] {- DP (Top 0) (Input 2) -}
reason
  (a#, 1/3)
  (b#, 1/3)
  (c#, 1/3)
   property Termination
has value Just True
for SRS
  [a, s] ->= [s, s, s, p, s, b, p, p, s, s] {- DP Nontop (Input 0) -}
  [b, s] ->= [s, s, s, p, p, s, s, c, p, s, p, s] {- DP Nontop (Input 1) -}
  [c, s] ->= [p, s, p, s, a, p, s, p, s] {- DP Nontop (Input 2) -}
  [p, p, s] ->= [p] {- DP Nontop (Input 3) -}
  [p, s] ->= [] {- DP Nontop (Input 4) -}
  [a#, s] |-> [b#, p, p, s, s] {- DP (Top 5) (Input 0) -}
  [p#, p, s] |-> [p#] {- DP (Top 0) (Input 3) -}
  [b#, s] |-> [c#, p, s, p, s] {- DP (Top 7) (Input 1) -}
  [c#, s] |-> [a#, p, s, p, s] {- DP (Top 4) (Input 2) -}
reason
  EDG
   property Termination
has value Just True
for SRS
  [p#, p, s] |-> [p#] {- DP (Top 0) (Input 3) -}
reason
  Usable
   property Termination
has value Just True
for SRS
  [p#, p, s] |-> [p#] {- DP (Top 0) (Input 3) -}
reason
  (s, 1/1)
  (p, 1/1)
   property Termination
has value Just True
for SRS
  
reason
  no strict rules

property Termination
has value Just True
for SRS
  [a#, s] |-> [b#, p, p, s, s] {- DP (Top 5) (Input 0) -}
  [b#, s] |-> [c#, p, s, p, s] {- DP (Top 7) (Input 1) -}
  [c#, s] |-> [a#, p, s, p, s] {- DP (Top 4) (Input 2) -}
  [p, p, s] ->= [p] {- DP Nontop (Input 3) -}
  [p, s] ->= [] {- DP Nontop (Input 4) -}
reason
  Usable
   property Termination
has value Just True
for SRS
  [a#, s] |-> [b#, p, p, s, s] {- DP (Top 5) (Input 0) -}
  [b#, s] |-> [c#, p, s, p, s] {- DP (Top 7) (Input 1) -}
  [c#, s] |-> [a#, p, s, p, s] {- DP (Top 4) (Input 2) -}
  [p, p, s] ->= [p] {- DP Nontop (Input 3) -}
  [p, s] ->= [] {- DP Nontop (Input 4) -}
reason
  Tiling   { method = Overlap, width = 4, state_type = Bit64, 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}
  steps 2
  using 26 tiles
  remove some unmatched rules
  steps: 2
  
   property Termination
has value Just True
for SRS
  [p, p, s] ->= [p] {- DP Nontop (Input 3) -}
  [p, s] ->= [] {- DP Nontop (Input 4) -}
reason
  (p, 1/1)
  (s, 1/1)
   property Termination
has value Just True
for SRS
  
reason
  no strict rules

**************************************************
skeleton: (5,5)\Deepee(15/5,9)\Weight(4/5,9)\EDG[\Usable(1,3)\Weight(0,0)[],\Usable(3/2,5)\TileRemoveROC{4}(0/2,2)\Weight(0,0)[]]
**************************************************
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)
**************************************************

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