/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 4 rules on 2 letters       mirror
SRS with 4 rules on 2 letters       DP
SRS with 13 strict rules and 4 weak rules on 4 letters       weights
SRS with 3 strict rules and 4 weak rules on 4 letters       EDG
2 sub-proofs
  1 SRS with 1 strict rules and 4 weak rules on 3 letters       remove some, by Config   { method = Overlap,width = 2,unlabel = True}
  SRS with 0 strict rules and 4 weak rules on 2 letters       no strict rules
  
  2 SRS with 2 strict rules and 4 weak rules on 3 letters       remove some, by Config   { method = Overlap,width = 4,unlabel = True}
  SRS with 1 strict rules and 3 weak rules on 3 letters       remove some, by Config   { method = Overlap,width = 4,unlabel = True}
  SRS with 0 strict rules and 3 weak rules on 2 letters       no strict rules
  
**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [a, b, b, b] -> [b, b, a, b] {- Input 0 -}
  [a, b, a, a] -> [b, a, b, a] {- Input 1 -}
  [b, b, a, a] -> [b, a, a, a] {- Input 2 -}
  [a, b, b, b] -> [a, b, a, a] {- Input 3 -}
reason
  mirror
   property Termination
has value Just True
for SRS
  [b, b, b, a] -> [b, a, b, b] {- Mirror (Input 0) -}
  [a, a, b, a] -> [a, b, a, b] {- Mirror (Input 1) -}
  [a, a, b, b] -> [a, a, a, b] {- Mirror (Input 2) -}
  [b, b, b, a] -> [a, a, b, a] {- Mirror (Input 3) -}
reason
  DP
   property Termination
has value Just True
for SRS
  [b, b, b, a] ->= [b, a, b, b] {- DP Nontop (Mirror (Input 0)) -}
  [a, a, b, a] ->= [a, b, a, b] {- DP Nontop (Mirror (Input 1)) -}
  [a, a, b, b] ->= [a, a, a, b] {- DP Nontop (Mirror (Input 2)) -}
  [b, b, b, a] ->= [a, a, b, a] {- DP Nontop (Mirror (Input 3)) -}
  [a#, a, b, a] |-> [a#, b] {- DP (Top 2) (Mirror (Input 1)) -}
  [a#, a, b, a] |-> [a#, b, a, b] {- DP (Top 0) (Mirror (Input 1)) -}
  [a#, a, b, a] |-> [b#] {- DP (Top 3) (Mirror (Input 1)) -}
  [a#, a, b, a] |-> [b#, a, b] {- DP (Top 1) (Mirror (Input 1)) -}
  [a#, a, b, b] |-> [a#, a, a, b] {- DP (Top 0) (Mirror (Input 2)) -}
  [a#, a, b, b] |-> [a#, a, b] {- DP (Top 1) (Mirror (Input 2)) -}
  [a#, a, b, b] |-> [a#, b] {- DP (Top 2) (Mirror (Input 2)) -}
  [b#, b, b, a] |-> [a#, a, b, a] {- DP (Top 0) (Mirror (Input 3)) -}
  [b#, b, b, a] |-> [a#, b, a] {- DP (Top 1) (Mirror (Input 3)) -}
  [b#, b, b, a] |-> [a#, b, b] {- DP (Top 1) (Mirror (Input 0)) -}
  [b#, b, b, a] |-> [b#] {- DP (Top 3) (Mirror (Input 0)) -}
  [b#, b, b, a] |-> [b#, a, b, b] {- DP (Top 0) (Mirror (Input 0)) -}
  [b#, b, b, a] |-> [b#, b] {- DP (Top 2) (Mirror (Input 0)) -}
reason
  (b, 2/1)
  (a, 2/1)
  (b#, 1/1)
   property Termination
has value Just True
for SRS
  [b, b, b, a] ->= [b, a, b, b] {- DP Nontop (Mirror (Input 0)) -}
  [a, a, b, a] ->= [a, b, a, b] {- DP Nontop (Mirror (Input 1)) -}
  [a, a, b, b] ->= [a, a, a, b] {- DP Nontop (Mirror (Input 2)) -}
  [b, b, b, a] ->= [a, a, b, a] {- DP Nontop (Mirror (Input 3)) -}
  [a#, a, b, a] |-> [a#, b, a, b] {- DP (Top 0) (Mirror (Input 1)) -}
  [a#, a, b, b] |-> [a#, a, a, b] {- DP (Top 0) (Mirror (Input 2)) -}
  [b#, b, b, a] |-> [b#, a, b, b] {- DP (Top 0) (Mirror (Input 0)) -}
reason
  EDG
   property Termination
has value Just True
for SRS
  [b#, b, b, a] |-> [b#, a, b, b] {- DP (Top 0) (Mirror (Input 0)) -}
  [b, b, b, a] ->= [b, a, b, b] {- DP Nontop (Mirror (Input 0)) -}
  [a, a, b, a] ->= [a, b, a, b] {- DP Nontop (Mirror (Input 1)) -}
  [a, a, b, b] ->= [a, a, a, b] {- DP Nontop (Mirror (Input 2)) -}
  [b, b, b, a] ->= [a, a, b, a] {- DP Nontop (Mirror (Input 3)) -}
reason
  Tiling   { method = Overlap, width = 2, 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 0
  using 10 tiles
  remove some unmatched rules
  steps: 0
  
   property Termination
has value Just True
for SRS
  [b, b, b, a] ->= [b, a, b, b] {- DP Nontop (Mirror (Input 0)) -}
  [a, a, b, a] ->= [a, b, a, b] {- DP Nontop (Mirror (Input 1)) -}
  [a, a, b, b] ->= [a, a, a, b] {- DP Nontop (Mirror (Input 2)) -}
  [b, b, b, a] ->= [a, a, b, a] {- DP Nontop (Mirror (Input 3)) -}
reason
  no strict rules

property Termination
has value Just True
for SRS
  [a#, a, b, a] |-> [a#, b, a, b] {- DP (Top 0) (Mirror (Input 1)) -}
  [a#, a, b, b] |-> [a#, a, a, b] {- DP (Top 0) (Mirror (Input 2)) -}
  [b, b, b, a] ->= [b, a, b, b] {- DP Nontop (Mirror (Input 0)) -}
  [a, a, b, a] ->= [a, b, a, b] {- DP Nontop (Mirror (Input 1)) -}
  [a, a, b, b] ->= [a, a, a, b] {- DP Nontop (Mirror (Input 2)) -}
  [b, b, b, a] ->= [a, a, b, a] {- DP Nontop (Mirror (Input 3)) -}
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 1
  using 42 tiles
  remove some unmatched rules
  steps: 1
  
   property Termination
has value Just True
for SRS
  [a#, a, b, a] |-> [a#, b, a, b] {- DP (Top 0) (Mirror (Input 1)) -}
  [b, b, b, a] ->= [b, a, b, b] {- DP Nontop (Mirror (Input 0)) -}
  [a, a, b, a] ->= [a, b, a, b] {- DP Nontop (Mirror (Input 1)) -}
  [b, b, b, a] ->= [a, a, b, a] {- DP Nontop (Mirror (Input 3)) -}
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 1
  using 33 tiles
  remove some unmatched rules
  steps: 1
  
   property Termination
has value Just True
for SRS
  [b, b, b, a] ->= [b, a, b, b] {- DP Nontop (Mirror (Input 0)) -}
  [a, a, b, a] ->= [a, b, a, b] {- DP Nontop (Mirror (Input 1)) -}
  [b, b, b, a] ->= [a, a, b, a] {- DP Nontop (Mirror (Input 3)) -}
reason
  no strict rules

**************************************************
skeleton: \Mirror(4,2)\Deepee(13/4,4)\Weight(3/4,4)\EDG[(1/4,3)\TileRemoveROC{2}(0/4,2)[],(2/4,3)\TileRemoveROC{4}(1/3,3)\TileRemoveROC{4}(0/3,2)[]]
**************************************************
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' ] : Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False}
  total number 1
  max duration 1.975068328000
  min duration 1.975068328000
  total durat. 1.975068328000
  Info
    { what = Matchbound
      { method = RFC
      , max_size = Just 100000
      , max_bound = Nothing
      , verbose = False
      , tracing = False}
    , input_size = Size
      { num_rules = 4
      , num_strict_rules = 4
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 2
      , total_length = 32}
    , self = 143
    , parent = Just 0
    , duration = 1.975068328000
    , status = Except [ 'A'
                      , 's'
                      , 'y'
                      , 'n'
                      , 'c'
                      , 'C'
                      , 'a'
                      , 'n'
                      , 'c'
                      , 'e'
                      , 'l'
                      , 'l'
                      , 'e'
                      , 'd' ]
    , start = 2021-07-13 23:43:23.160723569 UTC
    , finish = 2021-07-13 23:43:25.135791897 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '3'
                          , '6' ]
                        , 2
                        , True )}
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 1.856082885000
  min duration 0.114509396000
  total durat. 1.970592281000
  Info
    { what = Matrix
      { monotone = Weak
      , domain = Arctic
      , shape = Full
      , bits = 16
      , encoding = Ersatz_Binary
      , dim = 2
      , solver = Minisatapi
      , verbose = True
      , tracing = False}
    , input_size = Size
      { num_rules = 6
      , num_strict_rules = 2
      , num_top_rules = 2
      , num_weak_rules = 4
      , alphabet_size = 3
      , total_length = 48}
    , self = 141
    , parent = Just 12
    , duration = 1.856082885000
    , status = Except [ 'A'
                      , 's'
                      , 'y'
                      , 'n'
                      , 'c'
                      , 'C'
                      , 'a'
                      , 'n'
                      , 'c'
                      , 'e'
                      , 'l'
                      , 'l'
                      , 'e'
                      , 'd' ]
    , start = 2021-07-13 23:43:23.279406242 UTC
    , finish = 2021-07-13 23:43:25.135489127 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '2'
                          , '0'
                          , '1' ]
                        , 0
                        , True )}
Except [ 'A'
       , 's'
       , 'y'
       , 'n'
       , 'c'
       , 'C'
       , 'a'
       , 'n'
       , 'c'
       , 'e'
       , 'l'
       , 'l'
       , 'e'
       , 'd' ] : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False}
  total number 1
  max duration 1.128294472000
  min duration 1.128294472000
  total durat. 1.128294472000
  Info
    { what = Matrix
      { monotone = Weak
      , domain = Natural
      , shape = Full
      , bits = 3
      , encoding = Ersatz_Binary
      , dim = 4
      , solver = Minisatapi
      , verbose = True
      , tracing = False}
    , input_size = Size
      { num_rules = 6
      , num_strict_rules = 2
      , num_top_rules = 2
      , num_weak_rules = 4
      , alphabet_size = 3
      , total_length = 48}
    , self = 142
    , parent = Just 12
    , duration = 1.128294472000
    , status = Except [ 'A'
                      , 's'
                      , 'y'
                      , 'n'
                      , 'c'
                      , 'C'
                      , 'a'
                      , 'n'
                      , 'c'
                      , 'e'
                      , 'l'
                      , 'l'
                      , 'e'
                      , 'd' ]
    , start = 2021-07-13 23:43:24.007330274 UTC
    , finish = 2021-07-13 23:43:25.135624746 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '3'
                          , '2'
                          , '0' ]
                        , 0
                        , True )}
Fail : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False}
  total number 2
  max duration 0.727819456000
  min duration 0.507398227000
  total durat. 1.235217683000
Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False}
  total number 3
  max duration 0.618100116000
  min duration 0.114329026000
  total durat. 1.182844038000
Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False}
  total number 1
  max duration 1.237647226000
  min duration 1.237647226000
  total durat. 1.237647226000
  Info
    { what = QPI
      { dim = 4
      , bits = 3
      , solver = Minisatapi
      , tracing = False
      , verbose = False}
    , input_size = Size
      { num_rules = 6
      , num_strict_rules = 2
      , num_top_rules = 2
      , num_weak_rules = 4
      , alphabet_size = 3
      , total_length = 48}
    , self = 140
    , parent = Just 12
    , duration = 1.237647226000
    , status = Fail
    , start = 2021-07-13 23:43:23.897631116 UTC
    , finish = 2021-07-13 23:43:25.135278342 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '3'
                          , '0'
                          , '6' ]
                        , 0
                        , True )}
Success : Tiling { method = Backward , width = 2 , state_type = Best , 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}
  total number 5
  max duration 0.530588881000
  min duration 0.059405320000
  total durat. 1.285221186000
Success : Tiling { method = Backward , width = 4 , state_type = Best , 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}
  total number 2
  max duration 1.456871990000
  min duration 0.261385148000
  total durat. 1.718257138000
  Info
    { what = Tiling
      { method = Backward
      , width = 4
      , state_type = Best
      , 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}
    , input_size = Size
      { num_rules = 3
      , num_strict_rules = 3
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 2
      , total_length = 24}
    , self = 127
    , parent = Just 53
    , duration = 1.456871990000
    , status = Success
    , start = 2021-07-13 23:43:23.437925745 UTC
    , finish = 2021-07-13 23:43:24.894797735 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '2'
                          , '3'
                          , '8' ]
                        , 3
                        , True )}
Success : Tiling { method = Forward , width = 2 , state_type = Best , 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}
  total number 5
  max duration 0.969762169000
  min duration 0.072310636000
  total durat. 2.293792144000
Success : Tiling { method = Overlap , width = 2 , state_type = Best , 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}
  total number 5
  max duration 0.483478847000
  min duration 0.101042974000
  total durat. 1.264735537000
Success : Tiling { method = Overlap , width = 4 , state_type = Best , 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}
  total number 4
  max duration 1.430056949000
  min duration 0.904356901000
  total durat. 4.632344972000
  Info
    { what = Tiling
      { method = Overlap
      , width = 4
      , state_type = Best
      , 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}
    , input_size = Size
      { num_rules = 5
      , num_strict_rules = 1
      , num_top_rules = 1
      , num_weak_rules = 4
      , alphabet_size = 3
      , total_length = 40}
    , self = 108
    , parent = Just 12
    , duration = 1.374783306000
    , status = Success
    , start = 2021-07-13 23:43:23.16776724 UTC
    , finish = 2021-07-13 23:43:24.542550546 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '1'
                          , '2'
                          , '8' ]
                        , 3
                        , True )}
  Info
    { what = Tiling
      { method = Overlap
      , width = 4
      , state_type = Best
      , 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}
    , input_size = Size
      { num_rules = 5
      , num_strict_rules = 1
      , num_top_rules = 1
      , num_weak_rules = 4
      , alphabet_size = 3
      , total_length = 40}
    , self = 111
    , parent = Just 21
    , duration = 1.430056949000
    , status = Success
    , start = 2021-07-13 23:43:23.185912966 UTC
    , finish = 2021-07-13 23:43:24.615969915 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '1'
                          , '7'
                          , '0' ]
                        , 3
                        , True )}
Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False}
  total number 11
  max duration 0.316419467000
  min duration 0.000803145000
  total durat. 1.159504178000
**************************************************