%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SET940+1 : TPTP v5.0.0. Released v3.2.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 03:49:12 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1,X2] : union(unordered_pair(X1,X2)) = set_union2(X1,X2),
    file('/tmp/tmpsTVYn3/sel_SET940+1.p_1',l52_zfmisc_1) ).

fof(9,conjecture,
    ! [X1,X2] : union(unordered_pair(X1,X2)) = set_union2(X1,X2),
    file('/tmp/tmpsTVYn3/sel_SET940+1.p_1',t93_zfmisc_1) ).

fof(10,negated_conjecture,
    ~ ! [X1,X2] : union(unordered_pair(X1,X2)) = set_union2(X1,X2),
    inference(assume_negation,[status(cth)],[9]) ).

fof(14,plain,
    ! [X3,X4] : union(unordered_pair(X3,X4)) = set_union2(X3,X4),
    inference(variable_rename,[status(thm)],[1]) ).

cnf(15,plain,
    union(unordered_pair(X1,X2)) = set_union2(X1,X2),
    inference(split_conjunct,[status(thm)],[14]) ).

fof(34,negated_conjecture,
    ? [X1,X2] : union(unordered_pair(X1,X2)) != set_union2(X1,X2),
    inference(fof_nnf,[status(thm)],[10]) ).

fof(35,negated_conjecture,
    ? [X3,X4] : union(unordered_pair(X3,X4)) != set_union2(X3,X4),
    inference(variable_rename,[status(thm)],[34]) ).

fof(36,negated_conjecture,
    union(unordered_pair(esk3_0,esk4_0)) != set_union2(esk3_0,esk4_0),
    inference(skolemize,[status(esa)],[35]) ).

cnf(37,negated_conjecture,
    union(unordered_pair(esk3_0,esk4_0)) != set_union2(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[36]) ).

cnf(42,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[37,15,theory(equality)]),
    [unfolding] ).

cnf(43,negated_conjecture,
    $false,
    42,
    [proof] ).

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