Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Relative 2019-03-29 08.12 pair #432296854
details
property
value
status
complete
benchmark
r5.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n086.star.cs.uiowa.edu
space
Waldmann_06_relative
run statistics
property
value
solver
matchbox-2019-03-17
configuration
rel.sh
runtime (wallclock)
0.118876 seconds
cpu usage
0.363358
user time
0.311774
system time
0.051584
max virtual memory
113176.0
max residence set size
35516.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.10 YES 0.00/0.10 property Termination 0.00/0.10 has value True 0.00/0.10 for SRS ( [a, a, b, b] -> [], [b, a] ->= [a, b, a, b]) 0.00/0.10 reason 0.00/0.10 remap for 2 rules 0.00/0.10 property Termination 0.00/0.10 has value True 0.00/0.10 for SRS ( [0, 0, 1, 1] -> [], [1, 0] ->= [0, 1, 0, 1]) 0.00/0.10 reason 0.00/0.10 Tiling { method = Overlap, width = 5, state_type = Bit64, map_type = Enum, verbose = False, tracing = False} 0.00/0.10 using 45 tiles 0.00/0.10 [ [<, <, <, <, >] , [0, 1, 0, 1, >] , [0, 1, 1, 1, >] , [1, 0, 1, 1, >] , [1, 1, 0, 1, >] , [1, 1, 1, 1, >] , [<, <, <, <, 0] , [<, <, <, 0, 0] , [<, <, 0, 0, 0] , [<, <, 0, 1, 0] , [<, 0, 0, 0, 0] , [<, 0, 0, 1, 0] , [<, 0, 1, 0, 0] , [0, 0, 0, 0, 0] , [0, 0, 0, 1, 0] , [0, 0, 1, 0, 0] , [0, 1, 0, 0, 0] , [0, 1, 0, 1, 0] , [0, 1, 1, 0, 0] , [0, 1, 1, 1, 0] , [1, 0, 0, 0, 0] , [1, 0, 0, 1, 0] , [1, 0, 1, 0, 0] , [1, 0, 1, 1, 0] , [1, 1, 0, 0, 0] , [1, 1, 0, 1, 0] , [1, 1, 1, 0, 0] , [1, 1, 1, 1, 0] , [<, <, <, 0, 1] , [<, <, 0, 0, 1] , [<, 0, 0, 0, 1] , [<, 0, 1, 0, 1] , [0, 0, 0, 0, 1] , [0, 0, 1, 0, 1] , [0, 1, 0, 0, 1] , [0, 1, 0, 1, 1] , [0, 1, 1, 0, 1] , [0, 1, 1, 1, 1] , [1, 0, 0, 0, 1] , [1, 0, 1, 0, 1] , [1, 0, 1, 1, 1] , [1, 1, 0, 0, 1] , [1, 1, 0, 1, 1] , [1, 1, 1, 0, 1] , [1, 1, 1, 1, 1] ] 0.00/0.10 remove some unmatched rules 0.00/0.10 0.00/0.10 property Termination 0.00/0.10 has value True 0.00/0.10 for SRS ( [[1], [0]] ->= [[0], [1], [0], [1]]) 0.00/0.10 reason 0.00/0.10 remap for 1 rules 0.00/0.10 property Termination 0.00/0.10 has value True 0.00/0.10 for SRS ( [0, 1] ->= [1, 0, 1, 0]) 0.00/0.10 reason 0.00/0.10 has no strict rules 0.00/0.10 0.00/0.10 ************************************************** 0.00/0.10 summary 0.00/0.10 ************************************************** 0.00/0.10 SRS with 2 rules on 2 letters Remap { tracing = False} 0.00/0.10 SRS with 2 rules on 2 letters remove some, by Tiling { method = Overlap, width = 5, state_type = Bit64, map_type = Enum, verbose = False, tracing = False} 0.00/0.10 SRS with 1 rules on 2 letters Remap { tracing = False} 0.00/0.10 SRS with 1 rules on 2 letters has no strict rules 0.00/0.10 0.00/0.10 ************************************************** 0.00/0.10 (2, 2)\TileRemoveROC{5}(1, 2)[] 0.00/0.10 ************************************************** 0.00/0.10 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.10 in Apply (Worker Remap) method 0.00/0.11 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