TSTP Solution File: SYN382+1 by Faust---1.0

View Problem - Process Solution

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

% Computer : art08.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 17:52:25 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    :    6 (   4 unt;   0 def)
%            Number of atoms       :   24 (   0 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :   32 (  14   ~;  10   |;   8   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 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-2 aty)
%            Number of variables   :   12 (   7 sgn   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(x2134,plain,
    ! [E,A,C] :
      ( ( ~ big_p(E,y(A,C))
        | big_p(x_nn_2(A),C) )
      & ( ~ big_q(E,y(A,C))
        | big_p(x_nn_2(A),C) )
      & ( big_q(x_nn_2(A),A)
        | big_p(x_nn_2(A),C) )
      & ( ~ big_p(E,y(A,C))
        | ~ big_p(E,y(A,C)) )
      & ( ~ big_q(E,y(A,C))
        | ~ big_p(E,y(A,C)) )
      & ( big_q(x_nn_2(A),A)
        | ~ big_p(E,y(A,C)) )
      & ( ~ big_p(E,y(A,C))
        | ~ big_q(E,y(A,C)) )
      & ( ~ big_q(E,y(A,C))
        | ~ big_q(E,y(A,C)) )
      & ( big_q(x_nn_2(A),A)
        | ~ big_q(E,y(A,C)) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN382+1.tptp',unknown),
    [] ).

cnf(143632928,plain,
    ( big_q(x_nn_2(A),A)
    | big_p(x_nn_2(A),C) ),
    inference(rewrite,[status(thm)],[x2134]),
    [] ).

cnf(143623528,plain,
    ~ big_p(E,y(A,C)),
    inference(rewrite,[status(thm)],[x2134]),
    [] ).

cnf(161920496,plain,
    big_q(x_nn_2(A),A),
    inference(resolution,[status(thm)],[143632928,143623528]),
    [] ).

cnf(143606552,plain,
    ~ big_q(E,y(A,C)),
    inference(rewrite,[status(thm)],[x2134]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[161920496,143606552]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(x2134,plain,(((~big_p(E,y(A,C))|big_p(x_nn_2(A),C))&(~big_q(E,y(A,C))|big_p(x_nn_2(A),C))&(big_q(x_nn_2(A),A)|big_p(x_nn_2(A),C))&(~big_p(E,y(A,C))|~big_p(E,y(A,C)))&(~big_q(E,y(A,C))|~big_p(E,y(A,C)))&(big_q(x_nn_2(A),A)|~big_p(E,y(A,C)))&(~big_p(E,y(A,C))|~big_q(E,y(A,C)))&(~big_q(E,y(A,C))|~big_q(E,y(A,C)))&(big_q(x_nn_2(A),A)|~big_q(E,y(A,C))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN382+1.tptp',unknown),[]).
% 
% cnf(143632928,plain,(big_q(x_nn_2(A),A)|big_p(x_nn_2(A),C)),inference(rewrite,[status(thm)],[x2134]),[]).
% 
% cnf(143623528,plain,(~big_p(E,y(A,C))),inference(rewrite,[status(thm)],[x2134]),[]).
% 
% cnf(161920496,plain,(big_q(x_nn_2(A),A)),inference(resolution,[status(thm)],[143632928,143623528]),[]).
% 
% cnf(143606552,plain,(~big_q(E,y(A,C))),inference(rewrite,[status(thm)],[x2134]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[161920496,143606552]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------