%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET063+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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 02:40:45 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 47 ( 18 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 45 ( 18 ~; 14 |; 10 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 17 ( 1 sgn 12 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,conjecture,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/tmp/tmpz3bIrI/sel_SET063+3.p_1',prove_subset_of_empty_set_is_empty_set) ).
fof(4,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/tmp/tmpz3bIrI/sel_SET063+3.p_1',equal_defn) ).
fof(5,axiom,
! [X1] : subset(empty_set,X1),
file('/tmp/tmpz3bIrI/sel_SET063+3.p_1',empty_set_subset) ).
fof(8,negated_conjecture,
~ ! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
inference(assume_negation,[status(cth)],[2]) ).
fof(19,negated_conjecture,
? [X1] :
( subset(X1,empty_set)
& X1 != empty_set ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(20,negated_conjecture,
? [X2] :
( subset(X2,empty_set)
& X2 != empty_set ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,negated_conjecture,
( subset(esk2_0,empty_set)
& esk2_0 != empty_set ),
inference(skolemize,[status(esa)],[20]) ).
cnf(22,negated_conjecture,
esk2_0 != empty_set,
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,negated_conjecture,
subset(esk2_0,empty_set),
inference(split_conjunct,[status(thm)],[21]) ).
fof(30,plain,
! [X1,X2] :
( ( X1 != X2
| ( subset(X1,X2)
& subset(X2,X1) ) )
& ( ~ subset(X1,X2)
| ~ subset(X2,X1)
| X1 = X2 ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(31,plain,
! [X3,X4] :
( ( X3 != X4
| ( subset(X3,X4)
& subset(X4,X3) ) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(variable_rename,[status(thm)],[30]) ).
fof(32,plain,
! [X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[31]) ).
cnf(33,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[32]) ).
fof(36,plain,
! [X2] : subset(empty_set,X2),
inference(variable_rename,[status(thm)],[5]) ).
cnf(37,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(46,negated_conjecture,
( empty_set = esk2_0
| ~ subset(empty_set,esk2_0) ),
inference(spm,[status(thm)],[33,23,theory(equality)]) ).
cnf(48,negated_conjecture,
( empty_set = esk2_0
| $false ),
inference(rw,[status(thm)],[46,37,theory(equality)]) ).
cnf(49,negated_conjecture,
empty_set = esk2_0,
inference(cn,[status(thm)],[48,theory(equality)]) ).
cnf(50,negated_conjecture,
$false,
inference(sr,[status(thm)],[49,22,theory(equality)]) ).
cnf(51,negated_conjecture,
$false,
50,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET063+3.p
% --creating new selector for []
% -running prover on /tmp/tmpz3bIrI/sel_SET063+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET063+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET063+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET063+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
%
%------------------------------------------------------------------------------