Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Relative 2019-03-29 08.12 pair #432296799
details
property
value
status
complete
benchmark
rel13.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
Zantema_06_relative
run statistics
property
value
solver
matchbox-2019-03-17
configuration
rel.sh
runtime (wallclock)
0.058371 seconds
cpu usage
0.121973
user time
0.086969
system time
0.035004
max virtual memory
113176.0
max residence set size
19148.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.04 YES 0.00/0.04 property Termination 0.00/0.04 has value True 0.00/0.04 for SRS ( [o, l] -> [r], [n, l, o] -> [r, o], [L, l, o] -> [L, r, o], [r, o] -> [l], [o, r, n] -> [o, l], [o, r, R] -> [o, l, R], [L] ->= [L, n], [R] ->= [n, R]) 0.00/0.04 reason 0.00/0.04 remap for 8 rules 0.00/0.04 property Termination 0.00/0.04 has value True 0.00/0.04 for SRS ( [0, 1] -> [2], [3, 1, 0] -> [2, 0], [4, 1, 0] -> [4, 2, 0], [2, 0] -> [1], [0, 2, 3] -> [0, 1], [0, 2, 5] -> [0, 1, 5], [4] ->= [4, 3], [5] ->= [3, 5]) 0.00/0.04 reason 0.00/0.04 weights 0.00/0.04 Map [(0, 2/1)] 0.00/0.04 0.00/0.04 property Termination 0.00/0.04 has value True 0.00/0.04 for SRS ( [3, 1, 0] -> [2, 0], [4, 1, 0] -> [4, 2, 0], [0, 2, 3] -> [0, 1], [0, 2, 5] -> [0, 1, 5], [4] ->= [4, 3], [5] ->= [3, 5]) 0.00/0.04 reason 0.00/0.04 Tiling { method = Overlap, width = 2, state_type = Bit64, map_type = Enum, verbose = False, tracing = False} 0.00/0.04 using 18 tiles 0.00/0.04 [ [0, >] , [1, >] , [3, >] , [5, >] , [<, 0] , [2, 0] , [0, 1] , [<, 2] , [1, 2] , [3, 2] , [4, 2] , [<, 3] , [1, 3] , [3, 3] , [4, 3] , [<, 4] , [1, 5] , [3, 5] ] 0.00/0.04 remove some unmatched rules 0.00/0.04 0.00/0.04 property Termination 0.00/0.04 has value True 0.00/0.04 for SRS ( [[4]] ->= [[4], [3]], [[5]] ->= [[3], [5]]) 0.00/0.04 reason 0.00/0.04 remap for 2 rules 0.00/0.04 property Termination 0.00/0.04 has value True 0.00/0.04 for SRS ( [0] ->= [0, 1], [2] ->= [1, 2]) 0.00/0.04 reason 0.00/0.04 has no strict rules 0.00/0.04 0.00/0.04 ************************************************** 0.00/0.04 summary 0.00/0.04 ************************************************** 0.00/0.04 SRS with 8 rules on 6 letters Remap { tracing = False} 0.00/0.04 SRS with 8 rules on 6 letters weights 0.00/0.04 SRS with 6 rules on 6 letters remove some, by Tiling { method = Overlap, width = 2, state_type = Bit64, map_type = Enum, verbose = False, tracing = False} 0.00/0.04 SRS with 2 rules on 3 letters Remap { tracing = False} 0.00/0.04 SRS with 2 rules on 3 letters has no strict rules 0.00/0.04 0.00/0.04 ************************************************** 0.00/0.04 (8, 6)\Weight(6, 6)\TileRemoveROC{2}(2, 3)[] 0.00/0.04 ************************************************** 0.00/0.04 let { 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;when_small = \ m -> And_Then (Worker (SizeAtmost 100)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;tiling = \ m w -> weighted (And_Then (Worker (Tiling { method = m,width = w})) (Worker Remap));matrix = \ mo dom dim bits -> weighted (Worker (Matrix { monotone = mo,domain = dom,dim = dim,bits = bits}));kbo = \ b -> weighted (Worker (KBO { bits = b,solver = Minisatapi}));method = Apply wop (Tree_Search_Preemptive 0 done ([ ] <> ([ when_medium (kbo 1), when_medium (And_Then (Worker Mirror) (kbo 1))] <> ((for [ 3, 4] (\ d -> when_small (matrix Strict Natural d 3))) <> (for [ 2, 3, 5, 8] (\ w -> tiling Overlap w))))))} 0.00/0.04 in Apply (Worker Remap) method 0.00/0.05 EOF
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS_Relative 2019-03-29 08.12