projects / cvc5.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
On-demand upper bound lemmas for deltas in quantified LRA (for casc). Force no macros...
[cvc5.git] / src / theory / quantifiers / conjecture_generator.cpp
1 /********************* */
2 /*! \file conjecture_generator.cpp
3 ** \verbatim
4 ** Original author: Andrew Reynolds
5 ** Major contributors: none
6 ** Minor contributors (to current version): none
7 ** This file is part of the CVC4 project.
8 ** Copyright (c) 2009-2014 New York University and The University of Iowa
9 ** See the file COPYING in the top-level source directory for licensing
10 ** information.\endverbatim
11 **
12 ** \brief conjecture generator class
13 **
14 **/
15
16 #include "theory/quantifiers/conjecture_generator.h"
17 #include "theory/theory_engine.h"
18 #include "theory/quantifiers/options.h"
19 #include "theory/quantifiers/term_database.h"
20 #include "theory/quantifiers/trigger.h"
21 #include "theory/quantifiers/first_order_model.h"
22
23 using namespace CVC4;
24 using namespace CVC4::kind;
25 using namespace CVC4::theory;
26 using namespace CVC4::theory::quantifiers;
27 using namespace std;
28
29 namespace CVC4 {
30
31 struct sortConjectureScore {
32 std::vector< int > d_scores;
33 bool operator() (unsigned i, unsigned j) { return d_scores[i]>d_scores[j]; }
34 };
35
36
37 void OpArgIndex::addTerm( ConjectureGenerator * s, TNode n, unsigned index ){
38 if( index==n.getNumChildren() ){
39 Assert( n.hasOperator() );
40 if( std::find( d_ops.begin(), d_ops.end(), n.getOperator() )==d_ops.end() ){
41 d_ops.push_back( n.getOperator() );
42 d_op_terms.push_back( n );
43 }
44 }else{
45 d_child[s->getTermDatabase()->d_arg_reps[n][index]].addTerm( s, n, index+1 );
46 }
47 }
48
49 Node OpArgIndex::getGroundTerm( ConjectureGenerator * s, std::vector< TNode >& args ) {
50 if( d_ops.empty() ){
51 for( std::map< TNode, OpArgIndex >::iterator it = d_child.begin(); it != d_child.end(); ++it ){
52 std::map< TNode, Node >::iterator itf = s->d_ground_eqc_map.find( it->first );
53 if( itf!=s->d_ground_eqc_map.end() ){
54 args.push_back( itf->second );
55 Node n = it->second.getGroundTerm( s, args );
56 args.pop_back();
57 if( !n.isNull() ){
58 return n;
59 }
60 }
61 }
62 return Node::null();
63 }else{
64 std::vector< TNode > args2;
65 args2.push_back( d_ops[0] );
66 args2.insert( args2.end(), args.begin(), args.end() );
67 return NodeManager::currentNM()->mkNode( d_op_terms[0].getKind(), args2 );
68 }
69 }
70
71 void OpArgIndex::getGroundTerms( ConjectureGenerator * s, std::vector< TNode >& terms ) {
72 terms.insert( terms.end(), d_op_terms.begin(), d_op_terms.end() );
73 for( std::map< TNode, OpArgIndex >::iterator it = d_child.begin(); it != d_child.end(); ++it ){
74 if( s->isGroundEqc( it->first ) ){
75 it->second.getGroundTerms( s, terms );
76 }
77 }
78 }
79
80
81
82 ConjectureGenerator::ConjectureGenerator( QuantifiersEngine * qe, context::Context* c ) : QuantifiersModule( qe ),
83 d_notify( *this ),
84 d_uequalityEngine(d_notify, c, "ConjectureGenerator::ee", false),
85 d_ee_conjectures( c ){
86 d_fullEffortCount = 0;
87 d_uequalityEngine.addFunctionKind( kind::APPLY_UF );
88 d_uequalityEngine.addFunctionKind( kind::APPLY_CONSTRUCTOR );
89
90 }
91
92 void ConjectureGenerator::eqNotifyNewClass( TNode t ){
93 Trace("thm-ee-debug") << "UEE : new equivalence class " << t << std::endl;
94 d_upendingAdds.push_back( t );
95 }
96
97 void ConjectureGenerator::eqNotifyPreMerge(TNode t1, TNode t2) {
98 //get maintained representatives
99 TNode rt1 = t1;
100 TNode rt2 = t2;
101 std::map< Node, EqcInfo* >::iterator it1 = d_eqc_info.find( t1 );
102 if( it1!=d_eqc_info.end() && !it1->second->d_rep.get().isNull() ){
103 rt1 = it1->second->d_rep.get();
104 }
105 std::map< Node, EqcInfo* >::iterator it2 = d_eqc_info.find( t2 );
106 if( it2!=d_eqc_info.end() && !it2->second->d_rep.get().isNull() ){
107 rt2 = it2->second->d_rep.get();
108 }
109 Trace("thm-ee-debug") << "UEE : equality holds : " << t1 << " == " << t2 << std::endl;
110 Trace("thm-ee-debug") << " ureps : " << rt1 << " == " << rt2 << std::endl;
111 Trace("thm-ee-debug") << " relevant : " << d_pattern_is_relevant[rt1] << " " << d_pattern_is_relevant[rt2] << std::endl;
112 Trace("thm-ee-debug") << " normal : " << d_pattern_is_normal[rt1] << " " << d_pattern_is_normal[rt2] << std::endl;
113 Trace("thm-ee-debug") << " size : " << d_pattern_fun_sum[rt1] << " " << d_pattern_fun_sum[rt2] << std::endl;
114
115 if( isUniversalLessThan( rt2, rt1 ) ){
116 EqcInfo * ei;
117 if( it1==d_eqc_info.end() ){
118 ei = getOrMakeEqcInfo( t1, true );
119 }else{
120 ei = it1->second;
121 }
122 ei->d_rep = t2;
123 }
124 }
125
126 void ConjectureGenerator::eqNotifyPostMerge(TNode t1, TNode t2) {
127
128 }
129
130 void ConjectureGenerator::eqNotifyDisequal(TNode t1, TNode t2, TNode reason) {
131 Trace("thm-ee-debug") << "UEE : disequality holds : " << t1 << " != " << t2 << std::endl;
132
133 }
134
135
136 ConjectureGenerator::EqcInfo::EqcInfo( context::Context* c ) : d_rep( c, Node::null() ){
137
138 }
139
140 ConjectureGenerator::EqcInfo* ConjectureGenerator::getOrMakeEqcInfo( TNode n, bool doMake ) {
141 //Assert( getUniversalRepresentative( n )==n );
142 std::map< Node, EqcInfo* >::iterator eqc_i = d_eqc_info.find( n );
143 if( eqc_i!=d_eqc_info.end() ){
144 return eqc_i->second;
145 }else if( doMake ){
146 EqcInfo* ei = new EqcInfo( d_quantEngine->getSatContext() );
147 d_eqc_info[n] = ei;
148 return ei;
149 }else{
150 return NULL;
151 }
152 }
153
154 void ConjectureGenerator::setUniversalRelevant( TNode n ) {
155 //add pattern information
156 registerPattern( n, n.getType() );
157 d_urelevant_terms[n] = true;
158 for( unsigned i=0; i<n.getNumChildren(); i++ ){
159 setUniversalRelevant( n[i] );
160 }
161 }
162
163 bool ConjectureGenerator::isUniversalLessThan( TNode rt1, TNode rt2 ) {
164 //prefer the one that is (normal, smaller) lexographically
165 Assert( d_pattern_is_relevant.find( rt1 )!=d_pattern_is_relevant.end() );
166 Assert( d_pattern_is_relevant.find( rt2 )!=d_pattern_is_relevant.end() );
167 Assert( d_pattern_is_normal.find( rt1 )!=d_pattern_is_normal.end() );
168 Assert( d_pattern_is_normal.find( rt2 )!=d_pattern_is_normal.end() );
169 Assert( d_pattern_fun_sum.find( rt1 )!=d_pattern_fun_sum.end() );
170 Assert( d_pattern_fun_sum.find( rt2 )!=d_pattern_fun_sum.end() );
171
172 if( d_pattern_is_relevant[rt1] && !d_pattern_is_relevant[rt2] ){
173 Trace("thm-ee-debug") << "UEE : LT due to relevant." << std::endl;
174 return true;
175 }else if( d_pattern_is_relevant[rt1]==d_pattern_is_relevant[rt2] ){
176 if( d_pattern_is_normal[rt1] && !d_pattern_is_normal[rt2] ){
177 Trace("thm-ee-debug") << "UEE : LT due to normal." << std::endl;
178 return true;
179 }else if( d_pattern_is_normal[rt1]==d_pattern_is_normal[rt2] ){
180 if( d_pattern_fun_sum[rt1]<d_pattern_fun_sum[rt2] ){
181 Trace("thm-ee-debug") << "UEE : LT due to size." << std::endl;
182 //decide which representative to use : based on size of the term
183 return true;
184 }else if( d_pattern_fun_sum[rt1]==d_pattern_fun_sum[rt2] ){
185 //same size : tie goes to term that has already been reported
186 return isReportedCanon( rt1 ) && !isReportedCanon( rt2 );
187 }
188 }
189 }
190 return false;
191 }
192
193
194 bool ConjectureGenerator::isReportedCanon( TNode n ) {
195 return std::find( d_ue_canon.begin(), d_ue_canon.end(), n )==d_ue_canon.end();
196 }
197
198 void ConjectureGenerator::markReportedCanon( TNode n ) {
199 if( !isReportedCanon( n ) ){
200 d_ue_canon.push_back( n );
201 }
202 }
203
204 bool ConjectureGenerator::areUniversalEqual( TNode n1, TNode n2 ) {
205 return n1==n2 || ( d_uequalityEngine.hasTerm( n1 ) && d_uequalityEngine.hasTerm( n2 ) && d_uequalityEngine.areEqual( n1, n2 ) );
206 }
207
208 bool ConjectureGenerator::areUniversalDisequal( TNode n1, TNode n2 ) {
209 return n1!=n2 && d_uequalityEngine.hasTerm( n1 ) && d_uequalityEngine.hasTerm( n2 ) && d_uequalityEngine.areDisequal( n1, n2, false );
210 }
211
212 TNode ConjectureGenerator::getUniversalRepresentative( TNode n, bool add ) {
213 if( add ){
214 if( d_urelevant_terms.find( n )==d_urelevant_terms.end() ){
215 setUniversalRelevant( n );
216 //add term to universal equality engine
217 d_uequalityEngine.addTerm( n );
218 // addding this term to equality engine will lead to a set of new terms (the new subterms of n)
219 // now, do instantiation-based merging for each of these terms
220 Trace("thm-ee-debug") << "Merge equivalence classes based on instantiations of terms..." << std::endl;
221 //merge all pending equalities
222 while( !d_upendingAdds.empty() ){
223 Trace("sg-pending") << "Add " << d_upendingAdds.size() << " pending terms..." << std::endl;
224 std::vector< Node > pending;
225 pending.insert( pending.end(), d_upendingAdds.begin(), d_upendingAdds.end() );
226 d_upendingAdds.clear();
227 for( unsigned i=0; i<pending.size(); i++ ){
228 Node t = pending[i];
229 TypeNode tn = t.getType();
230 Trace("thm-ee-add") << "UEE : Add universal term " << t << std::endl;
231 std::vector< Node > eq_terms;
232 //if occurs modulo equality at ground level, it is equivalent to representative of ground equality engine
233 TNode gt = getTermDatabase()->evaluateTerm( t );
234 if( !gt.isNull() && gt!=t ){
235 eq_terms.push_back( gt );
236 }
237 //get all equivalent terms based on theorem database
238 d_thm_index.getEquivalentTerms( t, eq_terms );
239 if( !eq_terms.empty() ){
240 Trace("thm-ee-add") << "UEE : Based on ground EE/theorem DB, it is equivalent to " << eq_terms.size() << " terms : " << std::endl;
241 //add equivalent terms as equalities to universal engine
242 for( unsigned i=0; i<eq_terms.size(); i++ ){
243 Trace("thm-ee-add") << " " << eq_terms[i] << std::endl;
244 bool assertEq = false;
245 if( d_urelevant_terms.find( eq_terms[i] )!=d_urelevant_terms.end() ){
246 assertEq = true;
247 }else{
248 Assert( eq_terms[i].getType()==tn );
249 registerPattern( eq_terms[i], tn );
250 if( isUniversalLessThan( eq_terms[i], t ) || ( options::conjectureUeeIntro() && d_pattern_fun_sum[t]>=d_pattern_fun_sum[eq_terms[i]] ) ){
251 setUniversalRelevant( eq_terms[i] );
252 assertEq = true;
253 }
254 }
255 if( assertEq ){
256 Node exp;
257 d_uequalityEngine.assertEquality( t.eqNode( eq_terms[i] ), true, exp );
258 }else{
259 Trace("thm-ee-no-add") << "Do not add : " << t << " == " << eq_terms[i] << std::endl;
260 }
261 }
262 }else{
263 Trace("thm-ee-add") << "UEE : No equivalent terms." << std::endl;
264 }
265 }
266 }
267 }
268 }
269
270 if( d_uequalityEngine.hasTerm( n ) ){
271 Node r = d_uequalityEngine.getRepresentative( n );
272 EqcInfo * ei = getOrMakeEqcInfo( r );
273 if( ei && !ei->d_rep.get().isNull() ){
274 return ei->d_rep.get();
275 }else{
276 return r;
277 }
278 }else{
279 return n;
280 }
281 }
282
283 Node ConjectureGenerator::getFreeVar( TypeNode tn, unsigned i ) {
284 return d_quantEngine->getTermDatabase()->getCanonicalFreeVar( tn, i );
285 }
286
287 bool ConjectureGenerator::isHandledTerm( TNode n ){
288 return !n.getAttribute(NoMatchAttribute()) && inst::Trigger::isAtomicTrigger( n ) && ( n.getKind()!=APPLY_UF || n.getOperator().getKind()!=SKOLEM );
289 }
290
291 Node ConjectureGenerator::getGroundEqc( TNode r ) {
292 std::map< TNode, Node >::iterator it = d_ground_eqc_map.find( r );
293 return it!=d_ground_eqc_map.end() ? it->second : Node::null();
294 }
295
296 bool ConjectureGenerator::isGroundEqc( TNode r ) {
297 return d_ground_eqc_map.find( r )!=d_ground_eqc_map.end();
298 }
299
300 bool ConjectureGenerator::isGroundTerm( TNode n ) {
301 return std::find( d_ground_terms.begin(), d_ground_terms.end(), n )!=d_ground_terms.end();
302 }
303
304 bool ConjectureGenerator::needsCheck( Theory::Effort e ) {
305 // synchonized with instantiation engine
306 return d_quantEngine->getInstWhenNeedsCheck( e );
307 }
308
309 bool ConjectureGenerator::hasEnumeratedUf( Node n ) {
310 if( options::conjectureGenGtEnum()>0 ){
311 std::map< Node, bool >::iterator it = d_uf_enum.find( n.getOperator() );
312 if( it==d_uf_enum.end() ){
313 d_uf_enum[n.getOperator()] = true;
314 std::vector< Node > lem;
315 getEnumeratePredUfTerm( n, options::conjectureGenGtEnum(), lem );
316 if( !lem.empty() ){
317 for( unsigned j=0; j<lem.size(); j++ ){
318 d_quantEngine->addLemma( lem[j], false );
319 d_hasAddedLemma = true;
320 }
321 return false;
322 }
323 }
324 }
325 return true;
326 }
327
328 void ConjectureGenerator::reset_round( Theory::Effort e ) {
329
330 }
331
332 void ConjectureGenerator::check( Theory::Effort e, unsigned quant_e ) {
333 if( quant_e==QuantifiersEngine::QEFFORT_STANDARD ){
334 d_fullEffortCount++;
335 if( d_fullEffortCount%optFullCheckFrequency()==0 ){
336 d_hasAddedLemma = false;
337 d_tge.d_cg = this;
338 double clSet = 0;
339 if( Trace.isOn("sg-engine") ){
340 clSet = double(clock())/double(CLOCKS_PER_SEC);
341 Trace("sg-engine") << "---Conjecture Engine Round, effort = " << e << "---" << std::endl;
342 }
343 eq::EqualityEngine * ee = getEqualityEngine();
344 d_conj_count = 0;
345
346 Trace("sg-proc") << "Get eq classes..." << std::endl;
347 d_op_arg_index.clear();
348 d_ground_eqc_map.clear();
349 d_bool_eqc[0] = Node::null();
350 d_bool_eqc[1] = Node::null();
351 std::vector< TNode > eqcs;
352 d_em.clear();
353 eq::EqClassesIterator eqcs_i = eq::EqClassesIterator( ee );
354 while( !eqcs_i.isFinished() ){
355 TNode r = (*eqcs_i);
356 eqcs.push_back( r );
357 if( r.getType().isBoolean() ){
358 if( areEqual( r, getTermDatabase()->d_true ) ){
359 d_ground_eqc_map[r] = getTermDatabase()->d_true;
360 d_bool_eqc[0] = r;
361 }else if( areEqual( r, getTermDatabase()->d_false ) ){
362 d_ground_eqc_map[r] = getTermDatabase()->d_false;
363 d_bool_eqc[1] = r;
364 }
365 }
366 d_em[r] = eqcs.size();
367 eq::EqClassIterator ieqc_i = eq::EqClassIterator( r, ee );
368 while( !ieqc_i.isFinished() ){
369 TNode n = (*ieqc_i);
370 if( getTermDatabase()->hasTermCurrent( n ) ){
371 if( isHandledTerm( n ) ){
372 d_op_arg_index[r].addTerm( this, n );
373 }
374 }
375 ++ieqc_i;
376 }
377 ++eqcs_i;
378 }
379 Assert( !d_bool_eqc[0].isNull() );
380 Assert( !d_bool_eqc[1].isNull() );
381 d_urelevant_terms.clear();
382 Trace("sg-proc") << "...done get eq classes" << std::endl;
383
384 Trace("sg-proc") << "Determine ground EQC..." << std::endl;
385 bool success;
386 do{
387 success = false;
388 for( unsigned i=0; i<eqcs.size(); i++ ){
389 TNode r = eqcs[i];
390 if( d_ground_eqc_map.find( r )==d_ground_eqc_map.end() ){
391 std::vector< TNode > args;
392 Trace("sg-pat-debug") << "******* Get ground term for " << r << std::endl;
393 Node n;
394 if( getTermDatabase()->isInductionTerm( r ) ){
395 n = d_op_arg_index[r].getGroundTerm( this, args );
396 }else{
397 n = r;
398 }
399 if( !n.isNull() ){
400 Trace("sg-pat") << "Ground term for eqc " << r << " : " << std::endl;
401 Trace("sg-pat") << " " << n << std::endl;
402 d_ground_eqc_map[r] = n;
403 success = true;
404 }else{
405 Trace("sg-pat-debug") << "...could not find ground term." << std::endl;
406 }
407 }
408 }
409 }while( success );
410 //also get ground terms
411 d_ground_terms.clear();
412 for( unsigned i=0; i<eqcs.size(); i++ ){
413 TNode r = eqcs[i];
414 d_op_arg_index[r].getGroundTerms( this, d_ground_terms );
415 }
416 Trace("sg-proc") << "...done determine ground EQC" << std::endl;
417
418 //debug printing
419 if( Trace.isOn("sg-gen-eqc") ){
420 for( unsigned i=0; i<eqcs.size(); i++ ){
421 TNode r = eqcs[i];
422 //print out members
423 bool firstTime = true;
424 bool isFalse = areEqual( r, getTermDatabase()->d_false );
425 eq::EqClassIterator eqc_i = eq::EqClassIterator( r, ee );
426 while( !eqc_i.isFinished() ){
427 TNode n = (*eqc_i);
428 if( getTermDatabase()->hasTermCurrent( n ) && !n.getAttribute(NoMatchAttribute()) && ( n.getKind()!=EQUAL || isFalse ) ){
429 if( firstTime ){
430 Trace("sg-gen-eqc") << "e" << d_em[r] << " : { " << std::endl;
431 firstTime = false;
432 }
433 if( n.hasOperator() ){
434 Trace("sg-gen-eqc") << " (" << n.getOperator();
435 getTermDatabase()->computeArgReps( n );
436 for( unsigned i=0; i<getTermDatabase()->d_arg_reps[n].size(); i++ ){
437 Trace("sg-gen-eqc") << " e" << d_em[getTermDatabase()->d_arg_reps[n][i]];
438 }
439 Trace("sg-gen-eqc") << ") :: " << n << std::endl;
440 }else{
441 Trace("sg-gen-eqc") << " " << n << std::endl;
442 }
443 }
444 ++eqc_i;
445 }
446 if( !firstTime ){
447 Trace("sg-gen-eqc") << "}" << std::endl;
448 //print out ground term
449 std::map< TNode, Node >::iterator it = d_ground_eqc_map.find( r );
450 if( it!=d_ground_eqc_map.end() ){
451 Trace("sg-gen-eqc") << "- Ground term : " << it->second << std::endl;
452 }
453 }
454 }
455 }
456
457 Trace("sg-proc") << "Compute relevant eqc..." << std::endl;
458 d_tge.d_relevant_eqc[0].clear();
459 d_tge.d_relevant_eqc[1].clear();
460 for( unsigned i=0; i<eqcs.size(); i++ ){
461 TNode r = eqcs[i];
462 std::map< TNode, Node >::iterator it = d_ground_eqc_map.find( r );
463 unsigned index = 1;
464 if( it==d_ground_eqc_map.end() ){
465 index = 0;
466 }
467 //based on unproven conjectures? TODO
468 d_tge.d_relevant_eqc[index].push_back( r );
469 }
470 Trace("sg-gen-tg-debug") << "Initial relevant eqc : ";
471 for( unsigned i=0; i<d_tge.d_relevant_eqc[0].size(); i++ ){
472 Trace("sg-gen-tg-debug") << "e" << d_em[d_tge.d_relevant_eqc[0][i]] << " ";
473 }
474 Trace("sg-gen-tg-debug") << std::endl;
475 Trace("sg-proc") << "...done compute relevant eqc" << std::endl;
476
477
478 Trace("sg-proc") << "Collect signature information..." << std::endl;
479 d_tge.collectSignatureInformation();
480 if( d_hasAddedLemma ){
481 Trace("sg-proc") << "...added enumeration lemmas." << std::endl;
482 }
483 Trace("sg-proc") << "...done collect signature information" << std::endl;
484
485
486
487 Trace("sg-proc") << "Build theorem index..." << std::endl;
488 d_ue_canon.clear();
489 d_thm_index.clear();
490 std::vector< Node > provenConj;
491 quantifiers::FirstOrderModel* m = d_quantEngine->getModel();
492 for( int i=0; i<m->getNumAssertedQuantifiers(); i++ ){
493 Node q = m->getAssertedQuantifier( i );
494 Trace("thm-db-debug") << "Is " << q << " a relevant theorem?" << std::endl;
495 Node conjEq;
496 if( q[1].getKind()==EQUAL ){
497 bool isSubsume = false;
498 bool inEe = false;
499 for( unsigned r=0; r<2; r++ ){
500 TNode nl = q[1][r==0 ? 0 : 1];
501 TNode nr = q[1][r==0 ? 1 : 0];
502 Node eq = nl.eqNode( nr );
503 if( r==1 || std::find( d_conjectures.begin(), d_conjectures.end(), q )==d_conjectures.end() ){
504 //check if it contains only relevant functions
505 if( d_tge.isRelevantTerm( eq ) ){
506 //make it canonical
507 Trace("sg-proc-debug") << "get canonical " << eq << std::endl;
508 eq = d_quantEngine->getTermDatabase()->getCanonicalTerm( eq );
509 }else{
510 eq = Node::null();
511 }
512 }
513 if( !eq.isNull() ){
514 if( r==0 ){
515 inEe = d_ee_conjectures.find( q[1] )!=d_ee_conjectures.end();
516 if( !inEe ){
517 //add to universal equality engine
518 Node nl = getUniversalRepresentative( eq[0], true );
519 Node nr = getUniversalRepresentative( eq[1], true );
520 if( areUniversalEqual( nl, nr ) ){
521 isSubsume = true;
522 //set inactive (will be ignored by other modules)
523 d_quantEngine->getModel()->setQuantifierActive( q, false );
524 }else{
525 Node exp;
526 d_ee_conjectures[q[1]] = true;
527 d_uequalityEngine.assertEquality( nl.eqNode( nr ), true, exp );
528 }
529 }
530 Trace("sg-conjecture") << "*** CONJECTURE : currently proven" << (isSubsume ? " and subsumed" : "");
531 Trace("sg-conjecture") << " : " << q[1] << std::endl;
532 provenConj.push_back( q );
533 }
534 if( !isSubsume ){
535 Trace("thm-db-debug") << "Adding theorem to database " << eq[0] << " == " << eq[1] << std::endl;
536 d_thm_index.addTheorem( eq[0], eq[1] );
537 }else{
538 break;
539 }
540 }else{
541 break;
542 }
543 }
544 }
545 }
546 //examine status of other conjectures
547 for( unsigned i=0; i<d_conjectures.size(); i++ ){
548 Node q = d_conjectures[i];
549 if( std::find( provenConj.begin(), provenConj.end(), q )==provenConj.end() ){
550 //check each skolem variable
551 bool disproven = true;
552 //std::vector< Node > sk;
553 //getTermDatabase()->getSkolemConstants( q, sk, true );
554 Trace("sg-conjecture") << " CONJECTURE : ";
555 std::vector< Node > ce;
556 for( unsigned j=0; j<getTermDatabase()->d_skolem_constants[q].size(); j++ ){
557 TNode k = getTermDatabase()->d_skolem_constants[q][j];
558 TNode rk = getRepresentative( k );
559 std::map< TNode, Node >::iterator git = d_ground_eqc_map.find( rk );
560 //check if it is a ground term
561 if( git==d_ground_eqc_map.end() ){
562 Trace("sg-conjecture") << "ACTIVE : " << q;
563 if( Trace.isOn("sg-gen-eqc") ){
564 Trace("sg-conjecture") << " { ";
565 for( unsigned k=0; k<getTermDatabase()->d_skolem_constants[q].size(); k++ ){ Trace("sg-conjecture") << getTermDatabase()->d_skolem_constants[q][k] << ( j==k ? "*" : "" ) << " "; }
566 Trace("sg-conjecture") << "}";
567 }
568 Trace("sg-conjecture") << std::endl;
569 disproven = false;
570 break;
571 }else{
572 ce.push_back( git->second );
573 }
574 }
575 if( disproven ){
576 Trace("sg-conjecture") << "disproven : " << q << " : ";
577 for( unsigned i=0; i<ce.size(); i++ ){
578 Trace("sg-conjecture") << q[0][i] << " -> " << ce[i] << " ";
579 }
580 Trace("sg-conjecture") << std::endl;
581 }
582 }
583 }
584 Trace("thm-db") << "Theorem database is : " << std::endl;
585 d_thm_index.debugPrint( "thm-db" );
586 Trace("thm-db") << std::endl;
587 Trace("sg-proc") << "...done build theorem index" << std::endl;
588
589
590 //clear patterns
591 d_patterns.clear();
592 d_pattern_var_id.clear();
593 d_pattern_var_duplicate.clear();
594 d_pattern_is_normal.clear();
595 d_pattern_is_relevant.clear();
596 d_pattern_fun_id.clear();
597 d_pattern_fun_sum.clear();
598 d_rel_patterns.clear();
599 d_rel_pattern_var_sum.clear();
600 d_rel_pattern_typ_index.clear();
601 d_rel_pattern_subs_index.clear();
602
603 unsigned rel_term_count = 0;
604 std::map< TypeNode, unsigned > rt_var_max;
605 std::vector< TypeNode > rt_types;
606 std::map< TypeNode, std::map< int, std::vector< Node > > > conj_lhs;
607 unsigned addedLemmas = 0;
608 for( unsigned depth=1; depth<=3; depth++ ){
609 Trace("sg-proc") << "Generate relevant LHS at depth " << depth << "..." << std::endl;
610 Trace("sg-rel-term") << "Relevant terms of depth " << depth << " : " << std::endl;
611 //set up environment
612 d_tge.d_var_id.clear();
613 d_tge.d_var_limit.clear();
614 d_tge.reset( depth, true, TypeNode::null() );
615 while( d_tge.getNextTerm() ){
616 //construct term
617 Node nn = d_tge.getTerm();
618 if( !options::conjectureFilterCanonical() || considerTermCanon( nn, true ) ){
619 rel_term_count++;
620 Trace("sg-rel-term") << "*** Relevant term : ";
621 d_tge.debugPrint( "sg-rel-term", "sg-rel-term-debug2" );
622 Trace("sg-rel-term") << std::endl;
623
624 for( unsigned r=0; r<2; r++ ){
625 Trace("sg-rel-term-debug") << "...from equivalence classes (" << r << ") : ";
626 int index = d_tge.d_ccand_eqc[r].size()-1;
627 for( unsigned j=0; j<d_tge.d_ccand_eqc[r][index].size(); j++ ){
628 Trace("sg-rel-term-debug") << "e" << d_em[d_tge.d_ccand_eqc[r][index][j]] << " ";
629 }
630 Trace("sg-rel-term-debug") << std::endl;
631 }
632 TypeNode tnn = nn.getType();
633 Trace("sg-gen-tg-debug") << "...term is " << nn << std::endl;
634 conj_lhs[tnn][depth].push_back( nn );
635
636 //add information about pattern
637 Trace("sg-gen-tg-debug") << "Collect pattern information..." << std::endl;
638 Assert( std::find( d_rel_patterns[tnn].begin(), d_rel_patterns[tnn].end(), nn )==d_rel_patterns[tnn].end() );
639 d_rel_patterns[tnn].push_back( nn );
640 //build information concerning the variables in this pattern
641 unsigned sum = 0;
642 std::map< TypeNode, unsigned > typ_to_subs_index;
643 std::vector< TNode > gsubs_vars;
644 for( std::map< TypeNode, unsigned >::iterator it = d_tge.d_var_id.begin(); it != d_tge.d_var_id.end(); ++it ){
645 if( it->second>0 ){
646 typ_to_subs_index[it->first] = sum;
647 sum += it->second;
648 for( unsigned i=0; i<it->second; i++ ){
649 gsubs_vars.push_back( d_quantEngine->getTermDatabase()->getCanonicalFreeVar( it->first, i ) );
650 }
651 }
652 }
653 d_rel_pattern_var_sum[nn] = sum;
654 //register the pattern
655 registerPattern( nn, tnn );
656 Assert( d_pattern_is_normal[nn] );
657 Trace("sg-gen-tg-debug") << "...done collect pattern information" << std::endl;
658
659 //record information about types
660 Trace("sg-gen-tg-debug") << "Collect type information..." << std::endl;
661 PatternTypIndex * pti = &d_rel_pattern_typ_index;
662 for( std::map< TypeNode, unsigned >::iterator it = d_tge.d_var_id.begin(); it != d_tge.d_var_id.end(); ++it ){
663 pti = &pti->d_children[it->first][it->second];
664 //record maximum
665 if( rt_var_max.find( it->first )==rt_var_max.end() || it->second>rt_var_max[it->first] ){
666 rt_var_max[it->first] = it->second;
667 }
668 }
669 if( std::find( rt_types.begin(), rt_types.end(), tnn )==rt_types.end() ){
670 rt_types.push_back( tnn );
671 }
672 pti->d_terms.push_back( nn );
673 Trace("sg-gen-tg-debug") << "...done collect type information" << std::endl;
674
675 Trace("sg-gen-tg-debug") << "Build substitutions for ground EQC..." << std::endl;
676 std::vector< TNode > gsubs_terms;
677 gsubs_terms.resize( gsubs_vars.size() );
678 int index = d_tge.d_ccand_eqc[1].size()-1;
679 for( unsigned j=0; j<d_tge.d_ccand_eqc[1][index].size(); j++ ){
680 TNode r = d_tge.d_ccand_eqc[1][index][j];
681 Trace("sg-rel-term-debug") << " Matches for e" << d_em[r] << ", which is ground term " << d_ground_eqc_map[r] << ":" << std::endl;
682 std::map< TypeNode, std::map< unsigned, TNode > > subs;
683 std::map< TNode, bool > rev_subs;
684 //only get ground terms
685 unsigned mode = 2;
686 d_tge.resetMatching( r, mode );
687 while( d_tge.getNextMatch( r, subs, rev_subs ) ){
688 //we will be building substitutions
689 bool firstTime = true;
690 for( std::map< TypeNode, std::map< unsigned, TNode > >::iterator it = subs.begin(); it != subs.end(); ++it ){
691 unsigned tindex = typ_to_subs_index[it->first];
692 for( std::map< unsigned, TNode >::iterator it2 = it->second.begin(); it2 != it->second.end(); ++it2 ){
693 if( !firstTime ){
694 Trace("sg-rel-term-debug") << ", ";
695 }else{
696 firstTime = false;
697 Trace("sg-rel-term-debug") << " ";
698 }
699 Trace("sg-rel-term-debug") << it->first << ":x" << it2->first << " -> " << it2->second;
700 Assert( tindex+it2->first<gsubs_terms.size() );
701 gsubs_terms[tindex+it2->first] = it2->second;
702 }
703 }
704 Trace("sg-rel-term-debug") << std::endl;
705 d_rel_pattern_subs_index[nn].addSubstitution( r, gsubs_vars, gsubs_terms );
706 }
707 }
708 Trace("sg-gen-tg-debug") << "...done build substitutions for ground EQC" << std::endl;
709 }else{
710 Trace("sg-gen-tg-debug") << "> not canonical : " << nn << std::endl;
711 }
712 }
713 Trace("sg-proc") << "...done generate terms at depth " << depth << std::endl;
714 Trace("sg-stats") << "--------> Total LHS of depth " << depth << " : " << rel_term_count << std::endl;
715 //Trace("conjecture-count") << "Total LHS of depth " << depth << " : " << conj_lhs[depth].size() << std::endl;
716
717 /* test...
718 for( unsigned i=0; i<rt_types.size(); i++ ){
719 Trace("sg-term-enum") << "Term enumeration for " << rt_types[i] << " : " << std::endl;
720 Trace("sg-term-enum") << "Ground term : " << rt_types[i].mkGroundTerm() << std::endl;
721 for( unsigned j=0; j<150; j++ ){
722 Trace("sg-term-enum") << " " << getEnumerateTerm( rt_types[i], j ) << std::endl;
723 }
724 }
725 */
726
727 //consider types from relevant terms
728 for( unsigned rdepth=0; rdepth<=depth; rdepth++ ){
729 //set up environment
730 d_tge.d_var_id.clear();
731 d_tge.d_var_limit.clear();
732 for( std::map< TypeNode, unsigned >::iterator it = rt_var_max.begin(); it != rt_var_max.end(); ++it ){
733 d_tge.d_var_id[ it->first ] = it->second;
734 d_tge.d_var_limit[ it->first ] = it->second;
735 }
736 std::random_shuffle( rt_types.begin(), rt_types.end() );
737 std::map< TypeNode, std::vector< Node > > conj_rhs;
738 for( unsigned i=0; i<rt_types.size(); i++ ){
739
740 Trace("sg-proc") << "Generate relevant RHS terms of type " << rt_types[i] << " at depth " << rdepth << "..." << std::endl;
741 d_tge.reset( rdepth, false, rt_types[i] );
742
743 while( d_tge.getNextTerm() ){
744 Node rhs = d_tge.getTerm();
745 if( considerTermCanon( rhs, false ) ){
746 Trace("sg-rel-prop") << "Relevant RHS : " << rhs << std::endl;
747 //register pattern
748 Assert( rhs.getType()==rt_types[i] );
749 registerPattern( rhs, rt_types[i] );
750 if( rdepth<depth ){
751 //consider against all LHS at depth
752 for( unsigned j=0; j<conj_lhs[rt_types[i]][depth].size(); j++ ){
753 processCandidateConjecture( conj_lhs[rt_types[i]][depth][j], rhs, depth, rdepth );
754 }
755 }else{
756 conj_rhs[rt_types[i]].push_back( rhs );
757 }
758 }
759 }
760 }
761 flushWaitingConjectures( addedLemmas, depth, rdepth );
762 //consider against all LHS up to depth
763 if( rdepth==depth ){
764 for( unsigned lhs_depth = 1; lhs_depth<=depth; lhs_depth++ ){
765 if( (int)addedLemmas<options::conjectureGenPerRound() ){
766 Trace("sg-proc") << "Consider conjectures at depth (" << lhs_depth << ", " << rdepth << ")..." << std::endl;
767 for( std::map< TypeNode, std::vector< Node > >::iterator it = conj_rhs.begin(); it != conj_rhs.end(); ++it ){
768 for( unsigned j=0; j<it->second.size(); j++ ){
769 for( unsigned k=0; k<conj_lhs[it->first][lhs_depth].size(); k++ ){
770 processCandidateConjecture( conj_lhs[it->first][lhs_depth][k], it->second[j], lhs_depth, rdepth );
771 }
772 }
773 }
774 flushWaitingConjectures( addedLemmas, lhs_depth, depth );
775 }
776 }
777 }
778 if( (int)addedLemmas>=options::conjectureGenPerRound() ){
779 break;
780 }
781 }
782 if( (int)addedLemmas>=options::conjectureGenPerRound() ){
783 break;
784 }
785 }
786 Trace("sg-stats") << "Total conjectures considered : " << d_conj_count << std::endl;
787 if( Trace.isOn("thm-ee") ){
788 Trace("thm-ee") << "Universal equality engine is : " << std::endl;
789 eq::EqClassesIterator ueqcs_i = eq::EqClassesIterator( &d_uequalityEngine );
790 while( !ueqcs_i.isFinished() ){
791 TNode r = (*ueqcs_i);
792 bool firstTime = true;
793 TNode rr = getUniversalRepresentative( r );
794 Trace("thm-ee") << " " << rr;
795 Trace("thm-ee") << " : { ";
796 eq::EqClassIterator ueqc_i = eq::EqClassIterator( r, &d_uequalityEngine );
797 while( !ueqc_i.isFinished() ){
798 TNode n = (*ueqc_i);
799 if( rr!=n ){
800 if( firstTime ){
801 Trace("thm-ee") << std::endl;
802 firstTime = false;
803 }
804 Trace("thm-ee") << " " << n << std::endl;
805 }
806 ++ueqc_i;
807 }
808 if( !firstTime ){ Trace("thm-ee") << " "; }
809 Trace("thm-ee") << "}" << std::endl;
810 ++ueqcs_i;
811 }
812 Trace("thm-ee") << std::endl;
813 }
814 if( Trace.isOn("sg-engine") ){
815 double clSet2 = double(clock())/double(CLOCKS_PER_SEC);
816 Trace("sg-engine") << "Finished conjecture generator, time = " << (clSet2-clSet) << std::endl;
817 }
818 }
819 }
820 }
821
822 unsigned ConjectureGenerator::flushWaitingConjectures( unsigned& addedLemmas, int ldepth, int rdepth ) {
823 if( !d_waiting_conjectures_lhs.empty() ){
824 Trace("sg-proc") << "Generated " << d_waiting_conjectures_lhs.size() << " conjectures at depth " << ldepth << "/" << rdepth << "." << std::endl;
825 if( (int)addedLemmas<options::conjectureGenPerRound() ){
826 /*
827 std::vector< unsigned > indices;
828 for( unsigned i=0; i<d_waiting_conjectures_lhs.size(); i++ ){
829 indices.push_back( i );
830 }
831 bool doSort = false;
832 if( doSort ){
833 //sort them based on score
834 sortConjectureScore scs;
835 scs.d_scores.insert( scs.d_scores.begin(), d_waiting_conjectures_score.begin(), d_waiting_conjectures_score.end() );
836 std::sort( indices.begin(), indices.end(), scs );
837 }
838 //if( doSort && d_waiting_conjectures_score[indices[0]]<optFilterScoreThreshold() ){
839 */
840 unsigned prevCount = d_conj_count;
841 for( unsigned i=0; i<d_waiting_conjectures_lhs.size(); i++ ){
842 if( d_waiting_conjectures_score[i]>=optFilterScoreThreshold() ){
843 //we have determined a relevant subgoal
844 Node lhs = d_waiting_conjectures_lhs[i];
845 Node rhs = d_waiting_conjectures_rhs[i];
846 if( options::conjectureFilterCanonical() && ( getUniversalRepresentative( lhs )!=lhs || getUniversalRepresentative( rhs )!=rhs ) ){
847 //skip
848 }else{
849 Trace("sg-engine") << "*** Consider conjecture : " << lhs << " == " << rhs << std::endl;
850 Trace("sg-engine-debug") << " score : " << d_waiting_conjectures_score[i] << std::endl;
851 if( optStatsOnly() ){
852 d_conj_count++;
853 }else{
854 std::vector< Node > bvs;
855 for( std::map< TypeNode, unsigned >::iterator it = d_pattern_var_id[lhs].begin(); it != d_pattern_var_id[lhs].end(); ++it ){
856 for( unsigned i=0; i<=it->second; i++ ){
857 bvs.push_back( getFreeVar( it->first, i ) );
858 }
859 }
860 Node rsg;
861 if( !bvs.empty() ){
862 Node bvl = NodeManager::currentNM()->mkNode( BOUND_VAR_LIST, bvs );
863 rsg = NodeManager::currentNM()->mkNode( FORALL, bvl, lhs.eqNode( rhs ) );
864 }else{
865 rsg = lhs.eqNode( rhs );
866 }
867 rsg = Rewriter::rewrite( rsg );
868 d_conjectures.push_back( rsg );
869 d_eq_conjectures[lhs].push_back( rhs );
870 d_eq_conjectures[rhs].push_back( lhs );
871
872 Node lem = NodeManager::currentNM()->mkNode( OR, rsg.negate(), rsg );
873 d_quantEngine->addLemma( lem, false );
874 d_quantEngine->addRequirePhase( rsg, false );
875 addedLemmas++;
876 if( (int)addedLemmas>=options::conjectureGenPerRound() ){
877 break;
878 }
879 }
880 }
881 }
882 }
883 Trace("sg-proc") << "...have now added " << addedLemmas << " conjecture lemmas." << std::endl;
884 if( optStatsOnly() ){
885 Trace("sg-stats") << "Generated " << (d_conj_count-prevCount) << " conjectures at depth " << ldepth << "/" << rdepth << "." << std::endl;
886 }
887 }
888 d_waiting_conjectures_lhs.clear();
889 d_waiting_conjectures_rhs.clear();
890 d_waiting_conjectures_score.clear();
891 d_waiting_conjectures.clear();
892 }
893 return addedLemmas;
894 }
895
896 void ConjectureGenerator::registerQuantifier( Node q ) {
897
898 }
899
900 void ConjectureGenerator::assertNode( Node n ) {
901
902 }
903
904 bool ConjectureGenerator::considerTermCanon( Node ln, bool genRelevant ){
905 if( !ln.isNull() ){
906 //do not consider if it is non-canonical, and either:
907 // (1) we are not generating relevant terms, or
908 // (2) its canonical form is a generalization.
909 TNode lnr = getUniversalRepresentative( ln, true );
910 if( lnr==ln ){
911 markReportedCanon( ln );
912 }else if( !genRelevant || isGeneralization( lnr, ln ) ){
913 Trace("sg-gen-consider-term") << "Do not consider term, " << ln << " is not canonical representation (which is " << lnr << ")." << std::endl;
914 return false;
915 }
916 }
917 Trace("sg-gen-tg-debug") << "Will consider term canon " << ln << std::endl;
918 Trace("sg-gen-consider-term-debug") << std::endl;
919 return true;
920 }
921
922 unsigned ConjectureGenerator::collectFunctions( TNode opat, TNode pat, std::map< TNode, unsigned >& funcs,
923 std::map< TypeNode, unsigned >& mnvn, std::map< TypeNode, unsigned >& mxvn ){
924 if( pat.hasOperator() ){
925 funcs[pat.getOperator()]++;
926 if( !d_tge.isRelevantFunc( pat.getOperator() ) ){
927 d_pattern_is_relevant[opat] = false;
928 }
929 unsigned sum = 1;
930 for( unsigned i=0; i<pat.getNumChildren(); i++ ){
931 sum += collectFunctions( opat, pat[i], funcs, mnvn, mxvn );
932 }
933 return sum;
934 }else{
935 Assert( pat.getNumChildren()==0 );
936 funcs[pat]++;
937 //for variables
938 if( pat.getKind()==BOUND_VARIABLE ){
939 if( funcs[pat]>1 ){
940 //duplicate variable
941 d_pattern_var_duplicate[opat]++;
942 }else{
943 //check for max/min
944 TypeNode tn = pat.getType();
945 unsigned vn = pat.getAttribute(InstVarNumAttribute());
946 std::map< TypeNode, unsigned >::iterator it = mnvn.find( tn );
947 if( it!=mnvn.end() ){
948 if( vn<it->second ){
949 d_pattern_is_normal[opat] = false;
950 mnvn[tn] = vn;
951 }else if( vn>mxvn[tn] ){
952 if( vn!=mxvn[tn]+1 ){
953 d_pattern_is_normal[opat] = false;
954 }
955 mxvn[tn] = vn;
956 }
957 }else{
958 //first variable of this type
959 mnvn[tn] = vn;
960 mxvn[tn] = vn;
961 }
962 }
963 }else{
964 d_pattern_is_relevant[opat] = false;
965 }
966 return 1;
967 }
968 }
969
970 void ConjectureGenerator::registerPattern( Node pat, TypeNode tpat ) {
971 if( std::find( d_patterns[tpat].begin(), d_patterns[tpat].end(), pat )==d_patterns[tpat].end() ){
972 d_patterns[TypeNode::null()].push_back( pat );
973 d_patterns[tpat].push_back( pat );
974
975 Assert( d_pattern_fun_id.find( pat )==d_pattern_fun_id.end() );
976 Assert( d_pattern_var_id.find( pat )==d_pattern_var_id.end() );
977
978 //collect functions
979 std::map< TypeNode, unsigned > mnvn;
980 d_pattern_fun_sum[pat] = collectFunctions( pat, pat, d_pattern_fun_id[pat], mnvn, d_pattern_var_id[pat] );
981 if( d_pattern_is_normal.find( pat )==d_pattern_is_normal.end() ){
982 d_pattern_is_normal[pat] = true;
983 }
984 if( d_pattern_is_relevant.find( pat )==d_pattern_is_relevant.end() ){
985 d_pattern_is_relevant[pat] = true;
986 }
987 }
988 }
989
990 bool ConjectureGenerator::isGeneralization( TNode patg, TNode pat, std::map< TNode, TNode >& subs ) {
991 if( patg.getKind()==BOUND_VARIABLE ){
992 std::map< TNode, TNode >::iterator it = subs.find( patg );
993 if( it!=subs.end() ){
994 return it->second==pat;
995 }else{
996 subs[patg] = pat;
997 return true;
998 }
999 }else{
1000 Assert( patg.hasOperator() );
1001 if( !pat.hasOperator() || patg.getOperator()!=pat.getOperator() ){
1002 return false;
1003 }else{
1004 Assert( patg.getNumChildren()==pat.getNumChildren() );
1005 for( unsigned i=0; i<patg.getNumChildren(); i++ ){
1006 if( !isGeneralization( patg[i], pat[i], subs ) ){
1007 return false;
1008 }
1009 }
1010 return true;
1011 }
1012 }
1013 }
1014
1015 int ConjectureGenerator::calculateGeneralizationDepth( TNode n, std::vector< TNode >& fv ) {
1016 if( n.getKind()==BOUND_VARIABLE ){
1017 if( std::find( fv.begin(), fv.end(), n )==fv.end() ){
1018 fv.push_back( n );
1019 return 0;
1020 }else{
1021 return 1;
1022 }
1023 }else{
1024 int depth = 1;
1025 for( unsigned i=0; i<n.getNumChildren(); i++ ){
1026 depth += calculateGeneralizationDepth( n[i], fv );
1027 }
1028 return depth;
1029 }
1030 }
1031
1032 Node ConjectureGenerator::getPredicateForType( TypeNode tn ) {
1033 std::map< TypeNode, Node >::iterator it = d_typ_pred.find( tn );
1034 if( it==d_typ_pred.end() ){
1035 TypeNode op_tn = NodeManager::currentNM()->mkFunctionType( tn, NodeManager::currentNM()->booleanType() );
1036 Node op = NodeManager::currentNM()->mkSkolem( "PE", op_tn, "was created by conjecture ground term enumerator." );
1037 d_typ_pred[tn] = op;
1038 return op;
1039 }else{
1040 return it->second;
1041 }
1042 }
1043
1044 void ConjectureGenerator::getEnumerateUfTerm( Node n, unsigned num, std::vector< Node >& terms ) {
1045 if( n.getNumChildren()>0 ){
1046 std::vector< int > vec;
1047 for( unsigned i=0; i<n.getNumChildren(); i++ ){
1048 vec.push_back( 0 );
1049 }
1050 vec.pop_back();
1051 int size_limit = 0;
1052 int vec_sum = -1;
1053 unsigned index = 0;
1054 unsigned last_size = terms.size();
1055 while( terms.size()<num ){
1056 bool success = true;
1057 if( vec_sum==-1 ){
1058 vec_sum = 0;
1059 vec.push_back( size_limit );
1060 }else{
1061 //see if we can iterate current
1062 if( vec_sum<size_limit && !getTermDatabase()->getEnumerateTerm( n[index].getType(), vec[index]+1 ).isNull() ){
1063 vec[index]++;
1064 vec_sum++;
1065 vec.push_back( size_limit - vec_sum );
1066 }else{
1067 vec_sum -= vec[index];
1068 vec[index] = 0;
1069 index++;
1070 if( index==n.getNumChildren() ){
1071 success = false;
1072 }
1073 }
1074 }
1075 if( success ){
1076 if( vec.size()==n.getNumChildren() ){
1077 Node lc = getTermDatabase()->getEnumerateTerm( n[vec.size()-1].getType(), vec[vec.size()-1] );
1078 if( !lc.isNull() ){
1079 for( unsigned i=0; i<vec.size(); i++ ){
1080 Trace("sg-gt-enum-debug") << vec[i] << " ";
1081 }
1082 Trace("sg-gt-enum-debug") << " / " << size_limit << std::endl;
1083 for( unsigned i=0; i<n.getNumChildren(); i++ ){
1084 Trace("sg-gt-enum-debug") << n[i].getType() << " ";
1085 }
1086 Trace("sg-gt-enum-debug") << std::endl;
1087 std::vector< Node > children;
1088 children.push_back( n.getOperator() );
1089 for( unsigned i=0; i<(vec.size()-1); i++ ){
1090 Node nn = getTermDatabase()->getEnumerateTerm( n[i].getType(), vec[i] );
1091 Assert( !nn.isNull() );
1092 Assert( nn.getType()==n[i].getType() );
1093 children.push_back( nn );
1094 }
1095 children.push_back( lc );
1096 Node n = NodeManager::currentNM()->mkNode( APPLY_UF, children );
1097 Trace("sg-gt-enum") << "Ground term enumerate : " << n << std::endl;
1098 terms.push_back( n );
1099 }
1100 vec.pop_back();
1101 index = 0;
1102 }
1103 }else{
1104 if( terms.size()>last_size ){
1105 last_size = terms.size();
1106 size_limit++;
1107 for( unsigned i=0; i<vec.size(); i++ ){
1108 vec[i] = 0;
1109 }
1110 vec_sum = -1;
1111 }else{
1112 return;
1113 }
1114 }
1115 }
1116 }else{
1117 terms.push_back( n );
1118 }
1119 }
1120
1121 void ConjectureGenerator::getEnumeratePredUfTerm( Node n, unsigned num, std::vector< Node >& terms ) {
1122 std::vector< Node > uf_terms;
1123 getEnumerateUfTerm( n, num, uf_terms );
1124 Node p = getPredicateForType( n.getType() );
1125 for( unsigned i=0; i<uf_terms.size(); i++ ){
1126 terms.push_back( NodeManager::currentNM()->mkNode( APPLY_UF, p, uf_terms[i] ) );
1127 }
1128 }
1129
1130 void ConjectureGenerator::processCandidateConjecture( TNode lhs, TNode rhs, unsigned lhs_depth, unsigned rhs_depth ) {
1131 int score = considerCandidateConjecture( lhs, rhs );
1132 if( score>0 ){
1133 Trace("sg-conjecture") << "* Candidate conjecture : " << lhs << " == " << rhs << std::endl;
1134 Trace("sg-conjecture-debug") << " LHS, RHS generalization depth : " << lhs_depth << ", " << rhs_depth << std::endl;
1135 Trace("sg-conjecture-debug") << " confirmed = " << d_subs_confirmCount << ", #witnesses range = " << d_subs_confirmWitnessRange.size() << "." << std::endl;
1136 Trace("sg-conjecture-debug") << " #witnesses for ";
1137 bool firstTime = true;
1138 for( std::map< TNode, std::vector< TNode > >::iterator it = d_subs_confirmWitnessDomain.begin(); it != d_subs_confirmWitnessDomain.end(); ++it ){
1139 if( !firstTime ){
1140 Trace("sg-conjecture-debug") << ", ";
1141 }
1142 Trace("sg-conjecture-debug") << it->first << " : " << it->second.size();
1143 //if( it->second.size()==1 ){
1144 // Trace("sg-conjecture-debug") << " (" << it->second[0] << ")";
1145 //}
1146 Trace("sg-conjecture-debug2") << " (";
1147 for( unsigned j=0; j<it->second.size(); j++ ){
1148 if( j>0 ){ Trace("sg-conjecture-debug2") << " "; }
1149 Trace("sg-conjecture-debug2") << d_ground_eqc_map[it->second[j]];
1150 }
1151 Trace("sg-conjecture-debug2") << ")";
1152 firstTime = false;
1153 }
1154 Trace("sg-conjecture-debug") << std::endl;
1155 Trace("sg-conjecture-debug") << " unknown = " << d_subs_unkCount << std::endl;
1156 //Assert( getUniversalRepresentative( rhs )==rhs );
1157 //Assert( getUniversalRepresentative( lhs )==lhs );
1158 d_waiting_conjectures_lhs.push_back( lhs );
1159 d_waiting_conjectures_rhs.push_back( rhs );
1160 d_waiting_conjectures_score.push_back( score );
1161 d_waiting_conjectures[lhs].push_back( rhs );
1162 d_waiting_conjectures[rhs].push_back( lhs );
1163 }
1164 }
1165
1166 int ConjectureGenerator::considerCandidateConjecture( TNode lhs, TNode rhs ) {
1167 Assert( lhs.getType()==rhs.getType() );
1168
1169 Trace("sg-cconj-debug") << "Consider candidate conjecture : " << lhs << " == " << rhs << "?" << std::endl;
1170 if( lhs==rhs ){
1171 Trace("sg-cconj-debug") << " -> trivial." << std::endl;
1172 return -1;
1173 }else{
1174 if( lhs.getKind()==APPLY_CONSTRUCTOR && rhs.getKind()==APPLY_CONSTRUCTOR ){
1175 Trace("sg-cconj-debug") << " -> irrelevant by syntactic analysis." << std::endl;
1176 return -1;
1177 }
1178 //variables of LHS must subsume variables of RHS
1179 for( std::map< TypeNode, unsigned >::iterator it = d_pattern_var_id[rhs].begin(); it != d_pattern_var_id[rhs].end(); ++it ){
1180 std::map< TypeNode, unsigned >::iterator itl = d_pattern_var_id[lhs].find( it->first );
1181 if( itl!=d_pattern_var_id[lhs].end() ){
1182 if( itl->second<it->second ){
1183 Trace("sg-cconj-debug") << " -> variables of sort " << it->first << " are not subsumed." << std::endl;
1184 return -1;
1185 }else{
1186 Trace("sg-cconj-debug2") << " variables of sort " << it->first << " are : " << itl->second << " vs " << it->second << std::endl;
1187 }
1188 }else{
1189 Trace("sg-cconj-debug") << " -> has no variables of sort " << it->first << "." << std::endl;
1190 return -1;
1191 }
1192 }
1193
1194 //currently active conjecture?
1195 std::map< Node, std::vector< Node > >::iterator iteq = d_eq_conjectures.find( lhs );
1196 if( iteq!=d_eq_conjectures.end() ){
1197 if( std::find( iteq->second.begin(), iteq->second.end(), rhs )!=iteq->second.end() ){
1198 Trace("sg-cconj-debug") << " -> this conjecture is already active." << std::endl;
1199 return -1;
1200 }
1201 }
1202 //current a waiting conjecture?
1203 std::map< Node, std::vector< Node > >::iterator itw = d_waiting_conjectures.find( lhs );
1204 if( itw!=d_waiting_conjectures.end() ){
1205 if( std::find( itw->second.begin(), itw->second.end(), rhs )!=itw->second.end() ){
1206 Trace("sg-cconj-debug") << " -> already are considering this conjecture." << std::endl;
1207 return -1;
1208 }
1209 }
1210 //check if canonical representation (should be, but for efficiency this is not guarenteed)
1211 //if( options::conjectureFilterCanonical() && ( getUniversalRepresentative( lhs )!=lhs || getUniversalRepresentative( rhs )!=rhs ) ){
1212 // Trace("sg-cconj") << " -> after processing, not canonical." << std::endl;
1213 // return -1;
1214 //}
1215
1216 int score;
1217 bool scoreSet = false;
1218
1219 Trace("sg-cconj") << "Consider possible candidate conjecture : " << lhs << " == " << rhs << "?" << std::endl;
1220 //find witness for counterexample, if possible
1221 if( options::conjectureFilterModel() ){
1222 Assert( d_rel_pattern_var_sum.find( lhs )!=d_rel_pattern_var_sum.end() );
1223 Trace("sg-cconj-debug") << "Notify substitutions over " << d_rel_pattern_var_sum[lhs] << " variables." << std::endl;
1224 std::map< TNode, TNode > subs;
1225 d_subs_confirmCount = 0;
1226 d_subs_confirmWitnessRange.clear();
1227 d_subs_confirmWitnessDomain.clear();
1228 d_subs_unkCount = 0;
1229 if( !d_rel_pattern_subs_index[lhs].notifySubstitutions( this, subs, rhs, d_rel_pattern_var_sum[lhs] ) ){
1230 Trace("sg-cconj") << " -> found witness that falsifies the conjecture." << std::endl;
1231 return -1;
1232 }
1233 //score is the minimum number of distinct substitutions for a variable
1234 for( std::map< TNode, std::vector< TNode > >::iterator it = d_subs_confirmWitnessDomain.begin(); it != d_subs_confirmWitnessDomain.end(); ++it ){
1235 int num = (int)it->second.size();
1236 if( !scoreSet || num<score ){
1237 score = num;
1238 scoreSet = true;
1239 }
1240 }
1241 if( !scoreSet ){
1242 score = 0;
1243 }
1244 Trace("sg-cconj") << " confirmed = " << d_subs_confirmCount << ", #witnesses range = " << d_subs_confirmWitnessRange.size() << "." << std::endl;
1245 for( std::map< TNode, std::vector< TNode > >::iterator it = d_subs_confirmWitnessDomain.begin(); it != d_subs_confirmWitnessDomain.end(); ++it ){
1246 Trace("sg-cconj") << " #witnesses for " << it->first << " : " << it->second.size() << std::endl;
1247 }
1248 }else{
1249 score = 1;
1250 }
1251
1252 Trace("sg-cconj") << " -> SUCCESS." << std::endl;
1253 Trace("sg-cconj") << " score : " << score << std::endl;
1254
1255 return score;
1256 }
1257 }
1258
1259 bool ConjectureGenerator::notifySubstitution( TNode glhs, std::map< TNode, TNode >& subs, TNode rhs ) {
1260 if( Trace.isOn("sg-cconj-debug") ){
1261 Trace("sg-cconj-debug") << "Ground eqc for LHS : " << glhs << ", based on substituion: " << std::endl;
1262 for( std::map< TNode, TNode >::iterator it = subs.begin(); it != subs.end(); ++it ){
1263 Assert( getRepresentative( it->second )==it->second );
1264 Trace("sg-cconj-debug") << " " << it->first << " -> " << it->second << std::endl;
1265 }
1266 }
1267 Trace("sg-cconj-debug") << "Evaluate RHS : : " << rhs << std::endl;
1268 //get the representative of rhs with substitution subs
1269 TNode grhs = getTermDatabase()->evaluateTerm( rhs, subs, true );
1270 Trace("sg-cconj-debug") << "...done evaluating term, got : " << grhs << std::endl;
1271 if( !grhs.isNull() ){
1272 if( glhs!=grhs ){
1273 Trace("sg-cconj-debug") << "Ground eqc for RHS : " << grhs << std::endl;
1274 //check based on ground terms
1275 std::map< TNode, Node >::iterator itl = d_ground_eqc_map.find( glhs );
1276 if( itl!=d_ground_eqc_map.end() ){
1277 std::map< TNode, Node >::iterator itr = d_ground_eqc_map.find( grhs );
1278 if( itr!=d_ground_eqc_map.end() ){
1279 Trace("sg-cconj-debug") << "We have ground terms " << itl->second << " and " << itr->second << "." << std::endl;
1280 if( itl->second.isConst() && itr->second.isConst() ){
1281 Trace("sg-cconj-debug") << "...disequal constants." << std::endl;
1282 Trace("sg-cconj-witness") << " Witness of falsification : " << itl->second << " != " << itr->second << ", substutition is : " << std::endl;
1283 for( std::map< TNode, TNode >::iterator it = subs.begin(); it != subs.end(); ++it ){
1284 Trace("sg-cconj-witness") << " " << it->first << " -> " << it->second << std::endl;
1285 }
1286 return false;
1287 }
1288 }
1289 }
1290 }
1291 Trace("sg-cconj-debug") << "RHS is identical." << std::endl;
1292 bool isGroundSubs = true;
1293 for( std::map< TNode, TNode >::iterator it = subs.begin(); it != subs.end(); ++it ){
1294 std::map< TNode, Node >::iterator git = d_ground_eqc_map.find( it->second );
1295 if( git==d_ground_eqc_map.end() ){
1296 isGroundSubs = false;
1297 break;
1298 }
1299 }
1300 if( isGroundSubs ){
1301 if( glhs==grhs ){
1302 Trace("sg-cconj-witness") << " Witnessed " << glhs << " == " << grhs << ", substutition is : " << std::endl;
1303 for( std::map< TNode, TNode >::iterator it = subs.begin(); it != subs.end(); ++it ){
1304 Trace("sg-cconj-witness") << " " << it->first << " -> " << it->second << std::endl;
1305 if( std::find( d_subs_confirmWitnessDomain[it->first].begin(), d_subs_confirmWitnessDomain[it->first].end(), it->second )==d_subs_confirmWitnessDomain[it->first].end() ){
1306 d_subs_confirmWitnessDomain[it->first].push_back( it->second );
1307 }
1308 }
1309 d_subs_confirmCount++;
1310 if( std::find( d_subs_confirmWitnessRange.begin(), d_subs_confirmWitnessRange.end(), glhs )==d_subs_confirmWitnessRange.end() ){
1311 d_subs_confirmWitnessRange.push_back( glhs );
1312 }
1313 }else{
1314 if( optFilterUnknown() ){
1315 Trace("sg-cconj-debug") << "...ground substitution giving terms that are neither equal nor disequal." << std::endl;
1316 return false;
1317 }
1318 }
1319 }
1320 }else{
1321 Trace("sg-cconj-debug") << "(could not ground eqc for RHS)." << std::endl;
1322 }
1323 return true;
1324 }
1325
1326
1327
1328
1329
1330
1331 void TermGenerator::reset( TermGenEnv * s, TypeNode tn ) {
1332 Assert( d_children.empty() );
1333 d_typ = tn;
1334 d_status = 0;
1335 d_status_num = 0;
1336 d_children.clear();
1337 Trace("sg-gen-tg-debug2") << "...add to context " << this << std::endl;
1338 d_id = s->d_tg_id;
1339 s->changeContext( true );
1340 }
1341
1342 bool TermGenerator::getNextTerm( TermGenEnv * s, unsigned depth ) {
1343 if( Trace.isOn("sg-gen-tg-debug2") ){
1344 Trace("sg-gen-tg-debug2") << this << " getNextTerm depth " << depth << " : status = " << d_status << ", num = " << d_status_num;
1345 if( d_status==5 ){
1346 TNode f = s->getTgFunc( d_typ, d_status_num );
1347 Trace("sg-gen-tg-debug2") << ", f = " << f;
1348 Trace("sg-gen-tg-debug2") << ", #args = " << s->d_func_args[f].size();
1349 Trace("sg-gen-tg-debug2") << ", childNum = " << d_status_child_num;
1350 Trace("sg-gen-tg-debug2") << ", #children = " << d_children.size();
1351 }
1352 Trace("sg-gen-tg-debug2") << std::endl;
1353 }
1354
1355 if( d_status==0 ){
1356 d_status++;
1357 if( !d_typ.isNull() ){
1358 if( s->allowVar( d_typ ) ){
1359 //allocate variable
1360 d_status_num = s->d_var_id[d_typ];
1361 s->addVar( d_typ );
1362 Trace("sg-gen-tg-debug2") << this << " ...return unique var #" << d_status_num << std::endl;
1363 return s->considerCurrentTerm() ? true : getNextTerm( s, depth );
1364 }else{
1365 //check allocating new variable
1366 d_status++;
1367 d_status_num = -1;
1368 if( s->d_gen_relevant_terms ){
1369 s->d_tg_gdepth++;
1370 }
1371 return getNextTerm( s, depth );
1372 }
1373 }else{
1374 d_status = 4;
1375 d_status_num = -1;
1376 return getNextTerm( s, depth );
1377 }
1378 }else if( d_status==2 ){
1379 //cleanup previous information
1380 //if( d_status_num>=0 ){
1381 // s->d_var_eq_tg[d_status_num].pop_back();
1382 //}
1383 //check if there is another variable
1384 if( (d_status_num+1)<(int)s->getNumTgVars( d_typ ) ){
1385 d_status_num++;
1386 //we have equated two variables
1387 //s->d_var_eq_tg[d_status_num].push_back( d_id );
1388 Trace("sg-gen-tg-debug2") << this << "...consider other var #" << d_status_num << std::endl;
1389 return s->considerCurrentTerm() ? true : getNextTerm( s, depth );
1390 }else{
1391 if( s->d_gen_relevant_terms ){
1392 s->d_tg_gdepth--;
1393 }
1394 d_status++;
1395 return getNextTerm( s, depth );
1396 }
1397 }else if( d_status==4 ){
1398 d_status++;
1399 if( depth>0 && (d_status_num+1)<(int)s->getNumTgFuncs( d_typ ) ){
1400 d_status_num++;
1401 d_status_child_num = 0;
1402 Trace("sg-gen-tg-debug2") << this << "...consider function " << s->getTgFunc( d_typ, d_status_num ) << std::endl;
1403 s->d_tg_gdepth++;
1404 if( !s->considerCurrentTerm() ){
1405 s->d_tg_gdepth--;
1406 //don't consider this function
1407 d_status--;
1408 }else{
1409 //we have decided on a function application
1410 }
1411 return getNextTerm( s, depth );
1412 }else{
1413 //do not choose function applications at depth 0
1414 d_status++;
1415 return getNextTerm( s, depth );
1416 }
1417 }else if( d_status==5 ){
1418 //iterating over arguments
1419 TNode f = s->getTgFunc( d_typ, d_status_num );
1420 if( d_status_child_num<0 ){
1421 //no more arguments
1422 s->d_tg_gdepth--;
1423 d_status--;
1424 return getNextTerm( s, depth );
1425 }else if( d_status_child_num==(int)s->d_func_args[f].size() ){
1426 d_status_child_num--;
1427 return s->considerCurrentTermCanon( d_id ) ? true : getNextTerm( s, depth );
1428 //return true;
1429 }else{
1430 Assert( d_status_child_num<(int)s->d_func_args[f].size() );
1431 if( d_status_child_num==(int)d_children.size() ){
1432 d_children.push_back( s->d_tg_id );
1433 Assert( s->d_tg_alloc.find( s->d_tg_id )==s->d_tg_alloc.end() );
1434 s->d_tg_alloc[d_children[d_status_child_num]].reset( s, s->d_func_args[f][d_status_child_num] );
1435 return getNextTerm( s, depth );
1436 }else{
1437 Assert( d_status_child_num+1==(int)d_children.size() );
1438 if( s->d_tg_alloc[d_children[d_status_child_num]].getNextTerm( s, depth-1 ) ){
1439 d_status_child_num++;
1440 return getNextTerm( s, depth );
1441 }else{
1442 d_children.pop_back();
1443 d_status_child_num--;
1444 return getNextTerm( s, depth );
1445 }
1446 }
1447 }
1448 }else if( d_status==1 || d_status==3 ){
1449 if( d_status==1 ){
1450 s->removeVar( d_typ );
1451 Assert( d_status_num==(int)s->d_var_id[d_typ] );
1452 //check if there is only one feasible equivalence class. if so, don't make pattern any more specific.
1453 //unsigned i = s->d_ccand_eqc[0].size()-1;
1454 //if( s->d_ccand_eqc[0][i].size()==1 && s->d_ccand_eqc[1][i].empty() ){
1455 // d_status = 6;
1456 // return getNextTerm( s, depth );
1457 //}
1458 s->d_tg_gdepth++;
1459 }
1460 d_status++;
1461 d_status_num = -1;
1462 return getNextTerm( s, depth );
1463 }else{
1464 //clean up
1465 Assert( d_children.empty() );
1466 Trace("sg-gen-tg-debug2") << "...remove from context " << this << std::endl;
1467 s->changeContext( false );
1468 Assert( d_id==s->d_tg_id );
1469 return false;
1470 }
1471 }
1472
1473 void TermGenerator::resetMatching( TermGenEnv * s, TNode eqc, unsigned mode ) {
1474 d_match_status = 0;
1475 d_match_status_child_num = 0;
1476 d_match_children.clear();
1477 d_match_children_end.clear();
1478 d_match_mode = mode;
1479 //if this term generalizes, it must generalize a non-ground term
1480 //if( (d_match_mode & ( 1 << 2 ))!=0 && s->isGroundEqc( eqc ) && d_status==5 ){
1481 // d_match_status = -1;
1482 //}
1483 }
1484
1485 bool TermGenerator::getNextMatch( TermGenEnv * s, TNode eqc, std::map< TypeNode, std::map< unsigned, TNode > >& subs, std::map< TNode, bool >& rev_subs ) {
1486 if( d_match_status<0 ){
1487 return false;
1488 }
1489 if( Trace.isOn("sg-gen-tg-match") ){
1490 Trace("sg-gen-tg-match") << "Matching ";
1491 debugPrint( s, "sg-gen-tg-match", "sg-gen-tg-match" );
1492 Trace("sg-gen-tg-match") << " with eqc e" << s->d_cg->d_em[eqc] << "..." << std::endl;
1493 Trace("sg-gen-tg-match") << " mstatus = " << d_match_status;
1494 if( d_status==5 ){
1495 TNode f = s->getTgFunc( d_typ, d_status_num );
1496 Trace("sg-gen-tg-debug2") << ", f = " << f;
1497 Trace("sg-gen-tg-debug2") << ", #args = " << s->d_func_args[f].size();
1498 Trace("sg-gen-tg-debug2") << ", mchildNum = " << d_match_status_child_num;
1499 Trace("sg-gen-tg-debug2") << ", #mchildren = " << d_match_children.size();
1500 }
1501 Trace("sg-gen-tg-debug2") << ", current substitution : {";
1502 for( std::map< TypeNode, std::map< unsigned, TNode > >::iterator itt = subs.begin(); itt != subs.end(); ++itt ){
1503 for( std::map< unsigned, TNode >::iterator it = itt->second.begin(); it != itt->second.end(); ++it ){
1504 Trace("sg-gen-tg-debug2") << " " << it->first << " -> e" << s->d_cg->d_em[it->second];
1505 }
1506 }
1507 Trace("sg-gen-tg-debug2") << " } " << std::endl;
1508 }
1509 if( d_status==1 ){
1510 //a variable
1511 if( d_match_status==0 ){
1512 d_match_status++;
1513 if( (d_match_mode & ( 1 << 1 ))!=0 ){
1514 //only ground terms
1515 if( !s->isGroundEqc( eqc ) ){
1516 return false;
1517 }
1518 }else if( (d_match_mode & ( 1 << 2 ))!=0 ){
1519 //only non-ground terms
1520 //if( s->isGroundEqc( eqc ) ){
1521 // return false;
1522 //}
1523 }
1524 //store the match : restricted if match_mode.0 = 1
1525 if( (d_match_mode & ( 1 << 0 ))!=0 ){
1526 std::map< TNode, bool >::iterator it = rev_subs.find( eqc );
1527 if( it==rev_subs.end() ){
1528 rev_subs[eqc] = true;
1529 }else{
1530 return false;
1531 }
1532 }
1533 Assert( subs[d_typ].find( d_status_num )==subs[d_typ].end() );
1534 subs[d_typ][d_status_num] = eqc;
1535 return true;
1536 }else{
1537 //clean up
1538 subs[d_typ].erase( d_status_num );
1539 if( (d_match_mode & ( 1 << 0 ))!=0 ){
1540 rev_subs.erase( eqc );
1541 }
1542 return false;
1543 }
1544 }else if( d_status==2 ){
1545 if( d_match_status==0 ){
1546 d_match_status++;
1547 Assert( d_status_num<(int)s->getNumTgVars( d_typ ) );
1548 std::map< unsigned, TNode >::iterator it = subs[d_typ].find( d_status_num );
1549 Assert( it!=subs[d_typ].end() );
1550 return it->second==eqc;
1551 }else{
1552 return false;
1553 }
1554 }else if( d_status==5 ){
1555 //Assert( d_match_children.size()<=d_children.size() );
1556 //enumerating over f-applications in eqc
1557 if( d_match_status_child_num<0 ){
1558 return false;
1559 }else if( d_match_status==0 ){
1560 //set up next binding
1561 if( d_match_status_child_num==(int)d_match_children.size() ){
1562 if( d_match_status_child_num==0 ){
1563 //initial binding
1564 TNode f = s->getTgFunc( d_typ, d_status_num );
1565 std::map< TNode, TermArgTrie >::iterator it = s->getTermDatabase()->d_func_map_eqc_trie[f].d_data.find( eqc );
1566 if( it!=s->getTermDatabase()->d_func_map_eqc_trie[f].d_data.end() ){
1567 d_match_children.push_back( it->second.d_data.begin() );
1568 d_match_children_end.push_back( it->second.d_data.end() );
1569 }else{
1570 d_match_status++;
1571 d_match_status_child_num--;
1572 return getNextMatch( s, eqc, subs, rev_subs );
1573 }
1574 }else{
1575 d_match_children.push_back( d_match_children[d_match_status_child_num-1]->second.d_data.begin() );
1576 d_match_children_end.push_back( d_match_children[d_match_status_child_num-1]->second.d_data.end() );
1577 }
1578 }
1579 d_match_status++;
1580 Assert( d_match_status_child_num+1==(int)d_match_children.size() );
1581 if( d_match_children[d_match_status_child_num]==d_match_children_end[d_match_status_child_num] ){
1582 //no more arguments to bind
1583 d_match_children.pop_back();
1584 d_match_children_end.pop_back();
1585 d_match_status_child_num--;
1586 return getNextMatch( s, eqc, subs, rev_subs );
1587 }else{
1588 if( d_match_status_child_num==(int)d_children.size() ){
1589 //successfully matched all children
1590 d_match_children.pop_back();
1591 d_match_children_end.pop_back();
1592 d_match_status_child_num--;
1593 return true;//return d_match_children[d_match_status]!=d_match_children_end[d_match_status];
1594 }else{
1595 //do next binding
1596 s->d_tg_alloc[d_children[d_match_status_child_num]].resetMatching( s, d_match_children[d_match_status_child_num]->first, d_match_mode );
1597 return getNextMatch( s, eqc, subs, rev_subs );
1598 }
1599 }
1600 }else{
1601 Assert( d_match_status==1 );
1602 Assert( d_match_status_child_num+1==(int)d_match_children.size() );
1603 Assert( d_match_children[d_match_status_child_num]!=d_match_children_end[d_match_status_child_num] );
1604 d_match_status--;
1605 if( s->d_tg_alloc[d_children[d_match_status_child_num]].getNextMatch( s, d_match_children[d_match_status_child_num]->first, subs, rev_subs ) ){
1606 d_match_status_child_num++;
1607 return getNextMatch( s, eqc, subs, rev_subs );
1608 }else{
1609 //iterate
1610 d_match_children[d_match_status_child_num]++;
1611 return getNextMatch( s, eqc, subs, rev_subs );
1612 }
1613 }
1614 }
1615 Assert( false );
1616 return false;
1617 }
1618
1619 unsigned TermGenerator::getDepth( TermGenEnv * s ) {
1620 if( d_status==5 ){
1621 unsigned maxd = 0;
1622 for( unsigned i=0; i<d_children.size(); i++ ){
1623 unsigned d = s->d_tg_alloc[d_children[i]].getDepth( s );
1624 if( d>maxd ){
1625 maxd = d;
1626 }
1627 }
1628 return 1+maxd;
1629 }else{
1630 return 0;
1631 }
1632 }
1633
1634 unsigned TermGenerator::calculateGeneralizationDepth( TermGenEnv * s, std::map< TypeNode, std::vector< int > >& fvs ) {
1635 if( d_status==5 ){
1636 unsigned sum = 1;
1637 for( unsigned i=0; i<d_children.size(); i++ ){
1638 sum += s->d_tg_alloc[d_children[i]].calculateGeneralizationDepth( s, fvs );
1639 }
1640 return sum;
1641 }else{
1642 Assert( d_status==2 || d_status==1 );
1643 std::map< TypeNode, std::vector< int > >::iterator it = fvs.find( d_typ );
1644 if( it!=fvs.end() ){
1645 if( std::find( it->second.begin(), it->second.end(), d_status_num )!=it->second.end() ){
1646 return 1;
1647 }
1648 }
1649 fvs[d_typ].push_back( d_status_num );
1650 return 0;
1651 }
1652 }
1653
1654 unsigned TermGenerator::getGeneralizationDepth( TermGenEnv * s ) {
1655 //if( s->d_gen_relevant_terms ){
1656 // return s->d_tg_gdepth;
1657 //}else{
1658 std::map< TypeNode, std::vector< int > > fvs;
1659 return calculateGeneralizationDepth( s, fvs );
1660 //}
1661 }
1662
1663 Node TermGenerator::getTerm( TermGenEnv * s ) {
1664 if( d_status==1 || d_status==2 ){
1665 Assert( !d_typ.isNull() );
1666 return s->getFreeVar( d_typ, d_status_num );
1667 }else if( d_status==5 ){
1668 Node f = s->getTgFunc( d_typ, d_status_num );
1669 if( d_children.size()==s->d_func_args[f].size() ){
1670 std::vector< Node > children;
1671 if( s->d_tg_func_param[f] ){
1672 children.push_back( f );
1673 }
1674 for( unsigned i=0; i<d_children.size(); i++ ){
1675 Node nc = s->d_tg_alloc[d_children[i]].getTerm( s );
1676 if( nc.isNull() ){
1677 return Node::null();
1678 }else{
1679 //Assert( nc.getType()==s->d_func_args[f][i] );
1680 children.push_back( nc );
1681 }
1682 }
1683 return NodeManager::currentNM()->mkNode( s->d_func_kind[f], children );
1684 }
1685 }else{
1686 Assert( false );
1687 }
1688 return Node::null();
1689 }
1690
1691 void TermGenerator::debugPrint( TermGenEnv * s, const char * c, const char * cd ) {
1692 Trace(cd) << "[*" << d_id << "," << d_status << "]:";
1693 if( d_status==1 || d_status==2 ){
1694 Trace(c) << s->getFreeVar( d_typ, d_status_num );
1695 }else if( d_status==5 ){
1696 TNode f = s->getTgFunc( d_typ, d_status_num );
1697 Trace(c) << "(" << f;
1698 for( unsigned i=0; i<d_children.size(); i++ ){
1699 Trace(c) << " ";
1700 s->d_tg_alloc[d_children[i]].debugPrint( s, c, cd );
1701 }
1702 if( d_children.size()<s->d_func_args[f].size() ){
1703 Trace(c) << " ...";
1704 }
1705 Trace(c) << ")";
1706 }else{
1707 Trace(c) << "???";
1708 }
1709 }
1710
1711 void TermGenEnv::collectSignatureInformation() {
1712 d_typ_tg_funcs.clear();
1713 d_funcs.clear();
1714 d_func_kind.clear();
1715 d_func_args.clear();
1716 TypeNode tnull;
1717 for( std::map< Node, TermArgTrie >::iterator it = getTermDatabase()->d_func_map_trie.begin(); it != getTermDatabase()->d_func_map_trie.end(); ++it ){
1718 if( !getTermDatabase()->d_op_map[it->first].empty() ){
1719 Node nn = getTermDatabase()->d_op_map[it->first][0];
1720 Trace("sg-rel-sig-debug") << "Check in signature : " << nn << std::endl;
1721 if( d_cg->isHandledTerm( nn ) && nn.getKind()!=APPLY_SELECTOR_TOTAL && !nn.getType().isBoolean() ){
1722 bool do_enum = true;
1723 //check if we have enumerated ground terms
1724 if( nn.getKind()==APPLY_UF ){
1725 Trace("sg-rel-sig-debug") << "Check enumeration..." << std::endl;
1726 if( !d_cg->hasEnumeratedUf( nn ) ){
1727 do_enum = false;
1728 }
1729 }
1730 if( do_enum ){
1731 Trace("sg-rel-sig-debug") << "Set enumeration..." << std::endl;
1732 d_funcs.push_back( it->first );
1733 for( unsigned i=0; i<nn.getNumChildren(); i++ ){
1734 d_func_args[it->first].push_back( nn[i].getType() );
1735 }
1736 d_func_kind[it->first] = nn.getKind();
1737 d_typ_tg_funcs[tnull].push_back( it->first );
1738 d_typ_tg_funcs[nn.getType()].push_back( it->first );
1739 d_tg_func_param[it->first] = ( nn.getMetaKind() == kind::metakind::PARAMETERIZED );
1740 Trace("sg-rel-sig") << "Will enumerate function applications of : " << it->first << ", #args = " << d_func_args[it->first].size() << ", kind = " << nn.getKind() << std::endl;
1741 getTermDatabase()->computeUfEqcTerms( it->first );
1742 }
1743 }
1744 Trace("sg-rel-sig-debug") << "Done check in signature : " << nn << std::endl;
1745 }
1746 }
1747 //shuffle functions
1748 for( std::map< TypeNode, std::vector< TNode > >::iterator it = d_typ_tg_funcs.begin(); it != d_typ_tg_funcs.end(); ++it ){
1749 std::random_shuffle( it->second.begin(), it->second.end() );
1750 if( it->first.isNull() ){
1751 Trace("sg-gen-tg-debug") << "In this order : ";
1752 for( unsigned i=0; i<it->second.size(); i++ ){
1753 Trace("sg-gen-tg-debug") << it->second[i] << " ";
1754 }
1755 Trace("sg-gen-tg-debug") << std::endl;
1756 }
1757 }
1758 }
1759
1760 void TermGenEnv::reset( unsigned depth, bool genRelevant, TypeNode tn ) {
1761 Assert( d_tg_alloc.empty() );
1762 d_tg_alloc.clear();
1763
1764 if( genRelevant ){
1765 for( unsigned i=0; i<2; i++ ){
1766 d_ccand_eqc[i].clear();
1767 d_ccand_eqc[i].push_back( d_relevant_eqc[i] );
1768 }
1769 }
1770
1771 d_tg_id = 0;
1772 d_tg_gdepth = 0;
1773 d_tg_gdepth_limit = depth;
1774 d_gen_relevant_terms = genRelevant;
1775 d_tg_alloc[0].reset( this, tn );
1776 }
1777
1778 bool TermGenEnv::getNextTerm() {
1779 if( d_tg_alloc[0].getNextTerm( this, d_tg_gdepth_limit ) ){
1780 Assert( (int)d_tg_alloc[0].getGeneralizationDepth( this )<=d_tg_gdepth_limit );
1781 if( (int)d_tg_alloc[0].getGeneralizationDepth( this )!=d_tg_gdepth_limit ){
1782 return getNextTerm();
1783 }else{
1784 return true;
1785 }
1786 }else{
1787 return false;
1788 }
1789 }
1790
1791 //reset matching
1792 void TermGenEnv::resetMatching( TNode eqc, unsigned mode ) {
1793 d_tg_alloc[0].resetMatching( this, eqc, mode );
1794 }
1795
1796 //get next match
1797 bool TermGenEnv::getNextMatch( TNode eqc, std::map< TypeNode, std::map< unsigned, TNode > >& subs, std::map< TNode, bool >& rev_subs ) {
1798 return d_tg_alloc[0].getNextMatch( this, eqc, subs, rev_subs );
1799 }
1800
1801 //get term
1802 Node TermGenEnv::getTerm() {
1803 return d_tg_alloc[0].getTerm( this );
1804 }
1805
1806 void TermGenEnv::debugPrint( const char * c, const char * cd ) {
1807 d_tg_alloc[0].debugPrint( this, c, cd );
1808 }
1809
1810 unsigned TermGenEnv::getNumTgVars( TypeNode tn ) {
1811 return d_var_id[tn];
1812 }
1813
1814 bool TermGenEnv::allowVar( TypeNode tn ) {
1815 std::map< TypeNode, unsigned >::iterator it = d_var_limit.find( tn );
1816 if( it==d_var_limit.end() ){
1817 return true;
1818 }else{
1819 return d_var_id[tn]<it->second;
1820 }
1821 }
1822
1823 void TermGenEnv::addVar( TypeNode tn ) {
1824 d_var_id[tn]++;
1825 }
1826
1827 void TermGenEnv::removeVar( TypeNode tn ) {
1828 d_var_id[tn]--;
1829 //d_var_eq_tg.pop_back();
1830 //d_var_tg.pop_back();
1831 }
1832
1833 unsigned TermGenEnv::getNumTgFuncs( TypeNode tn ) {
1834 return d_typ_tg_funcs[tn].size();
1835 }
1836
1837 TNode TermGenEnv::getTgFunc( TypeNode tn, unsigned i ) {
1838 return d_typ_tg_funcs[tn][i];
1839 }
1840
1841 Node TermGenEnv::getFreeVar( TypeNode tn, unsigned i ) {
1842 return d_cg->getFreeVar( tn, i );
1843 }
1844
1845 bool TermGenEnv::considerCurrentTerm() {
1846 Assert( !d_tg_alloc.empty() );
1847
1848 //if generalization depth is too large, don't consider it
1849 unsigned i = d_tg_alloc.size();
1850 Trace("sg-gen-tg-debug") << "Consider term ";
1851 d_tg_alloc[0].debugPrint( this, "sg-gen-tg-debug", "sg-gen-tg-debug" );
1852 Trace("sg-gen-tg-debug") << "? curr term size = " << d_tg_alloc.size() << ", last status = " << d_tg_alloc[i-1].d_status;
1853 Trace("sg-gen-tg-debug") << std::endl;
1854
1855 if( d_tg_gdepth_limit>=0 && d_tg_alloc[0].getGeneralizationDepth( this )>(unsigned)d_tg_gdepth_limit ){
1856 Trace("sg-gen-consider-term") << "-> generalization depth of ";
1857 d_tg_alloc[0].debugPrint( this, "sg-gen-consider-term", "sg-gen-tg-debug" );
1858 Trace("sg-gen-consider-term") << " is too high " << d_tg_gdepth << " " << d_tg_alloc[0].getGeneralizationDepth( this ) << ", do not consider." << std::endl;
1859 return false;
1860 }
1861
1862 //----optimizations
1863 /*
1864 if( d_tg_alloc[i-1].d_status==1 ){
1865 }else if( d_tg_alloc[i-1].d_status==2 ){
1866 }else if( d_tg_alloc[i-1].d_status==5 ){
1867 }else{
1868 Trace("sg-gen-tg-debug") << "Bad tg: " << &d_tg_alloc[i-1] << std::endl;
1869 Assert( false );
1870 }
1871 */
1872 //if equated two variables, first check if context-independent TODO
1873 //----end optimizations
1874
1875
1876 //check based on which candidate equivalence classes match
1877 if( d_gen_relevant_terms ){
1878 Trace("sg-gen-tg-debug") << "Filter based on relevant ground EQC";
1879 Trace("sg-gen-tg-debug") << ", #eqc to try = " << d_ccand_eqc[0][i-1].size() << "/" << d_ccand_eqc[1][i-1].size() << std::endl;
1880
1881 Assert( d_ccand_eqc[0].size()>=2 );
1882 Assert( d_ccand_eqc[0].size()==d_ccand_eqc[1].size() );
1883 Assert( d_ccand_eqc[0].size()==d_tg_id+1 );
1884 Assert( d_tg_id==d_tg_alloc.size() );
1885 for( unsigned r=0; r<2; r++ ){
1886 d_ccand_eqc[r][i].clear();
1887 }
1888
1889 //re-check feasibility of EQC
1890 for( unsigned r=0; r<2; r++ ){
1891 for( unsigned j=0; j<d_ccand_eqc[r][i-1].size(); j++ ){
1892 std::map< TypeNode, std::map< unsigned, TNode > > subs;
1893 std::map< TNode, bool > rev_subs;
1894 unsigned mode;
1895 if( r==0 ){
1896 mode = d_cg->optReqDistinctVarPatterns() ? ( 1 << 0 ) : 0;
1897 mode = mode | (1 << 2 );
1898 }else{
1899 mode = 1 << 1;
1900 }
1901 d_tg_alloc[0].resetMatching( this, d_ccand_eqc[r][i-1][j], mode );
1902 if( d_tg_alloc[0].getNextMatch( this, d_ccand_eqc[r][i-1][j], subs, rev_subs ) ){
1903 d_ccand_eqc[r][i].push_back( d_ccand_eqc[r][i-1][j] );
1904 }
1905 }
1906 }
1907 for( unsigned r=0; r<2; r++ ){
1908 Trace("sg-gen-tg-debug") << "Current eqc of type " << r << " : ";
1909 for( unsigned j=0; j<d_ccand_eqc[r][i].size(); j++ ){
1910 Trace("sg-gen-tg-debug") << "e" << d_cg->d_em[d_ccand_eqc[r][i][j]] << " ";
1911 }
1912 Trace("sg-gen-tg-debug") << std::endl;
1913 }
1914 if( options::conjectureFilterActiveTerms() && d_ccand_eqc[0][i].empty() ){
1915 Trace("sg-gen-consider-term") << "Do not consider term of form ";
1916 d_tg_alloc[0].debugPrint( this, "sg-gen-consider-term", "sg-gen-consider-term-debug" );
1917 Trace("sg-gen-consider-term") << " since no relevant EQC matches it." << std::endl;
1918 return false;
1919 }
1920 if( options::conjectureFilterModel() && d_ccand_eqc[1][i].empty() ){
1921 Trace("sg-gen-consider-term") << "Do not consider term of form ";
1922 d_tg_alloc[0].debugPrint( this, "sg-gen-consider-term", "sg-gen-consider-term-debug" );
1923 Trace("sg-gen-consider-term") << " since no ground EQC matches it." << std::endl;
1924 return false;
1925 }
1926 }
1927 Trace("sg-gen-tg-debug") << "Will consider term ";
1928 d_tg_alloc[0].debugPrint( this, "sg-gen-tg-debug", "sg-gen-tg-debug" );
1929 Trace("sg-gen-tg-debug") << std::endl;
1930 Trace("sg-gen-consider-term-debug") << std::endl;
1931 return true;
1932 }
1933
1934 void TermGenEnv::changeContext( bool add ) {
1935 if( add ){
1936 for( unsigned r=0; r<2; r++ ){
1937 d_ccand_eqc[r].push_back( std::vector< TNode >() );
1938 }
1939 d_tg_id++;
1940 }else{
1941 for( unsigned r=0; r<2; r++ ){
1942 d_ccand_eqc[r].pop_back();
1943 }
1944 d_tg_id--;
1945 Assert( d_tg_alloc.find( d_tg_id )!=d_tg_alloc.end() );
1946 d_tg_alloc.erase( d_tg_id );
1947 }
1948 }
1949
1950 bool TermGenEnv::considerCurrentTermCanon( unsigned tg_id ){
1951 Assert( tg_id<d_tg_alloc.size() );
1952 if( options::conjectureFilterCanonical() ){
1953 //check based on a canonicity of the term (if there is one)
1954 Trace("sg-gen-tg-debug") << "Consider term canon ";
1955 d_tg_alloc[0].debugPrint( this, "sg-gen-tg-debug", "sg-gen-tg-debug" );
1956 Trace("sg-gen-tg-debug") << ", tg is [" << tg_id << "]..." << std::endl;
1957
1958 Node ln = d_tg_alloc[tg_id].getTerm( this );
1959 Trace("sg-gen-tg-debug") << "Term is " << ln << std::endl;
1960 return d_cg->considerTermCanon( ln, d_gen_relevant_terms );
1961 }
1962 return true;
1963 }
1964
1965 bool TermGenEnv::isRelevantFunc( Node f ) {
1966 return std::find( d_funcs.begin(), d_funcs.end(), f )!=d_funcs.end();
1967 }
1968
1969 bool TermGenEnv::isRelevantTerm( Node t ) {
1970 if( t.getKind()!=BOUND_VARIABLE ){
1971 if( t.getKind()!=EQUAL ){
1972 if( t.hasOperator() ){
1973 TNode op = t.getOperator();
1974 if( !isRelevantFunc( op ) ){
1975 return false;
1976 }
1977 }else{
1978 return false;
1979 }
1980 }
1981 for( unsigned i=0; i<t.getNumChildren(); i++ ){
1982 if( !isRelevantTerm( t[i] ) ){
1983 return false;
1984 }
1985 }
1986 }
1987 return true;
1988 }
1989
1990 TermDb * TermGenEnv::getTermDatabase() {
1991 return d_cg->getTermDatabase();
1992 }
1993 Node TermGenEnv::getGroundEqc( TNode r ) {
1994 return d_cg->getGroundEqc( r );
1995 }
1996 bool TermGenEnv::isGroundEqc( TNode r ){
1997 return d_cg->isGroundEqc( r );
1998 }
1999 bool TermGenEnv::isGroundTerm( TNode n ){
2000 return d_cg->isGroundTerm( n );
2001 }
2002
2003
2004 void SubstitutionIndex::addSubstitution( TNode eqc, std::vector< TNode >& vars, std::vector< TNode >& terms, unsigned i ) {
2005 if( i==vars.size() ){
2006 d_var = eqc;
2007 }else{
2008 Assert( d_var.isNull() || d_var==vars[i] );
2009 d_var = vars[i];
2010 d_children[terms[i]].addSubstitution( eqc, vars, terms, i+1 );
2011 }
2012 }
2013
2014 bool SubstitutionIndex::notifySubstitutions( ConjectureGenerator * s, std::map< TNode, TNode >& subs, TNode rhs, unsigned numVars, unsigned i ) {
2015 if( i==numVars ){
2016 Assert( d_children.empty() );
2017 return s->notifySubstitution( d_var, subs, rhs );
2018 }else{
2019 Assert( i==0 || !d_children.empty() );
2020 for( std::map< TNode, SubstitutionIndex >::iterator it = d_children.begin(); it != d_children.end(); ++it ){
2021 Trace("sg-cconj-debug2") << "Try " << d_var << " -> " << it->first << " (" << i << "/" << numVars << ")" << std::endl;
2022 subs[d_var] = it->first;
2023 if( !it->second.notifySubstitutions( s, subs, rhs, numVars, i+1 ) ){
2024 return false;
2025 }
2026 }
2027 return true;
2028 }
2029 }
2030
2031
2032 void TheoremIndex::addTheorem( std::vector< TNode >& lhs_v, std::vector< unsigned >& lhs_arg, TNode rhs ){
2033 if( lhs_v.empty() ){
2034 if( std::find( d_terms.begin(), d_terms.end(), rhs )==d_terms.end() ){
2035 d_terms.push_back( rhs );
2036 }
2037 }else{
2038 unsigned index = lhs_v.size()-1;
2039 if( lhs_arg[index]==lhs_v[index].getNumChildren() ){
2040 lhs_v.pop_back();
2041 lhs_arg.pop_back();
2042 addTheorem( lhs_v, lhs_arg, rhs );
2043 }else{
2044 lhs_arg[index]++;
2045 addTheoremNode( lhs_v[index][lhs_arg[index]-1], lhs_v, lhs_arg, rhs );
2046 }
2047 }
2048 }
2049
2050 void TheoremIndex::addTheoremNode( TNode curr, std::vector< TNode >& lhs_v, std::vector< unsigned >& lhs_arg, TNode rhs ){
2051 Trace("thm-db-debug") << "Adding conjecture for subterm " << curr << "..." << std::endl;
2052 if( curr.hasOperator() ){
2053 lhs_v.push_back( curr );
2054 lhs_arg.push_back( 0 );
2055 d_children[curr.getOperator()].addTheorem( lhs_v, lhs_arg, rhs );
2056 }else{
2057 Assert( curr.getKind()==kind::BOUND_VARIABLE );
2058 TypeNode tn = curr.getType();
2059 Assert( d_var[tn].isNull() || d_var[tn]==curr );
2060 d_var[tn] = curr;
2061 d_children[curr].addTheorem( lhs_v, lhs_arg, rhs );
2062 }
2063 }
2064
2065 void TheoremIndex::getEquivalentTerms( std::vector< TNode >& n_v, std::vector< unsigned >& n_arg,
2066 std::map< TNode, TNode >& smap, std::vector< TNode >& vars, std::vector< TNode >& subs,
2067 std::vector< Node >& terms ) {
2068 Trace("thm-db-debug") << "Get equivalent terms " << n_v.size() << " " << n_arg.size() << std::endl;
2069 if( n_v.empty() ){
2070 Trace("thm-db-debug") << "Number of terms : " << d_terms.size() << std::endl;
2071 //apply substutitions to RHS's
2072 for( unsigned i=0; i<d_terms.size(); i++ ){
2073 Node n = d_terms[i].substitute( vars.begin(), vars.end(), subs.begin(), subs.end() );
2074 terms.push_back( n );
2075 }
2076 }else{
2077 unsigned index = n_v.size()-1;
2078 if( n_arg[index]==n_v[index].getNumChildren() ){
2079 n_v.pop_back();
2080 n_arg.pop_back();
2081 getEquivalentTerms( n_v, n_arg, smap, vars, subs, terms );
2082 }else{
2083 n_arg[index]++;
2084 getEquivalentTermsNode( n_v[index][n_arg[index]-1], n_v, n_arg, smap, vars, subs, terms );
2085 }
2086 }
2087 }
2088
2089 void TheoremIndex::getEquivalentTermsNode( Node curr, std::vector< TNode >& n_v, std::vector< unsigned >& n_arg,
2090 std::map< TNode, TNode >& smap, std::vector< TNode >& vars, std::vector< TNode >& subs,
2091 std::vector< Node >& terms ) {
2092 Trace("thm-db-debug") << "Get equivalent based on subterm " << curr << "..." << std::endl;
2093 if( curr.hasOperator() ){
2094 Trace("thm-db-debug") << "Check based on operator..." << std::endl;
2095 std::map< TNode, TheoremIndex >::iterator it = d_children.find( curr.getOperator() );
2096 if( it!=d_children.end() ){
2097 n_v.push_back( curr );
2098 n_arg.push_back( 0 );
2099 it->second.getEquivalentTerms( n_v, n_arg, smap, vars, subs, terms );
2100 }
2101 Trace("thm-db-debug") << "...done check based on operator" << std::endl;
2102 }
2103 TypeNode tn = curr.getType();
2104 std::map< TypeNode, TNode >::iterator itt = d_var.find( tn );
2105 if( itt!=d_var.end() ){
2106 Trace("thm-db-debug") << "Check for substitution with " << itt->second << "..." << std::endl;
2107 Assert( curr.getType()==itt->second.getType() );
2108 //add to substitution if possible
2109 bool success = false;
2110 std::map< TNode, TNode >::iterator it = smap.find( itt->second );
2111 if( it==smap.end() ){
2112 smap[itt->second] = curr;
2113 vars.push_back( itt->second );
2114 subs.push_back( curr );
2115 success = true;
2116 }else if( it->second==curr ){
2117 success = true;
2118 }else{
2119 //also check modulo equality (in universal equality engine)
2120 }
2121 Trace("thm-db-debug") << "...check for substitution with " << itt->second << ", success = " << success << "." << std::endl;
2122 if( success ){
2123 d_children[itt->second].getEquivalentTerms( n_v, n_arg, smap, vars, subs, terms );
2124 }
2125 }
2126 }
2127
2128 void TheoremIndex::debugPrint( const char * c, unsigned ind ) {
2129 for( std::map< TNode, TheoremIndex >::iterator it = d_children.begin(); it != d_children.end(); ++it ){
2130 for( unsigned i=0; i<ind; i++ ){ Trace(c) << " "; }
2131 Trace(c) << it->first << std::endl;
2132 it->second.debugPrint( c, ind+1 );
2133 }
2134 if( !d_terms.empty() ){
2135 for( unsigned i=0; i<ind; i++ ){ Trace(c) << " "; }
2136 Trace(c) << "{";
2137 for( unsigned i=0; i<d_terms.size(); i++ ){
2138 Trace(c) << " " << d_terms[i];
2139 }
2140 Trace(c) << " }" << std::endl;
2141 }
2142 //if( !d_var.isNull() ){
2143 // for( unsigned i=0; i<ind; i++ ){ Trace(c) << " "; }
2144 // Trace(c) << "var:" << d_var << std::endl;
2145 //}
2146 }
2147
2148 bool ConjectureGenerator::optReqDistinctVarPatterns() { return false; }
2149 bool ConjectureGenerator::optFilterUnknown() { return true; } //may change
2150 int ConjectureGenerator::optFilterScoreThreshold() { return 1; }
2151 unsigned ConjectureGenerator::optFullCheckFrequency() { return 1; }
2152
2153 bool ConjectureGenerator::optStatsOnly() { return false; }
2154
2155 }