%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET627+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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 03:05:15 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 71 ( 33 ~; 22 |; 13 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 2 sgn 30 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/tmp/tmp1hNFbE/sel_SET627+3.p_1',intersect_defn) ).
fof(4,conjecture,
! [X1] : disjoint(X1,empty_set),
file('/tmp/tmp1hNFbE/sel_SET627+3.p_1',prove_th104) ).
fof(5,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
file('/tmp/tmp1hNFbE/sel_SET627+3.p_1',disjoint_defn) ).
fof(6,axiom,
! [X1] : ~ member(X1,empty_set),
file('/tmp/tmp1hNFbE/sel_SET627+3.p_1',empty_set_defn) ).
fof(7,negated_conjecture,
~ ! [X1] : disjoint(X1,empty_set),
inference(assume_negation,[status(cth)],[4]) ).
fof(9,plain,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(10,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(20,plain,
! [X1,X2] :
( ( ~ intersect(X1,X2)
| ? [X3] :
( member(X3,X1)
& member(X3,X2) ) )
& ( ! [X3] :
( ~ member(X3,X1)
| ~ member(X3,X2) )
| intersect(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(21,plain,
! [X4,X5] :
( ( ~ intersect(X4,X5)
| ? [X6] :
( member(X6,X4)
& member(X6,X5) ) )
& ( ! [X7] :
( ~ member(X7,X4)
| ~ member(X7,X5) )
| intersect(X4,X5) ) ),
inference(variable_rename,[status(thm)],[20]) ).
fof(22,plain,
! [X4,X5] :
( ( ~ intersect(X4,X5)
| ( member(esk2_2(X4,X5),X4)
& member(esk2_2(X4,X5),X5) ) )
& ( ! [X7] :
( ~ member(X7,X4)
| ~ member(X7,X5) )
| intersect(X4,X5) ) ),
inference(skolemize,[status(esa)],[21]) ).
fof(23,plain,
! [X4,X5,X7] :
( ( ~ member(X7,X4)
| ~ member(X7,X5)
| intersect(X4,X5) )
& ( ~ intersect(X4,X5)
| ( member(esk2_2(X4,X5),X4)
& member(esk2_2(X4,X5),X5) ) ) ),
inference(shift_quantors,[status(thm)],[22]) ).
fof(24,plain,
! [X4,X5,X7] :
( ( ~ member(X7,X4)
| ~ member(X7,X5)
| intersect(X4,X5) )
& ( member(esk2_2(X4,X5),X4)
| ~ intersect(X4,X5) )
& ( member(esk2_2(X4,X5),X5)
| ~ intersect(X4,X5) ) ),
inference(distribute,[status(thm)],[23]) ).
cnf(25,plain,
( member(esk2_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(28,negated_conjecture,
? [X1] : ~ disjoint(X1,empty_set),
inference(fof_nnf,[status(thm)],[7]) ).
fof(29,negated_conjecture,
? [X2] : ~ disjoint(X2,empty_set),
inference(variable_rename,[status(thm)],[28]) ).
fof(30,negated_conjecture,
~ disjoint(esk3_0,empty_set),
inference(skolemize,[status(esa)],[29]) ).
cnf(31,negated_conjecture,
~ disjoint(esk3_0,empty_set),
inference(split_conjunct,[status(thm)],[30]) ).
fof(32,plain,
! [X1,X2] :
( ( ~ disjoint(X1,X2)
| ~ intersect(X1,X2) )
& ( intersect(X1,X2)
| disjoint(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(33,plain,
! [X3,X4] :
( ( ~ disjoint(X3,X4)
| ~ intersect(X3,X4) )
& ( intersect(X3,X4)
| disjoint(X3,X4) ) ),
inference(variable_rename,[status(thm)],[32]) ).
cnf(34,plain,
( disjoint(X1,X2)
| intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[33]) ).
fof(36,plain,
! [X2] : ~ member(X2,empty_set),
inference(variable_rename,[status(thm)],[10]) ).
cnf(37,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(38,negated_conjecture,
intersect(esk3_0,empty_set),
inference(spm,[status(thm)],[31,34,theory(equality)]) ).
cnf(41,plain,
~ intersect(X1,empty_set),
inference(spm,[status(thm)],[37,25,theory(equality)]) ).
cnf(54,negated_conjecture,
$false,
inference(sr,[status(thm)],[38,41,theory(equality)]) ).
cnf(55,negated_conjecture,
$false,
54,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET627+3.p
% --creating new selector for []
% -running prover on /tmp/tmp1hNFbE/sel_SET627+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET627+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET627+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET627+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
%
%------------------------------------------------------------------------------