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

% Computer : art04.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:07 EST 2010

% Result   : Theorem 0.16s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (   4 unt;   0 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   67 (  22   ~;  23   |;  12   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   56 (  12 sgn  30   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ? [X1,X2] :
      ( ( ? [X3] : big_f(X1,X3)
       => ! [X3] : big_g(X1,X3) )
     => ( ! [X3] :
            ( big_g(X3,X3)
           => big_f(X3,X2) )
       => ( big_f(X1,X2)
        <=> ! [X3] : big_g(X1,X3) ) ) ),
    file('/tmp/tmppyTXzP/sel_SYN321+1.p_1',church_46_3_2) ).

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

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

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

fof(5,negated_conjecture,
    ! [X4,X5] :
      ( ( ! [X6] : ~ big_f(X4,X6)
        | ! [X7] : big_g(X4,X7) )
      & ! [X8] :
          ( ~ big_g(X8,X8)
          | big_f(X8,X5) )
      & ( ~ big_f(X4,X5)
        | ~ big_g(X4,esk1_2(X4,X5)) )
      & ( big_f(X4,X5)
        | ! [X10] : big_g(X4,X10) ) ),
    inference(skolemize,[status(esa)],[4]) ).

fof(6,negated_conjecture,
    ! [X4,X5,X6,X7,X8,X10] :
      ( ( big_g(X4,X10)
        | big_f(X4,X5) )
      & ( ~ big_f(X4,X5)
        | ~ big_g(X4,esk1_2(X4,X5)) )
      & ( ~ big_g(X8,X8)
        | big_f(X8,X5) )
      & ( big_g(X4,X7)
        | ~ big_f(X4,X6) ) ),
    inference(shift_quantors,[status(thm)],[5]) ).

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

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

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

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

cnf(11,negated_conjecture,
    big_f(X1,X2),
    inference(csr,[status(thm)],[8,10]) ).

cnf(13,negated_conjecture,
    ( big_g(X1,X3)
    | $false ),
    inference(rw,[status(thm)],[7,11,theory(equality)]) ).

cnf(14,negated_conjecture,
    big_g(X1,X3),
    inference(cn,[status(thm)],[13,theory(equality)]) ).

cnf(15,negated_conjecture,
    ( $false
    | ~ big_g(X1,esk1_2(X1,X2)) ),
    inference(rw,[status(thm)],[9,11,theory(equality)]) ).

cnf(16,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[15,14,theory(equality)]) ).

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

cnf(18,negated_conjecture,
    $false,
    17,
    [proof] ).

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