%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU139+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:50:30 EST 2010
% Result : Theorem 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 60 ( 11 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 61 ( 29 ~; 17 |; 12 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 35 ( 3 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,conjecture,
! [X1,X2] :
~ ( subset(X1,X2)
& proper_subset(X2,X1) ),
file('/tmp/tmp6emz_0/sel_SEU139+2.p_1',t60_xboole_1) ).
fof(12,axiom,
! [X1,X2] : ~ proper_subset(X1,X1),
file('/tmp/tmp6emz_0/sel_SEU139+2.p_1',irreflexivity_r2_xboole_0) ).
fof(38,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& X1 != X2 ) ),
file('/tmp/tmp6emz_0/sel_SEU139+2.p_1',d8_xboole_0) ).
fof(39,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
=> ~ proper_subset(X2,X1) ),
file('/tmp/tmp6emz_0/sel_SEU139+2.p_1',antisymmetry_r2_xboole_0) ).
fof(56,negated_conjecture,
~ ! [X1,X2] :
~ ( subset(X1,X2)
& proper_subset(X2,X1) ),
inference(assume_negation,[status(cth)],[9]) ).
fof(59,plain,
! [X1,X2] : ~ proper_subset(X1,X1),
inference(fof_simplification,[status(thm)],[12,theory(equality)]) ).
fof(65,plain,
! [X1,X2] :
( proper_subset(X1,X2)
=> ~ proper_subset(X2,X1) ),
inference(fof_simplification,[status(thm)],[39,theory(equality)]) ).
fof(88,negated_conjecture,
? [X1,X2] :
( subset(X1,X2)
& proper_subset(X2,X1) ),
inference(fof_nnf,[status(thm)],[56]) ).
fof(89,negated_conjecture,
? [X3,X4] :
( subset(X3,X4)
& proper_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[88]) ).
fof(90,negated_conjecture,
( subset(esk2_0,esk3_0)
& proper_subset(esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[89]) ).
cnf(91,negated_conjecture,
proper_subset(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(92,negated_conjecture,
subset(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[90]) ).
fof(97,plain,
! [X3,X4] : ~ proper_subset(X3,X3),
inference(variable_rename,[status(thm)],[59]) ).
cnf(98,plain,
~ proper_subset(X1,X1),
inference(split_conjunct,[status(thm)],[97]) ).
fof(194,plain,
! [X1,X2] :
( ( ~ proper_subset(X1,X2)
| ( subset(X1,X2)
& X1 != X2 ) )
& ( ~ subset(X1,X2)
| X1 = X2
| proper_subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(195,plain,
! [X3,X4] :
( ( ~ proper_subset(X3,X4)
| ( subset(X3,X4)
& X3 != X4 ) )
& ( ~ subset(X3,X4)
| X3 = X4
| proper_subset(X3,X4) ) ),
inference(variable_rename,[status(thm)],[194]) ).
fof(196,plain,
! [X3,X4] :
( ( subset(X3,X4)
| ~ proper_subset(X3,X4) )
& ( X3 != X4
| ~ proper_subset(X3,X4) )
& ( ~ subset(X3,X4)
| X3 = X4
| proper_subset(X3,X4) ) ),
inference(distribute,[status(thm)],[195]) ).
cnf(197,plain,
( proper_subset(X1,X2)
| X1 = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[196]) ).
fof(200,plain,
! [X1,X2] :
( ~ proper_subset(X1,X2)
| ~ proper_subset(X2,X1) ),
inference(fof_nnf,[status(thm)],[65]) ).
fof(201,plain,
! [X3,X4] :
( ~ proper_subset(X3,X4)
| ~ proper_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[200]) ).
cnf(202,plain,
( ~ proper_subset(X1,X2)
| ~ proper_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[201]) ).
cnf(283,negated_conjecture,
~ proper_subset(esk2_0,esk3_0),
inference(spm,[status(thm)],[202,91,theory(equality)]) ).
cnf(902,negated_conjecture,
( esk2_0 = esk3_0
| ~ subset(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[283,197,theory(equality)]) ).
cnf(903,negated_conjecture,
( esk2_0 = esk3_0
| $false ),
inference(rw,[status(thm)],[902,92,theory(equality)]) ).
cnf(904,negated_conjecture,
esk2_0 = esk3_0,
inference(cn,[status(thm)],[903,theory(equality)]) ).
cnf(905,negated_conjecture,
proper_subset(esk2_0,esk2_0),
inference(rw,[status(thm)],[91,904,theory(equality)]) ).
cnf(906,negated_conjecture,
$false,
inference(sr,[status(thm)],[905,98,theory(equality)]) ).
cnf(907,negated_conjecture,
$false,
906,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU139+2.p
% --creating new selector for []
% -running prover on /tmp/tmp6emz_0/sel_SEU139+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU139+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU139+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU139+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
%
%------------------------------------------------------------------------------