Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487511464
details
property
value
status
complete
benchmark
num-521.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n123.star.cs.uiowa.edu
space
Secret_07_SRS
run statistics
property
value
solver
matchbox-2020-06-25
configuration
tc20-std.sh
runtime (wallclock)
0.0660810470581 seconds
cpu usage
0.162550892
max memory
1.435648E7
stage attributes
key
value
output-size
3884
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_tc20-std.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO ************************************************** summary ************************************************** SRS with 2 rules on 3 letters looping SRS derivation Closure source : aaaaaab target : abcababcabcababcaaaaaaabaaa steps : 16 strict : True last_rule_app_source : 0 last_rule_app_target : 23 ************************************************** proof ************************************************** property Termination has value Just False for SRS [a, a, b] -> [a, b, c, a, a] {- Input 0 -} [a, c] -> [b, a] {- Input 1 -} reason Nontermination looping SRS derivation Closure source : aaaaaab target : abcababcabcababcaaaaaaabaaa steps : 16 strict : True last_rule_app_source : 0 last_rule_app_target : 23 reason : Overlap (Inside 23) Overlap (Inside 13) Overlap (Inside 15) Overlap (Inside 12) Overlap (Inside 8) Overlap (Inside 9) Overlap (Inside 5) Overlap (Inside 8) Overlap (Inside 4) Overlap (Left 2) Overlap (Inside 7) Overlap (Inside 4) Overlap (Left 2) Overlap (Left 2) Overlap (Left 2) Rule 0 Rule 0 Rule 0 Rule 0 Rule 1 Rule 1 Rule 0 Rule 1 Rule 0 Rule 0 Rule 0 Rule 0 Rule 1 Rule 1 Rule 0 Rule 1 ************************************************** skeleton: (2,3)\Loop{}[] ************************************************** 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