%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET883+1 : TPTP v5.0.0. Released v3.2.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 03:43:20 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 23 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 3 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,conjecture,
! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
file('/tmp/tmprX4ATb/sel_SET883+1.p_1',t24_zfmisc_1) ).
fof(4,axiom,
! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
file('/tmp/tmprX4ATb/sel_SET883+1.p_1',t6_zfmisc_1) ).
fof(6,negated_conjecture,
~ ! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[3]) ).
fof(14,negated_conjecture,
? [X1,X2] :
( subset(singleton(X1),singleton(X2))
& X1 != X2 ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(15,negated_conjecture,
? [X3,X4] :
( subset(singleton(X3),singleton(X4))
& X3 != X4 ),
inference(variable_rename,[status(thm)],[14]) ).
fof(16,negated_conjecture,
( subset(singleton(esk3_0),singleton(esk4_0))
& esk3_0 != esk4_0 ),
inference(skolemize,[status(esa)],[15]) ).
cnf(17,negated_conjecture,
esk3_0 != esk4_0,
inference(split_conjunct,[status(thm)],[16]) ).
cnf(18,negated_conjecture,
subset(singleton(esk3_0),singleton(esk4_0)),
inference(split_conjunct,[status(thm)],[16]) ).
fof(19,plain,
! [X1,X2] :
( ~ subset(singleton(X1),singleton(X2))
| X1 = X2 ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(20,plain,
! [X3,X4] :
( ~ subset(singleton(X3),singleton(X4))
| X3 = X4 ),
inference(variable_rename,[status(thm)],[19]) ).
cnf(21,plain,
( X1 = X2
| ~ subset(singleton(X1),singleton(X2)) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(24,negated_conjecture,
esk3_0 = esk4_0,
inference(spm,[status(thm)],[21,18,theory(equality)]) ).
cnf(25,negated_conjecture,
$false,
inference(sr,[status(thm)],[24,17,theory(equality)]) ).
cnf(26,negated_conjecture,
$false,
25,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET883+1.p
% --creating new selector for []
% -running prover on /tmp/tmprX4ATb/sel_SET883+1.p_1 with time limit 29
% -prover status Theorem
% Problem SET883+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET883+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET883+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
%
%------------------------------------------------------------------------------