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

% Computer : art01.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:14:33 EST 2010

% Result   : Theorem 0.19s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   5 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :   15 (   4 avg)
%            Number of connectives :   89 (  34   ~;  19   |;  24   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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-1 aty)
%            Number of variables   :   21 (   1 sgn  10   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ! [X1] :
    ? [X2] :
    ! [X3] :
      ( big_f(X2,X1)
     => ( ( big_f(X1,X3)
         => big_f(X1,X2) )
        & ( big_f(X1,X2)
         => ( ~ big_f(X1,X3)
           => ( big_f(X2,X1)
              & big_f(X3,X2) ) ) ) ) ),
    file('/tmp/tmp5-qB_v/sel_SYN327+1.p_1',church_46_12_2) ).

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

fof(3,negated_conjecture,
    ~ ! [X1] :
      ? [X2] :
      ! [X3] :
        ( big_f(X2,X1)
       => ( ( big_f(X1,X3)
           => big_f(X1,X2) )
          & ( big_f(X1,X2)
           => ( ~ big_f(X1,X3)
             => ( big_f(X2,X1)
                & big_f(X3,X2) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

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

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

fof(6,negated_conjecture,
    ! [X5] :
      ( big_f(X5,esk1_0)
      & ( ( big_f(esk1_0,esk2_1(X5))
          & ~ big_f(esk1_0,X5) )
        | ( big_f(esk1_0,X5)
          & ~ big_f(esk1_0,esk2_1(X5))
          & ( ~ big_f(X5,esk1_0)
            | ~ big_f(esk2_1(X5),X5) ) ) ) ),
    inference(skolemize,[status(esa)],[5]) ).

fof(7,negated_conjecture,
    ! [X5] :
      ( big_f(X5,esk1_0)
      & ( big_f(esk1_0,X5)
        | big_f(esk1_0,esk2_1(X5)) )
      & ( ~ big_f(esk1_0,esk2_1(X5))
        | big_f(esk1_0,esk2_1(X5)) )
      & ( ~ big_f(X5,esk1_0)
        | ~ big_f(esk2_1(X5),X5)
        | big_f(esk1_0,esk2_1(X5)) )
      & ( big_f(esk1_0,X5)
        | ~ big_f(esk1_0,X5) )
      & ( ~ big_f(esk1_0,esk2_1(X5))
        | ~ big_f(esk1_0,X5) )
      & ( ~ big_f(X5,esk1_0)
        | ~ big_f(esk2_1(X5),X5)
        | ~ big_f(esk1_0,X5) ) ),
    inference(distribute,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    ( ~ big_f(esk1_0,X1)
    | ~ big_f(esk2_1(X1),X1)
    | ~ big_f(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[7]) ).

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

cnf(16,negated_conjecture,
    ( $false
    | ~ big_f(esk1_0,X1)
    | ~ big_f(esk2_1(X1),X1) ),
    inference(rw,[status(thm)],[8,14,theory(equality)]) ).

cnf(17,negated_conjecture,
    ( ~ big_f(esk1_0,X1)
    | ~ big_f(esk2_1(X1),X1) ),
    inference(cn,[status(thm)],[16,theory(equality)]) ).

cnf(18,negated_conjecture,
    ~ big_f(esk1_0,esk1_0),
    inference(spm,[status(thm)],[17,14,theory(equality)]) ).

cnf(19,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[18,14,theory(equality)]) ).

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

cnf(21,negated_conjecture,
    $false,
    20,
    [proof] ).

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