| /dports/math/z3/z3-z3-4.8.13/src/math/lp/ |
| H A D | nla_basics_lemmas.h | 87 void negate_strict_sign(new_lemma& lemma, lpvar j);
|
| H A D | nra_solver.cpp | 106 nla::new_lemma lemma(m_nla_core, __FUNCTION__); in check() local
107 lemma &= ex; in check()
|
| /dports/misc/bibletime/bibletime-2.11.2/src/display-templates/ |
| H A D | Christmastide.css | 78 .lemma {
|
| H A D | Simple.css | 72 .lemma {
|
| /dports/print/fig2dev/fig2dev-3.2.8a/transfig/doc/ |
| H A D | setup12.tex | 44 \newtheorem{lemma}{Lemma}
|
| /dports/math/cvc4/CVC4-1.7/src/proof/ |
| H A D | clausal_bitvector_proof.h | 81 void printTheoryLemmaProof(std::vector<Expr>& lemma,
|
| H A D | lemma_proof.h | 79 void setOriginalLemma(Node lemma);
|
| H A D | uf_proof.h | 82 void printTheoryLemmaProof(std::vector<Expr>& lemma,
|
| /dports/math/cvc4/CVC4-1.7/src/theory/ |
| H A D | theory_test_utils.h | 82 LemmaStatus lemma(TNode n, ProofRule rule, bool removable = false,
|
| /dports/print/lyx/lyx-2.3.4.2/lib/layouts/ |
| H A D | svmono.layout | 43 Counter lemma
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/math/lp/ |
| H A D | nla_basics_lemmas.h | 87 void negate_strict_sign(new_lemma& lemma, lpvar j);
|
| H A D | nra_solver.cpp | 106 nla::new_lemma lemma(m_nla_core, __FUNCTION__); in check() local
107 lemma &= ex; in check()
|
| /dports/math/vampire/vampire-4.5.1/VUtils/ |
| H A D | Z3InterpolantExtractor.hpp | 97 void resolveHypotheses(List<TermList>*& hypotheses, TermList lemma);
|
| /dports/math/cvc4/CVC4-1.7/contrib/ |
| H A D | run-script-smtcomp2018 | 30 …e-approx --lemmas-on-replay-failure --replay-early-close-depth=4 --replay-lemma-reject-cut=128 --r…
35 …e-approx --lemmas-on-replay-failure --replay-early-close-depth=4 --replay-lemma-reject-cut=128 --r…
|
| /dports/math/abella/abella-2.0.7/examples/logic/ |
| H A D | focus.thm | 80 Theorem lemma : forall B2,
113 apply lemma with B2 = C. apply H11 to H1 H4 H2 H9 H10. search.
|
| /dports/textproc/py-ufal.udpipe/ufal.udpipe-1.2.0.3/udpipe/ |
| H A D | udpipe.h | 62 std::string lemma; // lemma variable
89 std::string lemma; // lemma variable
|
| /dports/net/bird2/bird-2.0.8/doc/sbase/dist/birddoc/html/ |
| H A D | mapping | 259 <lemma> + "<LEMMA>"
260 </lemma> + "</LEMMA>" +
|
| /dports/net/bird/bird-1.6.8/doc/sbase/dist/birddoc/html/ |
| H A D | mapping | 259 <lemma> + "<LEMMA>"
260 </lemma> + "</LEMMA>" +
|
| /dports/textproc/linuxdoc-tools/linuxdoc-tools-0.9.82/lib/mappings/html/ |
| H A D | mapping | 222 <lemma> + "<LEMMA>"
223 </lemma> + "</LEMMA>" +
|
| /dports/math/z3/z3-z3-4.8.13/src/smt/ |
| H A D | smt_internalizer.cpp | 1234 bool context::use_binary_clause_opt(literal l1, literal l2, bool lemma) const { in use_binary_clause_opt()
1241 if (lemma && relevancy_lvl() >= 2) in use_binary_clause_opt()
1245 if (!lemma && m_scope_lvl > 0) in use_binary_clause_opt()
1393 bool lemma = is_lemma(k); in mk_clause() local
1410 if (use_binary_clause_opt(lits[0], lits[1], lemma)) { in mk_clause()
1427 unsigned iscope_lvl = lemma ? get_max_iscope_lvl(num_lits, lits) : 0; in mk_clause()
1429 bool save_atoms = lemma && iscope_lvl > m_base_lvl; in mk_clause()
1431 SASSERT(!lemma || j == 0 || !j->in_region()); in mk_clause()
1434 if (lemma) { in mk_clause()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/smt/ |
| H A D | smt_internalizer.cpp | 1228 bool context::use_binary_clause_opt(literal l1, literal l2, bool lemma) const { in use_binary_clause_opt()
1235 if (lemma && relevancy_lvl() >= 2) in use_binary_clause_opt()
1239 if (!lemma && m_scope_lvl > 0) in use_binary_clause_opt()
1387 bool lemma = is_lemma(k); in mk_clause() local
1404 if (use_binary_clause_opt(lits[0], lits[1], lemma)) { in mk_clause()
1421 unsigned iscope_lvl = lemma ? get_max_iscope_lvl(num_lits, lits) : 0; in mk_clause()
1423 bool save_atoms = lemma && iscope_lvl > m_base_lvl; in mk_clause()
1425 SASSERT(!lemma || j == 0 || !j->in_region()); in mk_clause()
1428 if (lemma) { in mk_clause()
|
| /dports/mail/nextcloud-mail/mail/vendor/rubix/ml/docs/transformers/ |
| H A D | sparse-random-projector.md | 24 …ed to satisfy a *max distortion* constraint with *n* samples using the Johnson-Lindenstrauss lemma:
|
| /dports/textproc/artha/artha-1.0.3/src/ |
| H A D | wni.h | 122 gchar *lemma; // searched term to which these definitions correspond to member
|
| /dports/textproc/apertium/apertium-3.6.1/apertium/ |
| H A D | postchunk.rnc | 291 # the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
292 # (lemma queue) and 'whole' (referring to the whole lexical form).
327 # the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
328 # (lemma queue) and 'whole' (referring to the whole lexical form).
|
| /dports/math/fricas/fricas-1.3.7/src/algebra/ |
| H A D | pseudolin.spad | 89 -- expand companionblock by lemma 5
109 -- apply lemma 6
119 -- expand companionblock by lemma 8
|