/export/starexec/sandbox/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO ************************************************** summary ************************************************** SRS with 31 rules on 9 letters weights SRS with 28 rules on 9 letters looping SRS derivation steps : 1 from : (3) abc to : (4) aabc ************************************************** proof ************************************************** property Termination has value Just False for SRS [0, q0, 0] -> [0, 0, q0] {- Input 0 -} [0, q0, h] -> [0, 0, q0, h] {- Input 1 -} [0, q0, 1] -> [0, 1, q0] {- Input 2 -} [1, q0, 0] -> [0, 0, q1] {- Input 3 -} [1, q0, h] -> [0, 0, q1, h] {- Input 4 -} [1, q0, 1] -> [0, 1, q1] {- Input 5 -} [1, q1, 0] -> [1, 0, q1] {- Input 6 -} [1, q1, h] -> [1, 0, q1, h] {- Input 7 -} [1, q1, 1] -> [1, 1, q1] {- Input 8 -} [0, q1, 0] -> [0, 0, q2] {- Input 9 -} [0, q1, h] -> [0, 0, q2, h] {- Input 10 -} [0, q1, 1] -> [0, 1, q2] {- Input 11 -} [1, q2, 0] -> [1, 0, q2] {- Input 12 -} [1, q2, h] -> [1, 0, q2, h] {- Input 13 -} [1, q2, 1] -> [1, 1, q2] {- Input 14 -} [0, q2] -> [q3, 1] {- Input 15 -} [1, q3] -> [q3, 1] {- Input 16 -} [0, q3] -> [q4, 0] {- Input 17 -} [1, q4] -> [q4, 1] {- Input 18 -} [0, q4, 0] -> [1, 0, q5] {- Input 19 -} [0, q4, h] -> [1, 0, q5, h] {- Input 20 -} [0, q4, 1] -> [1, 1, q5] {- Input 21 -} [1, q5, 0] -> [0, 0, q1] {- Input 22 -} [1, q5, h] -> [0, 0, q1, h] {- Input 23 -} [1, q5, 1] -> [0, 1, q1] {- Input 24 -} [h, q0] -> [h, 0, q0] {- Input 25 -} [h, q1] -> [h, 0, q1] {- Input 26 -} [h, q2] -> [h, 0, q2] {- Input 27 -} [h, q3] -> [h, 0, q3] {- Input 28 -} [h, q4] -> [h, 0, q4] {- Input 29 -} [h, q5] -> [h, 0, q5] {- Input 30 -} reason (q0, 2/1) property Termination has value Just False for SRS [0, q0, 0] -> [0, 0, q0] {- Input 0 -} [0, q0, h] -> [0, 0, q0, h] {- Input 1 -} [0, q0, 1] -> [0, 1, q0] {- Input 2 -} [1, q1, 0] -> [1, 0, q1] {- Input 6 -} [1, q1, h] -> [1, 0, q1, h] {- Input 7 -} [1, q1, 1] -> [1, 1, q1] {- Input 8 -} [0, q1, 0] -> [0, 0, q2] {- Input 9 -} [0, q1, h] -> [0, 0, q2, h] {- Input 10 -} [0, q1, 1] -> [0, 1, q2] {- Input 11 -} [1, q2, 0] -> [1, 0, q2] {- Input 12 -} [1, q2, h] -> [1, 0, q2, h] {- Input 13 -} [1, q2, 1] -> [1, 1, q2] {- Input 14 -} [0, q2] -> [q3, 1] {- Input 15 -} [1, q3] -> [q3, 1] {- Input 16 -} [0, q3] -> [q4, 0] {- Input 17 -} [1, q4] -> [q4, 1] {- Input 18 -} [0, q4, 0] -> [1, 0, q5] {- Input 19 -} [0, q4, h] -> [1, 0, q5, h] {- Input 20 -} [0, q4, 1] -> [1, 1, q5] {- Input 21 -} [1, q5, 0] -> [0, 0, q1] {- Input 22 -} [1, q5, h] -> [0, 0, q1, h] {- Input 23 -} [1, q5, 1] -> [0, 1, q1] {- Input 24 -} [h, q0] -> [h, 0, q0] {- Input 25 -} [h, q1] -> [h, 0, q1] {- Input 26 -} [h, q2] -> [h, 0, q2] {- Input 27 -} [h, q3] -> [h, 0, q3] {- Input 28 -} [h, q4] -> [h, 0, q4] {- Input 29 -} [h, q5] -> [h, 0, q5] {- Input 30 -} reason Nontermination looping SRS derivation steps : 1 from : (3) abc to : (4) aabc ************************************************** skeleton: (31,9)\Weight(28,9)\Loop{1}[] ************************************************** 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) ************************************************** **************************************************