%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN343+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:47 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ? [X1,X2,X3] :
    ! [X4] :
      ( ( ( big_f(X1,X2)
         => big_f(X4,X1) )
       => big_f(X1,X1) )
     => ( big_f(X1,X1)
        & big_f(X2,X3) ) ),
    file('/tmp/tmpdnLaWX/sel_SYN343+1.p_1',church_46_16_2) ).

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

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

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

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

fof(6,negated_conjecture,
    ! [X5,X6,X7] :
      ( ( big_f(X5,X6)
        | big_f(X5,X5) )
      & ( ~ big_f(esk1_3(X5,X6,X7),X5)
        | big_f(X5,X5) )
      & ( ~ big_f(X5,X5)
        | ~ big_f(X6,X7) ) ),
    inference(distribute,[status(thm)],[5]) ).

cnf(7,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_f(X3,X3) ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(9,negated_conjecture,
    ( big_f(X1,X1)
    | big_f(X1,X2) ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(10,negated_conjecture,
    big_f(X3,X3),
    inference(ef,[status(thm)],[9,theory(equality)]) ).

fof(12,plain,
    ( ~ epred1_0
  <=> ! [X3] : ~ big_f(X3,X3) ),
    introduced(definition),
    [split] ).

cnf(13,plain,
    ( epred1_0
    | ~ big_f(X3,X3) ),
    inference(split_equiv,[status(thm)],[12]) ).

fof(14,plain,
    ( ~ epred2_0
  <=> ! [X2,X1] : ~ big_f(X1,X2) ),
    introduced(definition),
    [split] ).

cnf(15,plain,
    ( epred2_0
    | ~ big_f(X1,X2) ),
    inference(split_equiv,[status(thm)],[14]) ).

cnf(16,negated_conjecture,
    ( ~ epred2_0
    | ~ epred1_0 ),
    inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[7,12,theory(equality)]),14,theory(equality)]),
    [split] ).

cnf(19,negated_conjecture,
    ( epred1_0
    | $false ),
    inference(rw,[status(thm)],[13,10,theory(equality)]) ).

cnf(20,negated_conjecture,
    epred1_0,
    inference(cn,[status(thm)],[19,theory(equality)]) ).

cnf(21,negated_conjecture,
    ( ~ epred2_0
    | $false ),
    inference(rw,[status(thm)],[16,20,theory(equality)]) ).

cnf(22,negated_conjecture,
    ~ epred2_0,
    inference(cn,[status(thm)],[21,theory(equality)]) ).

cnf(23,negated_conjecture,
    epred2_0,
    inference(spm,[status(thm)],[15,10,theory(equality)]) ).

cnf(24,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[23,22,theory(equality)]) ).

cnf(25,negated_conjecture,
    $false,
    24,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN343+1.p
% --creating new selector for []
% -running prover on /tmp/tmpdnLaWX/sel_SYN343+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN343+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN343+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN343+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
% 
%------------------------------------------------------------------------------