%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU158+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:55:49 EST 2010
% Result : Theorem 0.32s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 53 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 21 ~; 19 |; 5 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(46,axiom,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/tmp/tmpnQRLdI/sel_SEU158+2.p_1',t69_enumset1) ).
fof(51,conjecture,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/tmp/tmpnQRLdI/sel_SEU158+2.p_1',t37_zfmisc_1) ).
fof(85,axiom,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/tmp/tmpnQRLdI/sel_SEU158+2.p_1',l2_zfmisc_1) ).
fof(89,negated_conjecture,
~ ! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
inference(assume_negation,[status(cth)],[51]) ).
fof(250,plain,
! [X2] : unordered_pair(X2,X2) = singleton(X2),
inference(variable_rename,[status(thm)],[46]) ).
cnf(251,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[250]) ).
fof(261,negated_conjecture,
? [X1,X2] :
( ( ~ subset(singleton(X1),X2)
| ~ in(X1,X2) )
& ( subset(singleton(X1),X2)
| in(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[89]) ).
fof(262,negated_conjecture,
? [X3,X4] :
( ( ~ subset(singleton(X3),X4)
| ~ in(X3,X4) )
& ( subset(singleton(X3),X4)
| in(X3,X4) ) ),
inference(variable_rename,[status(thm)],[261]) ).
fof(263,negated_conjecture,
( ( ~ subset(singleton(esk7_0),esk8_0)
| ~ in(esk7_0,esk8_0) )
& ( subset(singleton(esk7_0),esk8_0)
| in(esk7_0,esk8_0) ) ),
inference(skolemize,[status(esa)],[262]) ).
cnf(264,negated_conjecture,
( in(esk7_0,esk8_0)
| subset(singleton(esk7_0),esk8_0) ),
inference(split_conjunct,[status(thm)],[263]) ).
cnf(265,negated_conjecture,
( ~ in(esk7_0,esk8_0)
| ~ subset(singleton(esk7_0),esk8_0) ),
inference(split_conjunct,[status(thm)],[263]) ).
fof(408,plain,
! [X1,X2] :
( ( ~ subset(singleton(X1),X2)
| in(X1,X2) )
& ( ~ in(X1,X2)
| subset(singleton(X1),X2) ) ),
inference(fof_nnf,[status(thm)],[85]) ).
fof(409,plain,
! [X3,X4] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X3,X4)
| subset(singleton(X3),X4) ) ),
inference(variable_rename,[status(thm)],[408]) ).
cnf(410,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[409]) ).
cnf(411,plain,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[409]) ).
cnf(425,negated_conjecture,
( in(esk7_0,esk8_0)
| subset(unordered_pair(esk7_0,esk7_0),esk8_0) ),
inference(rw,[status(thm)],[264,251,theory(equality)]),
[unfolding] ).
cnf(433,plain,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X1),X2) ),
inference(rw,[status(thm)],[411,251,theory(equality)]),
[unfolding] ).
cnf(434,plain,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[410,251,theory(equality)]),
[unfolding] ).
cnf(442,negated_conjecture,
( ~ in(esk7_0,esk8_0)
| ~ subset(unordered_pair(esk7_0,esk7_0),esk8_0) ),
inference(rw,[status(thm)],[265,251,theory(equality)]),
[unfolding] ).
cnf(625,negated_conjecture,
in(esk7_0,esk8_0),
inference(spm,[status(thm)],[433,425,theory(equality)]) ).
cnf(1896,negated_conjecture,
subset(unordered_pair(esk7_0,esk7_0),esk8_0),
inference(spm,[status(thm)],[434,625,theory(equality)]) ).
cnf(1900,negated_conjecture,
( $false
| ~ subset(unordered_pair(esk7_0,esk7_0),esk8_0) ),
inference(rw,[status(thm)],[442,625,theory(equality)]) ).
cnf(1901,negated_conjecture,
~ subset(unordered_pair(esk7_0,esk7_0),esk8_0),
inference(cn,[status(thm)],[1900,theory(equality)]) ).
cnf(1986,negated_conjecture,
$false,
inference(rw,[status(thm)],[1901,1896,theory(equality)]) ).
cnf(1987,negated_conjecture,
$false,
inference(cn,[status(thm)],[1986,theory(equality)]) ).
cnf(1988,negated_conjecture,
$false,
1987,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU158+2.p
% --creating new selector for []
% -running prover on /tmp/tmpnQRLdI/sel_SEU158+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU158+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU158+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU158+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
%
%------------------------------------------------------------------------------