TSTP Solution File: SEU150+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU150+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 04:57:39 EST 2010
% Result : Theorem 27.90s
% Output : CNFRefutation 27.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 41 ( 13 unt; 0 def)
% Number of atoms : 183 ( 130 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 224 ( 82 ~; 92 |; 43 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 95 ( 6 sgn 59 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/tmp/tmpQ6Iuym/sel_SEU150+2.p_1',t69_enumset1) ).
fof(15,conjecture,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/tmp/tmpQ6Iuym/sel_SEU150+2.p_1',t9_zfmisc_1) ).
fof(17,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/tmp/tmpQ6Iuym/sel_SEU150+2.p_1',t8_zfmisc_1) ).
fof(68,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/tmp/tmpQ6Iuym/sel_SEU150+2.p_1',d1_tarski) ).
fof(72,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/tmp/tmpQ6Iuym/sel_SEU150+2.p_1',d2_tarski) ).
fof(74,negated_conjecture,
~ ! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
inference(assume_negation,[status(cth)],[15]) ).
fof(107,plain,
! [X2] : unordered_pair(X2,X2) = singleton(X2),
inference(variable_rename,[status(thm)],[9]) ).
cnf(108,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[107]) ).
fof(126,negated_conjecture,
? [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
& X2 != X3 ),
inference(fof_nnf,[status(thm)],[74]) ).
fof(127,negated_conjecture,
? [X4,X5,X6] :
( singleton(X4) = unordered_pair(X5,X6)
& X5 != X6 ),
inference(variable_rename,[status(thm)],[126]) ).
fof(128,negated_conjecture,
( singleton(esk2_0) = unordered_pair(esk3_0,esk4_0)
& esk3_0 != esk4_0 ),
inference(skolemize,[status(esa)],[127]) ).
cnf(129,negated_conjecture,
esk3_0 != esk4_0,
inference(split_conjunct,[status(thm)],[128]) ).
cnf(130,negated_conjecture,
singleton(esk2_0) = unordered_pair(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[128]) ).
fof(133,plain,
! [X1,X2,X3] :
( singleton(X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(134,plain,
! [X4,X5,X6] :
( singleton(X4) != unordered_pair(X5,X6)
| X4 = X5 ),
inference(variable_rename,[status(thm)],[133]) ).
cnf(135,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[134]) ).
fof(302,plain,
! [X1,X2] :
( ( X2 != singleton(X1)
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1 )
& ( X3 != X1
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( ~ in(X3,X2)
| X3 != X1 )
& ( in(X3,X2)
| X3 = X1 ) )
| X2 = singleton(X1) ) ),
inference(fof_nnf,[status(thm)],[68]) ).
fof(303,plain,
! [X4,X5] :
( ( X5 != singleton(X4)
| ! [X6] :
( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) ) )
& ( ? [X7] :
( ( ~ in(X7,X5)
| X7 != X4 )
& ( in(X7,X5)
| X7 = X4 ) )
| X5 = singleton(X4) ) ),
inference(variable_rename,[status(thm)],[302]) ).
fof(304,plain,
! [X4,X5] :
( ( X5 != singleton(X4)
| ! [X6] :
( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) ) )
& ( ( ( ~ in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) != X4 )
& ( in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) = X4 ) )
| X5 = singleton(X4) ) ),
inference(skolemize,[status(esa)],[303]) ).
fof(305,plain,
! [X4,X5,X6] :
( ( ( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) )
| X5 != singleton(X4) )
& ( ( ( ~ in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) != X4 )
& ( in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) = X4 ) )
| X5 = singleton(X4) ) ),
inference(shift_quantors,[status(thm)],[304]) ).
fof(306,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) = X4
| X5 = singleton(X4) ) ),
inference(distribute,[status(thm)],[305]) ).
cnf(310,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[306]) ).
fof(332,plain,
! [X1,X2,X3] :
( ( X3 != unordered_pair(X1,X2)
| ! [X4] :
( ( ~ in(X4,X3)
| X4 = X1
| X4 = X2 )
& ( ( X4 != X1
& X4 != X2 )
| in(X4,X3) ) ) )
& ( ? [X4] :
( ( ~ in(X4,X3)
| ( X4 != X1
& X4 != X2 ) )
& ( in(X4,X3)
| X4 = X1
| X4 = X2 ) )
| X3 = unordered_pair(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[72]) ).
fof(333,plain,
! [X5,X6,X7] :
( ( X7 != unordered_pair(X5,X6)
| ! [X8] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6 )
& ( ( X8 != X5
& X8 != X6 )
| in(X8,X7) ) ) )
& ( ? [X9] :
( ( ~ in(X9,X7)
| ( X9 != X5
& X9 != X6 ) )
& ( in(X9,X7)
| X9 = X5
| X9 = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(variable_rename,[status(thm)],[332]) ).
fof(334,plain,
! [X5,X6,X7] :
( ( X7 != unordered_pair(X5,X6)
| ! [X8] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6 )
& ( ( X8 != X5
& X8 != X6 )
| in(X8,X7) ) ) )
& ( ( ( ~ in(esk16_3(X5,X6,X7),X7)
| ( esk16_3(X5,X6,X7) != X5
& esk16_3(X5,X6,X7) != X6 ) )
& ( in(esk16_3(X5,X6,X7),X7)
| esk16_3(X5,X6,X7) = X5
| esk16_3(X5,X6,X7) = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(skolemize,[status(esa)],[333]) ).
fof(335,plain,
! [X5,X6,X7,X8] :
( ( ( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6 )
& ( ( X8 != X5
& X8 != X6 )
| in(X8,X7) ) )
| X7 != unordered_pair(X5,X6) )
& ( ( ( ~ in(esk16_3(X5,X6,X7),X7)
| ( esk16_3(X5,X6,X7) != X5
& esk16_3(X5,X6,X7) != X6 ) )
& ( in(esk16_3(X5,X6,X7),X7)
| esk16_3(X5,X6,X7) = X5
| esk16_3(X5,X6,X7) = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[334]) ).
fof(336,plain,
! [X5,X6,X7,X8] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6
| X7 != unordered_pair(X5,X6) )
& ( X8 != X5
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( X8 != X6
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( esk16_3(X5,X6,X7) != X5
| ~ in(esk16_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( esk16_3(X5,X6,X7) != X6
| ~ in(esk16_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( in(esk16_3(X5,X6,X7),X7)
| esk16_3(X5,X6,X7) = X5
| esk16_3(X5,X6,X7) = X6
| X7 = unordered_pair(X5,X6) ) ),
inference(distribute,[status(thm)],[335]) ).
cnf(340,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[336]) ).
cnf(346,negated_conjecture,
unordered_pair(esk3_0,esk4_0) = unordered_pair(esk2_0,esk2_0),
inference(rw,[status(thm)],[130,108,theory(equality)]),
[unfolding] ).
cnf(348,plain,
( X1 = X2
| unordered_pair(X2,X3) != unordered_pair(X1,X1) ),
inference(rw,[status(thm)],[135,108,theory(equality)]),
[unfolding] ).
cnf(356,plain,
( X2 = X3
| unordered_pair(X2,X2) != X1
| ~ in(X3,X1) ),
inference(rw,[status(thm)],[310,108,theory(equality)]),
[unfolding] ).
cnf(547,plain,
( in(X1,X2)
| unordered_pair(X3,X1) != X2 ),
inference(er,[status(thm)],[340,theory(equality)]) ).
cnf(617,negated_conjecture,
( esk2_0 = X1
| unordered_pair(esk3_0,esk4_0) != unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[348,346,theory(equality)]) ).
cnf(937,plain,
( X1 = X2
| ~ in(X2,unordered_pair(X1,X1)) ),
inference(er,[status(thm)],[356,theory(equality)]) ).
cnf(4865,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[547,theory(equality)]) ).
cnf(7925,negated_conjecture,
esk2_0 = esk3_0,
inference(er,[status(thm)],[617,theory(equality)]) ).
cnf(7938,negated_conjecture,
unordered_pair(esk3_0,esk3_0) = unordered_pair(esk3_0,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[346,7925,theory(equality)]),7925,theory(equality)]) ).
cnf(339388,negated_conjecture,
in(esk4_0,unordered_pair(esk3_0,esk3_0)),
inference(spm,[status(thm)],[4865,7938,theory(equality)]) ).
cnf(339506,negated_conjecture,
esk3_0 = esk4_0,
inference(spm,[status(thm)],[937,339388,theory(equality)]) ).
cnf(339524,negated_conjecture,
$false,
inference(sr,[status(thm)],[339506,129,theory(equality)]) ).
cnf(339525,negated_conjecture,
$false,
339524,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU150+2.p
% --creating new selector for []
% -running prover on /tmp/tmpQ6Iuym/sel_SEU150+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU150+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU150+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU150+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
%
%------------------------------------------------------------------------------