%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU140+1 : TPTP v5.0.0. Released v3.3.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 04:50:35 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
    file('/tmp/tmp_aSRmK/sel_SEU140+1.p_1',commutativity_k3_xboole_0) ).

fof(8,axiom,
    ! [X1,X2] :
      ( disjoint(X1,X2)
    <=> set_intersection2(X1,X2) = empty_set ),
    file('/tmp/tmp_aSRmK/sel_SEU140+1.p_1',d7_xboole_0) ).

fof(9,axiom,
    ! [X1,X2,X3] :
      ( subset(X1,X2)
     => subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
    file('/tmp/tmp_aSRmK/sel_SEU140+1.p_1',t26_xboole_1) ).

fof(10,conjecture,
    ! [X1,X2,X3] :
      ( ( subset(X1,X2)
        & disjoint(X2,X3) )
     => disjoint(X1,X3) ),
    file('/tmp/tmp_aSRmK/sel_SEU140+1.p_1',t63_xboole_1) ).

fof(11,axiom,
    ! [X1] :
      ( subset(X1,empty_set)
     => X1 = empty_set ),
    file('/tmp/tmp_aSRmK/sel_SEU140+1.p_1',t3_xboole_1) ).

fof(19,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( subset(X1,X2)
          & disjoint(X2,X3) )
       => disjoint(X1,X3) ),
    inference(assume_negation,[status(cth)],[10]) ).

fof(22,plain,
    ! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
    inference(variable_rename,[status(thm)],[1]) ).

cnf(23,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    inference(split_conjunct,[status(thm)],[22]) ).

fof(36,plain,
    ! [X1,X2] :
      ( ( ~ disjoint(X1,X2)
        | set_intersection2(X1,X2) = empty_set )
      & ( set_intersection2(X1,X2) != empty_set
        | disjoint(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(37,plain,
    ! [X3,X4] :
      ( ( ~ disjoint(X3,X4)
        | set_intersection2(X3,X4) = empty_set )
      & ( set_intersection2(X3,X4) != empty_set
        | disjoint(X3,X4) ) ),
    inference(variable_rename,[status(thm)],[36]) ).

cnf(38,plain,
    ( disjoint(X1,X2)
    | set_intersection2(X1,X2) != empty_set ),
    inference(split_conjunct,[status(thm)],[37]) ).

cnf(39,plain,
    ( set_intersection2(X1,X2) = empty_set
    | ~ disjoint(X1,X2) ),
    inference(split_conjunct,[status(thm)],[37]) ).

fof(40,plain,
    ! [X1,X2,X3] :
      ( ~ subset(X1,X2)
      | subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
    inference(fof_nnf,[status(thm)],[9]) ).

fof(41,plain,
    ! [X4,X5,X6] :
      ( ~ subset(X4,X5)
      | subset(set_intersection2(X4,X6),set_intersection2(X5,X6)) ),
    inference(variable_rename,[status(thm)],[40]) ).

cnf(42,plain,
    ( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
    | ~ subset(X1,X3) ),
    inference(split_conjunct,[status(thm)],[41]) ).

fof(43,negated_conjecture,
    ? [X1,X2,X3] :
      ( subset(X1,X2)
      & disjoint(X2,X3)
      & ~ disjoint(X1,X3) ),
    inference(fof_nnf,[status(thm)],[19]) ).

fof(44,negated_conjecture,
    ? [X4,X5,X6] :
      ( subset(X4,X5)
      & disjoint(X5,X6)
      & ~ disjoint(X4,X6) ),
    inference(variable_rename,[status(thm)],[43]) ).

fof(45,negated_conjecture,
    ( subset(esk2_0,esk3_0)
    & disjoint(esk3_0,esk4_0)
    & ~ disjoint(esk2_0,esk4_0) ),
    inference(skolemize,[status(esa)],[44]) ).

cnf(46,negated_conjecture,
    ~ disjoint(esk2_0,esk4_0),
    inference(split_conjunct,[status(thm)],[45]) ).

cnf(47,negated_conjecture,
    disjoint(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[45]) ).

cnf(48,negated_conjecture,
    subset(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[45]) ).

fof(49,plain,
    ! [X1] :
      ( ~ subset(X1,empty_set)
      | X1 = empty_set ),
    inference(fof_nnf,[status(thm)],[11]) ).

fof(50,plain,
    ! [X2] :
      ( ~ subset(X2,empty_set)
      | X2 = empty_set ),
    inference(variable_rename,[status(thm)],[49]) ).

cnf(51,plain,
    ( X1 = empty_set
    | ~ subset(X1,empty_set) ),
    inference(split_conjunct,[status(thm)],[50]) ).

cnf(72,negated_conjecture,
    set_intersection2(esk3_0,esk4_0) = empty_set,
    inference(spm,[status(thm)],[39,47,theory(equality)]) ).

cnf(79,plain,
    ( disjoint(X1,X2)
    | set_intersection2(X2,X1) != empty_set ),
    inference(spm,[status(thm)],[38,23,theory(equality)]) ).

cnf(103,negated_conjecture,
    subset(set_intersection2(esk2_0,X1),set_intersection2(esk3_0,X1)),
    inference(spm,[status(thm)],[42,48,theory(equality)]) ).

cnf(135,negated_conjecture,
    subset(set_intersection2(esk2_0,esk4_0),empty_set),
    inference(spm,[status(thm)],[103,72,theory(equality)]) ).

cnf(148,negated_conjecture,
    subset(set_intersection2(esk4_0,esk2_0),empty_set),
    inference(rw,[status(thm)],[135,23,theory(equality)]) ).

cnf(162,negated_conjecture,
    empty_set = set_intersection2(esk4_0,esk2_0),
    inference(spm,[status(thm)],[51,148,theory(equality)]) ).

cnf(166,negated_conjecture,
    disjoint(esk2_0,esk4_0),
    inference(spm,[status(thm)],[79,162,theory(equality)]) ).

cnf(169,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[166,46,theory(equality)]) ).

cnf(170,negated_conjecture,
    $false,
    169,
    [proof] ).

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