%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET199+4 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:54:41 EST 2010
% Result : Theorem 1.00s
% Output : CNFRefutation 1.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 47 ( 7 unt; 0 def)
% Number of atoms : 152 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 174 ( 69 ~; 73 |; 27 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 2 sgn 36 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmpe7yjgL/sel_SET199+4.p_1',subset) ).
fof(2,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/tmp/tmpe7yjgL/sel_SET199+4.p_1',intersection) ).
fof(3,conjecture,
! [X1,X3,X4] :
( ( subset(X1,X3)
& subset(X1,X4) )
<=> subset(X1,intersection(X3,X4)) ),
file('/tmp/tmpe7yjgL/sel_SET199+4.p_1',thI46) ).
fof(4,negated_conjecture,
~ ! [X1,X3,X4] :
( ( subset(X1,X3)
& subset(X1,X4) )
<=> subset(X1,intersection(X3,X4)) ),
inference(assume_negation,[status(cth)],[3]) ).
fof(5,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(6,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)],[5]) ).
fof(7,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)],[6]) ).
fof(8,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)],[7]) ).
fof(9,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)],[8]) ).
cnf(10,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(11,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(12,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(13,plain,
! [X3,X1,X2] :
( ( ~ member(X3,intersection(X1,X2))
| ( member(X3,X1)
& member(X3,X2) ) )
& ( ~ member(X3,X1)
| ~ member(X3,X2)
| member(X3,intersection(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(14,plain,
! [X4,X5,X6] :
( ( ~ member(X4,intersection(X5,X6))
| ( member(X4,X5)
& member(X4,X6) ) )
& ( ~ member(X4,X5)
| ~ member(X4,X6)
| member(X4,intersection(X5,X6)) ) ),
inference(variable_rename,[status(thm)],[13]) ).
fof(15,plain,
! [X4,X5,X6] :
( ( member(X4,X5)
| ~ member(X4,intersection(X5,X6)) )
& ( member(X4,X6)
| ~ member(X4,intersection(X5,X6)) )
& ( ~ member(X4,X5)
| ~ member(X4,X6)
| member(X4,intersection(X5,X6)) ) ),
inference(distribute,[status(thm)],[14]) ).
cnf(16,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(17,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(18,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[15]) ).
fof(19,negated_conjecture,
? [X1,X3,X4] :
( ( ~ subset(X1,X3)
| ~ subset(X1,X4)
| ~ subset(X1,intersection(X3,X4)) )
& ( ( subset(X1,X3)
& subset(X1,X4) )
| subset(X1,intersection(X3,X4)) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(20,negated_conjecture,
? [X5,X6,X7] :
( ( ~ subset(X5,X6)
| ~ subset(X5,X7)
| ~ subset(X5,intersection(X6,X7)) )
& ( ( subset(X5,X6)
& subset(X5,X7) )
| subset(X5,intersection(X6,X7)) ) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,negated_conjecture,
( ( ~ subset(esk2_0,esk3_0)
| ~ subset(esk2_0,esk4_0)
| ~ subset(esk2_0,intersection(esk3_0,esk4_0)) )
& ( ( subset(esk2_0,esk3_0)
& subset(esk2_0,esk4_0) )
| subset(esk2_0,intersection(esk3_0,esk4_0)) ) ),
inference(skolemize,[status(esa)],[20]) ).
fof(22,negated_conjecture,
( ( ~ subset(esk2_0,esk3_0)
| ~ subset(esk2_0,esk4_0)
| ~ subset(esk2_0,intersection(esk3_0,esk4_0)) )
& ( subset(esk2_0,esk3_0)
| subset(esk2_0,intersection(esk3_0,esk4_0)) )
& ( subset(esk2_0,esk4_0)
| subset(esk2_0,intersection(esk3_0,esk4_0)) ) ),
inference(distribute,[status(thm)],[21]) ).
cnf(23,negated_conjecture,
( subset(esk2_0,intersection(esk3_0,esk4_0))
| subset(esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(24,negated_conjecture,
( subset(esk2_0,intersection(esk3_0,esk4_0))
| subset(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(25,negated_conjecture,
( ~ subset(esk2_0,intersection(esk3_0,esk4_0))
| ~ subset(esk2_0,esk4_0)
| ~ subset(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(31,negated_conjecture,
( member(X1,intersection(esk3_0,esk4_0))
| subset(esk2_0,esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[12,24,theory(equality)]) ).
cnf(32,negated_conjecture,
( member(X1,intersection(esk3_0,esk4_0))
| subset(esk2_0,esk4_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[12,23,theory(equality)]) ).
cnf(33,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk1_2(X1,intersection(X2,X3)),X3)
| ~ member(esk1_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[10,16,theory(equality)]) ).
cnf(43,negated_conjecture,
( member(X1,esk3_0)
| subset(esk2_0,esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[18,31,theory(equality)]) ).
cnf(53,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(csr,[status(thm)],[43,12]) ).
cnf(54,negated_conjecture,
( subset(X1,esk3_0)
| ~ member(esk1_2(X1,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[10,53,theory(equality)]) ).
cnf(55,negated_conjecture,
subset(esk2_0,esk3_0),
inference(spm,[status(thm)],[54,11,theory(equality)]) ).
cnf(63,negated_conjecture,
( ~ subset(esk2_0,intersection(esk3_0,esk4_0))
| $false
| ~ subset(esk2_0,esk4_0) ),
inference(rw,[status(thm)],[25,55,theory(equality)]) ).
cnf(64,negated_conjecture,
( ~ subset(esk2_0,intersection(esk3_0,esk4_0))
| ~ subset(esk2_0,esk4_0) ),
inference(cn,[status(thm)],[63,theory(equality)]) ).
cnf(70,negated_conjecture,
( member(X1,esk4_0)
| subset(esk2_0,esk4_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[17,32,theory(equality)]) ).
cnf(82,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk2_0) ),
inference(csr,[status(thm)],[70,12]) ).
cnf(83,negated_conjecture,
( subset(X1,esk4_0)
| ~ member(esk1_2(X1,esk4_0),esk2_0) ),
inference(spm,[status(thm)],[10,82,theory(equality)]) ).
cnf(87,negated_conjecture,
subset(esk2_0,esk4_0),
inference(spm,[status(thm)],[83,11,theory(equality)]) ).
cnf(97,negated_conjecture,
( subset(X1,intersection(X2,esk4_0))
| ~ member(esk1_2(X1,intersection(X2,esk4_0)),X2)
| ~ member(esk1_2(X1,intersection(X2,esk4_0)),esk2_0) ),
inference(spm,[status(thm)],[33,82,theory(equality)]) ).
cnf(101,negated_conjecture,
( ~ subset(esk2_0,intersection(esk3_0,esk4_0))
| $false ),
inference(rw,[status(thm)],[64,87,theory(equality)]) ).
cnf(102,negated_conjecture,
~ subset(esk2_0,intersection(esk3_0,esk4_0)),
inference(cn,[status(thm)],[101,theory(equality)]) ).
cnf(446,negated_conjecture,
( subset(esk2_0,intersection(X1,esk4_0))
| ~ member(esk1_2(esk2_0,intersection(X1,esk4_0)),X1) ),
inference(spm,[status(thm)],[97,11,theory(equality)]) ).
cnf(9206,negated_conjecture,
( subset(esk2_0,intersection(esk3_0,esk4_0))
| ~ member(esk1_2(esk2_0,intersection(esk3_0,esk4_0)),esk2_0) ),
inference(spm,[status(thm)],[446,53,theory(equality)]) ).
cnf(9233,negated_conjecture,
~ member(esk1_2(esk2_0,intersection(esk3_0,esk4_0)),esk2_0),
inference(sr,[status(thm)],[9206,102,theory(equality)]) ).
cnf(9234,negated_conjecture,
subset(esk2_0,intersection(esk3_0,esk4_0)),
inference(spm,[status(thm)],[9233,11,theory(equality)]) ).
cnf(9235,negated_conjecture,
$false,
inference(sr,[status(thm)],[9234,102,theory(equality)]) ).
cnf(9236,negated_conjecture,
$false,
9235,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET199+4.p
% --creating new selector for [SET006+0.ax]
% -running prover on /tmp/tmpe7yjgL/sel_SET199+4.p_1 with time limit 29
% -prover status Theorem
% Problem SET199+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET199+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET199+4.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
%
%------------------------------------------------------------------------------