%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SWC262+1 : TPTP v3.4.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art05.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.17-1.2142_FC4
% CPULimit : 600s
% DateTime : Wed May  6 16:13:59 EDT 2009

% Result   : Theorem 1.9s
% Output   : Refutation 1.9s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    5 (   4 unt;   0 def)
%            Number of atoms       :   12 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :    9 (   2   ~;   0   |;   7   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(co1,plain,
    ( sslist(u)
    & sslist(v)
    & sslist(w)
    & sslist(x)
    & $equal(x,v)
    & $equal(w,u)
    & totalorderedp(w)
    & ~ totalorderedp(u) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC262+1.tptp',unknown),
    [] ).

cnf(154274272,plain,
    totalorderedp(w),
    inference(rewrite,[status(thm)],[co1]),
    [] ).

cnf(154261400,plain,
    ~ totalorderedp(u),
    inference(rewrite,[status(thm)],[co1]),
    [] ).

cnf(154286792,plain,
    $equal(w,u),
    inference(rewrite,[status(thm)],[co1]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__paramodulation,[status(thm)],[154274272,154261400,154286792,theory(equality)]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 2 seconds
% START OF PROOF SEQUENCE
% fof(co1,plain,((sslist(u)&sslist(v)&sslist(w)&sslist(x)&$equal(x,v)&$equal(w,u)&totalorderedp(w)&~totalorderedp(u))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC262+1.tptp',unknown),[]).
% 
% cnf(154274272,plain,(totalorderedp(w)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% cnf(154261400,plain,(~totalorderedp(u)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% cnf(154286792,plain,($equal(w,u)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[154274272,154261400,154286792,theory(equality)]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------