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

% Computer : art03.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:16 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ? [X1] :
      ( ! [X2] :
          ( ( big_f(X2,X1)
           => big_f(X1,X2) )
         => big_g(X2,X1) )
     => ~ ! [X2] :
            ( ( big_f(X2,X1)
             => big_f(X1,X2) )
           => ~ big_g(X2,X1) ) ),
    file('/tmp/tmp60COph/sel_SYN323+1.p_1',church_46_4_2) ).

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

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

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

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

fof(6,negated_conjecture,
    ! [X3,X4,X5] :
      ( ( ( big_f(X5,X3)
          & ~ big_f(X3,X5) )
        | ~ big_g(X5,X3) )
      & ( ( big_f(X4,X3)
          & ~ big_f(X3,X4) )
        | big_g(X4,X3) ) ),
    inference(shift_quantors,[status(thm)],[5]) ).

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

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

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

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

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

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

cnf(14,negated_conjecture,
    ( big_g(X1,X2)
    | $false ),
    inference(rw,[status(thm)],[8,12,theory(equality)]) ).

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

cnf(16,negated_conjecture,
    ( $false
    | ~ big_g(X1,X2) ),
    inference(rw,[status(thm)],[10,12,theory(equality)]) ).

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

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

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

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