%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU150+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:22 EST 2010
% Result : Theorem 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 35 ( 33 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 6 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 4 sgn 19 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/tmp/tmpOtItnN/sel_SEU150+3.p_1',t8_zfmisc_1) ).
fof(3,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/tmp/tmpOtItnN/sel_SEU150+3.p_1',commutativity_k2_tarski) ).
fof(5,conjecture,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/tmp/tmpOtItnN/sel_SEU150+3.p_1',t9_zfmisc_1) ).
fof(6,negated_conjecture,
~ ! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
inference(assume_negation,[status(cth)],[5]) ).
fof(8,plain,
! [X1,X2,X3] :
( singleton(X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(9,plain,
! [X4,X5,X6] :
( singleton(X4) != unordered_pair(X5,X6)
| X4 = X5 ),
inference(variable_rename,[status(thm)],[8]) ).
cnf(10,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(14,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[3]) ).
cnf(15,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[14]) ).
fof(19,negated_conjecture,
? [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
& X2 != X3 ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(20,negated_conjecture,
? [X4,X5,X6] :
( singleton(X4) = unordered_pair(X5,X6)
& X5 != X6 ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,negated_conjecture,
( singleton(esk3_0) = unordered_pair(esk4_0,esk5_0)
& esk4_0 != esk5_0 ),
inference(skolemize,[status(esa)],[20]) ).
cnf(22,negated_conjecture,
esk4_0 != esk5_0,
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,negated_conjecture,
singleton(esk3_0) = unordered_pair(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(24,negated_conjecture,
( esk3_0 = X1
| unordered_pair(X1,X2) != unordered_pair(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[10,23,theory(equality)]) ).
cnf(25,plain,
( X1 = X2
| unordered_pair(X3,X2) != singleton(X1) ),
inference(spm,[status(thm)],[10,15,theory(equality)]) ).
cnf(27,negated_conjecture,
esk3_0 = esk4_0,
inference(er,[status(thm)],[24,theory(equality)]) ).
cnf(30,negated_conjecture,
singleton(esk3_0) = unordered_pair(esk3_0,esk5_0),
inference(rw,[status(thm)],[23,27,theory(equality)]) ).
cnf(31,negated_conjecture,
esk5_0 != esk3_0,
inference(rw,[status(thm)],[22,27,theory(equality)]) ).
cnf(34,negated_conjecture,
( esk3_0 = X1
| unordered_pair(X2,X1) != unordered_pair(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[25,30,theory(equality)]) ).
cnf(40,negated_conjecture,
esk3_0 = esk5_0,
inference(er,[status(thm)],[34,theory(equality)]) ).
cnf(43,negated_conjecture,
$false,
inference(sr,[status(thm)],[40,31,theory(equality)]) ).
cnf(44,negated_conjecture,
$false,
43,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU150+3.p
% --creating new selector for []
% -running prover on /tmp/tmpOtItnN/sel_SEU150+3.p_1 with time limit 29
% -prover status Theorem
% Problem SEU150+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU150+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU150+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
%
%------------------------------------------------------------------------------