details

property	value
status	complete
benchmark	size-12-alpha-3-num-400.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n115.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	matchbox-2021-06-18b
configuration	tc21-9.sh
runtime (wallclock)	2.49841809273 seconds
cpu usage	6.387218589
max memory	3.42208512E8

stage attributes

key	value
output-size	14998
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO ************************************************** summary ************************************************** SRS with 2 rules on 3 letters admits a non-terminating transport system with pivot [a, a] alphabet [[a], [c, c, a]] pivot represented as [[a], [a]] derivations for transport system [a] [a] pivot ->^0 pivot [[a]] because of derivation [a, a, a] ->^0 [a, a, a] via steps [c, c, a] [c, c, a] pivot ->^6 pivot [[a], [c, c, a], [c, c, a]] because of derivation [c, c, a, a, a] ->^6 [a, a, a, c, c, a, c, c, a] via steps Step { rule = 0, position = 3} Step { rule = 0, position = 4} Step { rule = 1, position = 1} Step { rule = 0, position = 2} Step { rule = 0, position = 3} Step { rule = 1, position = 0} infinite derivation starts at [[c, c, a]] pivot ^ 5 ************************************************** proof ************************************************** property Termination has value Just False for SRS [a] -> [b] {- Input 0 -} [b, b, a, c] -> [a, c, c, a, a, a] {- Input 1 -} reason admits a non-terminating transport system with pivot [a, a] alphabet [[a], [c, c, a]] pivot represented as [[a], [a]] derivations for transport system [a] [a] pivot ->^0 pivot [[a]] because of derivation [a, a, a] ->^0 [a, a, a] via steps [c, c, a] [c, c, a] pivot ->^6 pivot [[a], [c, c, a], [c, c, a]] because of derivation [c, c, a, a, a] ->^6 [a, a, a, c, c, a, c, c, a] via steps Step { rule = 0, position = 3} Step { rule = 0, position = 4} Step { rule = 1, position = 1} Step { rule = 0, position = 2} Step { rule = 0, position = 3} Step { rule = 1, position = 0} infinite derivation starts at [[c, c, a]] pivot ^ 5 ************************************************** skeleton: (2,3)\Transport{}[] ************************************************** let {} in let {trac ?= False;loop_cap = 1;match_cap = 2;tile_cap = 3;matrix_cap = 4;mo = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;done = Worker No_Strict_Rules;dont = \ p -> Fail;tiling = \ m w -> On tile_cap (weighted (And_Then (Worker (Tiling {method = m,width = w,map_type = Enum,max_num_tiles = Just 1000,max_num_rules = Just 100000})) (Worker Remap)));tile_roc = Tree_Search_Preemptive 0 done let {ws = [ 2, 4, 8, 12]}in (for ws (\ w -> tiling Overlap w)) <> [ Worker Unlabel];mb = \ size -> On match_cap (Apply (Worker (Matchbound {method = RFC,max_size = Just size})) done);mbs = \ size -> First_Of [ mb size, Apply (Worker Mirror) (mb size)];tile_rfc = Tree_Search_Preemptive 0 done let {ws = [ 2, 4, 8, 12]}in (for ws (\ w -> tiling Forward w)) <> ((for ws (\ w -> tiling Backward w)) <> [ Worker Unlabel]);solver = Minisatapi;qpi = \ dim bits -> On matrix_cap (weighted (Worker (QPI {tracing = trac,dim = dim,bits = bits,solver = solver})));qpis = Seq [ Timeout 10 (qpi 2 3), Timeout 30 (qpi 4 3), Timeout 50 (qpi 6 3), qpi 8 3];kbo = \ b -> On matrix_cap (weighted (Worker (KBO {bits = b,solver = solver})));matrix = \ dom dim bits -> On matrix_cap (weighted (Worker (Matrix {monotone = Weak,domain = dom,dim = dim,bits = bits,encoding = Ersatz_Binary,tracing = trac,verbose = True,solver = solver})));arctics = Seq [ Timeout 10 (matrix Arctic 2 16), Timeout 30 (matrix Arctic 4 8), Timeout 50 (matrix Arctic 6 4), matrix Arctic 8 2];naturals = Seq [ Timeout 10 (matrix Natural 2 4), Timeout 30 (matrix Natural 4 3), Timeout 50 (matrix Natural 6 2), matrix Natural 8 1];remove = First_Of [ qpis, arctics, naturals, As_Transformer tile_roc];remove_wop = And_Then wop (Or_Else (As_Transformer (Worker No_Strict_Rules)) remove);deepee = Apply (And_Then (Worker DP) (Worker Remap)) (Apply wop (Branch (Worker (EDG {tracing = False,usable = True})) remove_wop));when_small = \ m -> Apply (Worker (SizeAtmost 1000)) m;yeah = First_Of [ when_small (First_Of [ deepee, Apply (Worker Mirror) deepee]), tile_rfc, mbs 100000];noh_for = \ side -> Worker (Simple (Config {closure = side,max_closure_width = Nothing,intermediates = All,priority = Linear [ ( 1, Log2 Steps), ( -1, Width_lhs), ( -2, Log2 Width_rhs)]}));noh = First_Of [ On loop_cap (noh_for Forward), On loop_cap (noh_for Backward), On loop_cap (Worker Transport)]} in Apply (Worker Remap) (Apply wop (Seq [ Worker KKST01, First_Of [ yeah, noh]])) ************************************************** statistics on proof search (nodes types that (together) took more than 1.000000000000) ************************************************** Fail : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 1.669617647000 min duration 1.669617647000 total durat. 1.669617647000 Info { what = Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 25} , self = 91 , parent = Just 18 , duration = 1.669617647000 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to SRS Standard