Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432289310
details
property
value
status
complete
benchmark
turing_copy.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n065.star.cs.uiowa.edu
space
Mixed_SRS
run statistics
property
value
solver
matchbox-2019-03-17
configuration
std.sh
runtime (wallclock)
0.188159 seconds
cpu usage
0.623989
user time
0.445044
system time
0.178945
max virtual memory
113176.0
max residence set size
55364.0
stage attributes
key
value
starexec-result
NO
output
0.00/0.03 NO 0.00/0.03 property Termination 0.00/0.03 has value False 0.00/0.04 for SRS ( [0, q0, 0] -> [0, 0, q0], [0, q0, h] -> [0, 0, q0, h], [0, q0, 1] -> [0, 1, q0], [1, q0, 0] -> [0, 0, q1], [1, q0, h] -> [0, 0, q1, h], [1, q0, 1] -> [0, 1, q1], [1, q1, 0] -> [1, 0, q1], [1, q1, h] -> [1, 0, q1, h], [1, q1, 1] -> [1, 1, q1], [0, q1, 0] -> [0, 0, q2], [0, q1, h] -> [0, 0, q2, h], [0, q1, 1] -> [0, 1, q2], [1, q2, 0] -> [1, 0, q2], [1, q2, h] -> [1, 0, q2, h], [1, q2, 1] -> [1, 1, q2], [0, q2] -> [q3, 1], [1, q3] -> [q3, 1], [0, q3] -> [q4, 0], [1, q4] -> [q4, 1], [0, q4, 0] -> [1, 0, q5], [0, q4, h] -> [1, 0, q5, h], [0, q4, 1] -> [1, 1, q5], [1, q5, 0] -> [0, 0, q1], [1, q5, h] -> [0, 0, q1, h], [1, q5, 1] -> [0, 1, q1], [h, q0] -> [h, 0, q0], [h, q1] -> [h, 0, q1], [h, q2] -> [h, 0, q2], [h, q3] -> [h, 0, q3], [h, q4] -> [h, 0, q4], [h, q5] -> [h, 0, q5]) 0.00/0.04 reason 0.00/0.04 remap for 31 rules 0.00/0.04 property Termination 0.00/0.04 has value False 0.00/0.05 for SRS ( [0, 1, 0] -> [0, 0, 1], [0, 1, 2] -> [0, 0, 1, 2], [0, 1, 3] -> [0, 3, 1], [3, 1, 0] -> [0, 0, 4], [3, 1, 2] -> [0, 0, 4, 2], [3, 1, 3] -> [0, 3, 4], [3, 4, 0] -> [3, 0, 4], [3, 4, 2] -> [3, 0, 4, 2], [3, 4, 3] -> [3, 3, 4], [0, 4, 0] -> [0, 0, 5], [0, 4, 2] -> [0, 0, 5, 2], [0, 4, 3] -> [0, 3, 5], [3, 5, 0] -> [3, 0, 5], [3, 5, 2] -> [3, 0, 5, 2], [3, 5, 3] -> [3, 3, 5], [0, 5] -> [6, 3], [3, 6] -> [6, 3], [0, 6] -> [7, 0], [3, 7] -> [7, 3], [0, 7, 0] -> [3, 0, 8], [0, 7, 2] -> [3, 0, 8, 2], [0, 7, 3] -> [3, 3, 8], [3, 8, 0] -> [0, 0, 4], [3, 8, 2] -> [0, 0, 4, 2], [3, 8, 3] -> [0, 3, 4], [2, 1] -> [2, 0, 1], [2, 4] -> [2, 0, 4], [2, 5] -> [2, 0, 5], [2, 6] -> [2, 0, 6], [2, 7] -> [2, 0, 7], [2, 8] -> [2, 0, 8]) 0.00/0.05 reason 0.00/0.05 looping SRS derivation 0.00/0.05 Closure source : abc 0.00/0.05 target : aabc 0.00/0.05 steps : 1 0.00/0.05 strict : True 0.00/0.05 last_rule_app_source : 0 0.00/0.05 last_rule_app_target : 0 0.00/0.05 reason : Rule 1 0.00/0.05 0.00/0.05 0.00/0.05 ************************************************** 0.00/0.05 summary 0.00/0.05 ************************************************** 0.00/0.05 SRS with 31 rules on 9 letters Remap { tracing = False} 0.00/0.05 SRS with 31 rules on 9 letters looping SRS derivation 0.00/0.05 Closure source : abc 0.00/0.05 target : aabc 0.00/0.05 steps : 1 0.00/0.05 strict : True 0.00/0.05 last_rule_app_source : 0 0.00/0.05 last_rule_app_target : 0 0.00/0.05 reason : Rule 1 0.00/0.05 0.00/0.05 0.00/0.05 ************************************************** 0.00/0.05 (31, 9)\Loop[] 0.00/0.05 ************************************************** 0.00/0.17 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;tiling = \ m w -> weighted (And_Then (Worker (Tiling { method = m,width = w})) (Worker Remap));when_small = \ m -> And_Then (Worker (SizeAtmost 100)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;solver = Minisatapi;qpi = \ dim bits -> weighted (when_small (Worker (QPI { tracing = True,dim = dim,bits = bits,solver = solver})));matrix = \ dom dim bits -> weighted (when_small (Worker (Matrix { monotone = Weak,domain = dom,dim = dim,bits = bits,tracing = False,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]] <> ([ matrix Arctic 4 3, matrix Natural 4 3] <> [ kbo 1, And_Then (Worker Mirror) (kbo 1)])));remove_tile = Seq [ remove, tiling Overlap 3];dp = As_Transformer (Apply (And_Then (Worker (DP { tracing = False})) (Worker Remap)) (Apply wop (Branch (Worker (EDG { tracing = False})) remove_tile)));noh = [ Timeout 10 (Worker (Enumerate { closure = Forward})), Timeout 10 (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]} 0.00/0.17 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 0.00/0.18 EOF
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS_Standard 2019-03-29 03.29