%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU134+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:45:55 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 39 ( 18 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 38 ( 16 ~; 14 |; 5 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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-2 aty)
% Number of variables : 18 ( 0 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(19,conjecture,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/tmp/tmpZE057J/sel_SEU134+2.p_1',t37_xboole_1) ).
fof(20,axiom,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/tmp/tmpZE057J/sel_SEU134+2.p_1',l32_xboole_1) ).
fof(48,negated_conjecture,
~ ! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(118,negated_conjecture,
? [X1,X2] :
( ( set_difference(X1,X2) != empty_set
| ~ subset(X1,X2) )
& ( set_difference(X1,X2) = empty_set
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(119,negated_conjecture,
? [X3,X4] :
( ( set_difference(X3,X4) != empty_set
| ~ subset(X3,X4) )
& ( set_difference(X3,X4) = empty_set
| subset(X3,X4) ) ),
inference(variable_rename,[status(thm)],[118]) ).
fof(120,negated_conjecture,
( ( set_difference(esk5_0,esk6_0) != empty_set
| ~ subset(esk5_0,esk6_0) )
& ( set_difference(esk5_0,esk6_0) = empty_set
| subset(esk5_0,esk6_0) ) ),
inference(skolemize,[status(esa)],[119]) ).
cnf(121,negated_conjecture,
( subset(esk5_0,esk6_0)
| set_difference(esk5_0,esk6_0) = empty_set ),
inference(split_conjunct,[status(thm)],[120]) ).
cnf(122,negated_conjecture,
( ~ subset(esk5_0,esk6_0)
| set_difference(esk5_0,esk6_0) != empty_set ),
inference(split_conjunct,[status(thm)],[120]) ).
fof(123,plain,
! [X1,X2] :
( ( set_difference(X1,X2) != empty_set
| subset(X1,X2) )
& ( ~ subset(X1,X2)
| set_difference(X1,X2) = empty_set ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(124,plain,
! [X3,X4] :
( ( set_difference(X3,X4) != empty_set
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| set_difference(X3,X4) = empty_set ) ),
inference(variable_rename,[status(thm)],[123]) ).
cnf(125,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(126,plain,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(252,plain,
~ subset(esk5_0,esk6_0),
inference(spm,[status(thm)],[122,125,theory(equality)]) ).
cnf(537,negated_conjecture,
set_difference(esk5_0,esk6_0) = empty_set,
inference(sr,[status(thm)],[121,252,theory(equality)]) ).
cnf(544,negated_conjecture,
subset(esk5_0,esk6_0),
inference(spm,[status(thm)],[126,537,theory(equality)]) ).
cnf(553,negated_conjecture,
$false,
inference(sr,[status(thm)],[544,252,theory(equality)]) ).
cnf(554,negated_conjecture,
$false,
553,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU134+2.p
% --creating new selector for []
% -running prover on /tmp/tmpZE057J/sel_SEU134+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU134+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU134+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU134+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
%
%------------------------------------------------------------------------------