%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU295+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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 06:55:18 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 3 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 1 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(32,conjecture,
! [X1,X2] :
( finite(X1)
=> finite(set_intersection2(X1,X2)) ),
file('/tmp/tmp3l_eVo/sel_SEU295+1.p_1',t15_finset_1) ).
fof(57,axiom,
! [X1,X2] :
( finite(X1)
=> finite(set_intersection2(X1,X2)) ),
file('/tmp/tmp3l_eVo/sel_SEU295+1.p_1',fc11_finset_1) ).
fof(58,negated_conjecture,
~ ! [X1,X2] :
( finite(X1)
=> finite(set_intersection2(X1,X2)) ),
inference(assume_negation,[status(cth)],[32]) ).
fof(198,negated_conjecture,
? [X1,X2] :
( finite(X1)
& ~ finite(set_intersection2(X1,X2)) ),
inference(fof_nnf,[status(thm)],[58]) ).
fof(199,negated_conjecture,
? [X3,X4] :
( finite(X3)
& ~ finite(set_intersection2(X3,X4)) ),
inference(variable_rename,[status(thm)],[198]) ).
fof(200,negated_conjecture,
( finite(esk12_0)
& ~ finite(set_intersection2(esk12_0,esk13_0)) ),
inference(skolemize,[status(esa)],[199]) ).
cnf(201,negated_conjecture,
~ finite(set_intersection2(esk12_0,esk13_0)),
inference(split_conjunct,[status(thm)],[200]) ).
cnf(202,negated_conjecture,
finite(esk12_0),
inference(split_conjunct,[status(thm)],[200]) ).
fof(287,plain,
! [X1,X2] :
( ~ finite(X1)
| finite(set_intersection2(X1,X2)) ),
inference(fof_nnf,[status(thm)],[57]) ).
fof(288,plain,
! [X3,X4] :
( ~ finite(X3)
| finite(set_intersection2(X3,X4)) ),
inference(variable_rename,[status(thm)],[287]) ).
cnf(289,plain,
( finite(set_intersection2(X1,X2))
| ~ finite(X1) ),
inference(split_conjunct,[status(thm)],[288]) ).
cnf(301,negated_conjecture,
~ finite(esk12_0),
inference(spm,[status(thm)],[201,289,theory(equality)]) ).
cnf(302,negated_conjecture,
$false,
inference(rw,[status(thm)],[301,202,theory(equality)]) ).
cnf(303,negated_conjecture,
$false,
inference(cn,[status(thm)],[302,theory(equality)]) ).
cnf(304,negated_conjecture,
$false,
303,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU295+1.p
% --creating new selector for []
% -running prover on /tmp/tmp3l_eVo/sel_SEU295+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU295+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU295+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU295+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
%
%------------------------------------------------------------------------------