TSTP Solution File: SET591+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET591+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:59:11 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 48 ( 12 unt; 0 def)
% Number of atoms : 146 ( 18 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 168 ( 70 ~; 57 |; 32 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 90 ( 6 sgn 60 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmpApGBFR/sel_SET591+3.p_1',subset_defn) ).
fof(2,conjecture,
! [X1,X2] :
( subset(X1,difference(X2,X1))
=> X1 = empty_set ),
file('/tmp/tmpApGBFR/sel_SET591+3.p_1',prove_th50) ).
fof(3,axiom,
! [X1] :
( empty(X1)
<=> ! [X2] : ~ member(X2,X1) ),
file('/tmp/tmpApGBFR/sel_SET591+3.p_1',empty_defn) ).
fof(4,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/tmp/tmpApGBFR/sel_SET591+3.p_1',equal_defn) ).
fof(5,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/tmp/tmpApGBFR/sel_SET591+3.p_1',difference_defn) ).
fof(7,axiom,
! [X1] : ~ member(X1,empty_set),
file('/tmp/tmpApGBFR/sel_SET591+3.p_1',empty_set_defn) ).
fof(8,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,difference(X2,X1))
=> X1 = empty_set ),
inference(assume_negation,[status(cth)],[2]) ).
fof(9,plain,
! [X1] :
( empty(X1)
<=> ! [X2] : ~ member(X2,X1) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(10,plain,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(11,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(12,plain,
! [X1,X2] :
( ( ~ subset(X1,X2)
| ! [X3] :
( ~ member(X3,X1)
| member(X3,X2) ) )
& ( ? [X3] :
( member(X3,X1)
& ~ member(X3,X2) )
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(13,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ? [X7] :
( member(X7,X4)
& ~ member(X7,X5) )
| subset(X4,X5) ) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ( member(esk1_2(X4,X5),X4)
& ~ member(esk1_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[13]) ).
fof(15,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subset(X4,X5) )
& ( ( member(esk1_2(X4,X5),X4)
& ~ member(esk1_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[14]) ).
fof(16,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subset(X4,X5) )
& ( member(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[15]) ).
cnf(18,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(19,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(20,negated_conjecture,
? [X1,X2] :
( subset(X1,difference(X2,X1))
& X1 != empty_set ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(21,negated_conjecture,
? [X3,X4] :
( subset(X3,difference(X4,X3))
& X3 != empty_set ),
inference(variable_rename,[status(thm)],[20]) ).
fof(22,negated_conjecture,
( subset(esk2_0,difference(esk3_0,esk2_0))
& esk2_0 != empty_set ),
inference(skolemize,[status(esa)],[21]) ).
cnf(23,negated_conjecture,
esk2_0 != empty_set,
inference(split_conjunct,[status(thm)],[22]) ).
cnf(24,negated_conjecture,
subset(esk2_0,difference(esk3_0,esk2_0)),
inference(split_conjunct,[status(thm)],[22]) ).
fof(25,plain,
! [X1] :
( ( ~ empty(X1)
| ! [X2] : ~ member(X2,X1) )
& ( ? [X2] : member(X2,X1)
| empty(X1) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(26,plain,
! [X3] :
( ( ~ empty(X3)
| ! [X4] : ~ member(X4,X3) )
& ( ? [X5] : member(X5,X3)
| empty(X3) ) ),
inference(variable_rename,[status(thm)],[25]) ).
fof(27,plain,
! [X3] :
( ( ~ empty(X3)
| ! [X4] : ~ member(X4,X3) )
& ( member(esk4_1(X3),X3)
| empty(X3) ) ),
inference(skolemize,[status(esa)],[26]) ).
fof(28,plain,
! [X3,X4] :
( ( ~ member(X4,X3)
| ~ empty(X3) )
& ( member(esk4_1(X3),X3)
| empty(X3) ) ),
inference(shift_quantors,[status(thm)],[27]) ).
cnf(29,plain,
( empty(X1)
| member(esk4_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(30,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
fof(31,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(32,plain,
! [X3,X4] :
( ( X3 != X4
| ( subset(X3,X4)
& subset(X4,X3) ) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(variable_rename,[status(thm)],[31]) ).
fof(33,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)],[32]) ).
cnf(34,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[33]) ).
fof(37,plain,
! [X1,X2,X3] :
( ( ~ member(X3,difference(X1,X2))
| ( member(X3,X1)
& ~ member(X3,X2) ) )
& ( ~ member(X3,X1)
| member(X3,X2)
| member(X3,difference(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(38,plain,
! [X4,X5,X6] :
( ( ~ member(X6,difference(X4,X5))
| ( member(X6,X4)
& ~ member(X6,X5) ) )
& ( ~ member(X6,X4)
| member(X6,X5)
| member(X6,difference(X4,X5)) ) ),
inference(variable_rename,[status(thm)],[37]) ).
fof(39,plain,
! [X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X5)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X4)
| member(X6,X5)
| member(X6,difference(X4,X5)) ) ),
inference(distribute,[status(thm)],[38]) ).
cnf(41,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[39]) ).
fof(45,plain,
! [X2] : ~ member(X2,empty_set),
inference(variable_rename,[status(thm)],[11]) ).
cnf(46,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[45]) ).
cnf(50,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[46,18,theory(equality)]) ).
cnf(51,plain,
( subset(X1,X2)
| ~ empty(X1) ),
inference(spm,[status(thm)],[30,18,theory(equality)]) ).
cnf(63,negated_conjecture,
( member(X1,difference(esk3_0,esk2_0))
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[19,24,theory(equality)]) ).
cnf(66,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ empty(X2) ),
inference(spm,[status(thm)],[34,51,theory(equality)]) ).
cnf(73,plain,
( empty_set = X1
| ~ empty(X1) ),
inference(spm,[status(thm)],[66,50,theory(equality)]) ).
cnf(254,negated_conjecture,
~ member(X1,esk2_0),
inference(csr,[status(thm)],[63,41]) ).
cnf(255,negated_conjecture,
empty(esk2_0),
inference(spm,[status(thm)],[254,29,theory(equality)]) ).
cnf(259,negated_conjecture,
empty_set = esk2_0,
inference(spm,[status(thm)],[73,255,theory(equality)]) ).
cnf(262,negated_conjecture,
$false,
inference(sr,[status(thm)],[259,23,theory(equality)]) ).
cnf(263,negated_conjecture,
$false,
262,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET591+3.p
% --creating new selector for []
% -running prover on /tmp/tmpApGBFR/sel_SET591+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET591+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET591+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET591+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
%
%------------------------------------------------------------------------------