Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516972597
details
property
value
status
complete
benchmark
4827.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n173.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
matchbox-2021-06-18b
configuration
tc21-9.sh
runtime (wallclock)
2.50177407265 seconds
cpu usage
6.322601913
max memory
2.20401664E8
stage attributes
key
value
output-size
11493
starexec-result
YES
output
/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 32 rules on 6 letters mirror SRS with 32 rules on 6 letters Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 939 states ************************************************** proof ************************************************** property Termination has value Just True for SRS [2, 4, 2] -> [0, 2, 0, 0, 5, 1, 0, 2, 0, 4] {- Input 0 -} [1, 4, 2, 1] -> [2, 4, 1, 5, 4, 3, 2, 3, 1, 2] {- Input 1 -} [1, 4, 4, 2] -> [3, 4, 0, 3, 0, 2, 5, 5, 1, 2] {- Input 2 -} [1, 5, 3, 1] -> [1, 1, 5, 4, 3, 0, 2, 1, 1, 1] {- Input 3 -} [1, 5, 4, 0] -> [3, 3, 1, 1, 1, 4, 0, 1, 0, 0] {- Input 4 -} [2, 2, 4, 1] -> [0, 2, 2, 0, 3, 0, 2, 5, 0, 0] {- Input 5 -} [2, 4, 2, 1] -> [0, 1, 0, 3, 5, 3, 2, 3, 2, 1] {- Input 6 -} [1, 4, 1, 2, 0] -> [5, 2, 0, 4, 0, 5, 0, 5, 1, 2] {- Input 7 -} [1, 4, 2, 4, 0] -> [5, 1, 4, 3, 5, 0, 0, 0, 3, 0] {- Input 8 -} [1, 4, 4, 1, 4] -> [3, 3, 2, 1, 0, 5, 0, 5, 2, 4] {- Input 9 -} [1, 5, 4, 2, 1] -> [3, 4, 1, 3, 3, 3, 3, 3, 0, 1] {- Input 10 -} [2, 1, 4, 4, 1] -> [2, 5, 0, 2, 2, 1, 2, 0, 0, 0] {- Input 11 -} [3, 2, 4, 4, 2] -> [3, 3, 3, 0, 2, 3, 1, 4, 0, 4] {- Input 12 -} [5, 3, 2, 1, 5] -> [0, 4, 0, 4, 3, 4, 3, 2, 2, 5] {- Input 13 -} [1, 4, 0, 4, 0, 5] -> [5, 1, 1, 2, 4, 0, 2, 1, 3, 5] {- Input 14 -} [1, 5, 5, 3, 2, 2] -> [0, 1, 2, 4, 0, 5, 0, 1, 2, 3] {- Input 15 -} [2, 5, 3, 0, 4, 4] -> [2, 2, 5, 0, 4, 4, 5, 0, 4, 4] {- Input 16 -} [3, 1, 2, 4, 2, 4] -> [4, 3, 2, 0, 1, 2, 3, 0, 5, 4] {- Input 17 -} [3, 4, 2, 2, 0, 5] -> [0, 1, 3, 1, 2, 0, 2, 0, 4, 3] {- Input 18 -} [4, 1, 1, 4, 0, 4] -> [4, 0, 2, 3, 5, 0, 4, 1, 5, 2] {- Input 19 -} [5, 5, 0, 1, 4, 2] -> [5, 2, 0, 1, 2, 4, 1, 3, 3, 3] {- Input 20 -} [0, 1, 4, 0, 0, 4, 2] -> [0, 1, 0, 1, 5, 2, 1, 0, 1, 2] {- Input 21 -} [1, 0, 4, 4, 2, 5, 5] -> [1, 0, 4, 1, 0, 5, 3, 5, 2, 5] {- Input 22 -} [1, 3, 0, 5, 4, 1, 4] -> [1, 0, 3, 0, 1, 3, 1, 3, 2, 4] {- Input 23 -} [1, 4, 2, 4, 1, 3, 5] -> [4, 4, 3, 3, 5, 0, 0, 0, 2, 5] {- Input 24 -} [1, 5, 5, 4, 0, 2, 5] -> [1, 1, 4, 3, 2, 1, 4, 1, 1, 5] {- Input 25 -} [2, 4, 2, 1, 5, 4, 1] -> [0, 1, 0, 4, 0, 3, 0, 5, 4, 1] {- Input 26 -} [4, 2, 5, 0, 1, 4, 2] -> [4, 2, 5, 3, 0, 1, 2, 3, 2, 1] {- Input 27 -} [5, 2, 2, 0, 4, 4, 2] -> [2, 0, 1, 1, 2, 4, 5, 5, 0, 2] {- Input 28 -} [5, 2, 2, 0, 5, 4, 0] -> [1, 5, 1, 3, 0, 0, 1, 3, 2, 1] {- Input 29 -} [5, 3, 1, 4, 2, 4, 0] -> [5, 5, 3, 1, 1, 3, 0, 1, 5, 2] {- Input 30 -} [5, 5, 1, 4, 4, 2, 5] -> [3, 5, 0, 5, 4, 0, 1, 5, 2, 5] {- Input 31 -} reason mirror property Termination has value Just True for SRS [2, 4, 2] -> [4, 0, 2, 0, 1, 5, 0, 0, 2, 0] {- Mirror (Input 0) -} [1, 2, 4, 1] -> [2, 1, 3, 2, 3, 4, 5, 1, 4, 2] {- Mirror (Input 1) -} [2, 4, 4, 1] -> [2, 1, 5, 5, 2, 0, 3, 0, 4, 3] {- Mirror (Input 2) -} [1, 3, 5, 1] -> [1, 1, 1, 2, 0, 3, 4, 5, 1, 1] {- Mirror (Input 3) -} [0, 4, 5, 1] -> [0, 0, 1, 0, 4, 1, 1, 1, 3, 3] {- Mirror (Input 4) -} [1, 4, 2, 2] -> [0, 0, 5, 2, 0, 3, 0, 2, 2, 0] {- Mirror (Input 5) -} [1, 2, 4, 2] -> [1, 2, 3, 2, 3, 5, 3, 0, 1, 0] {- Mirror (Input 6) -} [0, 2, 1, 4, 1] -> [2, 1, 5, 0, 5, 0, 4, 0, 2, 5] {- Mirror (Input 7) -} [0, 4, 2, 4, 1] -> [0, 3, 0, 0, 0, 5, 3, 4, 1, 5] {- Mirror (Input 8) -} [4, 1, 4, 4, 1] -> [4, 2, 5, 0, 5, 0, 1, 2, 3, 3] {- Mirror (Input 9) -} [1, 2, 4, 5, 1] -> [1, 0, 3, 3, 3, 3, 3, 1, 4, 3] {- Mirror (Input 10) -} [1, 4, 4, 1, 2] -> [0, 0, 0, 2, 1, 2, 2, 0, 5, 2] {- Mirror (Input 11) -} [2, 4, 4, 2, 3] -> [4, 0, 4, 1, 3, 2, 0, 3, 3, 3] {- Mirror (Input 12) -} [5, 1, 2, 3, 5] -> [5, 2, 2, 3, 4, 3, 4, 0, 4, 0] {- Mirror (Input 13) -} [5, 0, 4, 0, 4, 1] -> [5, 3, 1, 2, 0, 4, 2, 1, 1, 5] {- Mirror (Input 14) -} [2, 2, 3, 5, 5, 1] -> [3, 2, 1, 0, 5, 0, 4, 2, 1, 0] {- Mirror (Input 15) -} [4, 4, 0, 3, 5, 2] -> [4, 4, 0, 5, 4, 4, 0, 5, 2, 2] {- Mirror (Input 16) -} [4, 2, 4, 2, 1, 3] -> [4, 5, 0, 3, 2, 1, 0, 2, 3, 4] {- Mirror (Input 17) -} [5, 0, 2, 2, 4, 3] -> [3, 4, 0, 2, 0, 2, 1, 3, 1, 0] {- Mirror (Input 18) -} [4, 0, 4, 1, 1, 4] -> [2, 5, 1, 4, 0, 5, 3, 2, 0, 4] {- Mirror (Input 19) -} [2, 4, 1, 0, 5, 5] -> [3, 3, 3, 1, 4, 2, 1, 0, 2, 5] {- Mirror (Input 20) -} [2, 4, 0, 0, 4, 1, 0] -> [2, 1, 0, 1, 2, 5, 1, 0, 1, 0] {- Mirror (Input 21) -} [5, 5, 2, 4, 4, 0, 1] -> [5, 2, 5, 3, 5, 0, 1, 4, 0, 1] {- Mirror (Input 22) -} [4, 1, 4, 5, 0, 3, 1] -> [4, 2, 3, 1, 3, 1, 0, 3, 0, 1] {- Mirror (Input 23) -} [5, 3, 1, 4, 2, 4, 1] -> [5, 2, 0, 0, 0, 5, 3, 3, 4, 4] {- Mirror (Input 24) -} [5, 2, 0, 4, 5, 5, 1] -> [5, 1, 1, 4, 1, 2, 3, 4, 1, 1] {- Mirror (Input 25) -} [1, 4, 5, 1, 2, 4, 2] -> [1, 4, 5, 0, 3, 0, 4, 0, 1, 0] {- Mirror (Input 26) -} [2, 4, 1, 0, 5, 2, 4] -> [1, 2, 3, 2, 1, 0, 3, 5, 2, 4] {- Mirror (Input 27) -} [2, 4, 4, 0, 2, 2, 5] -> [2, 0, 5, 5, 4, 2, 1, 1, 0, 2] {- Mirror (Input 28) -} [0, 4, 5, 0, 2, 2, 5] -> [1, 2, 3, 1, 0, 0, 3, 1, 5, 1] {- Mirror (Input 29) -} [0, 4, 2, 4, 1, 3, 5] -> [2, 5, 1, 0, 3, 1, 1, 3, 5, 5] {- Mirror (Input 30) -} [5, 2, 4, 4, 1, 5, 5] -> [5, 2, 5, 1, 0, 4, 5, 0, 5, 3] {- Mirror (Input 31) -} reason Matchbound Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 939 states ************************************************** skeleton: \Mirror(32,6)\Rfcmatchbound{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)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard