%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : MSC011+1 : TPTP v5.0.0. Released v3.2.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 : Sat Dec 25 21:09:53 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] :
      ( ( drunk(X1)
        & not_drunk(X1) )
     => goal ),
    file('/tmp/tmpyTpSyl/sel_MSC011+1.p_1',d_cons) ).

fof(2,conjecture,
    goal,
    file('/tmp/tmpyTpSyl/sel_MSC011+1.p_1',goal_to_be_proved) ).

fof(3,axiom,
    ! [X1] :
      ( drunk(X1)
      & neg_psi ),
    file('/tmp/tmpyTpSyl/sel_MSC011+1.p_1',neg_phi) ).

fof(4,axiom,
    ( neg_psi
   => ? [X1] : not_drunk(X1) ),
    file('/tmp/tmpyTpSyl/sel_MSC011+1.p_1',neg_psi_ax) ).

fof(5,negated_conjecture,
    ~ goal,
    inference(assume_negation,[status(cth)],[2]) ).

fof(6,negated_conjecture,
    ~ goal,
    inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).

fof(7,plain,
    ! [X1] :
      ( ~ drunk(X1)
      | ~ not_drunk(X1)
      | goal ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(8,plain,
    ! [X2] :
      ( ~ drunk(X2)
      | ~ not_drunk(X2)
      | goal ),
    inference(variable_rename,[status(thm)],[7]) ).

cnf(9,plain,
    ( goal
    | ~ not_drunk(X1)
    | ~ drunk(X1) ),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(10,negated_conjecture,
    ~ goal,
    inference(split_conjunct,[status(thm)],[6]) ).

fof(11,plain,
    ! [X2] :
      ( drunk(X2)
      & neg_psi ),
    inference(variable_rename,[status(thm)],[3]) ).

cnf(12,plain,
    neg_psi,
    inference(split_conjunct,[status(thm)],[11]) ).

cnf(13,plain,
    drunk(X1),
    inference(split_conjunct,[status(thm)],[11]) ).

fof(14,plain,
    ( ~ neg_psi
    | ? [X1] : not_drunk(X1) ),
    inference(fof_nnf,[status(thm)],[4]) ).

fof(15,plain,
    ( ~ neg_psi
    | ? [X2] : not_drunk(X2) ),
    inference(variable_rename,[status(thm)],[14]) ).

fof(16,plain,
    ( ~ neg_psi
    | not_drunk(esk1_0) ),
    inference(skolemize,[status(esa)],[15]) ).

cnf(17,plain,
    ( not_drunk(esk1_0)
    | ~ neg_psi ),
    inference(split_conjunct,[status(thm)],[16]) ).

cnf(18,plain,
    ( goal
    | $false
    | ~ not_drunk(X1) ),
    inference(rw,[status(thm)],[9,13,theory(equality)]),
    [unfolding] ).

cnf(19,plain,
    ~ not_drunk(X1),
    inference(sr,[status(thm)],[18,10,theory(equality)]) ).

cnf(20,plain,
    ( not_drunk(esk1_0)
    | $false ),
    inference(rw,[status(thm)],[17,12,theory(equality)]) ).

cnf(21,plain,
    not_drunk(esk1_0),
    inference(cn,[status(thm)],[20,theory(equality)]) ).

cnf(22,plain,
    $false,
    inference(sr,[status(thm)],[21,19,theory(equality)]) ).

cnf(23,plain,
    $false,
    22,
    [proof] ).

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