%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU116+1 : TPTP v5.0.0. Released v3.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 04:41:54 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 3 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 16 ( 1 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1,X2] :
( element(X2,finite_subsets(X1))
=> finite(X2) ),
file('/tmp/tmpoiNwXA/sel_SEU116+1.p_1',cc3_finsub_1) ).
fof(10,conjecture,
! [X1,X2] :
( element(X2,finite_subsets(X1))
=> finite(X2) ),
file('/tmp/tmpoiNwXA/sel_SEU116+1.p_1',t30_finsub_1) ).
fof(32,negated_conjecture,
~ ! [X1,X2] :
( element(X2,finite_subsets(X1))
=> finite(X2) ),
inference(assume_negation,[status(cth)],[10]) ).
fof(66,plain,
! [X1,X2] :
( ~ element(X2,finite_subsets(X1))
| finite(X2) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(67,plain,
! [X3,X4] :
( ~ element(X4,finite_subsets(X3))
| finite(X4) ),
inference(variable_rename,[status(thm)],[66]) ).
cnf(68,plain,
( finite(X1)
| ~ element(X1,finite_subsets(X2)) ),
inference(split_conjunct,[status(thm)],[67]) ).
fof(86,negated_conjecture,
? [X1,X2] :
( element(X2,finite_subsets(X1))
& ~ finite(X2) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(87,negated_conjecture,
? [X3,X4] :
( element(X4,finite_subsets(X3))
& ~ finite(X4) ),
inference(variable_rename,[status(thm)],[86]) ).
fof(88,negated_conjecture,
( element(esk6_0,finite_subsets(esk5_0))
& ~ finite(esk6_0) ),
inference(skolemize,[status(esa)],[87]) ).
cnf(89,negated_conjecture,
~ finite(esk6_0),
inference(split_conjunct,[status(thm)],[88]) ).
cnf(90,negated_conjecture,
element(esk6_0,finite_subsets(esk5_0)),
inference(split_conjunct,[status(thm)],[88]) ).
cnf(170,negated_conjecture,
finite(esk6_0),
inference(spm,[status(thm)],[68,90,theory(equality)]) ).
cnf(172,negated_conjecture,
$false,
inference(sr,[status(thm)],[170,89,theory(equality)]) ).
cnf(173,negated_conjecture,
$false,
172,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU116+1.p
% --creating new selector for []
% -running prover on /tmp/tmpoiNwXA/sel_SEU116+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU116+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU116+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU116+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
%
%------------------------------------------------------------------------------