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
|
/*-----------------------------------------------------------------------
File : ccl_condensation.c
Author: Stephan Schulz (schulz@eprover.org)
Contents
Implementation of the condensation rule.
Copyright 2012 by the author.
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.
Changes
<1> New
-----------------------------------------------------------------------*/
#include "ccl_condensation.h"
/*---------------------------------------------------------------------*/
/* Global Variables */
/*---------------------------------------------------------------------*/
long CondensationAttempts = 0;
long CondensationSuccesses = 0;
/*---------------------------------------------------------------------*/
/* Forward Declarations */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Internal Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: try_condensation()
//
// Try to condense literals l1 and l2 in clause. If successful,
// modify clause and return true, otherwise return false.
//
// Global Variables: -
//
// Side Effects : Modification of clause
//
/----------------------------------------------------------------------*/
static bool try_condensation(Clause_p clause, Eqn_p l1, Eqn_p l2, bool swap)
{
Subst_p subst = SubstAlloc();
Eqn_p newlits;
Clause_p cand;
bool res = false;
if(LiteralUnifyOneWay(l1, l2, subst, false))
{
newlits = EqnListCopyExcept(clause->literals,l2, l1->bank);
SubstBacktrack(subst);
EqnListRemoveDuplicates(newlits);
EqnListRemoveResolved(&newlits);
cand = ClauseAlloc(newlits);
cand->weight = ClauseStandardWeight(cand);
ClauseSubsumeOrderSortLits(cand);
if(ClauseSubsumesClause(cand, clause))
{
EqnListFree(clause->literals);
clause->literals = cand->literals;
ClauseRecomputeLitCounts(clause);
clause->weight = ClauseStandardWeight(clause);
cand->literals = NULL;
ClauseFree(cand);
res = true;
}
else
{
ClauseFree(cand);
}
}
SubstDelete(subst);
return res;
}
/*---------------------------------------------------------------------*/
/* Exported Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: CondenseOnce()
//
// Try to condense clause. If successful, simplify the clause, and
// return true. If not, the clause is unchanged and false is
// returned.
//
// Global Variables:
//
// Side Effects :
//
/----------------------------------------------------------------------*/
bool CondenseOnce(Clause_p clause)
{
Eqn_p l1, l2;
assert(ClauseIsSubsumeOrdered(clause));
for(l1=clause->literals; l1; l1=l1->next)
{
assert(l1);
for(l2=l1->next; l2; l2=l2->next)
{
if(try_condensation(clause, l1, l2, false))
{
return true;
}
if((!EqnIsOriented(l1))||(!EqnIsOriented(l2)))
{
if(try_condensation(clause, l1, l2, true))
{
return true;
}
}
}
}
return false;
}
/*-----------------------------------------------------------------------
//
// Function: Condense()
//
// Condense a clause as much as possible. Return true if the clause
// was changed, false otherwise.
//
// Global Variables:
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool Condense(Clause_p clause)
{
bool res = false;
CondensationAttempts++;
if((clause->pos_lit_no > 1) || (clause->neg_lit_no >1))
{
clause->weight = ClauseStandardWeight(clause);
ClauseSubsumeOrderSortLits(clause);
while(CondenseOnce(clause))
{
res = true;
}
if(res)
{
CondensationSuccesses++;
DocClauseModificationDefault(clause, inf_condense, NULL);
ClausePushDerivation(clause, DCCondense, NULL, NULL);
}
}
return res;
}
/*---------------------------------------------------------------------*/
/* End of File */
/*---------------------------------------------------------------------*/
|
