/dports/math/z3/z3-z3-4.8.13/src/muz/spacer/ |
H A D | spacer_generalizers.cpp | 39 cube.append(lemma->get_cube()); in operator ()() 40 ENSURE(lemma->get_pob()->pt().check_inductive(lemma->level(), in operator ()() 76 cube.append(lemma->get_cube()); in operator ()() 138 lemma->update_cube(lemma->get_pob(), cube); in operator ()() 140 lemma->set_level(uses_level); in operator ()() 165 VERIFY(pt.is_invariant(lemma->level(), lemma.get(), uses_level, &core)); in operator ()() 174 lemma->update_cube(lemma->get_pob(), core); in operator ()() 236 core.append (lemma->get_cube()); in operator ()() 303 if (pt.check_inductive(lemma->level(), lits, uses_level1, lemma->weakness())) { in operator ()() 305 lemma->update_cube(lemma->get_pob(), lits); in operator ()() [all …]
|
H A D | spacer_arith_generalizers.cpp | 86 void limit_num_generalizer::operator()(lemma_ref &lemma) { in operator ()() argument 87 if (lemma->get_cube().empty()) return; in operator ()() 93 pred_transformer &pt = lemma->get_pob()->pt(); in operator ()() 100 SASSERT(lemma->has_pob()); in operator ()() 101 sol->assert_expr(lemma->get_pob()->post()); in operator ()() 102 unsigned weakness = lemma->weakness(); in operator ()() 107 cube.append(lemma->get_cube()); in operator ()() 124 << lemma->get_cube() in operator ()() 135 << lemma->get_cube() << "\n\nto\n" in operator ()() 137 lemma->update_cube(lemma->get_pob(), cube); in operator ()() [all …]
|
H A D | spacer_generalizers.h | 33 void operator()(lemma_ref &lemma) override; 63 void operator()(lemma_ref &lemma) override; 87 void operator()(lemma_ref &lemma) override; 100 void operator()(lemma_ref &lemma) override; 107 void operator()(lemma_ref &lemma) override; 134 void operator()(lemma_ref &lemma) override; 140 bool generalize(lemma_ref &lemma, app *term); 145 void mk_abs_cube(lemma_ref &lemma, app *term, var *var, 179 void operator()(lemma_ref &lemma) override;
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/muz/spacer/ |
H A D | spacer_generalizers.cpp | 39 cube.append(lemma->get_cube()); in operator ()() 40 ENSURE(lemma->get_pob()->pt().check_inductive(lemma->level(), in operator ()() 76 cube.append(lemma->get_cube()); in operator ()() 138 lemma->update_cube(lemma->get_pob(), cube); in operator ()() 140 lemma->set_level(uses_level); in operator ()() 165 VERIFY(pt.is_invariant(lemma->level(), lemma.get(), uses_level, &core)); in operator ()() 174 lemma->update_cube(lemma->get_pob(), core); in operator ()() 236 core.append (lemma->get_cube()); in operator ()() 303 if (pt.check_inductive(lemma->level(), lits, uses_level1, lemma->weakness())) { in operator ()() 305 lemma->update_cube(lemma->get_pob(), lits); in operator ()() [all …]
|
H A D | spacer_arith_generalizers.cpp | 86 void limit_num_generalizer::operator()(lemma_ref &lemma) { in operator ()() argument 87 if (lemma->get_cube().empty()) return; in operator ()() 93 pred_transformer &pt = lemma->get_pob()->pt(); in operator ()() 100 SASSERT(lemma->has_pob()); in operator ()() 101 sol->assert_expr(lemma->get_pob()->post()); in operator ()() 102 unsigned weakness = lemma->weakness(); in operator ()() 107 cube.append(lemma->get_cube()); in operator ()() 124 << lemma->get_cube() in operator ()() 135 << lemma->get_cube() << "\n\nto\n" in operator ()() 137 lemma->update_cube(lemma->get_pob(), cube); in operator ()() [all …]
|
H A D | spacer_generalizers.h | 33 void operator()(lemma_ref &lemma) override; in sata_reset() 63 void operator()(lemma_ref &lemma) override; in sata_reset() 87 void operator()(lemma_ref &lemma) override; in sata_reset() 100 void operator()(lemma_ref &lemma) override; in sata_reset() 107 void operator()(lemma_ref &lemma) override; in sata_reset() 134 void operator()(lemma_ref &lemma) override; in sata_reset() 140 bool generalize(lemma_ref &lemma, app *term); in sata_reset() 145 void mk_abs_cube(lemma_ref &lemma, app *term, var *var, in sata_reset() 179 void operator()(lemma_ref &lemma) override; in sata_reset()
|
/dports/math/z3/z3-z3-4.8.13/src/math/lp/ |
H A D | nla_basics_lemmas.cpp | 158 lemma &= m; in generate_sign_lemma() 159 lemma &= n; in generate_sign_lemma() 236 lemma &= rm; in basic_lemma_for_mon_zero() 237 lemma &= f; in basic_lemma_for_mon_zero() 353 lemma &= rm; in basic_lemma_for_mon_neutral_derived() 354 lemma &= f; in basic_lemma_for_mon_neutral_derived() 442 lemma &= fc; in generate_pl() 474 lemma &= f; in basic_lemma_for_mon_zero_model_based() 566 lemma &= f; in basic_lemma_for_mon_neutral_monic_to_factor_model_based() 657 lemma &= m; in basic_lemma_for_mon_neutral_from_factors_to_monic_model_based() [all …]
|
H A D | nla_order_lemmas.cpp | 175 lemma &= bd; in generate_mon_ol() 176 lemma &= b; in generate_mon_ol() 177 lemma &= d; in generate_mon_ol() 267 lemma &= ac; in generate_ol_eq() 268 lemma &= a; in generate_ol_eq() 269 lemma &= bc; in generate_ol_eq() 270 lemma &= b; in generate_ol_eq() 271 lemma &= c; in generate_ol_eq() 301 lemma &= a; in generate_ol() 303 lemma &= b; in generate_ol() [all …]
|
H A D | monomial_bounds.cpp | 63 lemma &= ex; in propagate_value() 64 lemma |= ineq(v, cmp, upper); in propagate_value() 76 lemma &= ex; in propagate_value() 77 lemma |= ineq(v, cmp, lower); in propagate_value() 108 lemma &= ex; in propagate_value() 117 lemma &= ex; in propagate_value() 118 lemma |= ineq(v, le, r); in propagate_value() 125 lemma &= ex; in propagate_value() 126 lemma |= ineq(v, ge, -r); in propagate_value() 139 lemma &= ex; in propagate_value() [all …]
|
H A D | nla_tangent_lemmas.cpp | 64 void explain(new_lemma& lemma) { in explain() argument 66 lemma &= m_m; in explain() 67 lemma &= m_x; in explain() 68 lemma &= m_y; in explain() 90 explain(lemma); in generate_plane() 94 new_lemma lemma(c(), "tangent line 1"); in generate_line1() local 96 lemma |= ineq(m_jx, llc::NE, c().val(m_jx)); in generate_line1() 98 explain(lemma); in generate_line1() 102 new_lemma lemma(c(), "tangent line 2"); in generate_line2() local 103 lemma |= ineq(m_jy, llc::NE, c().val(m_jy)); in generate_line2() [all …]
|
H A D | nla_monotone_lemmas.cpp | 57 new_lemma lemma(c(), "monotonicity > "); in monotonicity_lemma_gt() local 61 lemma |= ineq(j, v.is_neg() ? llc::LT : llc::GT, v); in monotonicity_lemma_gt() 62 lemma |= ineq(j, v.is_neg() ? llc::GT : llc::LT, 0); in monotonicity_lemma_gt() 65 lemma |= ineq(m.var(), product.is_neg() ? llc::GE : llc::LE, product); in monotonicity_lemma_gt() 79 new_lemma lemma(c(), "monotonicity <"); in monotonicity_lemma_lt() local 83 lemma |= ineq(j, v.is_neg() ? llc::GT : llc::LT, v); in monotonicity_lemma_lt() 86 lemma |= ineq(m.var(), product.is_neg() ? llc::LE : llc::GE, product); in monotonicity_lemma_lt()
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/lp/ |
H A D | nla_basics_lemmas.cpp | 158 lemma &= m; in generate_sign_lemma() 159 lemma &= n; in generate_sign_lemma() 236 lemma &= rm; in basic_lemma_for_mon_zero() 237 lemma &= f; in basic_lemma_for_mon_zero() 353 lemma &= rm; in basic_lemma_for_mon_neutral_derived() 354 lemma &= f; in basic_lemma_for_mon_neutral_derived() 442 lemma &= fc; in generate_pl() 474 lemma &= f; in basic_lemma_for_mon_zero_model_based() 566 lemma &= f; in basic_lemma_for_mon_neutral_monic_to_factor_model_based() 657 lemma &= m; in basic_lemma_for_mon_neutral_from_factors_to_monic_model_based() [all …]
|
H A D | nla_order_lemmas.cpp | 175 lemma &= bd; in generate_mon_ol() 176 lemma &= b; in generate_mon_ol() 177 lemma &= d; in generate_mon_ol() 267 lemma &= ac; in generate_ol_eq() 268 lemma &= a; in generate_ol_eq() 269 lemma &= bc; in generate_ol_eq() 270 lemma &= b; in generate_ol_eq() 271 lemma &= c; in generate_ol_eq() 301 lemma &= a; in generate_ol() 303 lemma &= b; in generate_ol() [all …]
|
H A D | monomial_bounds.cpp | 56 lemma &= ex; in delete_hw_instance_data() 57 lemma |= ineq(v, cmp, upper); in delete_hw_instance_data() 67 lemma &= ex; in delete_hw_instance_data() 68 lemma |= ineq(v, cmp, lower); in delete_hw_instance_data() 99 lemma &= ex; in hw_instance_delete() 108 lemma &= ex; in hw_instance_delete() 109 lemma |= ineq(v, le, r); in hw_instance_delete() 116 lemma &= ex; in hw_instance_delete() 117 lemma |= ineq(v, ge, -r); in hw_instance_delete() 130 lemma &= ex; in hw_instance_delete() [all …]
|
H A D | nla_tangent_lemmas.cpp | 64 void explain(new_lemma& lemma) { in explain() argument 66 lemma &= m_m; in explain() 67 lemma &= m_x; in explain() 68 lemma &= m_y; in explain() 90 explain(lemma); in generate_plane() 94 new_lemma lemma(c(), "tangent line 1"); in generate_line1() local 96 lemma |= ineq(m_jx, llc::NE, c().val(m_jx)); in generate_line1() 98 explain(lemma); in generate_line1() 102 new_lemma lemma(c(), "tangent line 2"); in generate_line2() local 103 lemma |= ineq(m_jy, llc::NE, c().val(m_jy)); in generate_line2() [all …]
|
H A D | nla_monotone_lemmas.cpp | 57 new_lemma lemma(c(), "monotonicity > "); in monotonicity_lemma_gt() local 61 lemma |= ineq(j, v.is_neg() ? llc::LT : llc::GT, v); in monotonicity_lemma_gt() 62 lemma |= ineq(j, v.is_neg() ? llc::GT : llc::LT, 0); in monotonicity_lemma_gt() 65 lemma |= ineq(m.var(), product.is_neg() ? llc::GE : llc::LE, product); in monotonicity_lemma_gt() 79 new_lemma lemma(c(), "monotonicity <"); in monotonicity_lemma_lt() local 83 lemma |= ineq(j, v.is_neg() ? llc::GT : llc::LT, v); in monotonicity_lemma_lt() 86 lemma |= ineq(m.var(), product.is_neg() ? llc::LE : llc::GE, product); in monotonicity_lemma_lt()
|
/dports/textproc/py-pygments/Pygments-2.7.2/tests/examplefiles/ |
H A D | example.thy | 56 lemma power_commutes: 60 lemma power_Suc2: 64 lemma power_add: 68 lemma power_mult: 78 lemma power_even_eq: 82 lemma power_odd_eq: 137 lemma of_nat_power: 196 lemma power_minus: 316 lemma power_mono: 339 lemma power_gt1: [all …]
|
/dports/textproc/py-pygments-25/Pygments-2.5.2/tests/examplefiles/ |
H A D | example.thy | 56 lemma power_commutes: 60 lemma power_Suc2: 64 lemma power_add: 68 lemma power_mult: 78 lemma power_even_eq: 82 lemma power_odd_eq: 137 lemma of_nat_power: 196 lemma power_minus: 316 lemma power_mono: 339 lemma power_gt1: [all …]
|
/dports/textproc/zorba/zorba-2.7.0/scripts/ |
H A D | zt-wn-compile | 137 my $lemma = shift; 138 $lemma =~ s/[_-]/ /g; 139 $lemma =~ s/\([^)]+\)//g; 140 return lc( $lemma ); 230 my $lemma = fix_lemma( shift( @rest ) ); 231 die "$ME: \"$lemma\": lemma not found\n" unless exists $index{ $lemma }; 279 $lemma = fix_lemma( $lemma ); 280 next if $seen_lemma{ $lemma }; 281 $seen_lemma{ $lemma } = 1; 328 for my $lemma ( @lemmas ) { [all …]
|
/dports/textproc/py-nltk/nltk-3.4.1/nltk/corpus/reader/ |
H A D | wordnet.py | 1296 return lemma 1321 return lemma 1487 lemma._frame_strings.append(frame_string_fmt % lemma._name) 1503 lemma._name, 1553 if not lemma: 1578 lemma = lemma.lower() 1607 lemma = lemma.lower() 1639 lemma 1645 lemma = [] 1651 lemma = list(set(lemma)) [all …]
|
/dports/math/z3/z3-z3-4.8.13/src/test/lp/ |
H A D | nla_solver_test.cpp | 182 vector<lemma> lv; in test_basic_lemma_for_mon_neutral_from_factors_to_monomial_0() 253 vector<lemma> lemma; in test_basic_lemma_for_mon_neutral_from_factors_to_monomial_1() local 263 SASSERT(lemma[0].size() == 4); in test_basic_lemma_for_mon_neutral_from_factors_to_monomial_1() 279 for (const auto& k : lemma[0].ineqs()){ in test_basic_lemma_for_mon_neutral_from_factors_to_monomial_1() 333 vector<lemma> lemma; in test_basic_lemma_for_mon_zero_from_factors_to_monomial() local 349 SASSERT(lemma.size() == 1 && lemma[0].size() == 2); in test_basic_lemma_for_mon_zero_from_factors_to_monomial() 392 vector<lemma> lemma; in test_basic_lemma_for_mon_zero_from_monomial_to_factors() local 455 vector<lemma> lemma; in test_basic_lemma_for_mon_neutral_from_monomial_to_factors() local 587 vector<lemma> lemmas; in test_basic_sign_lemma() 824 vector<lemma> lemma; in test_tangent_lemma_rat() local [all …]
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/test/lp/ |
H A D | nla_solver_test.cpp | 182 vector<lemma> lv; 253 vector<lemma> lemma; 263 SASSERT(lemma[0].size() == 4); 279 for (const auto& k : lemma[0].ineqs()){ 333 vector<lemma> lemma; 349 SASSERT(lemma.size() == 1 && lemma[0].size() == 2); 392 vector<lemma> lemma; 455 vector<lemma> lemma; 587 vector<lemma> lemmas; 824 vector<lemma> lemma; [all …]
|
/dports/www/orangehrm/orangehrm-4.9/symfony/lib/vendor/google/apiclient-services/src/Google/Service/CloudNaturalLanguageAPI/ |
H A D | Token.php | 22 public $lemma; variable in Google_Service_CloudNaturalLanguageAPI_Token 36 public function setLemma($lemma) argument 38 $this->lemma = $lemma; 42 return $this->lemma;
|
/dports/www/owncloud/owncloud/apps/files_external/3rdparty/google/apiclient-services/src/Google/Service/CloudNaturalLanguageAPI/ |
H A D | Token.php | 22 public $lemma; variable in Google_Service_CloudNaturalLanguageAPI_Token 36 public function setLemma($lemma) argument 38 $this->lemma = $lemma; 42 return $this->lemma;
|
/dports/www/owncloud/owncloud/apps/files_external/3rdparty/google/apiclient-services/src/Google/Service/CloudNaturalLanguage/ |
H A D | Token.php | 22 public $lemma; variable in Google_Service_CloudNaturalLanguage_Token 42 public function setLemma($lemma) argument 44 $this->lemma = $lemma; 48 return $this->lemma;
|