%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU122+2 : TPTP v5.0.0. Released v3.3.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 04:43:05 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 68 ( 12 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 78 ( 33 ~; 27 |; 14 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 2 sgn 32 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmp3fB5op/sel_SEU122+2.p_1',d3_tarski) ).
fof(13,conjecture,
! [X1] : subset(empty_set,X1),
file('/tmp/tmp3fB5op/sel_SEU122+2.p_1',t2_xboole_1) ).
fof(18,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/tmp/tmp3fB5op/sel_SEU122+2.p_1',d1_xboole_0) ).
fof(22,negated_conjecture,
~ ! [X1] : subset(empty_set,X1),
inference(assume_negation,[status(cth)],[13]) ).
fof(26,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).
fof(30,plain,
! [X1,X2] :
( ( ~ subset(X1,X2)
| ! [X3] :
( ~ in(X3,X1)
| in(X3,X2) ) )
& ( ? [X3] :
( in(X3,X1)
& ~ in(X3,X2) )
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(31,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ? [X7] :
( in(X7,X4)
& ~ in(X7,X5) )
| subset(X4,X5) ) ),
inference(variable_rename,[status(thm)],[30]) ).
fof(32,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ( in(esk1_2(X4,X5),X4)
& ~ in(esk1_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[31]) ).
fof(33,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( ( in(esk1_2(X4,X5),X4)
& ~ in(esk1_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[32]) ).
fof(34,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( in(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk1_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[33]) ).
cnf(36,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[34]) ).
fof(69,negated_conjecture,
? [X1] : ~ subset(empty_set,X1),
inference(fof_nnf,[status(thm)],[22]) ).
fof(70,negated_conjecture,
? [X2] : ~ subset(empty_set,X2),
inference(variable_rename,[status(thm)],[69]) ).
fof(71,negated_conjecture,
~ subset(empty_set,esk4_0),
inference(skolemize,[status(esa)],[70]) ).
cnf(72,negated_conjecture,
~ subset(empty_set,esk4_0),
inference(split_conjunct,[status(thm)],[71]) ).
fof(93,plain,
! [X1] :
( ( X1 != empty_set
| ! [X2] : ~ in(X2,X1) )
& ( ? [X2] : in(X2,X1)
| X1 = empty_set ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(94,plain,
! [X3] :
( ( X3 != empty_set
| ! [X4] : ~ in(X4,X3) )
& ( ? [X5] : in(X5,X3)
| X3 = empty_set ) ),
inference(variable_rename,[status(thm)],[93]) ).
fof(95,plain,
! [X3] :
( ( X3 != empty_set
| ! [X4] : ~ in(X4,X3) )
& ( in(esk7_1(X3),X3)
| X3 = empty_set ) ),
inference(skolemize,[status(esa)],[94]) ).
fof(96,plain,
! [X3,X4] :
( ( ~ in(X4,X3)
| X3 != empty_set )
& ( in(esk7_1(X3),X3)
| X3 = empty_set ) ),
inference(shift_quantors,[status(thm)],[95]) ).
cnf(98,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[96]) ).
cnf(121,plain,
( subset(X1,X2)
| empty_set != X1 ),
inference(spm,[status(thm)],[98,36,theory(equality)]) ).
cnf(189,negated_conjecture,
$false,
inference(spm,[status(thm)],[72,121,theory(equality)]) ).
cnf(192,negated_conjecture,
$false,
189,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU122+2.p
% --creating new selector for []
% -running prover on /tmp/tmp3fB5op/sel_SEU122+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU122+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU122+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU122+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
%
%------------------------------------------------------------------------------