## TSTP Solution File: LAT270-2 by DCTP---1.31

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : DCTP---1.31
% Problem  : LAT270-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm  : none
% Format   : oldtptp
% Command  : dctp-wrapper -negpref -complexity -fullrewrite -alternate -resisol %s

% Computer : art04.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec  4 06:16:44 EST 2010

% Result   : Unsatisfiable 0.00s
% Output   : Assurance 0.00s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% running dctp on problem file LAT270-2.oldtptp on host art04.cs.miami.edu
% starting preprocessing loop for 5 clauses
% starting preprocessing loop for 4 clauses
% no all negative clause in formula
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is in Bernays-Schönfinkel class
% input formula is Horn
% problem statistics for file /tmp/SystemOnTPTP16956/LAT270-2.oldtptp
%   	Syntax :	Number of clauses :	3 ( 0 non-Horn; 2 unit)
%   			Number of literals :	3 ( 0 equality)
%   			Maximal clause size :	1
%   			Number of predicates :	2 ( 1 propositional; 0-3 arity)
%   			Number of functors :	4 ( 4 constant; 0-0 arity)
%   			Number of variables :	0 ( 0 singleton)
%   			Maximal term depth :	2
% complementary unit pair generated by formula preprocessing.
% **************** Exit status is success (PROOF found in 0.0 seconds) ****************
%
%------------------------------------------------------------------------------
```