/export/starexec/sandbox2/solver/bin/starexec_run_tc20-std.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 4 rules on 3 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 24 rules on 10 letters weights SRS with 20 rules on 9 letters unlabel SRS with 2 rules on 2 letters mirror SRS with 2 rules on 2 letters DP SRS with 4 strict rules and 2 weak rules on 4 letters weights SRS with 2 strict rules and 2 weak rules on 4 letters EDG SRS with 2 strict rules and 2 weak rules on 4 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = False} SRS with 1 strict rules and 2 weak rules on 4 letters weights SRS with 0 strict rules and 2 weak rules on 2 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [b, a, b] -> [a, b, a] {- Input 0 -} [b, b, a] -> [b, b, b] {- Input 1 -} [c, a] -> [a, b, c] {- Input 2 -} [c, b] -> [b, a, c] {- Input 3 -} reason Tiling { method = Forward, width = 2, state_type = Bit64, map_type = Enum, unlabel = False, print_completion_steps = False, print_tiles = False, verbose = False, tracing = False} steps 1 using 11 tiles tile all rules steps: 1 property Termination has value Just True for SRS [[<, b], [b, a], [a, b], [b, >]] -> [ [<, a] , [a, b] , [b, a] , [ a , > ] ] {- Semlab 0 (Concon 0 (Input 0)) -} [[<, b], [b, a], [a, b], [b, b]] -> [ [<, a] , [a, b] , [b, a] , [ a , b ] ] {- Semlab 0 (Concon 1 (Input 0)) -} [[<, b], [b, a], [a, b], [b, a]] -> [ [<, a] , [a, b] , [b, a] , [ a , a ] ] {- Semlab 0 (Concon 2 (Input 0)) -} [[<, b], [b, a], [a, b], [b, c]] -> [ [<, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 0 (Concon 3 (Input 0)) -} [[b, b], [b, a], [a, b], [b, >]] -> [ [b, a] , [a, b] , [b, a] , [ a , > ] ] {- Semlab 1 (Concon 0 (Input 0)) -} [[b, b], [b, a], [a, b], [b, b]] -> [ [b, a] , [a, b] , [b, a] , [ a , b ] ] {- Semlab 1 (Concon 1 (Input 0)) -} [[b, b], [b, a], [a, b], [b, a]] -> [ [b, a] , [a, b] , [b, a] , [ a , a ] ] {- Semlab 1 (Concon 2 (Input 0)) -} [[b, b], [b, a], [a, b], [b, c]] -> [ [b, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 1 (Concon 3 (Input 0)) -} [[a, b], [b, a], [a, b], [b, >]] -> [ [a, a] , [a, b] , [b, a] , [ a , > ] ] {- Semlab 2 (Concon 0 (Input 0)) -} [[a, b], [b, a], [a, b], [b, b]] -> [ [a, a] , [a, b] , [b, a] , [ a , b ] ] {- Semlab 2 (Concon 1 (Input 0)) -} [[a, b], [b, a], [a, b], [b, a]] -> [ [a, a] , [a, b] , [b, a] , [ a , a ] ] {- Semlab 2 (Concon 2 (Input 0)) -} [[a, b], [b, a], [a, b], [b, c]] -> [ [a, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 2 (Concon 3 (Input 0)) -} [[<, b], [b, b], [b, a], [a, >]] -> [ [<, b] , [b, b] , [b, b] , [ b , > ] ] {- Semlab 0 (Concon 0 (Input 1)) -} [[<, b], [b, b], [b, a], [a, b]] -> [ [<, b] , [b, b] , [b, b] , [ b , b ] ] {- Semlab 0 (Concon 1 (Input 1)) -} [[<, b], [b, b], [b, a], [a, a]] -> [ [<, b] , [b, b] , [b, b] , [ b , a ] ] {- Semlab 0 (Concon 2 (Input 1)) -} [[<, b], [b, b], [b, a], [a, c]] -> [ [<, b] , [b, b] , [b, b] , [ b , c ] ] {- Semlab 0 (Concon 3 (Input 1)) -} [[b, b], [b, b], [b, a], [a, >]] -> [ [b, b] , [b, b] , [b, b] , [ b , > ] ] {- Semlab 1 (Concon 0 (Input 1)) -} [[b, b], [b, b], [b, a], [a, b]] -> [ [b, b] , [b, b] , [b, b] , [ b , b ] ] {- Semlab 1 (Concon 1 (Input 1)) -} [[b, b], [b, b], [b, a], [a, a]] -> [ [b, b] , [b, b] , [b, b] , [ b , a ] ] {- Semlab 1 (Concon 2 (Input 1)) -} [[b, b], [b, b], [b, a], [a, c]] -> [ [b, b] , [b, b] , [b, b] , [ b , c ] ] {- Semlab 1 (Concon 3 (Input 1)) -} [[a, b], [b, b], [b, a], [a, >]] -> [ [a, b] , [b, b] , [b, b] , [ b , > ] ] {- Semlab 2 (Concon 0 (Input 1)) -} [[a, b], [b, b], [b, a], [a, b]] -> [ [a, b] , [b, b] , [b, b] , [ b , b ] ] {- Semlab 2 (Concon 1 (Input 1)) -} [[a, b], [b, b], [b, a], [a, a]] -> [ [a, b] , [b, b] , [b, b] , [ b , a ] ] {- Semlab 2 (Concon 2 (Input 1)) -} [[a, b], [b, b], [b, a], [a, c]] -> [ [a, b] , [b, b] , [b, b] , [ b , c ] ] {- Semlab 2 (Concon 3 (Input 1)) -} reason ([<, b], 4/1) property Termination has value Just True for SRS [[b, b], [b, a], [a, b], [b, >]] -> [ [b, a] , [a, b] , [b, a] , [ a , > ] ] {- Semlab 1 (Concon 0 (Input 0)) -} [[b, b], [b, a], [a, b], [b, b]] -> [ [b, a] , [a, b] , [b, a] , [ a , b ] ] {- Semlab 1 (Concon 1 (Input 0)) -} [[b, b], [b, a], [a, b], [b, a]] -> [ [b, a] , [a, b] , [b, a] , [ a , a ] ] {- Semlab 1 (Concon 2 (Input 0)) -} [[b, b], [b, a], [a, b], [b, c]] -> [ [b, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 1 (Concon 3 (Input 0)) -} [[a, b], [b, a], [a, b], [b, >]] -> [ [a, a] , [a, b] , [b, a] , [ a , > ] ] {- Semlab 2 (Concon 0 (Input 0)) -} [[a, b], [b, a], [a, b], [b, b]] -> [ [a, a] , [a, b] , [b, a] , [ a , b ] ] {- Semlab 2 (Concon 1 (Input 0)) -} [[a, b], [b, a], [a, b], [b, a]] -> [ [a, a] , [a, b] , [b, a] , [ a , a ] ] {- Semlab 2 (Concon 2 (Input 0)) -} [[a, b], [b, a], [a, b], [b, c]] -> [ [a, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 2 (Concon 3 (Input 0)) -} [[<, b], [b, b], [b, a], [a, >]] -> [ [<, b] , [b, b] , [b, b] , [ b , > ] ] {- Semlab 0 (Concon 0 (Input 1)) -} [[<, b], [b, b], [b, a], [a, b]] -> [ [<, b] , [b, b] , [b, b] , [ b , b ] ] {- Semlab 0 (Concon 1 (Input 1)) -} [[<, b], [b, b], [b, a], [a, a]] -> [ [<, b] , [b, b] , [b, b] , [ b , a ] ] {- Semlab 0 (Concon 2 (Input 1)) -} [[<, b], [b, b], [b, a], [a, c]] -> [ [<, b] , [b, b] , [b, b] , [ b , c ] ] {- Semlab 0 (Concon 3 (Input 1)) -} [[b, b], [b, b], [b, a], [a, >]] -> [ [b, b] , [b, b] , [b, b] , [ b , > ] ] {- Semlab 1 (Concon 0 (Input 1)) -} [[b, b], [b, b], [b, a], [a, b]] -> [ [b, b] , [b, b] , [b, b] , [ b , b ] ] {- Semlab 1 (Concon 1 (Input 1)) -} [[b, b], [b, b], [b, a], [a, a]] -> [ [b, b] , [b, b] , [b, b] , [ b , a ] ] {- Semlab 1 (Concon 2 (Input 1)) -} [[b, b], [b, b], [b, a], [a, c]] -> [ [b, b] , [b, b] , [b, b] , [ b , c ] ] {- Semlab 1 (Concon 3 (Input 1)) -} [[a, b], [b, b], [b, a], [a, >]] -> [ [a, b] , [b, b] , [b, b] , [ b , > ] ] {- Semlab 2 (Concon 0 (Input 1)) -} [[a, b], [b, b], [b, a], [a, b]] -> [ [a, b] , [b, b] , [b, b] , [ b , b ] ] {- Semlab 2 (Concon 1 (Input 1)) -} [[a, b], [b, b], [b, a], [a, a]] -> [ [a, b] , [b, b] , [b, b] , [ b , a ] ] {- Semlab 2 (Concon 2 (Input 1)) -} [[a, b], [b, b], [b, a], [a, c]] -> [ [a, b] , [b, b] , [b, b] , [ b , c ] ] {- Semlab 2 (Concon 3 (Input 1)) -} reason unlabel property Termination has value Just True for SRS [0, 1, 0] -> [1, 0, 1] {- Input 0 -} [0, 0, 1] -> [0, 0, 0] {- Input 1 -} reason mirror property Termination has value Just True for SRS [0, 1, 0] -> [1, 0, 1] {- Mirror (Input 0) -} [1, 0, 0] -> [0, 0, 0] {- Mirror (Input 1) -} reason DP property Termination has value Just True for SRS [0, 1, 0] ->= [1, 0, 1] {- DP Nontop (Mirror (Input 0)) -} [1, 0, 0] ->= [0, 0, 0] {- DP Nontop (Mirror (Input 1)) -} [0#, 1, 0] |-> [0#, 1] {- DP (Top 1) (Mirror (Input 0)) -} [0#, 1, 0] |-> [1#] {- DP (Top 2) (Mirror (Input 0)) -} [0#, 1, 0] |-> [1#, 0, 1] {- DP (Top 0) (Mirror (Input 0)) -} [1#, 0, 0] |-> [0#, 0, 0] {- DP (Top 0) (Mirror (Input 1)) -} reason (0, 1/3) (1, 1/3) property Termination has value Just True for SRS [0, 1, 0] ->= [1, 0, 1] {- DP Nontop (Mirror (Input 0)) -} [1, 0, 0] ->= [0, 0, 0] {- DP Nontop (Mirror (Input 1)) -} [0#, 1, 0] |-> [1#, 0, 1] {- DP (Top 0) (Mirror (Input 0)) -} [1#, 0, 0] |-> [0#, 0, 0] {- DP (Top 0) (Mirror (Input 1)) -} reason EDG property Termination has value Just True for SRS [0#, 1, 0] |-> [1#, 0, 1] {- DP (Top 0) (Mirror (Input 0)) -} [1#, 0, 0] |-> [0#, 0, 0] {- DP (Top 0) (Mirror (Input 1)) -} [0, 1, 0] ->= [1, 0, 1] {- DP Nontop (Mirror (Input 0)) -} [1, 0, 0] ->= [0, 0, 0] {- DP Nontop (Mirror (Input 1)) -} reason ( 0 , Wk / 9A 9A 12A \ | 9A 9A 9A | \ 6A 6A 9A / ) ( 1 , Wk / 9A 9A 9A \ | 6A 9A 9A | \ 6A 9A 9A / ) ( 0# , Wk / 10A 10A 11A \ | 10A 10A 11A | \ 10A 10A 11A / ) ( 1# , Wk / 8A 11A 11A \ | 8A 11A 11A | \ 8A 11A 11A / ) property Termination has value Just True for SRS [0#, 1, 0] |-> [1#, 0, 1] {- DP (Top 0) (Mirror (Input 0)) -} [0, 1, 0] ->= [1, 0, 1] {- DP Nontop (Mirror (Input 0)) -} [1, 0, 0] ->= [0, 0, 0] {- DP Nontop (Mirror (Input 1)) -} reason (0#, 1/1) property Termination has value Just True for SRS [0, 1, 0] ->= [1, 0, 1] {- DP Nontop (Mirror (Input 0)) -} [1, 0, 0] ->= [0, 0, 0] {- DP Nontop (Mirror (Input 1)) -} reason EDG ************************************************** skeleton: (4,3)\TileAllRFC{2}(24,10)\Weight(20,9)\Unlabel\Mirror(2,2)\Deepee(4/2,4)\Weight\EDG(2/2,4)\Matrix{\Arctic}{3}(1/2,4)\Weight(0/2,2)\EDG[] ************************************************** let {} in let {trac = False;done = Worker No_Strict_Rules;mo = Pre (Or_Else Count (IfSizeLeq 10000 GLPK Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;tiling = \ m w -> weighted (And_Then (Worker (Tiling {method = m,width = w,unlabel = False})) (Worker Remap));when_small = \ m -> And_Then (Worker (SizeAtmost 1000)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;solver = Minisatapi;qpi = \ dim bits -> weighted (when_small (Worker (QPI {tracing = trac,dim = dim,bits = bits,solver = solver})));matrix = \ dom dim bits -> weighted (when_small (Worker (Matrix {monotone = Weak,domain = dom,dim = dim,bits = bits,tracing = trac,solver = solver})));kbo = \ b -> weighted (when_small (Worker (KBO {bits = b,solver = solver})));mb = Worker (Matchbound {method = RFC,max_size = 100000});remove = First_Of ([ Worker (Weight {modus = mo})] <> ([ Seq [ qpi 2 4, qpi 3 4, qpi 4 4], Seq [ qpi 5 4, qpi 6 3, qpi 7 3]] <> ([ Seq [ matrix Arctic 2 5, matrix Arctic 3 4, matrix Arctic 4 3], Seq [ matrix Natural 2 5, matrix Natural 3 4, matrix Natural 4 3]] <> [ kbo 1, And_Then (Worker Mirror) (And_Then (kbo 1) (Worker Mirror))])));dp = As_Transformer (Apply (And_Then (Worker (DP {tracing = True})) (Worker Remap)) (Apply wop (Branch (Worker (EDG {tracing = True})) remove)));noh = [ Worker (Enumerate {closure = Forward}), Worker (Enumerate {closure = Backward})];yeah = Tree_Search_Preemptive 0 done ([ Worker (Weight {modus = mo}), mb, And_Then (Worker Mirror) mb, dp, And_Then (Worker Mirror) dp, tiling Forward 2, And_Then (Worker Mirror) (tiling Forward 2)] <> [ Worker (Unlabel {verbose = True})])} in Apply (Worker Remap) (Seq [ Worker KKST01, First_Of ([ yeah] <> noh)])