File: ccl_axiomsorter.c

package info (click to toggle)
eprover 2.6%2Bds-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 21,288 kB
  • sloc: ansic: 331,111; csh: 12,026; python: 10,178; awk: 5,825; makefile: 461; sh: 389
file content (195 lines) | stat: -rw-r--r-- 4,696 bytes parent folder | download | duplicates (2)
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
/*-----------------------------------------------------------------------

File  : ccl_axiomsorter.c

Author: Stephan Schulz (schulz@eprover.org)

Contents

  Code implementing axiom sorting.

  Copyright 2009 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> Sun Jun 14 01:10:37 CEST 2009
    New

-----------------------------------------------------------------------*/

#include "ccl_axiomsorter.h"



/*---------------------------------------------------------------------*/
/*                        Global Variables                             */
/*---------------------------------------------------------------------*/


/*---------------------------------------------------------------------*/
/*                      Forward Declarations                           */
/*---------------------------------------------------------------------*/


/*---------------------------------------------------------------------*/
/*                         Internal Functions                          */
/*---------------------------------------------------------------------*/



/*---------------------------------------------------------------------*/
/*                         Exported Functions                          */
/*---------------------------------------------------------------------*/


/*-----------------------------------------------------------------------
//
// Function: WAxiomAlloc()
//
//   Allocate and initialze a weighted axiom cell.
//
// Global Variables: -
//
// Side Effects    : Memory operations
//
/----------------------------------------------------------------------*/

WAxiom_p WAxiomAlloc(void* axiom, AxiomType type)
{
   WAxiom_p ax = WAxiomCellAlloc();

   ax->weight = 0.0;
   switch(type)
   {
   case ClauseAxiom:
         ax->ax.clause = axiom;
         break;
   case FormulaAxiom:
         ax->ax.form = axiom;
         break;
   default:
         assert(false);
   }
   return ax;
}


/*-----------------------------------------------------------------------
//
// Function: WAxiomAddRelEval()
//
//   Given a vector of relevance levels for the symbols, assign a
//   clause or formula (in a WAxiom data structure) the average
//   relevancy of its symbols.
//
// Global Variables: -
//
// Side Effects    : Memory operations
//
/----------------------------------------------------------------------*/

void WAxiomAddRelEval(WAxiom_p ax, Sig_p sig, PDArray_p rel_vec)
{
   PStack_p      f_codes = PStackAlloc();
   double        sum = 0.0;
   long          count = 0, rel;
   FunCode       f;
   PStackPointer i;

   switch(ax->type)
   {
   case ClauseAxiom:
         ClauseReturnFCodes(ax->ax.clause, f_codes);
         break;
   case FormulaAxiom:
         WFormulaReturnFCodes(ax->ax.form, f_codes);
         break;
   default:
         assert(false);
   }
   for(i=0; i<PStackGetSP(f_codes); i++)
   {
      f = PStackElementInt(f_codes, i);
      if(!SigIsSpecial(sig, f))
      {
         rel = PDArrayElementInt(rel_vec, f);
         if(rel)
         {
            sum+= rel;
            count++;
         }
      }
   }
   if(count)
   {
      ax->weight = sum/count;
   }
   PStackFree(f_codes);
}



/*-----------------------------------------------------------------------
//
// Function: WAxiomCmp()
//
//   Compare two WAxioms by weight, with some extra work to make the
//   ordering total.
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

int WAxiomCmp(WAxiom_p s1, WAxiom_p s2)
{
   if(s1->weight < s2->weight)
   {
      return -1;
   }
   if(s1->weight > s2->weight)
   {
      return 1;
   }
   if(s1->type < s2->type)
   {
      return -1;
   }
   if(s1->type > s2->type)
   {
      return 1;
   }
   return PCmp(s1, s2);
}

/*-----------------------------------------------------------------------
//
// Function: WAxiomCmpWrapper()
//
//   Compare two IntOrP's pointing to WAxioms by WAxiom weight.
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

int WAxiomCmpWrapper(const void* s1, const void* s2)
{
   const IntOrP* step1 = (const IntOrP*) s1;
   const IntOrP* step2 = (const IntOrP*) s2;

   return WAxiomCmp(step1->p_val, step2->p_val);
}


/*---------------------------------------------------------------------*/
/*                        End of File                                  */
/*---------------------------------------------------------------------*/