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

% Computer : art06.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:11:00 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   40 (  10 unt;   0 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   95 (  45   ~;  31   |;  10   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   33 (   0 sgn  17   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ? [X1] :
      ( big_f(X1)
      & ~ big_g(X1) ),
    file('/tmp/tmp8Wo_y7/sel_SYN057+1.p_1',pel27_1) ).

fof(2,axiom,
    ! [X1] :
      ( big_f(X1)
     => big_h(X1) ),
    file('/tmp/tmp8Wo_y7/sel_SYN057+1.p_1',pel27_2) ).

fof(3,axiom,
    ! [X1] :
      ( ( big_j(X1)
        & big_i(X1) )
     => big_f(X1) ),
    file('/tmp/tmp8Wo_y7/sel_SYN057+1.p_1',pel27_3) ).

fof(4,axiom,
    ( ? [X1] :
        ( big_h(X1)
        & ~ big_g(X1) )
   => ! [X2] :
        ( big_i(X2)
       => ~ big_h(X2) ) ),
    file('/tmp/tmp8Wo_y7/sel_SYN057+1.p_1',pel27_4) ).

fof(5,conjecture,
    ! [X1] :
      ( big_j(X1)
     => ~ big_i(X1) ),
    file('/tmp/tmp8Wo_y7/sel_SYN057+1.p_1',pel27) ).

fof(6,negated_conjecture,
    ~ ! [X1] :
        ( big_j(X1)
       => ~ big_i(X1) ),
    inference(assume_negation,[status(cth)],[5]) ).

fof(7,plain,
    ? [X1] :
      ( big_f(X1)
      & ~ big_g(X1) ),
    inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).

fof(8,plain,
    ( ? [X1] :
        ( big_h(X1)
        & ~ big_g(X1) )
   => ! [X2] :
        ( big_i(X2)
       => ~ big_h(X2) ) ),
    inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).

fof(9,negated_conjecture,
    ~ ! [X1] :
        ( big_j(X1)
       => ~ big_i(X1) ),
    inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).

fof(10,plain,
    ? [X2] :
      ( big_f(X2)
      & ~ big_g(X2) ),
    inference(variable_rename,[status(thm)],[7]) ).

fof(11,plain,
    ( big_f(esk1_0)
    & ~ big_g(esk1_0) ),
    inference(skolemize,[status(esa)],[10]) ).

cnf(12,plain,
    ~ big_g(esk1_0),
    inference(split_conjunct,[status(thm)],[11]) ).

cnf(13,plain,
    big_f(esk1_0),
    inference(split_conjunct,[status(thm)],[11]) ).

fof(14,plain,
    ! [X1] :
      ( ~ big_f(X1)
      | big_h(X1) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(15,plain,
    ! [X2] :
      ( ~ big_f(X2)
      | big_h(X2) ),
    inference(variable_rename,[status(thm)],[14]) ).

cnf(16,plain,
    ( big_h(X1)
    | ~ big_f(X1) ),
    inference(split_conjunct,[status(thm)],[15]) ).

fof(17,plain,
    ! [X1] :
      ( ~ big_j(X1)
      | ~ big_i(X1)
      | big_f(X1) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(18,plain,
    ! [X2] :
      ( ~ big_j(X2)
      | ~ big_i(X2)
      | big_f(X2) ),
    inference(variable_rename,[status(thm)],[17]) ).

cnf(19,plain,
    ( big_f(X1)
    | ~ big_i(X1)
    | ~ big_j(X1) ),
    inference(split_conjunct,[status(thm)],[18]) ).

fof(20,plain,
    ( ! [X1] :
        ( ~ big_h(X1)
        | big_g(X1) )
    | ! [X2] :
        ( ~ big_i(X2)
        | ~ big_h(X2) ) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(21,plain,
    ( ! [X3] :
        ( ~ big_h(X3)
        | big_g(X3) )
    | ! [X4] :
        ( ~ big_i(X4)
        | ~ big_h(X4) ) ),
    inference(variable_rename,[status(thm)],[20]) ).

fof(22,plain,
    ! [X3,X4] :
      ( ~ big_i(X4)
      | ~ big_h(X4)
      | ~ big_h(X3)
      | big_g(X3) ),
    inference(shift_quantors,[status(thm)],[21]) ).

cnf(23,plain,
    ( big_g(X1)
    | ~ big_h(X1)
    | ~ big_h(X2)
    | ~ big_i(X2) ),
    inference(split_conjunct,[status(thm)],[22]) ).

fof(24,negated_conjecture,
    ? [X1] :
      ( big_j(X1)
      & big_i(X1) ),
    inference(fof_nnf,[status(thm)],[9]) ).

fof(25,negated_conjecture,
    ? [X2] :
      ( big_j(X2)
      & big_i(X2) ),
    inference(variable_rename,[status(thm)],[24]) ).

fof(26,negated_conjecture,
    ( big_j(esk2_0)
    & big_i(esk2_0) ),
    inference(skolemize,[status(esa)],[25]) ).

cnf(27,negated_conjecture,
    big_i(esk2_0),
    inference(split_conjunct,[status(thm)],[26]) ).

cnf(28,negated_conjecture,
    big_j(esk2_0),
    inference(split_conjunct,[status(thm)],[26]) ).

cnf(29,negated_conjecture,
    ( big_f(esk2_0)
    | ~ big_i(esk2_0) ),
    inference(spm,[status(thm)],[19,28,theory(equality)]) ).

cnf(30,negated_conjecture,
    ( big_f(esk2_0)
    | $false ),
    inference(rw,[status(thm)],[29,27,theory(equality)]) ).

cnf(31,negated_conjecture,
    big_f(esk2_0),
    inference(cn,[status(thm)],[30,theory(equality)]) ).

cnf(32,plain,
    ( big_g(X1)
    | ~ big_i(X2)
    | ~ big_h(X1)
    | ~ big_f(X2) ),
    inference(spm,[status(thm)],[23,16,theory(equality)]) ).

cnf(33,negated_conjecture,
    ( big_g(X1)
    | ~ big_h(X1)
    | ~ big_f(esk2_0) ),
    inference(spm,[status(thm)],[32,27,theory(equality)]) ).

cnf(34,negated_conjecture,
    ( big_g(X1)
    | ~ big_h(X1)
    | $false ),
    inference(rw,[status(thm)],[33,31,theory(equality)]) ).

cnf(35,negated_conjecture,
    ( big_g(X1)
    | ~ big_h(X1) ),
    inference(cn,[status(thm)],[34,theory(equality)]) ).

cnf(36,negated_conjecture,
    ~ big_h(esk1_0),
    inference(spm,[status(thm)],[12,35,theory(equality)]) ).

cnf(37,negated_conjecture,
    ~ big_f(esk1_0),
    inference(spm,[status(thm)],[36,16,theory(equality)]) ).

cnf(38,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[37,13,theory(equality)]) ).

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

cnf(40,negated_conjecture,
    $false,
    39,
    [proof] ).

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