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

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

**************************************************
skeleton: (2,2)\Deepee(7/2,4)\Weight\EDG(1/2,3)\Matrix{\Arctic}{4}(0/2,2)\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' ] : Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False}
  total number 2
  max duration 1.983145583000
  min duration 1.982983631000
  total durat. 3.966129214000
  Info
    { what = Matchbound
      { method = RFC
      , max_size = Just 100000
      , max_bound = Nothing
      , verbose = False
      , tracing = False}
    , input_size = Size
      { num_rules = 2
      , num_strict_rules = 2
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 2
      , total_length = 16}
    , self = 76
    , parent = Just 0
    , duration = 1.982983631000
    , status = Except [ 'A'
                      , 's'
                      , 'y'
                      , 'n'
                      , 'c'
                      , 'C'
                      , 'a'
                      , 'n'
                      , 'c'
                      , 'e'
                      , 'l'
                      , 'l'
                      , 'e'
                      , 'd' ]
    , start = 2021-07-13 22:26:30.480487 UTC
    , finish = 2021-07-13 22:26:32.463470631 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '3'
                          , '5' ]
                        , 2
                        , True )}
  Info
    { what = Matchbound
      { method = RFC
      , max_size = Just 100000
      , max_bound = Nothing
      , verbose = False
      , tracing = False}
    , input_size = Size
      { num_rules = 2
      , num_strict_rules = 2
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 2
      , total_length = 16}
    , self = 77
    , parent = Just 7
    , duration = 1.983145583000
    , status = Except [ 'A'
                      , 's'
                      , 'y'
                      , 'n'
                      , 'c'
                      , 'C'
                      , 'a'
                      , 'n'
                      , 'c'
                      , 'e'
                      , 'l'
                      , 'l'
                      , 'e'
                      , 'd' ]
    , start = 2021-07-13 22:26:30.480532323 UTC
    , finish = 2021-07-13 22:26:32.463677906 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '5'
                          , '3' ]
                        , 2
                        , True )}
Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False}
  total number 1
  max duration 1.604358836000
  min duration 1.604358836000
  total durat. 1.604358836000
  Info
    { what = QPI
      { dim = 4
      , bits = 3
      , solver = Minisatapi
      , tracing = False
      , verbose = False}
    , input_size = Size
      { num_rules = 3
      , num_strict_rules = 1
      , num_top_rules = 1
      , num_weak_rules = 2
      , alphabet_size = 3
      , total_length = 24}
    , self = 73
    , parent = Just 13
    , duration = 1.604358836000
    , status = Success
    , start = 2021-07-13 22:26:30.852790622 UTC
    , finish = 2021-07-13 22:26:32.457149458 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '2'
                          , '0'
                          , '8' ]
                        , 0
                        , True )}
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 1
  max duration 1.014169407000
  min duration 1.014169407000
  total durat. 1.014169407000
  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 = 2
      , num_strict_rules = 2
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 2
      , total_length = 16}
    , self = 65
    , parent = Just 0
    , duration = 1.014169407000
    , status = Success
    , start = 2021-07-13 22:26:30.481403137 UTC
    , finish = 2021-07-13 22:26:31.495572544 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '6'
                          , '3' ]
                        , 3
                        , True )}
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 4
  max duration 1.279731105000
  min duration 0.071938400000
  total durat. 2.391913500000
  Info
    { what = 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}
    , input_size = Size
      { num_rules = 19
      , num_strict_rules = 2
      , num_top_rules = 2
      , num_weak_rules = 17
      , alphabet_size = 9
      , total_length = 190}
    , self = 69
    , parent = Just 38
    , duration = 1.279731105000
    , status = Success
    , start = 2021-07-13 22:26:30.615806305 UTC
    , finish = 2021-07-13 22:26:31.89553741 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '1'
                          , '9'
                          , '1' ]
                        , 3
                        , True )}
Fail : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False}
  total number 11
  max duration 0.485060428000
  min duration 0.000074425000
  total durat. 1.069207575000
**************************************************