%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU153+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:53:58 EST 2010
% Result : Theorem 0.31s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 16 unt; 0 def)
% Number of atoms : 64 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 23 ~; 16 |; 11 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 1 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/tmp/tmp5ZJxhn/sel_SEU153+2.p_1',t69_enumset1) ).
fof(14,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/tmp/tmp5ZJxhn/sel_SEU153+2.p_1',t83_xboole_1) ).
fof(33,axiom,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/tmp/tmp5ZJxhn/sel_SEU153+2.p_1',t37_xboole_1) ).
fof(49,conjecture,
! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
file('/tmp/tmp5ZJxhn/sel_SEU153+2.p_1',l25_zfmisc_1) ).
fof(69,axiom,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/tmp/tmp5ZJxhn/sel_SEU153+2.p_1',l2_zfmisc_1) ).
fof(72,axiom,
! [X1] : singleton(X1) != empty_set,
file('/tmp/tmp5ZJxhn/sel_SEU153+2.p_1',l1_zfmisc_1) ).
fof(77,negated_conjecture,
~ ! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
inference(assume_negation,[status(cth)],[49]) ).
fof(118,plain,
! [X2] : unordered_pair(X2,X2) = singleton(X2),
inference(variable_rename,[status(thm)],[10]) ).
cnf(119,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[118]) ).
fof(131,plain,
! [X1,X2] :
( ( ~ disjoint(X1,X2)
| set_difference(X1,X2) = X1 )
& ( set_difference(X1,X2) != X1
| disjoint(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(132,plain,
! [X3,X4] :
( ( ~ disjoint(X3,X4)
| set_difference(X3,X4) = X3 )
& ( set_difference(X3,X4) != X3
| disjoint(X3,X4) ) ),
inference(variable_rename,[status(thm)],[131]) ).
cnf(134,plain,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[132]) ).
fof(187,plain,
! [X1,X2] :
( ( set_difference(X1,X2) != empty_set
| subset(X1,X2) )
& ( ~ subset(X1,X2)
| set_difference(X1,X2) = empty_set ) ),
inference(fof_nnf,[status(thm)],[33]) ).
fof(188,plain,
! [X3,X4] :
( ( set_difference(X3,X4) != empty_set
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| set_difference(X3,X4) = empty_set ) ),
inference(variable_rename,[status(thm)],[187]) ).
cnf(189,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[188]) ).
fof(248,negated_conjecture,
? [X1,X2] :
( disjoint(singleton(X1),X2)
& in(X1,X2) ),
inference(fof_nnf,[status(thm)],[77]) ).
fof(249,negated_conjecture,
? [X3,X4] :
( disjoint(singleton(X3),X4)
& in(X3,X4) ),
inference(variable_rename,[status(thm)],[248]) ).
fof(250,negated_conjecture,
( disjoint(singleton(esk8_0),esk9_0)
& in(esk8_0,esk9_0) ),
inference(skolemize,[status(esa)],[249]) ).
cnf(251,negated_conjecture,
in(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[250]) ).
cnf(252,negated_conjecture,
disjoint(singleton(esk8_0),esk9_0),
inference(split_conjunct,[status(thm)],[250]) ).
fof(308,plain,
! [X1,X2] :
( ( ~ subset(singleton(X1),X2)
| in(X1,X2) )
& ( ~ in(X1,X2)
| subset(singleton(X1),X2) ) ),
inference(fof_nnf,[status(thm)],[69]) ).
fof(309,plain,
! [X3,X4] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X3,X4)
| subset(singleton(X3),X4) ) ),
inference(variable_rename,[status(thm)],[308]) ).
cnf(310,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[309]) ).
fof(323,plain,
! [X2] : singleton(X2) != empty_set,
inference(variable_rename,[status(thm)],[72]) ).
cnf(324,plain,
singleton(X1) != empty_set,
inference(split_conjunct,[status(thm)],[323]) ).
cnf(358,negated_conjecture,
disjoint(unordered_pair(esk8_0,esk8_0),esk9_0),
inference(rw,[status(thm)],[252,119,theory(equality)]),
[unfolding] ).
cnf(367,plain,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[310,119,theory(equality)]),
[unfolding] ).
cnf(373,plain,
unordered_pair(X1,X1) != empty_set,
inference(rw,[status(thm)],[324,119,theory(equality)]),
[unfolding] ).
cnf(412,negated_conjecture,
set_difference(unordered_pair(esk8_0,esk8_0),esk9_0) = unordered_pair(esk8_0,esk8_0),
inference(spm,[status(thm)],[134,358,theory(equality)]) ).
cnf(512,negated_conjecture,
subset(unordered_pair(esk8_0,esk8_0),esk9_0),
inference(spm,[status(thm)],[367,251,theory(equality)]) ).
cnf(1391,negated_conjecture,
set_difference(unordered_pair(esk8_0,esk8_0),esk9_0) = empty_set,
inference(spm,[status(thm)],[189,512,theory(equality)]) ).
cnf(1538,negated_conjecture,
empty_set = unordered_pair(esk8_0,esk8_0),
inference(rw,[status(thm)],[412,1391,theory(equality)]) ).
cnf(1539,negated_conjecture,
$false,
inference(sr,[status(thm)],[1538,373,theory(equality)]) ).
cnf(1540,negated_conjecture,
$false,
1539,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU153+2.p
% --creating new selector for []
% -running prover on /tmp/tmp5ZJxhn/sel_SEU153+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU153+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU153+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU153+2.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
%
%------------------------------------------------------------------------------