%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN072+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:12:29 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ? [X1,X2] :
    ! [X3] :
      ( X3 = X1
      | X3 = X2 ),
    file('/tmp/tmp1uxM2z/sel_SYN072+1.p_1',pel49_1) ).

fof(2,axiom,
    big_p(a),
    file('/tmp/tmp1uxM2z/sel_SYN072+1.p_1',pel49_2) ).

fof(3,axiom,
    big_p(b),
    file('/tmp/tmp1uxM2z/sel_SYN072+1.p_1',pel49_3) ).

fof(4,axiom,
    a != b,
    file('/tmp/tmp1uxM2z/sel_SYN072+1.p_1',pel49_4) ).

fof(5,conjecture,
    ! [X1] : big_p(X1),
    file('/tmp/tmp1uxM2z/sel_SYN072+1.p_1',pel49) ).

fof(6,negated_conjecture,
    ~ ! [X1] : big_p(X1),
    inference(assume_negation,[status(cth)],[5]) ).

fof(7,plain,
    ? [X4,X5] :
    ! [X6] :
      ( X6 = X4
      | X6 = X5 ),
    inference(variable_rename,[status(thm)],[1]) ).

fof(8,plain,
    ! [X6] :
      ( X6 = esk1_0
      | X6 = esk2_0 ),
    inference(skolemize,[status(esa)],[7]) ).

cnf(9,plain,
    ( X1 = esk2_0
    | X1 = esk1_0 ),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(10,plain,
    big_p(a),
    inference(split_conjunct,[status(thm)],[2]) ).

cnf(11,plain,
    big_p(b),
    inference(split_conjunct,[status(thm)],[3]) ).

cnf(12,plain,
    a != b,
    inference(split_conjunct,[status(thm)],[4]) ).

fof(13,negated_conjecture,
    ? [X1] : ~ big_p(X1),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(14,negated_conjecture,
    ? [X2] : ~ big_p(X2),
    inference(variable_rename,[status(thm)],[13]) ).

fof(15,negated_conjecture,
    ~ big_p(esk3_0),
    inference(skolemize,[status(esa)],[14]) ).

cnf(16,negated_conjecture,
    ~ big_p(esk3_0),
    inference(split_conjunct,[status(thm)],[15]) ).

cnf(19,negated_conjecture,
    ( esk1_0 = esk3_0
    | ~ big_p(esk2_0) ),
    inference(spm,[status(thm)],[16,9,theory(equality)]) ).

cnf(20,plain,
    ( X2 = X1
    | esk1_0 = X1
    | esk1_0 = X2 ),
    inference(spm,[status(thm)],[9,9,theory(equality)]) ).

cnf(22,negated_conjecture,
    ( esk3_0 = esk1_0
    | esk1_0 = X1
    | ~ big_p(X1) ),
    inference(spm,[status(thm)],[19,9,theory(equality)]) ).

cnf(71,negated_conjecture,
    ( esk3_0 = esk1_0
    | esk1_0 = a ),
    inference(spm,[status(thm)],[22,10,theory(equality)]) ).

cnf(72,negated_conjecture,
    ( esk3_0 = esk1_0
    | esk1_0 = b ),
    inference(spm,[status(thm)],[22,11,theory(equality)]) ).

cnf(73,negated_conjecture,
    ( esk1_0 = a
    | ~ big_p(esk1_0) ),
    inference(spm,[status(thm)],[16,71,theory(equality)]) ).

cnf(74,negated_conjecture,
    ( esk1_0 = b
    | ~ big_p(esk1_0) ),
    inference(spm,[status(thm)],[16,72,theory(equality)]) ).

cnf(75,negated_conjecture,
    ( X1 = a
    | esk1_0 = X2
    | X1 = X2
    | ~ big_p(X1) ),
    inference(spm,[status(thm)],[73,20,theory(equality)]) ).

cnf(96,negated_conjecture,
    ( esk1_0 = X1
    | b = a
    | b = X1 ),
    inference(spm,[status(thm)],[75,11,theory(equality)]) ).

cnf(97,negated_conjecture,
    ( esk1_0 = X1
    | b = X1 ),
    inference(sr,[status(thm)],[96,12,theory(equality)]) ).

cnf(108,negated_conjecture,
    ( X1 = b
    | ~ big_p(X1) ),
    inference(spm,[status(thm)],[74,97,theory(equality)]) ).

cnf(114,negated_conjecture,
    a = b,
    inference(spm,[status(thm)],[108,10,theory(equality)]) ).

cnf(115,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[114,12,theory(equality)]) ).

cnf(116,negated_conjecture,
    $false,
    115,
    [proof] ).

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