DRAT-TRIM(1)

πŸ“¦
version 0.0~git20240428.effa1dc Β· 7 versions
, in debian trixie, ubuntu questing

✨ DRAT-TRIM(1) β€” the manual, but make it make sense ✨

okay bestie, sit down, hydrate, and let me tell you about drat-trim β€” the DRAT-trim Satisfiability Proof Checker πŸ’… this is a User Commands page, so you already know it's gonna be giving "I live in your terminal and I'm iconic".


πŸŽ€ NAME πŸŽ€

drat-trim β€” DRAT-trim Satisfiability Proof Checker. no cap, that's literally the whole name. that's the brand. that's the vibe. ✨


πŸ¦‹ DESCRIPTION πŸ¦‹

so here's the tea, the synopsis, the whole main-character entrance:

drat-trim [INPUT] [<PROOF>] [<option> ...]

and <option> is one of the following, and yes we're going through all of them, no skipping, no skimming, this is a completionist household 🫢

  • -h β€” prints this command line option summary. it's the "help me bestie" button πŸ’–
  • -c CORE β€” prints the unsatisfiable core to the file CORE, in DIMACS format. the receipts, but for unsatisfiability ✨
  • -a ACTIVE β€” prints the active clauses to the file ACTIVE, in DIMACS format.
  • -l LEMMAS β€” prints the core lemmas to the file LEMMAS, in DRAT format.
  • -L LEMMAS β€” prints the core lemmas to the file LEMMAS, in LRAT format. yes it's a different letter than -l, and yes that matters, look at them again πŸ” (one is lowercase, one is uppercase, do not mix them up, I am begging πŸ™ˆ)
  • -r TRACE β€” resolution graph in the TRACE file, in TRACECHECK format. it's giving family tree but for logic 🌳
  • -t <lim> β€” time limit in seconds. default is 40000. that's a lot of seconds. that's a whole situation of seconds ⏳
  • -u β€” default unit propatation, i.e., no core-first. (that's spelled exactly like that in the original, and I'm keeping it, we don't edit the ancestors πŸ’€)
  • -f β€” forward mode for UNSAT.
  • -v β€” more verbose output. it will simply talk more. relatable, honestly πŸ—£οΈ
  • -b β€” show progress bar. visual feedback, we love to see it ✨
  • -O β€” optimize proof till fixpoint by repeating verification. it keeps going until it can't go anymore. queen behavior πŸ‘‘
  • -C β€” compress core lemmas (emit binary proof). tiny proof, big energy 🌸
  • -D β€” delete proof file after parsing. bestie it deletes it. after parsing. it's gone. be so serious about this one 😭
  • -I β€” force ASCII proof parse mode.
  • -i β€” force binary proof parse mode. (-I and -i are NOT the same thing, casing is load-bearing, iykyk)
  • -w β€” suppress warning messages. the warnings just… stop πŸ¦‹
  • -W β€” exit after first warning. one warning and it's out the door, no second chances πŸ’…
  • -p β€” run in plain mode, i.e., ignore deletion information.
  • -R β€” turn off reduce mode.
  • -S β€” run in SAT check mode (forward checking).
  • -U β€” only allow RUP additions.

🌈 and input and proof are specified as follows 🌈

  • INPUT β€” input file in DIMACS format πŸ“₯
  • PROOF β€” proof file in DRAT format (stdin if no argument). so if you don't hand it a proof file, it just reads from stdin like "fine, I'll take what you give me" πŸ“
heads up bestie: -D literally deletes the proof file after parsing, and -W bails out at the first warning β€” those two are not playing around, okay? read twice, run once. πŸ™ˆ

this page is from drat-trim 0.0~git20240428.effa1dc, dated October 2024, and it's page DRAT-TRIM(1) of the manual πŸŽ€ mwah, go check some proofs, you're doing amazing sweetie πŸ’–βœ¨πŸ¦‹

πŸ“¦ where this page comes from