Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516974007
details
property
value
status
complete
benchmark
size-12-alpha-3-num-176.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n080.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
matchbox-2021-06-18b
configuration
tc21-9.sh
runtime (wallclock)
6.69564986229 seconds
cpu usage
17.604988916
max memory
7.95480064E8
stage attributes
key
value
output-size
19894
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 4 rules on 3 letters DP SRS with 5 strict rules and 4 weak rules on 6 letters weights SRS with 2 strict rules and 4 weak rules on 4 letters EDG SRS with 2 strict rules and 4 weak rules on 4 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 8, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 0 strict rules and 4 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [] {- Input 0 -} [a, b] -> [b, a, c, b, a] {- Input 1 -} [b] -> [] {- Input 2 -} [c, c, c] -> [] {- Input 3 -} reason DP property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Input 0) -} [a, b] ->= [b, a, c, b, a] {- DP Nontop (Input 1) -} [b] ->= [] {- DP Nontop (Input 2) -} [c, c, c] ->= [] {- DP Nontop (Input 3) -} [a#, b] |-> [a#] {- DP (Top 4) (Input 1) -} [a#, b] |-> [a#, c, b, a] {- DP (Top 1) (Input 1) -} [a#, b] |-> [b#, a] {- DP (Top 3) (Input 1) -} [a#, b] |-> [b#, a, c, b, a] {- DP (Top 0) (Input 1) -} [a#, b] |-> [c#, b, a] {- DP (Top 2) (Input 1) -} reason (a#, 3/1) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Input 0) -} [a, b] ->= [b, a, c, b, a] {- DP Nontop (Input 1) -} [b] ->= [] {- DP Nontop (Input 2) -} [c, c, c] ->= [] {- DP Nontop (Input 3) -} [a#, b] |-> [a#] {- DP (Top 4) (Input 1) -} [a#, b] |-> [a#, c, b, a] {- DP (Top 1) (Input 1) -} reason EDG property Termination has value Just True for SRS [a#, b] |-> [a#] {- DP (Top 4) (Input 1) -} [a#, b] |-> [a#, c, b, a] {- DP (Top 1) (Input 1) -} [a] ->= [] {- DP Nontop (Input 0) -} [a, b] ->= [b, a, c, b, a] {- DP Nontop (Input 1) -} [b] ->= [] {- DP Nontop (Input 2) -} [c, c, c] ->= [] {- DP Nontop (Input 3) -} reason ( a , Wk / 0A - 0A 0A \ | - 0A 3A - | | - - 3A 2A | \ - - - 0A / ) ( b , Wk / 0A - - 0A \ | - 0A 0A 1A | | 3A 0A 3A 4A | \ - - - 0A / ) ( c , Wk / 0A 0A - 0A \ | 0A 0A 0A - | | 0A - - - | \ - - - 0A / ) ( a# , Wk / 0A - 1A 2A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Input 0) -} [a, b] ->= [b, a, c, b, a] {- DP Nontop (Input 1) -} [b] ->= [] {- DP Nontop (Input 2) -} [c, c, c] ->= [] {- DP Nontop (Input 3) -} reason EDG ************************************************** skeleton: (4,3)\Deepee(5/4,6)\Weight\EDG(2/4,4)\Matrix{\Arctic}{4}(0/4,3)\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]])) **************************************************
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard