/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 5 rules on 4 letters       DP
SRS with 9 strict rules and 5 weak rules on 7 letters       weights
SRS with 3 strict rules and 5 weak rules on 6 letters       EDG
SRS with 3 strict rules and 5 weak rules on 6 letters       Matrix   { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 2, solver = Minisatapi, verbose = False, tracing = False}
SRS with 1 strict rules and 5 weak rules on 6 letters       weights
SRS with 0 strict rules and 5 weak rules on 4 letters       EDG

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [f] -> [n, c, c] {- Input 0 -}
  [c, f] -> [f, c, c] {- Input 1 -}
  [c, c] -> [c] {- Input 2 -}
  [n, s] -> [f, s, s] {- Input 3 -}
  [n, f] -> [f, n] {- Input 4 -}
reason
  DP
   property Termination
has value Just True
for SRS
  [f] ->= [n, c, c] {- DP Nontop (Input 0) -}
  [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -}
  [c, c] ->= [c] {- DP Nontop (Input 2) -}
  [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -}
  [n, f] ->= [f, n] {- DP Nontop (Input 4) -}
  [f#] |-> [n#, c, c] {- DP (Top 0) (Input 0) -}
  [f#] |-> [c#] {- DP (Top 2) (Input 0) -}
  [f#] |-> [c#, c] {- DP (Top 1) (Input 0) -}
  [n#, f] |-> [f#, n] {- DP (Top 0) (Input 4) -}
  [n#, f] |-> [n#] {- DP (Top 1) (Input 4) -}
  [n#, s] |-> [f#, s, s] {- DP (Top 0) (Input 3) -}
  [c#, f] |-> [f#, c, c] {- DP (Top 0) (Input 1) -}
  [c#, f] |-> [c#] {- DP (Top 2) (Input 1) -}
  [c#, f] |-> [c#, c] {- DP (Top 1) (Input 1) -}
reason
  (f, 3/2)
  (n, 3/2)
  (f#, 1/2)
  (n#, 1/2)
   property Termination
has value Just True
for SRS
  [f] ->= [n, c, c] {- DP Nontop (Input 0) -}
  [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -}
  [c, c] ->= [c] {- DP Nontop (Input 2) -}
  [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -}
  [n, f] ->= [f, n] {- DP Nontop (Input 4) -}
  [f#] |-> [n#, c, c] {- DP (Top 0) (Input 0) -}
  [n#, f] |-> [f#, n] {- DP (Top 0) (Input 4) -}
  [n#, s] |-> [f#, s, s] {- DP (Top 0) (Input 3) -}
reason
  EDG
   property Termination
has value Just True
for SRS
  [f#] |-> [n#, c, c] {- DP (Top 0) (Input 0) -}
  [n#, s] |-> [f#, s, s] {- DP (Top 0) (Input 3) -}
  [n#, f] |-> [f#, n] {- DP (Top 0) (Input 4) -}
  [f] ->= [n, c, c] {- DP Nontop (Input 0) -}
  [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -}
  [c, c] ->= [c] {- DP Nontop (Input 2) -}
  [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -}
  [n, f] ->= [f, n] {- DP Nontop (Input 4) -}
reason
  ( f
  , Wk  / 2A 2A \
        \ 0A 2A / )
  ( n
  , Wk  / 0A 2A \
        \ 0A 2A / )
  ( c
  , Wk  / 0A  0A  \
        \ -2A -2A / )
  ( s
  , Wk  / 0A 0A \
        \ 0A 0A / )
  ( f#
  , Wk  / 8A 9A \
        \ 8A 9A / )
  ( n#
  , Wk  / 8A 10A \
        \ 8A 10A / )
   property Termination
has value Just True
for SRS
  [f#] |-> [n#, c, c] {- DP (Top 0) (Input 0) -}
  [f] ->= [n, c, c] {- DP Nontop (Input 0) -}
  [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -}
  [c, c] ->= [c] {- DP Nontop (Input 2) -}
  [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -}
  [n, f] ->= [f, n] {- DP Nontop (Input 4) -}
reason
  (f#, 1/1)
   property Termination
has value Just True
for SRS
  [f] ->= [n, c, c] {- DP Nontop (Input 0) -}
  [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -}
  [c, c] ->= [c] {- DP Nontop (Input 2) -}
  [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -}
  [n, f] ->= [f, n] {- DP Nontop (Input 4) -}
reason
  EDG

**************************************************
skeleton: (5,4)\Deepee(9/5,7)\Weight\EDG(3/5,6)\Matrix{\Arctic}{2}(1/5,6)\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)
**************************************************
Except [ 'A'
       , 's'
       , 'y'
       , 'n'
       , 'c'
       , 'C'
       , 'a'
       , 'n'
       , 'c'
       , 'e'
       , 'l'
       , 'l'
       , 'e'
       , 'd' ] : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False}
  total number 2
  max duration 0.549787891000
  min duration 0.458693981000
  total durat. 1.008481872000
Success : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False}
  total number 2
  max duration 0.547651688000
  min duration 0.454247371000
  total durat. 1.001899059000
**************************************************