TSTP Solution File: SEU160+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU160+3 : 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 04:56:58 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 77 ( 48 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 85 ( 32 ~; 36 |; 14 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 22 ( 1 sgn 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/tmp/tmpkkDyv_/sel_SEU160+3.p_1',t39_zfmisc_1) ).
fof(3,axiom,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/tmp/tmpkkDyv_/sel_SEU160+3.p_1',l4_zfmisc_1) ).
fof(7,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(9,negated_conjecture,
? [X1,X2] :
( ( ~ subset(X1,singleton(X2))
| ( X1 != empty_set
& X1 != singleton(X2) ) )
& ( subset(X1,singleton(X2))
| X1 = empty_set
| X1 = singleton(X2) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(10,negated_conjecture,
? [X3,X4] :
( ( ~ subset(X3,singleton(X4))
| ( X3 != empty_set
& X3 != singleton(X4) ) )
& ( subset(X3,singleton(X4))
| X3 = empty_set
| X3 = singleton(X4) ) ),
inference(variable_rename,[status(thm)],[9]) ).
fof(11,negated_conjecture,
( ( ~ subset(esk1_0,singleton(esk2_0))
| ( esk1_0 != empty_set
& esk1_0 != singleton(esk2_0) ) )
& ( subset(esk1_0,singleton(esk2_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0) ) ),
inference(skolemize,[status(esa)],[10]) ).
fof(12,negated_conjecture,
( ( esk1_0 != empty_set
| ~ subset(esk1_0,singleton(esk2_0)) )
& ( esk1_0 != singleton(esk2_0)
| ~ subset(esk1_0,singleton(esk2_0)) )
& ( subset(esk1_0,singleton(esk2_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0) ) ),
inference(distribute,[status(thm)],[11]) ).
cnf(13,negated_conjecture,
( esk1_0 = singleton(esk2_0)
| esk1_0 = empty_set
| subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(14,negated_conjecture,
( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != singleton(esk2_0) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(15,negated_conjecture,
( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != empty_set ),
inference(split_conjunct,[status(thm)],[12]) ).
fof(19,plain,
! [X1,X2] :
( ( ~ subset(X1,singleton(X2))
| X1 = empty_set
| X1 = singleton(X2) )
& ( ( X1 != empty_set
& X1 != singleton(X2) )
| subset(X1,singleton(X2)) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(20,plain,
! [X3,X4] :
( ( ~ subset(X3,singleton(X4))
| X3 = empty_set
| X3 = singleton(X4) )
& ( ( X3 != empty_set
& X3 != singleton(X4) )
| subset(X3,singleton(X4)) ) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,plain,
! [X3,X4] :
( ( ~ subset(X3,singleton(X4))
| X3 = empty_set
| X3 = singleton(X4) )
& ( X3 != empty_set
| subset(X3,singleton(X4)) )
& ( X3 != singleton(X4)
| subset(X3,singleton(X4)) ) ),
inference(distribute,[status(thm)],[20]) ).
cnf(22,plain,
( subset(X1,singleton(X2))
| X1 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,plain,
( subset(X1,singleton(X2))
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(24,plain,
( X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(31,negated_conjecture,
empty_set != esk1_0,
inference(csr,[status(thm)],[15,23]) ).
cnf(32,negated_conjecture,
( singleton(esk2_0) = esk1_0
| subset(esk1_0,singleton(esk2_0)) ),
inference(sr,[status(thm)],[13,31,theory(equality)]) ).
cnf(33,negated_conjecture,
singleton(esk2_0) != esk1_0,
inference(csr,[status(thm)],[14,22]) ).
cnf(36,negated_conjecture,
subset(esk1_0,singleton(esk2_0)),
inference(sr,[status(thm)],[32,33,theory(equality)]) ).
cnf(37,negated_conjecture,
( singleton(esk2_0) = esk1_0
| empty_set = esk1_0 ),
inference(spm,[status(thm)],[24,36,theory(equality)]) ).
cnf(38,negated_conjecture,
empty_set = esk1_0,
inference(sr,[status(thm)],[37,33,theory(equality)]) ).
cnf(39,negated_conjecture,
$false,
inference(sr,[status(thm)],[38,31,theory(equality)]) ).
cnf(40,negated_conjecture,
$false,
39,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU160+3.p
% --creating new selector for []
% -running prover on /tmp/tmpkkDyv_/sel_SEU160+3.p_1 with time limit 29
% -prover status Theorem
% Problem SEU160+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU160+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU160+3.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
%
%------------------------------------------------------------------------------