<s>
Paradox	B-Application
is	O
a	O
finite-domain	O
model	O
finder	O
for	O
pure	O
first-order	O
logic	O
(	O
FOL	O
)	O
with	O
equality	O
developed	O
by	O
Koen	O
Lindström	O
Claessen	O
and	O
Niklas	O
Sörensson	O
at	O
the	O
Chalmers	O
University	O
of	O
Technology	O
.	O
</s>
<s>
It	O
can	O
a	O
participate	O
as	O
part	O
of	O
an	O
automated	B-Application
theorem	I-Application
proving	I-Application
system	O
.	O
</s>
<s>
The	O
software	O
is	O
primarily	O
written	O
in	O
the	O
Haskell	B-Language
programming	I-Language
language	I-Language
.	O
</s>
<s>
It	O
is	O
released	O
under	O
the	O
terms	O
of	O
the	O
GNU	B-License
General	I-License
Public	I-License
License	I-License
and	O
is	O
free	O
.	O
</s>
<s>
The	O
Paradox	B-Application
developers	O
described	O
the	O
software	O
as	O
a	O
Mace-style	O
method	O
after	O
the	O
McCune	O
's	O
tool	O
of	O
that	O
name	O
.	O
</s>
<s>
Paradox	B-Application
was	O
developed	O
up	O
to	O
version	O
4	O
,	O
the	O
final	O
version	O
being	O
effective	O
in	O
model	O
finding	O
for	O
Web	B-Language
Ontology	I-Language
Language	I-Language
OWL2	O
.	O
</s>
<s>
Paradox	B-Application
was	O
a	O
division	O
winner	O
in	O
the	O
annual	O
CADE	B-General_Concept
ATP	I-General_Concept
System	I-General_Concept
Competition	I-General_Concept
,	O
an	O
annual	O
contest	O
for	O
automated	B-Application
theorem	I-Application
proving	I-Application
,	O
in	O
the	O
years	O
2003	O
to	O
2012	O
.	O
</s>
