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

View Problem - Process Solution

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

% Computer : art04.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:53:34 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 (   2 unt;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   17 (   7   ~;   7   |;   3   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   0 con; 3-3 aty)
%            Number of variables   :   21 (   9 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(kalish250,plain,
    ! [J,K,L,A,B,C] :
      ( ( f(J,K,L)
        | f(A,B,C) )
      & ( ~ f(x(A,B,C),y(A,B,C),z(A,B,C))
        | f(A,B,C) )
      & ( f(J,K,L)
        | ~ f(u_nn_1(A,B,C),v_nn_2(A,B,C),w_nn_3(A,B,C)) )
      & ( ~ f(x(A,B,C),y(A,B,C),z(A,B,C))
        | ~ f(u_nn_1(A,B,C),v_nn_2(A,B,C),w_nn_3(A,B,C)) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN411+1.tptp',unknown),
    [] ).

cnf(141806736,plain,
    ( ~ f(x(A,B,C),y(A,B,C),z(A,B,C))
    | f(A,B,C) ),
    inference(rewrite,[status(thm)],[kalish250]),
    [] ).

cnf(141810992,plain,
    ( f(J,K,L)
    | f(A,B,C) ),
    inference(rewrite,[status(thm)],[kalish250]),
    [] ).

cnf(157499344,plain,
    f(A,B,C),
    inference(resolution,[status(thm)],[141806736,141810992]),
    [] ).

cnf(141790680,plain,
    ( ~ f(x(A,B,C),y(A,B,C),z(A,B,C))
    | ~ f(u_nn_1(A,B,C),v_nn_2(A,B,C),w_nn_3(A,B,C)) ),
    inference(rewrite,[status(thm)],[kalish250]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[157499344,141790680,157499344]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(kalish250,plain,(((f(J,K,L)|f(A,B,C))&(~f(x(A,B,C),y(A,B,C),z(A,B,C))|f(A,B,C))&(f(J,K,L)|~f(u_nn_1(A,B,C),v_nn_2(A,B,C),w_nn_3(A,B,C)))&(~f(x(A,B,C),y(A,B,C),z(A,B,C))|~f(u_nn_1(A,B,C),v_nn_2(A,B,C),w_nn_3(A,B,C))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN411+1.tptp',unknown),[]).
% 
% cnf(141806736,plain,(~f(x(A,B,C),y(A,B,C),z(A,B,C))|f(A,B,C)),inference(rewrite,[status(thm)],[kalish250]),[]).
% 
% cnf(141810992,plain,(f(J,K,L)|f(A,B,C)),inference(rewrite,[status(thm)],[kalish250]),[]).
% 
% cnf(157499344,plain,(f(A,B,C)),inference(resolution,[status(thm)],[141806736,141810992]),[]).
% 
% cnf(141790680,plain,(~f(x(A,B,C),y(A,B,C),z(A,B,C))|~f(u_nn_1(A,B,C),v_nn_2(A,B,C),w_nn_3(A,B,C))),inference(rewrite,[status(thm)],[kalish250]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[157499344,141790680,157499344]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------