%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET901+1 : TPTP v5.0.0. Released v3.2.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 03:45:21 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 2
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 143 ( 104 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 180 ( 71 ~; 69 |; 37 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 4 sgn 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( subset(X1,unordered_pair(X2,X3))
<=> ~ ( X1 != empty_set
& X1 != singleton(X2)
& X1 != singleton(X3)
& X1 != unordered_pair(X2,X3) ) ),
file('/tmp/tmpu2EwWQ/sel_SET901+1.p_1',l46_zfmisc_1) ).
fof(2,conjecture,
! [X1,X2,X3] :
( subset(X1,unordered_pair(X2,X3))
<=> ~ ( X1 != empty_set
& X1 != singleton(X2)
& X1 != singleton(X3)
& X1 != unordered_pair(X2,X3) ) ),
file('/tmp/tmpu2EwWQ/sel_SET901+1.p_1',t42_zfmisc_1) ).
fof(8,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,unordered_pair(X2,X3))
<=> ~ ( X1 != empty_set
& X1 != singleton(X2)
& X1 != singleton(X3)
& X1 != unordered_pair(X2,X3) ) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(10,plain,
! [X1,X2,X3] :
( ( ~ subset(X1,unordered_pair(X2,X3))
| X1 = empty_set
| X1 = singleton(X2)
| X1 = singleton(X3)
| X1 = unordered_pair(X2,X3) )
& ( ( X1 != empty_set
& X1 != singleton(X2)
& X1 != singleton(X3)
& X1 != unordered_pair(X2,X3) )
| subset(X1,unordered_pair(X2,X3)) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(11,plain,
! [X4,X5,X6] :
( ( ~ subset(X4,unordered_pair(X5,X6))
| X4 = empty_set
| X4 = singleton(X5)
| X4 = singleton(X6)
| X4 = unordered_pair(X5,X6) )
& ( ( X4 != empty_set
& X4 != singleton(X5)
& X4 != singleton(X6)
& X4 != unordered_pair(X5,X6) )
| subset(X4,unordered_pair(X5,X6)) ) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(12,plain,
! [X4,X5,X6] :
( ( ~ subset(X4,unordered_pair(X5,X6))
| X4 = empty_set
| X4 = singleton(X5)
| X4 = singleton(X6)
| X4 = unordered_pair(X5,X6) )
& ( X4 != empty_set
| subset(X4,unordered_pair(X5,X6)) )
& ( X4 != singleton(X5)
| subset(X4,unordered_pair(X5,X6)) )
& ( X4 != singleton(X6)
| subset(X4,unordered_pair(X5,X6)) )
& ( X4 != unordered_pair(X5,X6)
| subset(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[11]) ).
cnf(13,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(14,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(15,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(16,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(17,plain,
( X1 = unordered_pair(X2,X3)
| X1 = singleton(X3)
| X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[12]) ).
fof(18,negated_conjecture,
? [X1,X2,X3] :
( ( ~ subset(X1,unordered_pair(X2,X3))
| ( X1 != empty_set
& X1 != singleton(X2)
& X1 != singleton(X3)
& X1 != unordered_pair(X2,X3) ) )
& ( subset(X1,unordered_pair(X2,X3))
| X1 = empty_set
| X1 = singleton(X2)
| X1 = singleton(X3)
| X1 = unordered_pair(X2,X3) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(19,negated_conjecture,
? [X4,X5,X6] :
( ( ~ subset(X4,unordered_pair(X5,X6))
| ( X4 != empty_set
& X4 != singleton(X5)
& X4 != singleton(X6)
& X4 != unordered_pair(X5,X6) ) )
& ( subset(X4,unordered_pair(X5,X6))
| X4 = empty_set
| X4 = singleton(X5)
| X4 = singleton(X6)
| X4 = unordered_pair(X5,X6) ) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(20,negated_conjecture,
( ( ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0))
| ( esk1_0 != empty_set
& esk1_0 != singleton(esk2_0)
& esk1_0 != singleton(esk3_0)
& esk1_0 != unordered_pair(esk2_0,esk3_0) ) )
& ( subset(esk1_0,unordered_pair(esk2_0,esk3_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0)
| esk1_0 = singleton(esk3_0)
| esk1_0 = unordered_pair(esk2_0,esk3_0) ) ),
inference(skolemize,[status(esa)],[19]) ).
fof(21,negated_conjecture,
( ( esk1_0 != empty_set
| ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0)) )
& ( esk1_0 != singleton(esk2_0)
| ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0)) )
& ( esk1_0 != singleton(esk3_0)
| ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0)) )
& ( esk1_0 != unordered_pair(esk2_0,esk3_0)
| ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0)) )
& ( subset(esk1_0,unordered_pair(esk2_0,esk3_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0)
| esk1_0 = singleton(esk3_0)
| esk1_0 = unordered_pair(esk2_0,esk3_0) ) ),
inference(distribute,[status(thm)],[20]) ).
cnf(22,negated_conjecture,
( esk1_0 = unordered_pair(esk2_0,esk3_0)
| esk1_0 = singleton(esk3_0)
| esk1_0 = singleton(esk2_0)
| esk1_0 = empty_set
| subset(esk1_0,unordered_pair(esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,negated_conjecture,
( ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0))
| esk1_0 != unordered_pair(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(24,negated_conjecture,
( ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0))
| esk1_0 != singleton(esk3_0) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(25,negated_conjecture,
( ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0))
| esk1_0 != singleton(esk2_0) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(26,negated_conjecture,
( ~ subset(esk1_0,unordered_pair(esk2_0,esk3_0))
| esk1_0 != empty_set ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(42,negated_conjecture,
empty_set != esk1_0,
inference(csr,[status(thm)],[26,16]) ).
cnf(45,negated_conjecture,
singleton(esk2_0) != esk1_0,
inference(csr,[status(thm)],[25,15]) ).
cnf(46,negated_conjecture,
singleton(esk3_0) != esk1_0,
inference(csr,[status(thm)],[24,14]) ).
cnf(49,negated_conjecture,
unordered_pair(esk2_0,esk3_0) != esk1_0,
inference(csr,[status(thm)],[23,13]) ).
cnf(50,negated_conjecture,
( singleton(esk2_0) = esk1_0
| singleton(esk3_0) = esk1_0
| unordered_pair(esk2_0,esk3_0) = esk1_0
| subset(esk1_0,unordered_pair(esk2_0,esk3_0)) ),
inference(sr,[status(thm)],[22,42,theory(equality)]) ).
cnf(51,negated_conjecture,
( singleton(esk3_0) = esk1_0
| unordered_pair(esk2_0,esk3_0) = esk1_0
| subset(esk1_0,unordered_pair(esk2_0,esk3_0)) ),
inference(sr,[status(thm)],[50,45,theory(equality)]) ).
cnf(52,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = esk1_0
| subset(esk1_0,unordered_pair(esk2_0,esk3_0)) ),
inference(sr,[status(thm)],[51,46,theory(equality)]) ).
cnf(53,negated_conjecture,
subset(esk1_0,unordered_pair(esk2_0,esk3_0)),
inference(sr,[status(thm)],[52,49,theory(equality)]) ).
cnf(54,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = esk1_0
| singleton(esk2_0) = esk1_0
| singleton(esk3_0) = esk1_0
| empty_set = esk1_0 ),
inference(spm,[status(thm)],[17,53,theory(equality)]) ).
cnf(61,negated_conjecture,
( singleton(esk2_0) = esk1_0
| singleton(esk3_0) = esk1_0
| empty_set = esk1_0 ),
inference(sr,[status(thm)],[54,49,theory(equality)]) ).
cnf(62,negated_conjecture,
( singleton(esk3_0) = esk1_0
| empty_set = esk1_0 ),
inference(sr,[status(thm)],[61,45,theory(equality)]) ).
cnf(63,negated_conjecture,
empty_set = esk1_0,
inference(sr,[status(thm)],[62,46,theory(equality)]) ).
cnf(64,negated_conjecture,
$false,
inference(sr,[status(thm)],[63,42,theory(equality)]) ).
cnf(65,negated_conjecture,
$false,
64,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET901+1.p
% --creating new selector for []
% -running prover on /tmp/tmpu2EwWQ/sel_SET901+1.p_1 with time limit 29
% -prover status Theorem
% Problem SET901+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET901+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET901+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
%
%------------------------------------------------------------------------------