-
Notifications
You must be signed in to change notification settings - Fork 35
/
codi_down_theoremsep-e1.par.out
141 lines (125 loc) · 3.56 KB
/
codi_down_theoremsep-e1.par.out
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
Paradox, version 3.0, 2008-07-29.
+++ PROBLEM: C:\Users\torsten\Documents\github\colore\ontologies\multidim_mereotopology_codi\theorems\conversions\codi_down_theoremsep-e1.all.tptp
Reading 'C:\Users\torsten\Documents\github\colore\ontologies\multidim_mereotopology_codi\theorems\conversions\codi_down_theoremsep-e1.all.tptp' ... OK
+++ SOLVING: C:\Users\torsten\Documents\github\colore\ontologies\multidim_mereotopology_codi\theorems\conversions\codi_down_theoremsep-e1.all.tptp
domain size 1
domain size 2
+++ BEGIN MODEL
SZS output start FiniteModel for C:\Users\torsten\Documents\github\colore\ontologies\multidim_mereotopology_codi\theorems\conversions\codi_down_theoremsep-e1.all.tptp
% domain size is 2
fof(domain, fi_domain,
(![X] : (X = "1" | X = "2"))
).
fof(c, fi_predicates,
( c("1","1") <=> $false
& c("1","2") <=> $false
& c("2","1") <=> $false
& c("2","2") <=> $true
)
).
fof(cont, fi_predicates,
( cont("1","1") <=> $false
& cont("1","2") <=> $false
& cont("2","1") <=> $false
& cont("2","2") <=> $true
)
).
fof(covers, fi_predicates,
( covers("1","1") <=> $false
& covers("1","2") <=> $false
& covers("2","1") <=> $true
& covers("2","2") <=> $false
)
).
fof(difference, fi_functors,
( difference("1","1") = "1"
& difference("1","2") = "1"
& difference("2","1") = "2"
& difference("2","2") = "1"
)
).
fof(eqdim, fi_predicates,
( eqdim("1","1") <=> $true
& eqdim("1","2") <=> $false
& eqdim("2","1") <=> $false
& eqdim("2","2") <=> $true
)
).
fof(geq, fi_predicates,
( geq("1","1") <=> $true
& geq("1","2") <=> $false
& geq("2","1") <=> $true
& geq("2","2") <=> $true
)
).
fof(gt, fi_predicates,
( gt("1","1") <=> $false
& gt("1","2") <=> $false
& gt("2","1") <=> $true
& gt("2","2") <=> $false
)
).
fof(intersection, fi_functors,
( intersection("1","1") = "1"
& intersection("1","2") = "1"
& intersection("2","1") = "1"
& intersection("2","2") = "2"
)
).
fof(leq, fi_predicates,
( leq("1","1") <=> $true
& leq("1","2") <=> $true
& leq("2","1") <=> $false
& leq("2","2") <=> $true
)
).
fof(lt, fi_predicates,
( lt("1","1") <=> $false
& lt("1","2") <=> $true
& lt("2","1") <=> $false
& lt("2","2") <=> $false
)
).
fof(maxdim, fi_predicates,
( maxdim("1") <=> $false
& maxdim("2") <=> $true
)
).
fof(mindim, fi_predicates,
( mindim("1") <=> $false
& mindim("2") <=> $true
)
).
fof(p, fi_predicates,
( p("1","1") <=> $false
& p("1","2") <=> $false
& p("2","1") <=> $false
& p("2","2") <=> $true
)
).
fof(po, fi_predicates,
( po("1","1") <=> $false
& po("1","2") <=> $false
& po("2","1") <=> $false
& po("2","2") <=> $true
)
).
fof(pp, fi_predicates,
( ![X1,X2] : pp(X1,X2) <=> $false
)
).
fof(zex, fi_predicates,
( zex("1") <=> $true
& zex("2") <=> $false
)
).
SZS output end FiniteModel for C:\Users\torsten\Documents\github\colore\ontologies\multidim_mereotopology_codi\theorems\conversions\codi_down_theoremsep-e1.all.tptp
+++ END MODEL
+++ RESULT: Satisfiable
SZS status Satisfiable for C:\Users\torsten\Documents\github\colore\ontologies\multidim_mereotopology_codi\theorems\conversions\codi_down_theoremsep-e1.all.tptp
============================= C:\Reasoning\paradox3 ================================
execution finished: Tue Apr 24 09:42:37 2018
total CPU time used: 0
The command was "C:\Reasoning\paradox3 --time 600 --verbose 2 --model --tstp C:\Users\torsten\Documents\github\colore\ontologies\multidim_mereotopology_codi\theorems\conversions\codi_down_theoremsep-e1.all.tptp"
Input read from
============================ end of footer ===========================