CRYPTOMINISAT5(1)
💖 CRYPTOMINISAT5(1) 💖
okay bestie, welcome to the User Commands manual for cryptominisat5 — a whole SAT solver and she is iconic. We're doing this in three parts, so buckle up. This is part 1. 💅
🌸 NAME 🌸
cryptominisat5 — manual page for cryptominisat5 5.11.21
✨ SYNOPSIS ✨
okay so the summoning circle looks like this, no cap:
cryptominisat5 [--help] [--version] [--help VAR] [--version] [--verb
VAR] [--maxtime VAR] [--maxconfl VAR] [--random VAR] [--threads VAR]
[--mult VAR] [--nextm VAR] [--memoutmult VAR] [--maxsol VAR] [--polar
VAR] [--scc VAR] [--restart VAR] [--rstfirst VAR] [--gluehist VAR]
[--lwrbndblkrest VAR] [--locgmult VAR] [--ratiogluegeom VAR]
[--blockingglue VAR] [--gluecut0 VAR] [--gluecut1 VAR] [--adjustglue
VAR] [--everylev1 VAR] [--everylev2 VAR] [--lev1usewithin VAR]
[--branchstr VAR] [--nobansol] [--debuglib VAR] [--breakid VAR]
[--breakideveryn VAR] [--breakidmaxlits VAR] [--breakidmaxcls VAR]
[--breakidmaxvars VAR] [--breakidtime VAR] [--breakidcls VAR]
[--breakidmatrix VAR] [--sls VAR] [--slstype VAR] [--slsmaxmem VAR]
[--slseveryn VAR] [--yalsatmems VAR] [--walksatruns VAR] [--slsgetphase
VAR] [--slsccnraspire VAR] [--slstobump VAR] [--slstobumpmaxpervar VAR]
[--slsbumptype VAR] [--transred VAR] [--intree VAR] [--intreemaxm VAR]
[--otfhyper VAR] [--schedsimp VAR] [--presimp VAR] [--allpresimp VAR]
[--nonstop VAR] [--maxnumsimppersolve VAR] [--schedule VAR]
[--preschedule VAR] [--occsimp VAR] [--confbtwsimp VAR]
[--confbtwsimpinc VAR] [--tern VAR] [--terntimelim VAR] [--ternkeep VAR]
[--terncreate VAR] [--ternbincreate VAR] [--occredmax VAR]
[--occredmaxmb VAR] [--occirredmaxmb VAR] [--strengthen VAR]
[--weakentimelim VAR] [--substimelim VAR] [--substimelimbinratio VAR]
[--substimelimlongratio VAR] [--strstimelim VAR] [--sublonggothrough
VAR] [--bva VAR] [--bvaeveryn VAR] [--bvalim VAR] [--bva2lit VAR]
[--bvato VAR] [--varelim VAR] [--varelimto VAR] [--varelimover VAR]
[--emptyelim VAR] [--varelimmaxmb VAR] [--eratio VAR] [--varelimcheckres
VAR] [--xor VAR] [--maxxorsize VAR] [--xorfindtout VAR] [--varsperxorcut
VAR] [--maxxormat VAR] [--forcepreservexors VAR] [--gates VAR]
[--printgatedot VAR] [--gatefindto VAR] [--recur VAR] [--moreminim VAR]
[--moremoreminim VAR] [--moremorealways VAR] [--decbased VAR]
[--updateglueonanalysis VAR] [--maxgluehistltlimited VAR]
[--diffdeclevelchrono VAR] [--verbstat VAR] [--verbrestart VAR]
[--verballrestarts VAR] [--printsol,s VAR] [--restartprint VAR]
[--distill VAR] [--distillbin VAR] [--distillmaxm VAR] [--distillincconf
VAR] [--distillminconf VAR] [--distilltier0ratio VAR]
[--distilltier1ratio VAR] [--distillirredalsoremratio VAR]
[--distillirrednoremratio VAR] [--distillshuffleeveryn VAR]
[--distillsort VAR] [--renumber VAR] [--mustconsolidate VAR] [--savemem
VAR] [--mustrenumber VAR] [--fullwatchconseveryn VAR] [--strmaxt VAR]
[--implicitmanip VAR] [--implsubsto VAR] [--implstrto VAR] [--cardfind
VAR] [--sync VAR] [--clearinter VAR] [--zero-exit-status] [--printtimes
VAR] [--maxsccdepth VAR] [--simfrat VAR] [--sampling VAR]
[--onlysampling] [--assump VAR] [--maxmatrixrows VAR] [--maxmatrixcols
VAR] [--autodisablegauss VAR] [--minmatrixrows VAR] [--maxnummatrices
VAR] [--detachxor VAR] [--useallmatrixes VAR] [--detachverb VAR]
[--gaussusefulcutoff VAR] [--dumpresult VAR] files🦋 DESCRIPTION 🦋
She's a universal, fast SAT solver with XOR and Gaussian Elimination support. Input can be either plain or gzipped DIMACS with XOR extension. 💖
cryptominisat5 [options] inputfile [frat-file]
📁 Positional arguments 📁
files— input file and FRAT output[nargs: 0 or more]🗂️
⚙️ Optional arguments ⚙️
-h,--help— shows help message and exits ✨-v,--version— prints version information and exits 🎀-h,--help— Print extensive help[nargs=0..1][default: false]👑-v,--version— Print version info 💖--verb[0-10]— Verbosity of solver.0= only solution[nargs=0..1][default: 1]🔊--maxtime— Stop solving after this much time (s) ⏰--maxconfl— Stop solving after this many conflicts 💥-r,--random—[0..]Random seed[nargs=0..1][default: 0]🎲-t,--threads— Number of threads[nargs=0..1][default: 1]🧵-m,--mult— Time multiplier for all simplification cutoffs[nargs=0..1][default: 3]✖️--nextm— Global multiplier when the next inprocessing should take place[nargs=0..1][default: 1]🔄--memoutmult— Multiplier for memory-out checks on inprocessing functions. It limits things such as clause-link-in. Useful when you have limited memory but still want to do some inprocessing[nargs=0..1][default: 1]🧠--maxsol— Search for given amount of solutions. Thanks to Jannis Harder for the decision-based banning idea[nargs=0..1][default: 1]🌟--polar—{true,false,rnd,auto,stable}Selects polarity mode.'true'-> selects only positive polarity when branching.'false'-> selects only negative polarity when branching.'auto'-> selects last polarity used (also called'caching')[nargs=0..1][default: "auto"]🧭--scc— Find equivalent literals through SCC and replace them[nargs=0..1][default: 1]🔍--restart—{geom, glue, luby}Restart strategy to follow.[nargs=0..1][default: "auto"]🔁--rstfirst— The size of the base restart[nargs=0..1][default: 100]🏁--gluehist— The size of the moving window for short-term glue history of redundant clauses. If higher, the minimal number of conflicts between restarts is longer[nargs=0..1][default: 50]🪟--lwrbndblkrest— Lower bound on blocking restart -- don't block before this many conflicts[nargs=0..1][default: 10000]🚫--locgmult— The multiplier used to determine if we should restart during glue-based restart[nargs=0..1][default: 0.8]📈--ratiogluegeom— Ratio of glue vs geometric restarts -- more is more glue[nargs=0..1][default: 5]⚖️--blockingglue— Do blocking restart for glues[nargs=0..1][default: 1]🧱--gluecut0— Glue value for lev 0 ('keep') cut[nargs=0..1][default: 3]✂️--gluecut1— Glue value for lev 1 cut ('give another shot'[nargs=0..1][default: 6]🎯--adjustglue— If more than this % of clauses is LOW glue (level 0) then lower the glue cutoff by 1 -- once and never again[nargs=0..1][default: 0.7]📉--everylev1— Reduce lev1 clauses every N[nargs=0..1][default: 10000]🧹--everylev2— Reduce lev2 clauses every N[nargs=0..1][default: 15000]🧽--lev1usewithin— Learnt clause must be used in lev1 within this timeframe or be dropped to lev2[nargs=0..1][default: 70000]⏳--branchstr— Branch strategy string that switches between different branch strategies while solving e.g.'vsids1+vsids2'[nargs=0..1][default: "vmtf+vsids"]🌿--nobansol— Don't ban the solution once it's found 🚷--debuglib— Parse special comments to run solve/simplify during parsing of CNF 🐞--breakid— Run BreakID to break symmetries.[nargs=0..1][default: true]💔--breakideveryn— Run BreakID every N simplification iterations[nargs=0..1][default: 5]🔂--breakidmaxlits— Maximum number of literals in thousands. If exceeded, BreakID will not run[nargs=0..1][default: 3500]🔤--breakidmaxcls— Maximum number of clauses in thousands. If exceeded, BreakID will not run[nargs=0..1][default: 600]📚--breakidmaxvars— Maximum number of variables in thousands. If exceeded, BreakID will not run[nargs=0..1][default: 300]🔢--breakidtime— Maximum number of steps taken during automorphism finding.[nargs=0..1][default: 2000]⏱️--breakidcls— Maximum number of breaking clauses per permutation.[nargs=0..1][default: 50]🔗--breakidmatrix— Detect matrix row interchangability[nargs=0..1][default: true]🔄--sls— Run SLS during simplification[nargs=0..1][default: 1]🏃♀️--slstype— Which SLS to run. Allowed values:walksat,yalsat,ccnr,ccnr_yalsat[nargs=0..1][default: "ccnr"]🎛️--slsmaxmem— Maximum number of MB to give to SLS solver. Doesn't run SLS solver if the memory usage would be more than this.[nargs=0..1][default: 500]💾--slseveryn— Run SLS solver every N simplifications only[nargs=0..1][default: 2]⏲️--yalsatmems— Run Yalsat with this many mems*million timeout. Limits time of yalsat run[nargs=0..1][default: 10]🧮--walksatruns— Max'runs'for WalkSAT. Limits time of WalkSAT run[nargs=0..1][default: 50]🚶--slsgetphase— Get phase from SLS solver, set as new phase for CDCL[nargs=0..1][default: 1]🌙--slsccnraspire— Turn aspiration on/off for CCANR[nargs=0..1][default: 1]💨--slstobump— How many variables to bump in CCNR[nargs=0..1][default: 100]📌--slstobumpmaxpervar— How many times to bump an individual variable's activity in CCNR[nargs=0..1][default: 100]🔝--slsbumptype— How to calculate what variable to bump.1= clause-based,2= var-flip-based,3= var-score-based[nargs=0..1][default: 6]🧠--transred— Remove useless binary clauses (transitive reduction)[nargs=0..1][default: 1]🗑️--intree— Carry out intree-based probing[nargs=0..1][default: 1]🌳--intreemaxm— Time in mega-bogoprops to perform intree probing[nargs=0..1][default: 400]⏳--otfhyper— Perform hyper-binary resolution during probing[nargs=0..1][default: 1]🚀--schedsimp— Perform simplification rounds. If0, we never perform any.[nargs=0..1][default: 1]🗓️--presimp— Perform simplification at the very start[nargs=0..1][default: 0]🏁--allpresimp— Perform simplification at EVERY start -- only matters in library mode[nargs=0..1][default: 0]🔄-n,--nonstop— Never stop thesearch()process in classSATSolver[nargs=0..1][default: 0]🛑--maxnumsimppersolve— Maximum number of simplifiactions to perform for everysolve()call. After this, no more inprocessing will take place.[nargs=0..1][default: 25]🔢--schedule— Schedule for simplification during run 🗓️--preschedule— Schedule for simplification at startup 🚀--occsimp— Perform occurrence-list-based optimisations (variable elimination, subsumption, bounded variable addition...)[nargs=0..1][default: 1]📋--confbtwsimp— Start first simplification after this many conflicts[nargs=0..1][default: 40000]💥
part 1 done, bestie — part 2 is loading… 💅✨
okay bestie the flag parade continues and there are sooo many 💅 hydrate, stretch, we're going in — every single one keeps its [nargs=0..1] and [default: ...] exactly, no cap.
--confbtwsimpinc— how hard the simp rounds bump up each time, expressed as a power of N.[nargs=0..1][default: 1.4]--tern— turn on Ternary resolution. yes bestie we're resolving ternarily[nargs=0..1][default: true]--terntimelim— the time-out, in bogoprops M, of ternary resolution, exactly as described in the paper'Look-Ahead Versus Look-Back for Satisfiability Problems'. 📄[nargs=0..1][default: 100]--ternkeep— ternary resolution clauses only get kept if they're touched within this multiple of'lev1usewithin'.[nargs=0..1][default: 5]--terncreate— only create this multiple (of linked in cls) ternary resolution clauses per simp run.[nargs=0..1][default: 0.3]--ternbincreate— let ternary resolving generate binary clauses.[nargs=0..1][default: 0]--occredmax— don't add any redundant clause bigger than this to the occur list.[nargs=0..1][default: 50]--occredmaxmb— don't let the redundant occur size go beyond this many MB.[nargs=0..1][default: 600]--occirredmaxmb— don't let the irredundant occur size go beyond this many MB.[nargs=0..1][default: 2500]--strengthen— perform clause contraction through self-subsuming resolution as part of the occurrence-subsumption system.[nargs=0..1][default: 1]--weakentimelim— time-out in bogoprops M ofweakeaningused (yes, the typo is canon, we respect it 🫶).[nargs=0..1][default: 300]--substimelim— time-out in bogoprops M of subsumption of long clauses with long clauses, after computing occur.[nargs=0..1][default: 300]--substimelimbinratio— the ratio of the subsumption time limit to spend onsub&strlong clauses with bin.[nargs=0..1][default: 0.1]--substimelimlongratio— the ratio of the subsumption time limit to spend on sub long clauses with long.[nargs=0..1][default: 0.9]--strstimelim— time-out in bogoprops M of strengthening of long clauses with long clauses, after computing occur.[nargs=0..1][default: 300]--sublonggothrough— how many times go through subsume.[nargs=0..1][default: 1]--bva— perform bounded variable addition. iconic[nargs=0..1][default: 1]--bvaeveryn— only perform BVA every N occ-simplify calls.[nargs=0..1][default: 7]--bvalim— maximum number of variables to add by BVA per call.[nargs=0..1][default: 250000]--bva2lit— BVA with 2-lit difference hack, too. ⚠️ Beware bestie: this reduces the effectiveness of 1-lit diff.[nargs=0..1][default: 1]--bvato— BVA time limit in bogoprops M.[nargs=0..1][default: 50]--varelim— perform variable elimination as per Een and Biere.[nargs=0..1][default: 1]--varelimto— var elimination bogoprops M time limit.[nargs=0..1][default: 750]--varelimover— do BVE until the resulting no. of clause increase is less than X. Only power of 2 makes sense, i.e. 2,4,8...[nargs=0..1][default: 16]--emptyelim— perform empty resolvent elimination using the bit-map trick. 🎀[nargs=0..1][default: 1]--varelimmaxmb— maximum extra MB of memory to use for new clauses during varelim.[nargs=0..1][default: 1000]--eratio— eliminate this ratio of free variables at most per variable elimination iteration.[nargs=0..1][default: 1.6]--varelimcheckres— BVE should check whether resolvents subsume others and check for exact size increase.[nargs=0..1][default: 0]--xor— discover long XORs. the XOR detector has entered the chat[nargs=0..1][default: 1]--maxxorsize— maximum XOR size to find.[nargs=0..1][default: 7]--xorfindtout— time limit for finding XORs.[nargs=0..1][default: 400]--varsperxorcut— number of real variables per XOR when cutting them. So 2 will have XORs of size 4 because 1 = connecting to previous, 1 = connecting to next, 2 in the midde. If the XOR is 4 long, it will be just one 4-long XOR, no connectors.[nargs=0..1][default: 2]--maxxormat— maximum matrix size (=num elements) that we should try to echelonize.[nargs=0..1][default: 400]--forcepreservexors— force preserving XORs when they have been found. Easier to make sure XORs are not lost through simplifiactions such as strenghtening.[nargs=0..1][default: 1]--gates— find gates. 🚪[nargs=0..1][default: 0]--printgatedot— print the gate structure regularly to file'gatesX.dot'.[nargs=0..1][default: 0]--gatefindto— max time in bogoprops M to find gates.[nargs=0..1][default: 200]--recur— perform recursive minimisation.[nargs=0..1][default: 1]--moreminim— perform strong minimisation at conflict gen.[nargs=0..1][default: 1]--moremoreminim— perform even stronger minimisation at conflict gen.[nargs=0..1][default: 2]--moremorealways— always strong-minimise clause.[nargs=0..1][default: 0]--decbased— create decision-based conflict clauses when the UIP clause is too large.[nargs=0..1][default: 1]--updateglueonanalysis— update glues while analyzing.[nargs=0..1][default: 1]--maxgluehistltlimited— maximum glue used by the glue-based restart strategy when populating glue history.[nargs=0..1][default: 50]--diffdeclevelchrono— if the difference in decision level is more than this, perform chonological backtracking instead of non-chronological backtracking. Giving-1means it is never turned on (overrides'--confltochrono -1'in this case).[nargs=0..1][default: 20]--verbstat— change the verbosity of statistics at the end of the solving[0..3].[nargs=0..1][default: 2]--verbrestart— print more thorough, but different stats.[nargs=0..1][default: 0]--verballrestarts— print a line for every restart.[nargs=0..1][default: 0]--printsol,s— print the assignment if the solution is SAT.[nargs=0..1][default: 1]--restartprint— print restart status lines at least every N conflicts.[nargs=0..1][default: 8192]--distill— regularly execute clause distillation.[nargs=0..1][default: 1]--distillbin— regularly execute clause distillation. (yes, the description is literally the same as the one above, no I will not be editing it 🙈)[nargs=0..1][default: 1]--distillmaxm— maximum number of Mega-bogoprops(~time) to spend on vivifying/distilling long cls by enqueueing and propagating.[nargs=0..1][default: 20]--distillincconf— multiplier for current number of conflicts OTF distill.[nargs=0..1][default: 0.1]--distillminconf— minimum number of conflicts between OTF distill.[nargs=0..1][default: 10000]--distilltier0ratio— how much of tier 0 to distill.[nargs=0..1][default: 10]--distilltier1ratio— how much of tier 1 to distill.[nargs=0..1][default: 0.03]--distillirredalsoremratio— how much of irred to distill when doing also removal.[nargs=0..1][default: 1.2]--distillirrednoremratio— how much of irred to distill when doing no removal.[nargs=0..1][default: 1]--distillshuffleeveryn— shuffle to-be-distilled clauses every N cases randomly. 🔀[nargs=0..1][default: 3]--distillsort— distill sorting type.[nargs=0..1][default: 1]--renumber— renumber variables to increase CPU cache efficiency. cache girlies rise[nargs=0..1][default: 1]--mustconsolidate— always consolidate, even if not useful. This is used for debugging ONLY.[nargs=0..1][default: 0]--savemem— save memory by deallocating variable space after renumbering. Only works if renumbering is active.[nargs=0..1][default: 1]--mustrenumber— treat all'renumber'strategies as'must-renumber'.[nargs=0..1][default: 0]--fullwatchconseveryn— consolidate watchlists fully once every N conflicts. Scheduled during simplification rounds.[nargs=0..1][default: 4000000]--strmaxt— maximum MBP to spend on distilling long irred cls through watches.[nargs=0..1][default: 20]--implicitmanip— subsume and strengthen implicit clauses with each other.[nargs=0..1][default: 1]--implsubsto— timeout (in bogoprop Millions) of implicit subsumption.[nargs=0..1][default: 100]--implstrto— timeout (in bogoprop Millions) of implicit strengthening.[nargs=0..1][default: 200]--cardfind— find cardinality constraints.[nargs=0..1][default: 0]--sync— sync threads every N conflicts.[nargs=0..1][default: 7000]--clearinter— interrupt threads cleanly, all the time.[nargs=0..1][default: 0]--zero-exit-status— exit with status zero in case the solving has finished without an issue.--printtimes— print the time it took for each simplification run. If set to 0, logs are easier to compare.[nargs=0..1][default: 1]--maxsccdepth— the maximum for scc search depth.[nargs=0..1][default: 10000]--simfrat— simulate FRAT.[nargs=0..1][default: 0]--sampling— sampling vars, separated by comma.[nargs=0..1][default: ""]--onlysampling— print and ban(!) solutions' vars only in'c ind'or as--sampling'...'--assump— assumptions file.[nargs=0..1][default: ""]--maxmatrixrows— set maximum no. of rows for gaussian matrix. Too large matricesshould bee discarded for reasons of efficiency.[nargs=0..1][default: 2000]--maxmatrixcols— set maximum no. of columns for gaussian matrix. Too large matricesshould bee discarded for reasons of efficiency.[nargs=0..1][default: 1000]--autodisablegauss— automatically disable gauss when performing badly.[nargs=0..1][default: true]--minmatrixrows— set minimum no. of rows for gaussian matrix. Normally, too small matrices are discarded for reasons of efficiency.[nargs=0..1][default: 3]--maxnummatrices— maximum number of matrices to treat.[nargs=0..1][default: 5]--detachxor— detach and reattach XORs.[nargs=0..1][default: false]--useallmatrixes— force using all matrices.[nargs=0..1][default: false]--detachverb— if set, verbosity for XOR detach code is upped, ignoring normal verbosity.[nargs=0..1][default: 0]--gaussusefulcutoff— turn off Gauss if less than this many usefulenss ratio is recorded.[nargs=0..1][default: 0.2]
and that's a wrap on... this chunk of them 👑 not the whole page tho, bestie, don't go anywhere — there's more coming and you're doing amazing 💜
--dumpresult— writes the solution(s) out to this file 💾 like the receipts of your solve, saved for later.
✨ Normal run schedules ✨
okay so this is the pre-planned glow-up routine your solver goes through, and there's two of them. Obsessed, honestly.
Default schedule:
scc-vrepl,sub-impl,breakid,occ-backw-sub-str,occ-clean-implicit,occ-bve,occ-bva,occ-ternary-res,occ-xor,card-find,cl-consolidate,scc-vrepl,renumber,bosphorus,louvain-commsSchedule at startup:
sub-impl, occ-backw-sub,scc-vrepl,breakid, occ-bve,occ-xoryes bestie, scc-vrepl really does show up twice in the default schedule — that's not a typo, that's the actual list, don't come for me 😭
🌈 SEE ALSO 🌈
fr fr, the full documentation for cryptominisat5 lives in a Texinfo manual — like the director's cut of this whole thing 🎀
If the info and cryptominisat5 programs are properly installed at your site, then this:
info cryptominisat5should give you access to the complete manual. periodt. 👑
and that's the whole page, bestie!! this was cryptominisat5 version 5.11.21, dated January 2026 — thanks for reading, you absolute main character 🫶💖✨
📦 where this page comes from
- ubuntu resolute: cryptominisat 5.11.21+dfsg1-3build1 · MIT
- ubuntu stonking: cryptominisat 5.11.21+dfsg1-3build1 · MIT
- 💖 girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms