Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487087221
details
property
value
status
complete
benchmark
40093.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n137.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
matchbox-2020-06-19b
configuration
tc20-std.sh
runtime (wallclock)
1.44744 seconds
cpu usage
5.43384
user time
4.76262
system time
0.671225
max virtual memory
1.16614376E8
max residence set size
224904.0
stage attributes
key
value
starexec-result
YES
output
YES summary ************************************************** SRS with 2 rules on 6 letters mirror SRS with 2 rules on 6 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 12 rules on 10 letters mirror SRS with 12 rules on 10 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 30 rules on 16 letters mirror SRS with 30 rules on 16 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 30 rules on 22 letters mirror SRS with 30 rules on 22 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 30 rules on 28 letters mirror SRS with 30 rules on 28 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 56 rules on 36 letters mirror SRS with 56 rules on 36 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 56 rules on 42 letters unlabel SRS with 30 rules on 34 letters mirror SRS with 30 rules on 34 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 56 rules on 42 letters mirror SRS with 56 rules on 42 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 80 rules on 49 letters weights SRS with 32 rules on 48 letters unlabel SRS with 18 rules on 40 letters mirror SRS with 18 rules on 40 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 50 rules on 49 letters weights SRS with 32 rules on 48 letters mirror SRS with 32 rules on 48 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 8 rules on 40 letters weights SRS with 1 rules on 29 letters mirror SRS with 1 rules on 29 letters tile all, by Config { method = Forward,width = 2,unlabel = False} SRS with 0 rules on 0 letters no strict rules ************************************************** skeleton: \Mirror(2,6)\TileAllRFC{2}\Mirror(12,10)\TileAllRFC{2}\Mirror(30,16)\TileAllRFC{2}\Mirror(30,22)\TileAllRFC{2}\Mirror(30,28)\TileAllRFC{2}\Mirror(56,36)\TileAllRFC{2}(56,42)\Unlabel\Mirror(30,34)\TileAllRFC{2}\Mirror(56,42)\TileAllRFC{2}(80,49)\Weight(32,48)\Unlabel\Mirror(18,40)\TileAllRFC{2}(50,49)\Weight\Mirror(32,48)\TileAllRFC{2}(8,40)\Weight\Mirror(1,29)\TileAllRFC{2}(0,0)[] ************************************************** 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)])
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard