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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SYN405+1 : TPTP v3.4.2. Released v2.0.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 17:53:20 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 (   4 unt;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :   24 (   7   ~;   9   |;   8   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :    5 (   3 sgn   2   !;   0   ?)

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

cnf(153160536,plain,
    g(y(A)),
    inference(rewrite,[status(thm)],[kalish239]),
    [] ).

cnf(153169856,plain,
    f(A),
    inference(rewrite,[status(thm)],[kalish239]),
    [] ).

cnf(153181776,plain,
    ~ g(C),
    inference(rewrite__forward_subsumption_resolution,[status(thm)],[kalish239,153169856]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[153160536,153181776]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(kalish239,plain,(((f(A)|~g(C))&(g(y(A))|~g(C))&(~f(C)|~g(C))&(f(A)|f(A))&(g(y(A))|f(A))&(~f(C)|f(A))&(f(A)|g(y(A)))&(g(y(A))|g(y(A)))&(~f(C)|g(y(A))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN405+1.tptp',unknown),[]).
% 
% cnf(153160536,plain,(g(y(A))),inference(rewrite,[status(thm)],[kalish239]),[]).
% 
% cnf(153169856,plain,(f(A)),inference(rewrite,[status(thm)],[kalish239]),[]).
% 
% cnf(153181776,plain,(~g(C)),inference(rewrite__forward_subsumption_resolution,[status(thm)],[kalish239,153169856]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[153160536,153181776]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------