%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN336+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art07.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 13:15:13 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ! [X1] :
    ? [X2,X3] :
    ! [X4] :
      ( big_f(X1,X4)
     => ( big_f(X2,X4)
       => ( big_f(X3,X4)
         => ( big_f(X2,X1)
           => big_f(X4,X3) ) ) ) ),
    file('/tmp/tmp5-GR0t/sel_SYN336+1.p_1',church_46_15_1) ).

fof(2,negated_conjecture,
    ~ ! [X1] :
      ? [X2,X3] :
      ! [X4] :
        ( big_f(X1,X4)
       => ( big_f(X2,X4)
         => ( big_f(X3,X4)
           => ( big_f(X2,X1)
             => big_f(X4,X3) ) ) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ? [X1] :
    ! [X2,X3] :
    ? [X4] :
      ( big_f(X1,X4)
      & big_f(X2,X4)
      & big_f(X3,X4)
      & big_f(X2,X1)
      & ~ big_f(X4,X3) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(4,negated_conjecture,
    ? [X5] :
    ! [X6,X7] :
    ? [X8] :
      ( big_f(X5,X8)
      & big_f(X6,X8)
      & big_f(X7,X8)
      & big_f(X6,X5)
      & ~ big_f(X8,X7) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ! [X6,X7] :
      ( big_f(esk1_0,esk2_2(X6,X7))
      & big_f(X6,esk2_2(X6,X7))
      & big_f(X7,esk2_2(X6,X7))
      & big_f(X6,esk1_0)
      & ~ big_f(esk2_2(X6,X7),X7) ),
    inference(skolemize,[status(esa)],[4]) ).

cnf(6,negated_conjecture,
    ~ big_f(esk2_2(X1,X2),X2),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(7,negated_conjecture,
    big_f(X1,esk1_0),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(11,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[6,7,theory(equality)]) ).

cnf(12,negated_conjecture,
    $false,
    11,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN336+1.p
% --creating new selector for []
% -running prover on /tmp/tmp5-GR0t/sel_SYN336+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN336+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN336+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN336+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------