%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET915+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:47:00 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 26 ( 15 ~; 3 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('/tmp/tmpvtZK2D/sel_SET915+1.p_1',l28_zfmisc_1) ).
fof(4,conjecture,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('/tmp/tmpvtZK2D/sel_SET915+1.p_1',t56_zfmisc_1) ).
fof(7,negated_conjecture,
~ ! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(9,plain,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(10,negated_conjecture,
~ ! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(18,plain,
! [X1,X2] :
( in(X1,X2)
| disjoint(singleton(X1),X2) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(19,plain,
! [X3,X4] :
( in(X3,X4)
| disjoint(singleton(X3),X4) ),
inference(variable_rename,[status(thm)],[18]) ).
cnf(20,plain,
( disjoint(singleton(X1),X2)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[19]) ).
fof(21,negated_conjecture,
? [X1,X2] :
( ~ in(X1,X2)
& ~ disjoint(singleton(X1),X2) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(22,negated_conjecture,
? [X3,X4] :
( ~ in(X3,X4)
& ~ disjoint(singleton(X3),X4) ),
inference(variable_rename,[status(thm)],[21]) ).
fof(23,negated_conjecture,
( ~ in(esk3_0,esk4_0)
& ~ disjoint(singleton(esk3_0),esk4_0) ),
inference(skolemize,[status(esa)],[22]) ).
cnf(24,negated_conjecture,
~ disjoint(singleton(esk3_0),esk4_0),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(25,negated_conjecture,
~ in(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(32,negated_conjecture,
in(esk3_0,esk4_0),
inference(spm,[status(thm)],[24,20,theory(equality)]) ).
cnf(34,negated_conjecture,
$false,
inference(sr,[status(thm)],[32,25,theory(equality)]) ).
cnf(35,negated_conjecture,
$false,
34,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET915+1.p
% --creating new selector for []
% -running prover on /tmp/tmpvtZK2D/sel_SET915+1.p_1 with time limit 29
% -prover status Theorem
% Problem SET915+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET915+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET915+1.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
%
%------------------------------------------------------------------------------