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

% Computer : art02.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 18:20:52 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(x3411,plain,
    ! [A,C,D,F] :
      ( ( p(v(A,C,D),D)
        | ~ p(x(A),A) )
      & ( ~ p(D,F)
        | ~ p(x(A),A) )
      & ( ~ q(F,D)
        | ~ p(x(A),A) )
      & ( q(C,A)
        | ~ p(x(A),A) )
      & ( p(v(A,C,D),D)
        | p(v(A,C,D),D) )
      & ( ~ p(D,F)
        | p(v(A,C,D),D) )
      & ( ~ q(F,D)
        | p(v(A,C,D),D) )
      & ( q(C,A)
        | p(v(A,C,D),D) )
      & ( p(v(A,C,D),D)
        | ~ p(D,F) )
      & ( ~ p(D,F)
        | ~ p(D,F) )
      & ( ~ q(F,D)
        | ~ p(D,F) )
      & ( q(C,A)
        | ~ p(D,F) )
      & ( p(v(A,C,D),D)
        | ~ q(F,D) )
      & ( ~ p(D,F)
        | ~ q(F,D) )
      & ( ~ q(F,D)
        | ~ q(F,D) )
      & ( q(C,A)
        | ~ q(F,D) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN732+1.tptp',unknown),
    [] ).

cnf(171830520,plain,
    ( q(C,A)
    | ~ p(D,F) ),
    inference(rewrite,[status(thm)],[x3411]),
    [] ).

cnf(171835344,plain,
    ~ p(D,F),
    inference(rewrite__forward_subsumption_resolution,[status(thm)],[x3411,171830520]),
    [] ).

cnf(171856632,plain,
    p(v(A,C,D),D),
    inference(rewrite,[status(thm)],[x3411]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[171835344,171856632]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(x3411,plain,(((p(v(A,C,D),D)|~p(x(A),A))&(~p(D,F)|~p(x(A),A))&(~q(F,D)|~p(x(A),A))&(q(C,A)|~p(x(A),A))&(p(v(A,C,D),D)|p(v(A,C,D),D))&(~p(D,F)|p(v(A,C,D),D))&(~q(F,D)|p(v(A,C,D),D))&(q(C,A)|p(v(A,C,D),D))&(p(v(A,C,D),D)|~p(D,F))&(~p(D,F)|~p(D,F))&(~q(F,D)|~p(D,F))&(q(C,A)|~p(D,F))&(p(v(A,C,D),D)|~q(F,D))&(~p(D,F)|~q(F,D))&(~q(F,D)|~q(F,D))&(q(C,A)|~q(F,D)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN732+1.tptp',unknown),[]).
% 
% cnf(171830520,plain,(q(C,A)|~p(D,F)),inference(rewrite,[status(thm)],[x3411]),[]).
% 
% cnf(171835344,plain,(~p(D,F)),inference(rewrite__forward_subsumption_resolution,[status(thm)],[x3411,171830520]),[]).
% 
% cnf(171856632,plain,(p(v(A,C,D),D)),inference(rewrite,[status(thm)],[x3411]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[171835344,171856632]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------