1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089
|
/*-----------------------------------------------------------------------
File : ccl_satinterface.c
Author: Stephan Schulz (schulz@eprover.org)
Contents
Functions for efficient conversion of the proof state to
propositional clauses and submission to a SAT solver.
Copyright 2017 by the authors.
This code is released under the GNU General Public Licence.
See the file COPYING in the main CLIB directory for details.
Run "eprover -h" for contact information.
Created: Sat Sep 16 16:52:43 CEST 2017
-----------------------------------------------------------------------*/
#include "ccl_satinterface.h"
#include <cte_idx_fp.h>
/*---------------------------------------------------------------------*/
/* Global Variables */
/*---------------------------------------------------------------------*/
#define PICOSAT_BUFSIZE 200
char* GroundingStratNames[] =
{
"NoGrounding",
"PseudoVar",
"FirstConst",
"ConjMinMinFreq",
"ConjMaxMinFreq",
"ConjMinMaxFreq",
"ConjMaxMaxFreq",
"GlobalMax",
"GlobalMin",
NULL
};
/*---------------------------------------------------------------------*/
/* Forward Declarations */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Internal Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: sat_translate_literal()
//
// Translate a full E literal into a propositional literal.
//
// Global Variables: -
//
// Side Effects : May alloc and/or updare renumber index, memory
// operations, inserts terms into eqn->bank.
//
/----------------------------------------------------------------------*/
int sat_translate_literal(Eqn_p eqn, SatClauseSet_p set)
{
int atom = 0;
long lit_code;
Term_p lterm, rterm, lit_term;
assert(eqn);
assert(set);
if(EqnIsEquLit(eqn))
{
lterm = TBInsertInstantiated(eqn->bank, eqn->lterm);
rterm = TBInsertInstantiated(eqn->bank, eqn->rterm);
// We normalize literals to avoid spurious failures
if(PGreater(lterm, rterm))
{
lit_term = EqnTermsTBTermEncode(eqn->bank, lterm, rterm, true, PENormal);
}
else
{
lit_term = EqnTermsTBTermEncode(eqn->bank, lterm, rterm, true, PEReverse);
}
}
else
{
lit_term = TBInsertInstantiated(eqn->bank, eqn->lterm);
}
lit_code = lit_term->entry_no;
if(!set->renumber_index)
{
set->renumber_index = PDRangeArrAlloc(lit_code, 0);
}
atom = PDRangeArrElementInt(set->renumber_index, lit_code);
if(!atom)
{
atom = ++set->max_lit;
PDRangeArrAssignInt(set->renumber_index, lit_code, atom);
}
if(EqnIsPositive(eqn))
{
return atom;
}
return -atom;
}
/*-----------------------------------------------------------------------
//
// Function: litstate_add_satclause()
//
// Add the literals of a clause to the literal state array (bit 0
// indicates presence of positive instances of the atom, bit 1
// represents pesence of negative instances).
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
static void litstate_add_satclause(int* state, SatClause_p clause)
{
int i, lit;
assert(state);
assert(clause);
for(i=0; i<clause->lit_no; i++)
{
lit = clause->literals[i];
if(lit > 0)
{
state[lit] |= 1;
}
else
{
state[-lit] |= 2;
}
}
}
/*-----------------------------------------------------------------------
//
// Function: litstate_check_pure()
//
// Given a SatClause and a literal state array, check if any of the
// literals in the clause is pure.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
static bool litstate_check_pure(int* state, SatClause_p clause)
{
int i, lit;
assert(state);
assert(clause);
for(i = 0; i<clause->lit_no; i++)
{
lit = clause->literals[i];
if(lit > 0)
{
assert(state[lit]);
if(state[lit]!=3)
{
return true;
}
}
else
{
assert(state[-lit]);
if(state[-lit]!=3)
{
return true;
}
}
}
return false;
}
/*-----------------------------------------------------------------------
//
// Function: prefer_conj_min_max_freq()
//
// Prefer conjecture symbols, among those the ones rarest in
// conjectures, and among those the ones most frequent overall,
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool prefer_conj_min_max_freq(FunCode f1, FunCode f2, long* conj_dist_array,
long* dist_array)
{
if(conj_dist_array[f1] && !conj_dist_array[f2])
{
return true;
}
if(!conj_dist_array[f1] && conj_dist_array[f2])
{
return false;
}
return (conj_dist_array[f1] < conj_dist_array[f2])||
((conj_dist_array[f1] = conj_dist_array[f2]) &&
(dist_array[f1] > dist_array[f2]));
}
/*-----------------------------------------------------------------------
//
// Function: prefer_conj_max_max_freq()
//
// Prefer symbols based on lexicographic comparision of conjecture
// count, total count.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool prefer_conj_max_max_freq(FunCode f1, FunCode f2, long* conj_dist_array,
long* dist_array)
{
return (conj_dist_array[f1] > conj_dist_array[f2])||
((conj_dist_array[f1] = conj_dist_array[f2]) &&
(dist_array[f1] > dist_array[f2]));
}
/*-----------------------------------------------------------------------
//
// Function: prefer_conj_min_min_freq()
//
// Prefer conjecture symbols, among those rare conjecture symbols,
// and among those overall rare symbols.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool prefer_conj_min_min_freq(FunCode f1, FunCode f2, long* conj_dist_array,
long* dist_array)
{
if(conj_dist_array[f1] && !conj_dist_array[f2])
{
return true;
}
if(!conj_dist_array[f1] && conj_dist_array[f2])
{
return false;
}
return (conj_dist_array[f1] < conj_dist_array[f2])||
((conj_dist_array[f1] = conj_dist_array[f2]) &&
(dist_array[f1] < dist_array[f2]));
}
/*-----------------------------------------------------------------------
//
// Function: prefer_conj_max_min_freq()
//
// Prefer symbols based on lexicographic comparision of conjecture
// count, -total count.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool prefer_conj_max_min_freq(FunCode f1, FunCode f2, long* conj_dist_array,
long* dist_array)
{
return (conj_dist_array[f1] > conj_dist_array[f2])||
((conj_dist_array[f1] = conj_dist_array[f2]) &&
(dist_array[f1] < dist_array[f2]));
}
/*-----------------------------------------------------------------------
//
// Function: prefer_global_max_freq()
//
// Prefer most frequent symbol.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool prefer_global_max_freq(FunCode f1, FunCode f2, long* conj_dist_array,
long* dist_array)
{
return (dist_array[f1] > dist_array[f2]);
}
/*-----------------------------------------------------------------------
//
// Function: prefer_global_min_freq()
//
// Prefer least frequent symbol.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool prefer_global_min_freq(FunCode f1, FunCode f2, long* conj_dist_array,
long* dist_array)
{
return (dist_array[f1] < dist_array[f2]);
}
/*-----------------------------------------------------------------------
//
// Function: sat_clause_not_pure()
//
// Does the SAT clause have no pure literals?
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool sat_clause_not_pure(SatClause_p cl)
{
return !cl->has_pure_lit;
}
/*-----------------------------------------------------------------------
//
// Function: export_to_solver()
//
// Adds the clauses that satisfy filter to the solver state. filter
// can be NULL in which case all the clauses are added.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
void export_to_solver(SatSolver_p solver, SatClauseSet_p set, SatClauseFilter filter)
{
PStackPointer i;
SatClause_p clause;
assert(set);
PStackReset(set->exported);
for(i=0; i<PStackGetSP(set->set); i++)
{
clause = PStackElementP(set->set, i);
if(filter == NULL || filter(clause))
{
picosat_add_lits(solver, clause->literals);
PStackPushP(set->exported, clause);
}
}
if(PStackGetSP(set->exported) != picosat_added_original_clauses(solver))
{
Error("PicoSAT communication is broken.", INTERFACE_ERROR);
}
}
/*---------------------------------------------------------------------*/
/* Exported Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: SatClauseAlloc()
//
// Allocate an empty, unlinked propositional clause with space for a
// given number of literals. Allocates space for lit_no+1 literals,
// where the last literal is 0 (to support efficient integration with
// PicoSAT). Note that other literals are not initialized (not even to 0).
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
SatClause_p SatClauseAlloc(int lit_no)
{
SatClause_p handle = SatClauseCellAlloc();
handle->has_pure_lit = false;
handle->lit_no = lit_no;
handle->literals = SizeMalloc((lit_no+1)*sizeof(int));
handle->literals[handle->lit_no] = 0;
handle->source = NULL;
return handle;
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseFree()
//
// Free the SatClause.
//
// Global Variables: -
//
// Side Effects : Memory Operations
//
/----------------------------------------------------------------------*/
void SatClauseFree(SatClause_p junk)
{
assert(junk);
SizeFree(junk->literals, (junk->lit_no+1)*sizeof(int));
SatClauseCellFree(junk);
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseSetAlloc()
//
// Allocate a SatClauseSet. This is much less flexible than full
// clause sets (clauses can only be added), and also carries some
// admin information for the translation from normal clauses to
// propositional clauses.
//
// Global Variables: -
//
// Side Effects : Memory management
//
/----------------------------------------------------------------------*/
SatClauseSet_p SatClauseSetAlloc(void)
{
SatClauseSet_p set = SatClauseSetCellAlloc();
set->max_lit = 0;
set->renumber_index = NULL; // We create this lazily when we know
// the first index!
set->set = PStackAlloc();
set->exported = PStackAlloc();
set->core_size = 0;
set->set_size_limit = -1;
return set;
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseSetFree()
//
// Free a SatClauseSet (including the SatClauses).
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
void SatClauseSetFree(SatClauseSet_p junk)
{
assert(junk);
SatClause_p clause;
if(junk->renumber_index)
{
PDRangeArrFree(junk->renumber_index);
}
while(!PStackEmpty(junk->set))
{
clause = PStackPopP(junk->set);
SatClauseFree(clause);
}
PStackFree(junk->set);
PStackFree(junk->exported);
SatClauseSetCellFree(junk);
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseCreateAndStore()
//
// Encode the instantiated clause as a SatClause, store it in set,
// and return it.
// Global Variables:
//
// Side Effects :
//
/----------------------------------------------------------------------*/
SatClause_p SatClauseCreateAndStore(Clause_p clause, SatClauseSet_p set)
{
int i;
Eqn_p lit;
SatClause_p handle;
assert(clause);
assert(set);
if(set->set_size_limit != -1 &&
PStackGetSP(set->set) >= set->set_size_limit)
{
return NULL;
}
handle = SatClauseAlloc(ClauseLiteralNumber(clause));
handle->source = clause;
for(i=0, lit=clause->literals;
lit;
i++, lit=lit->next)
{
assert(i<handle->lit_no);
handle->literals[i] = sat_translate_literal(lit, set);
}
PStackPushP(set->set, handle);
return handle;
}
/*-----------------------------------------------------------------------
//
// Function: SatClausePrint()
//
// Print a sat clause in DIMACS format.
//
// Global Variables: -
//
// Side Effects : Output
//
/----------------------------------------------------------------------*/
void SatClausePrint(FILE* out, SatClause_p satclause)
{
int i;
assert(satclause);
for(i=0; i<satclause->lit_no; i++)
{
fprintf(out, "%d ", satclause->literals[i]);
}
fprintf(out, "0\n");
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseSetPrint()
//
// Print a SatClauseSet.
//
// Global Variables: -
//
// Side Effects : Output
//
/----------------------------------------------------------------------*/
void SatClauseSetPrint(FILE* out, SatClauseSet_p set)
{
PStackPointer i;
assert(set);
fprintf(out, "p cnf %d %ld\n", set->max_lit, PStackGetSP(set->set));
for(i=0; i<PStackGetSP(set->set); i++)
{
SatClausePrint(out, PStackElementP(set->set, i));
}
//printf("0\n");
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseSetExportToSolver()
//
// Exports all clauses to solver.
//
// Global Variables: -
//
// Side Effects : Output
//
/----------------------------------------------------------------------*/
void SatClauseSetExportToSolver(SatSolver_p solver, SatClauseSet_p set)
{
export_to_solver(solver, set, NULL);
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseSetImportClauseSet()
//
// Import all (instanciated) clauses from set into satset. Return
// number of clauses.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
long SatClauseSetImportClauseSet(SatClauseSet_p satset, ClauseSet_p set)
{
Clause_p handle;
assert(satset);
assert(set);
int added = 0;
for(handle = set->anchor->succ;
handle != set->anchor;
handle = handle->succ, added++)
{
if(!SatClauseCreateAndStore(handle, satset))
{
break;
}
}
return added;
}
/*-----------------------------------------------------------------------
//
// Function: SubstPseudoGroundVarBank()
//
// Create a substitution binding all variables of a given sort to
// the smallest (first) variable of that sort (to be interpreted as
// an anonymous constant - this can be seen as a complete
// (pseudo-)grounding of all terms, literals, and clauses using this
// variable bank.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
Subst_p SubstPseudoGroundVarBank(VarBank_p vars)
{
Subst_p subst = SubstAlloc();
VarBankStack_p varstack;
long i, j, size;
Term_p current, norm;
assert(vars);
for (i=0; i < PDArraySize(vars->varstacks); i++)
{
varstack = PDArrayElementP(vars->varstacks, i);
// printf("# varstack: %p\n", varstack);
if(varstack)
{
size = PStackGetSP(varstack);
// printf("# varstack size: %ld\n", size);
if(size)
{
norm = PStackElementP(varstack,0);
// printf("# varstack[1]: %p\n", norm);
for(j=0; j< size; j++)
{
current = PStackElementP(varstack,j);
// printf("# varstack[%ld]: %p\n", j, current);
if(current && !current->binding)
{
SubstAddBinding(subst, current, norm);
}
}
}
}
}
return subst;
}
/*-----------------------------------------------------------------------
//
// Function: SubstGroundVarBankFirstConst()
//
// Create a substitution binding each variable to the first constant
// of the proper sort.
//
// Global Variables: 0
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
Subst_p SubstGroundVarBankFirstConst(TB_p terms, bool norm_const)
{
Subst_p subst = SubstAlloc();
VarBank_p vars = terms->vars;
VarBankStack_p varstack;
long i, j, size;
Term_p current, norm, backup;
assert(vars);
for (i=0; i < PDArraySize(vars->varstacks); i++)
{
varstack = PDArrayElementP(vars->varstacks, i);
//printf("# varstack: %p\n", varstack);
if (varstack)
{
size = PStackGetSP(varstack);
//printf("# varstack size: %ld\n", size);
if(size)
{
backup = PStackElementP(varstack,0);
assert(backup->type->type_uid == i);
norm = TBGetFirstConstTerm(terms, backup->type);
if(!norm)
{
norm = backup;
}
else if(norm_const)
{
norm = TermFollowRWChain(norm);
}
// printf("# varstack[1]: %p\n", norm);
for(j=0; j< size; j++)
{
current = PStackElementP(varstack,j);
// printf("# varstack[%ld]: %p\n", j, current);
if(current && !current->binding)
{
SubstAddBinding(subst, current, norm);
}
}
}
}
}
return subst;
}
/*-----------------------------------------------------------------------
//
// Function: SubstGroundFreqBased()
//
// Generate a grounding substitution using occurrence-count based
// preference functions.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
Subst_p SubstGroundFreqBased(TB_p terms, ClauseSet_p clauses,
FunConstCmpFunType is_better, bool norm_const)
{
Subst_p subst = SubstAlloc();
VarBank_p vars = terms->vars;
VarBankStack_p varstack;
long sort, j, size, dist_arr_size;
Term_p current, norm, backup;
long *conj_dist_array, *dist_array;
assert(vars);
dist_arr_size = (terms->sig->f_count+1) * sizeof(long);
conj_dist_array = SizeMalloc(dist_arr_size);
dist_array = SizeMalloc(dist_arr_size);
memset(conj_dist_array, 0, dist_arr_size);
memset(dist_array, 0, dist_arr_size);
ClauseSetAddSymbolDistribution(clauses, dist_array);
ClauseSetAddConjSymbolDistribution(clauses, conj_dist_array);
for (sort=0; sort < PDArraySize(vars->varstacks); sort++)
{
varstack = PDArrayElementP(vars->varstacks, sort);
//printf("# varstack: %p\n", varstack);
if (varstack)
{
size = PStackGetSP(varstack);
//printf("# varstack size: %ld\n", size);
if(size)
{
backup = PStackElementP(varstack,0);
assert(backup->type->type_uid == sort);
norm = TBGetFreqConstTerm(terms, backup->type,
conj_dist_array, dist_array, is_better);
if(!norm)
{
norm = backup;
}
else if(norm_const)
{
norm = TermFollowRWChain(norm);
}
// printf("# varstack[1]: %p\n", norm);
for(j=0; j< size; j++)
{
current = PStackElementP(varstack,j);
// printf("# varstack[%ld]: %p\n", j, current);
if(current)
{
SubstAddBinding(subst, current, norm);
}
}
}
}
}
SizeFree(conj_dist_array, dist_arr_size);
SizeFree(dist_array, dist_arr_size);
return subst;
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseSetExportToSolverNonPure()
//
// Exports non-pure clauses to solver.
//
// Global Variables: -
//
// Side Effects : Output
//
/----------------------------------------------------------------------*/
void SatClauseSetExportToSolverNonPure(SatSolver_p solver, SatClauseSet_p set)
{
export_to_solver(solver, set, sat_clause_not_pure);
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseSetImportProofState()
//
// Import the all pseudo-grounded clauses in the proof state into
// satset.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
long SatClauseSetImportProofState(SatClauseSet_p satset, ProofState_p state,
GroundingStrategy strat, bool norm_const)
{
long res = 0;
Subst_p pseudogroundsubst = NULL;
assert(satset);
assert(state);
//printf("# SatClauseSetImportProofState()\n");
switch(strat)
{
case GMPseudoVar:
pseudogroundsubst = SubstPseudoGroundVarBank(state->terms->vars);
break;
case GMFirstConst:
pseudogroundsubst = SubstGroundVarBankFirstConst(state->terms,
norm_const);
break;
case GMConjMinMinFreq:
pseudogroundsubst = SubstGroundFreqBased(state->terms,
state->axioms,
prefer_conj_min_min_freq,
norm_const);
break;
case GMConjMaxMinFreq:
pseudogroundsubst = SubstGroundFreqBased(state->terms,
state->axioms,
prefer_conj_max_min_freq,
norm_const);
break;
case GMConjMinMaxFreq:
pseudogroundsubst = SubstGroundFreqBased(state->terms,
state->axioms,
prefer_conj_min_max_freq,
norm_const);
break;
case GMConjMaxMaxFreq:
pseudogroundsubst = SubstGroundFreqBased(state->terms,
state->axioms,
prefer_conj_max_max_freq,
norm_const);
break;
case GMGlobalMax:
pseudogroundsubst = SubstGroundFreqBased(state->terms,
state->axioms,
prefer_global_max_freq,
norm_const);
break;
case GMGlobalMin:
pseudogroundsubst = SubstGroundFreqBased(state->terms,
state->axioms,
prefer_global_min_freq,
norm_const);
break;
default:
assert(false && "Unimplemented grounding strategy");
break;
}
// printf("# Pseudogrounded()\n");
res += SatClauseSetImportClauseSet(satset, state->processed_pos_rules);
res += SatClauseSetImportClauseSet(satset, state->processed_pos_eqns);
res += SatClauseSetImportClauseSet(satset, state->processed_neg_units);
res += SatClauseSetImportClauseSet(satset, state->processed_non_units);
res += SatClauseSetImportClauseSet(satset, state->unprocessed);
SubstDelete(pseudogroundsubst);
return res;
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseSetMarkPure()
//
// Mark all clauses in satset that have pure literals.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
long SatClauseSetMarkPure(SatClauseSet_p satset)
{
long pure_clauses = 0;
int *litstate;
PStackPointer i;
SatClause_p clause;
assert(satset);
litstate = SizeMalloc(sizeof(int)*(satset->max_lit+1));
memset(litstate, 0, sizeof(int)*(satset->max_lit+1));
for(i=0; i< PStackGetSP(satset->set); i++)
{
clause = PStackElementP(satset->set, i);
litstate_add_satclause(litstate, clause);
clause->has_pure_lit = false;
}
for(i=0; i< PStackGetSP(satset->set); i++)
{
clause = PStackElementP(satset->set, i);
if(litstate_check_pure(litstate, clause))
{
clause->has_pure_lit = true;
pure_clauses++;
}
}
SizeFree(litstate, sizeof(int)*(satset->max_lit+1));
return pure_clauses;
}
/*-----------------------------------------------------------------------
//
// Function: sat_extract_core()
//
// Extracts the original clauses pointing to the unsatisfiable core
// and pushes them onto core.
//
// Global Variables: -
//
// Side Effects : Reads input
//
/----------------------------------------------------------------------*/
long sat_extract_core(SatClauseSet_p satset, PStack_p core, SatSolver_p solver)
{
SatClause_p satclause;
long nr_exported = PStackGetSP(satset->exported);
long res = 0;
for(long id=0; id<nr_exported; id++)
{
if(picosat_coreclause(solver, id))
{
res++;
satclause = PStackElementP(satset->exported, id);
PStackPushP(core, satclause->source);
}
}
return res;
}
/*-----------------------------------------------------------------------
//
// Function: SatClauseSetCheckUnsat()
//
// Check the satset for unsatisfiability. Return the empty clause if
// unsat can be shown, NULL otherwise.
//
// Global Variables: -
//
// Side Effects : Runs external SAT solver, file operations, ...
//
/----------------------------------------------------------------------*/
ProverResult SatClauseSetCheckUnsat(SatClauseSet_p satset, Clause_p *empty,
SatSolver_p solver,
int sat_check_decision_limit)
{
ProverResult res;
int solverres;
Clause_p parent;
SatClauseSetMarkPure(satset);
SatClauseSetExportToSolverNonPure(solver, satset);
//printf("# XXXXX Decision level: %d\n", sat_check_decision_limit);
solverres = picosat_sat(solver, sat_check_decision_limit);
//printf("# YYYYY Solver done\n");
switch(solverres)
{
case PICOSAT_SATISFIABLE:
res = PRSatisfiable;
break;
case PICOSAT_UNSATISFIABLE:
res = PRUnsatisfiable;
break;
default:
res = PRGaveUp;
}
if(res == PRUnsatisfiable)
{
PStack_p unsat_core = PStackAlloc();
fprintf(GlobalOut, "# SatCheck found unsatisfiable ground set\n");
*empty = EmptyClauseAlloc();
sat_extract_core(satset, unsat_core, solver);
satset->core_size = PStackGetSP(unsat_core);
parent = PStackPopP(unsat_core);
ClausePushDerivation(*empty, DCSatGen, parent, NULL);
while(!PStackEmpty(unsat_core))
{
parent = PStackPopP(unsat_core);
ClausePushDerivation(*empty, DCCnfAddArg, parent, NULL);
}
PStackFree(unsat_core);
}
return res;
}
/*---------------------------------------------------------------------*/
/* End of File */
/*---------------------------------------------------------------------*/
|