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

% Computer : art05.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:13:54 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ? [X1] :
      ( ! [X2] :
          ( big_f(X2)
         => ( big_f(X1)
           => big_g(X2) ) )
     => ( p
       => ! [X2] :
            ( big_f(X2)
           => big_g(X1) ) ) ),
    file('/tmp/tmp2DVXk6/sel_SYN318+1.p_1',church_46_2_4) ).

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

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

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

fof(5,negated_conjecture,
    ! [X3] :
      ( ! [X4] :
          ( ~ big_f(X4)
          | ~ big_f(X3)
          | big_g(X4) )
      & p
      & big_f(esk1_1(X3))
      & ~ big_g(X3) ),
    inference(skolemize,[status(esa)],[4]) ).

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

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

cnf(8,negated_conjecture,
    big_f(esk1_1(X1)),
    inference(split_conjunct,[status(thm)],[6]) ).

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

cnf(11,negated_conjecture,
    ( ~ big_f(X2)
    | ~ big_f(X1) ),
    inference(sr,[status(thm)],[10,7,theory(equality)]) ).

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

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

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

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

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

cnf(17,negated_conjecture,
    epred1_0,
    inference(spm,[status(thm)],[13,8,theory(equality)]) ).

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

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

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

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

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

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