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

View Problem - Process Solution

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

% Computer : art09.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:42:33 EDT 2009

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

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

fof(pel59_1,plain,
    ! [A] :
      ( ( ~ big_f(A)
        | ~ big_f(f(A)) )
      & ( big_f(A)
        | big_f(f(A)) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN081+1.tptp',unknown),
    [] ).

cnf(165139392,plain,
    ( big_f(A)
    | big_f(f(A)) ),
    inference(rewrite,[status(thm)],[pel59_1]),
    [] ).

cnf(165153912,plain,
    big_f(f(A)),
    inference(rewrite__forward_subsumption_resolution,[status(thm)],[pel59,165139392]),
    [] ).

cnf(165145832,plain,
    ( ~ big_f(A)
    | ~ big_f(f(A)) ),
    inference(rewrite,[status(thm)],[pel59_1]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[165153912,165145832,165153912]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(pel59,plain,(~big_f(A)|big_f(f(A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN081+1.tptp',unknown),[]).
% 
% fof(pel59_1,plain,(((~big_f(A)|~big_f(f(A)))&(big_f(A)|big_f(f(A))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN081+1.tptp',unknown),[]).
% 
% cnf(165139392,plain,(big_f(A)|big_f(f(A))),inference(rewrite,[status(thm)],[pel59_1]),[]).
% 
% cnf(165153912,plain,(big_f(f(A))),inference(rewrite__forward_subsumption_resolution,[status(thm)],[pel59,165139392]),[]).
% 
% cnf(165145832,plain,(~big_f(A)|~big_f(f(A))),inference(rewrite,[status(thm)],[pel59_1]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[165153912,165145832,165153912]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------