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
|
/*-----------------------------------------------------------------------
File : pcl_miniclauses.c
Author: Stephan Schulz
Contents
Functions dealing with minimal (compact clause representations.
Copyright 1998, 1999, 2002 by the author.
This code is released under the GNU General Public Licence and
the GNU Lesser General Public License.
See the file COPYING in the main E directory for details..
Run "eprover -h" for contact information.
Changes
<1> Fri Jan 29 17:20:30 MET 1999
New
-----------------------------------------------------------------------*/
#include "pcl_miniclauses.h"
/*---------------------------------------------------------------------*/
/* Global Variables */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Forward Declarations */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Internal Functions */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Exported Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: MiniClauseFree()
//
// Release the memory taken by a compact clause.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
void MiniClauseFree(MiniClause_p clause)
{
if(clause->lit_terms)
{
SizeFree(clause->sign, clause->literal_no*sizeof(short));
clause->sign = NULL;
SizeFree(clause->lit_terms, 2*clause->literal_no*sizeof(Term_p));
clause->lit_terms = NULL;
}
MiniClauseCellFree(clause);
}
/*-----------------------------------------------------------------------
//
// Function: MiniClauseAddTerms()
//
// Add the terms in term_clause to clause.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
void MiniClauseAddTerms(MiniClause_p clause, Clause_p term_clause)
{
int i;
Eqn_p literal;
assert(!clause->lit_terms);
assert(!clause->sign);
clause->literal_no = ClauseLiteralNumber(term_clause);
clause->lit_terms =
SizeMalloc(2*clause->literal_no*sizeof(Term_p));
clause->sign = SizeMalloc(clause->literal_no*sizeof(short));
for(i=0, literal = term_clause->literals; literal; i++, literal =
literal->next)
{
assert(i<clause->literal_no);
clause->sign[i] = EqnIsPositive(literal);
clause->lit_terms[(2*i)] = literal->lterm;
clause->lit_terms[(2*i)+1] = literal->rterm;
}
}
/*-----------------------------------------------------------------------
//
// Function: ClauseToMiniClause()
//
// Generate a compact clause represention from the normal one.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
MiniClause_p ClauseToMiniClause(Clause_p clause)
{
MiniClause_p handle = MiniClauseCellAlloc();
int i;
Eqn_p literal;
/* handle->properties = CPIgnoreProps; */
handle->lit_terms = NULL;
handle->sign = NULL;
handle->literal_no = ClauseLiteralNumber(clause);
if(handle->literal_no)
{
handle->lit_terms = SizeMalloc(2*ClauseLiteralNumber(clause)*sizeof(Term_p));
handle->sign = SizeMalloc(ClauseLiteralNumber(clause)*sizeof(short));
for(i=0, literal = clause->literals; literal; i++, literal =
literal->next)
{
assert(i<handle->literal_no);
handle->sign[i] = EqnIsPositive(literal);
handle->lit_terms[(2*i)] = literal->lterm;
handle->lit_terms[(2*i)+1] = literal->rterm;
}
}
return handle;
}
/*-----------------------------------------------------------------------
//
// Function: MiniClauseToClause()
//
// Given a compact clause, create the corresponding normal clause.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
Clause_p MiniClauseToClause(MiniClause_p clause, TB_p bank)
{
Eqn_p list=NULL, *eqn = &list;
Clause_p handle;
int i;
for(i=0; i<clause->literal_no; i++)
{
*eqn = EqnAlloc(clause->lit_terms[(2*i)],
clause->lit_terms[(2*i)+1],
bank, clause->sign[i]);
eqn = &((*eqn)->next);
}
handle = ClauseAlloc(list);
return handle;
}
/*-----------------------------------------------------------------------
//
// Function: MinifyClause()
//
// As ClauseToMiniClause(), but destroy original.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
MiniClause_p MinifyClause(Clause_p clause)
{
MiniClause_p handle = ClauseToMiniClause(clause);
ClauseFree(clause);
return handle;
}
/*-----------------------------------------------------------------------
//
// Function: UnMinifyClause()
//
// As MiniClauseToClause(), but destroy original.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
Clause_p UnMinifyClause(MiniClause_p clause, TB_p bank)
{
Clause_p handle = MiniClauseToClause(clause, bank);
MiniClauseFree(clause);
return handle;
}
/*-----------------------------------------------------------------------
//
// Function: MiniClausePrint()
//
// Print a compact clause. Not the best way, but the easiest!
//
// Global Variables: -
//
// Side Effects : Output, memory operations.
//
/----------------------------------------------------------------------*/
void MiniClausePrint(FILE* out, MiniClause_p compact, TB_p bank, bool
full_terms)
{
Clause_p clause;
clause = MiniClauseToClause(compact, bank);
ClausePrint(out, clause, full_terms);
ClauseFree(clause);
}
/*-----------------------------------------------------------------------
//
// Function: MiniClausePCLPrint()
//
// Print the clause in PCL format, i.e. as a literal list.
//
// Global Variables: -
//
// Side Effects : Output, memory operations.
//
/----------------------------------------------------------------------*/
void MiniClausePCLPrint(FILE* out, MiniClause_p compact, TB_p bank)
{
Clause_p clause;
clause = MiniClauseToClause(compact, bank);
ClausePCLPrint(out, clause, true);
ClauseFree(clause);
}
/*-----------------------------------------------------------------------
//
// Function: MiniClauseTSTPCorePrint()
//
// Print the core clause in TSTP format, i.e. as a literal list.
//
// Global Variables: -
//
// Side Effects : Output, memory operations.
//
/----------------------------------------------------------------------*/
void MiniClauseTSTPCorePrint(FILE* out, MiniClause_p compact, TB_p bank)
{
Clause_p clause;
clause = MiniClauseToClause(compact, bank);
ClauseTSTPCorePrint(out, clause, true);
ClauseFree(clause);
}
/*---------------------------------------------------------------------*/
/* End of File */
/*---------------------------------------------------------------------*/
|