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
|
/**************************************************************/
/* ********************************************************** */
/* * * */
/* * CONVERTER FROM DFG SYNTAX TO OTTER SYNTAX * */
/* * * */
/* * $Module: DFG2OTTER * */
/* * * */
/* * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001 * */
/* * MPI fuer Informatik * */
/* * * */
/* * This program is free software; you can redistribute * */
/* * it and/or modify it under the terms of the FreeBSD * */
/* * Licence. * */
/* * * */
/* * This program is distributed in the hope that it will * */
/* * be useful, but WITHOUT ANY WARRANTY; without even * */
/* * the implied warranty of MERCHANTABILITY or FITNESS * */
/* * FOR A PARTICULAR PURPOSE. See the LICENCE file * */
/* * for more details. * */
/* * * */
/* * * */
/* $Revision: 1.7 $ * */
/* $State: Exp $ * */
/* $Date: 2010-02-22 14:09:57 $ * */
/* $Author: weidenb $ * */
/* * * */
/* * Contact: * */
/* * Christoph Weidenbach * */
/* * MPI fuer Informatik * */
/* * Stuhlsatzenhausweg 85 * */
/* * 66123 Saarbruecken * */
/* * Email: spass@mpi-inf.mpg.de * */
/* * Germany * */
/* * * */
/* ********************************************************** */
/**************************************************************/
/* $RCSfile: dfg2otter.c,v $ */
/*** MAINLOOP *************************************************/
/**************************************************************/
/* Includes */
/**************************************************************/
#include "dfg.h"
#include "foldfg.h"
#include "clause.h"
#include "cmdline.h"
#include "eml.h"
#include "description.h"
#include <errno.h>
#define DFG2OTTER__VERSION "0.9"
/**************************************************************/
/* Main Function */
/**************************************************************/
int main(int argc, const char* argv[])
{
LIST Scan, Scan1, Clauses, AxiomList,ConjectureList, SortList,
UserPrecedence,UserSelection,ClAxRelation;
FILE *Output,*Input;
const char *Filename;
char ConLabel[] = "Conjecture";
FLAGSTORE Flags;
PRECEDENCE Precedence;
BOOL HasPlainClauses;
DFGDESCRIPTION Description;
memory_Init(memory__UNLIMITED);
atexit(memory_FreeAllMem);
symbol_Init(TRUE);
stack_Init();
term_Init();
flag_Init(flag_SPASS);
Flags = flag_CreateStore();
flag_InitStoreByDefaults(Flags);
Precedence = symbol_CreatePrecedence();
Description = desc_Create();
fol_Init(TRUE, Precedence);
eml_Init(Precedence);
clause_Init();
cmdlne_Init();
if (!cmdlne_Read(argc, argv))
return EXIT_FAILURE;
if (!cmdlne_SetFlags(Flags))
return EXIT_FAILURE;
if (!flag_GetFlagIntValue(Flags, flag_STDIN) &&
(cmdlne_GetInputFile() == (char*)NULL || cmdlne_GetOutputFile() == (char*)NULL )) {
fputs("\n\t dfg2otter Version ", stdout);
fputs(DFG2OTTER__VERSION, stdout);
puts("\n\t Usage: dfg2otter [options] <input-file> <output-file>\n");
return EXIT_FAILURE;
}
AxiomList = list_Nil();
ConjectureList = list_Nil();
SortList = list_Nil();
UserPrecedence = list_Nil();
UserSelection = list_Nil();
ClAxRelation = list_Nil();
if (!flag_GetFlagIntValue(Flags, flag_STDIN)) {
Input = misc_OpenFile(cmdlne_GetInputFile(),"r");
Clauses = dfg_DFGParser(Input,Flags,Precedence,Description,&AxiomList,&ConjectureList,
&SortList, &UserPrecedence, &UserSelection, &ClAxRelation, &HasPlainClauses);
misc_CloseFile(Input,cmdlne_GetInputFile());
if (flag_GetFlagIntValue(Flags, flag_EML)) {
misc_StartUserErrorReport();
misc_UserErrorReport("\n The input file contains EML formulae. Please perfrom a translation to FOL by FLOTTER first!\n\n");
misc_FinishUserErrorReport();
}
AxiomList = list_Nconc(AxiomList, SortList);
if (!list_Empty(ConjectureList)) {
/* Build conjecture formula and negate it: conjectures are taken disjunctively!!*/
for (Scan = ConjectureList; !list_Empty(Scan); Scan = list_Cdr(Scan))
list_Rplacd(list_Car(Scan), (LIST)term_Create(fol_Not(),
list_List(list_PairSecond(list_Car(Scan)))));
if (!list_Empty(list_Cdr(ConjectureList))) {
for (Scan = ConjectureList; !list_Empty(Scan); Scan = list_Cdr(Scan)) {
Scan1 = list_Car(Scan);
list_Rplaca(Scan, list_PairSecond(list_Car(Scan)));
if (list_PairFirst(Scan1) != NULL)
string_StringFree(list_PairFirst(Scan1)); /* Free the label */
list_PairFree(Scan1); /* Free the pair */
}
ConjectureList = list_List(list_PairCreate(string_StringCopy(ConLabel),
term_Create(fol_Or(), ConjectureList)));
}
}
AxiomList = list_Nconc(ConjectureList, AxiomList);
Filename = cmdlne_GetOutputFile();
Output = misc_OpenFile(Filename,"w");
fputs("\n% Generated by dfg2otter ", Output);
fputs(DFG2OTTER__VERSION, Output);
if (list_Empty(AxiomList))
clause_FPrintCnfOtter(Output, Clauses, Flags);
else
fol_FPrintOtter(Output, AxiomList,
flag_GetFlagIntValue(Flags, flag_TDFG2OTTEROPTIONS));
dfg_DeleteFormulaPairList(AxiomList);
misc_CloseFile(Output,Filename);
}
else {
Clauses = dfg_DFGParser(stdin,Flags,Precedence,Description,&AxiomList,&ConjectureList,
&SortList, &UserPrecedence, &UserSelection, &ClAxRelation, &HasPlainClauses);
if (flag_GetFlagIntValue(Flags, flag_EML)) {
misc_StartUserErrorReport();
misc_UserErrorReport("\n The input file contains EML formulae. Please perfrom a translation to FOL by FLOTTER first!\n");
misc_FinishUserErrorReport();
}
AxiomList = list_Nconc(AxiomList, SortList);
if (!list_Empty(ConjectureList)) {
/* Build conjecture formula and negate it: conjectures are taken disjunctively!!*/
for (Scan = ConjectureList; !list_Empty(Scan); Scan = list_Cdr(Scan))
list_Rplacd(list_Car(Scan), (LIST)term_Create(fol_Not(),
list_List(list_PairSecond(list_Car(Scan)))));
if (!list_Empty(list_Cdr(ConjectureList))) {
for (Scan = ConjectureList; !list_Empty(Scan); Scan = list_Cdr(Scan)) {
Scan1 = list_Car(Scan);
list_Rplaca(Scan, list_PairSecond(list_Car(Scan)));
if (list_PairFirst(Scan1) != NULL)
string_StringFree(list_PairFirst(Scan1)); /* Free the label */
list_PairFree(Scan1); /* Free the pair */
}
ConjectureList = list_List(list_PairCreate(string_StringCopy(ConLabel),
term_Create(fol_Or(), ConjectureList)));
}
}
AxiomList = list_Nconc(ConjectureList, AxiomList);
Output = stdout;
fputs("\n% Generated by dfg2otter ", Output);
fputs(DFG2OTTER__VERSION, Output);
if (list_Empty(AxiomList))
clause_FPrintCnfOtter(Output, Clauses, Flags);
else
fol_FPrintOtter(Output, AxiomList,
flag_GetFlagIntValue(Flags, flag_TDFG2OTTEROPTIONS));
dfg_DeleteFormulaPairList(AxiomList);
}
clause_DeleteClauseList(Clauses);
/*symbol_Dump();*/
eml_Free();
flag_DeleteStore(Flags);
symbol_DeletePrecedence(Precedence);
list_Delete(UserPrecedence);
list_Delete(UserSelection);
dfg_DeleteClAxRelation(ClAxRelation);
desc_Delete(Description);
cmdlne_Free();
fol_Free();
symbol_FreeAllSymbols();
#ifdef CHECK
memory_Print();
#endif
return 0;
}
|
