Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516969639
details
property
value
status
complete
benchmark
88143.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
matchbox-2021-06-18b
configuration
tc21-9.sh
runtime (wallclock)
6.9581861496 seconds
cpu usage
17.763661166
max memory
5.20220672E8
stage attributes
key
value
output-size
18716
starexec-result
YES
output
/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 28 rules on 4 letters Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 1338 states ************************************************** proof ************************************************** property Termination has value Just True for SRS [0, 0, 0, 1, 1, 1, 2, 3, 3, 1, 3, 3, 2] -> [ 0 , 2 , 2 , 1 , 0 , 1 , 2 , 3 , 0 , 0 , 3 , 2 , 2 , 3 , 1 , 2 , 2 ] {- Input 0 -} [0, 0, 0, 3, 3, 1, 1, 1, 3, 3, 1, 3, 2] -> [ 3 , 0 , 2 , 1 , 0 , 3 , 3 , 3 , 1 , 2 , 2 , 2 , 1 , 2 , 1 , 2 , 2 ] {- Input 1 -} [0, 0, 2, 0, 3, 1, 3, 2, 1, 0, 0, 2, 3] -> [ 0 , 2 , 2 , 2 , 1 , 3 , 3 , 3 , 2 , 2 , 0 , 3 , 1 , 3 , 2 , 1 , 2 ] {- Input 2 -} [0, 1, 0, 0, 3, 3, 2, 1, 2, 0, 1, 2, 3] -> [ 3 , 2 , 2 , 1 , 2 , 2 , 0 , 3 , 0 , 2 , 2 , 2 , 1 , 2 , 2 , 3 , 1 ] {- Input 3 -} [0, 1, 2, 0, 1, 1, 0, 2, 2, 1, 2, 0, 2] -> [ 2 , 0 , 3 , 3 , 2 , 2 , 1 , 0 , 3 , 3 , 3 , 3 , 2 , 2 , 2 , 3 , 3 ] {- Input 4 -} [0, 1, 2, 1, 1, 1, 2, 2, 0, 1, 3, 2, 0] -> [ 2 , 3 , 2 , 0 , 1 , 2 , 3 , 0 , 3 , 3 , 2 , 1 , 3 , 3 , 1 , 3 , 3 ] {- Input 5 -} [0, 2, 2, 0, 0, 3, 1, 0, 3, 2, 1, 3, 0] -> [ 3 , 1 , 2 , 2 , 1 , 3 , 3 , 2 , 2 , 3 , 0 , 2 , 2 , 1 , 1 , 1 , 0 ] {- Input 6 -} [0, 2, 3, 3, 1, 0, 3, 3, 0, 2, 3, 1, 1] -> [ 2 , 1 , 3 , 2 , 2 , 2 , 0 , 2 , 2 , 2 , 3 , 3 , 2 , 2 , 2 , 0 , 3 ] {- Input 7 -} [0, 3, 0, 3, 0, 2, 3, 0, 0, 3, 1, 2, 1] -> [ 3 , 1 , 1 , 2 , 2 , 3 , 0 , 1 , 2 , 2 , 2 , 2 , 3 , 2 , 2 , 2 , 0 ] {- Input 8 -} [0, 3, 0, 3, 1, 0, 1, 2, 2, 0, 3, 1, 3] -> [ 2 , 3 , 2 , 2 , 3 , 0 , 3 , 0 , 3 , 3 , 2 , 2 , 1 , 2 , 2 , 0 , 3 ] {- Input 9 -} [1, 0, 0, 1, 2, 2, 2, 3, 2, 3, 2, 0, 1] -> [ 1 , 2 , 1 , 0 , 2 , 2 , 1 , 2 , 1 , 0 , 3 , 3 , 2 , 2 , 2 , 3 , 3 ] {- Input 10 -} [1, 0, 2, 3, 0, 3, 2, 3, 2, 2, 3, 2, 3] -> [ 1 , 3 , 2 , 2 , 1 , 2 , 2 , 2 , 3 , 3 , 2 , 2 , 3 , 1 , 2 , 1 , 2 ] {- Input 11 -} [1, 3, 1, 0, 1, 1, 3, 2, 2, 1, 1, 2, 1] -> [ 1 , 2 , 3 , 2 , 3 , 2 , 1 , 2 , 2 , 2 , 2 , 2 , 2 , 0 , 1 , 2 , 2 ] {- Input 12 -} [2, 0, 0, 1, 3, 0, 3, 1, 3, 0, 1, 2, 1] -> [ 2 , 2 , 3 , 3 , 0 , 1 , 0 , 0 , 3 , 3 , 3 , 1 , 0 , 2 , 2 , 1 , 2 ] {- Input 13 -} [2, 0, 0, 2, 3, 0, 3, 1, 0, 0, 2, 1, 3] -> [ 2 , 0 , 2 , 1 , 2 , 2 , 2 , 2 , 3 , 2 , 3 , 1 , 3 , 3 , 1 , 3 , 1 ] {- Input 14 -} [2, 1, 0, 2, 2, 0, 0, 1, 3, 2, 0, 3, 3] -> [ 2 , 0 , 2 , 2 , 1 , 3 , 2 , 1 , 1 , 1 , 2 , 2 , 1 , 3 , 3 , 3 , 3 ] {- Input 15 -} [2, 1, 0, 3, 0, 3, 0, 3, 3, 0, 2, 1, 1] -> [ 2 , 2 , 0 , 1 , 2 , 1 , 1 , 0 , 2 , 2 , 2 , 3 , 2 , 3 , 0 , 2 , 2 ] {- Input 16 -} [2, 1, 1, 2, 0, 1, 1, 3, 0, 2, 3, 0, 1] -> [ 2 , 2 , 3 , 3 , 3 , 3 , 3 , 2 , 1 , 0 , 1 , 2 , 2 , 3 , 3 , 2 , 2 ] {- Input 17 -} [2, 1, 1, 3, 3, 0, 3, 2, 3, 2, 1, 1, 3] -> [ 2 , 3 , 2 , 3 , 2 , 2 , 3 , 3 , 2 , 1 , 2 , 2 , 3 , 3 , 0 , 1 , 3 ] {- Input 18 -} [2, 1, 1, 3, 3, 3, 0, 3, 0, 3, 0, 0, 2] -> [ 2 , 0 , 2 , 2 , 0 , 2 , 1 , 3 , 3 , 3 , 2 , 3 , 3 , 2 , 3 , 3 , 2 ] {- Input 19 -} [2, 2, 0, 0, 1, 0, 2, 3, 0, 3, 0, 1, 0] -> [ 2 , 2 , 2 , 1 , 0 , 2 , 0 , 1 , 3 , 1 , 3 , 0 , 3 , 3 , 3 , 3 , 2 ] {- Input 20 -} [2, 2, 0, 0, 3, 0, 2, 2, 3, 0, 1, 3, 3] -> [ 2 , 2 , 1 , 1 , 0 , 1 , 2 , 1 , 2 , 0 , 2 , 2 , 2 , 0 , 2 , 2 , 2 ] {- Input 21 -} [2, 2, 0, 3, 0, 1, 0, 2, 3, 2, 3, 1, 2] -> [ 2 , 2 , 0 , 2 , 2 , 2 , 1 , 0 , 0 , 3 , 1 , 3 , 1 , 3 , 3 , 2 , 2 ] {- Input 22 -} [2, 2, 1, 0, 2, 1, 2, 1, 1, 0, 1, 2, 0] -> [ 2 , 2 , 0 , 2 , 0 , 3 , 1 , 2 , 2 , 0 , 1 , 2 , 2 , 2 , 2 , 2 , 2 ] {- Input 23 -} [2, 3, 1, 1, 0, 2, 3, 1, 2, 3, 3, 1, 1] -> [ 2 , 2 , 2 , 1 , 2 , 1 , 1 , 2 , 0 , 2 , 0 , 0 , 3 , 0 , 1 , 3 , 3 ] {- Input 24 -} [2, 3, 2, 0, 3, 0, 1, 3, 2, 2, 2, 0, 2] -> [ 2 , 1 , 2 , 2 , 3 , 0 , 0 , 1 , 3 , 2 , 2 , 3 , 2 , 2 , 3 , 3 , 2 ] {- Input 25 -} [2, 3, 2, 1, 1, 1, 3, 2, 3, 2, 3, 2, 1] -> [ 2 , 2 , 2 , 0 , 3 , 2 , 2 , 0 , 2 , 3 , 2 , 3 , 0 , 2 , 2 , 0 , 2 ] {- Input 26 -} [3, 0, 2, 3, 0, 1, 0, 3, 3, 0, 0, 1, 0] -> [ 3 , 0 , 0 , 1 , 2 , 2 , 3 , 3 , 3 , 2 , 0 , 1 , 2 , 0 , 3 , 3 , 2 ] {- Input 27 -} reason Matchbound Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 1338 states ************************************************** skeleton: (28,4)\Rfcmatchbound{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) ************************************************** Success : EDG { usable = True, tracing = False} total number 2 max duration 4.901155802000 min duration 0.229298825000 total durat. 5.130454627000 Info { what = EDG { usable = True, tracing = False} , input_size = Size { num_rules = 493 , num_strict_rules = 465 , num_top_rules = 465 , num_weak_rules = 28 , alphabet_size = 8 , total_length = 11156} , self = 30 , parent = Just 6 , duration = 4.901155802000 , status = Success , start = 2021-07-13 14:36:42.460239252 UTC , finish = 2021-07-13 14:36:47.361395054 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '0' ] , 3 , False )} Success : Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} total number 1 max duration 6.691834862000 min duration 6.691834862000 total durat. 6.691834862000 Info { what = Matchbound { method = RFC
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard