TSTP Solution File: SEU303+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU303+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 07:03:20 EST 2010
% Result : Theorem 8.57s
% Output : CNFRefutation 8.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 66 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 68 ( 26 ~; 23 |; 13 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(30,axiom,
! [X1] :
( relation(X1)
=> relation_image(X1,relation_dom(X1)) = relation_rng(X1) ),
file('/tmp/tmpw-OW_d/sel_SEU303+2.p_1',t146_relat_1) ).
fof(237,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( finite(relation_dom(X1))
=> finite(relation_rng(X1)) ) ),
file('/tmp/tmpw-OW_d/sel_SEU303+2.p_1',t26_finset_1) ).
fof(345,axiom,
! [X1,X2] :
( ( relation(X1)
& function(X1)
& finite(X2) )
=> finite(relation_image(X1,X2)) ),
file('/tmp/tmpw-OW_d/sel_SEU303+2.p_1',fc13_finset_1) ).
fof(421,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( finite(relation_dom(X1))
=> finite(relation_rng(X1)) ) ),
inference(assume_negation,[status(cth)],[237]) ).
fof(643,plain,
! [X1] :
( ~ relation(X1)
| relation_image(X1,relation_dom(X1)) = relation_rng(X1) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(644,plain,
! [X2] :
( ~ relation(X2)
| relation_image(X2,relation_dom(X2)) = relation_rng(X2) ),
inference(variable_rename,[status(thm)],[643]) ).
cnf(645,plain,
( relation_image(X1,relation_dom(X1)) = relation_rng(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[644]) ).
fof(2035,negated_conjecture,
? [X1] :
( relation(X1)
& function(X1)
& finite(relation_dom(X1))
& ~ finite(relation_rng(X1)) ),
inference(fof_nnf,[status(thm)],[421]) ).
fof(2036,negated_conjecture,
? [X2] :
( relation(X2)
& function(X2)
& finite(relation_dom(X2))
& ~ finite(relation_rng(X2)) ),
inference(variable_rename,[status(thm)],[2035]) ).
fof(2037,negated_conjecture,
( relation(esk185_0)
& function(esk185_0)
& finite(relation_dom(esk185_0))
& ~ finite(relation_rng(esk185_0)) ),
inference(skolemize,[status(esa)],[2036]) ).
cnf(2038,negated_conjecture,
~ finite(relation_rng(esk185_0)),
inference(split_conjunct,[status(thm)],[2037]) ).
cnf(2039,negated_conjecture,
finite(relation_dom(esk185_0)),
inference(split_conjunct,[status(thm)],[2037]) ).
cnf(2040,negated_conjecture,
function(esk185_0),
inference(split_conjunct,[status(thm)],[2037]) ).
cnf(2041,negated_conjecture,
relation(esk185_0),
inference(split_conjunct,[status(thm)],[2037]) ).
fof(2724,plain,
! [X1,X2] :
( ~ relation(X1)
| ~ function(X1)
| ~ finite(X2)
| finite(relation_image(X1,X2)) ),
inference(fof_nnf,[status(thm)],[345]) ).
fof(2725,plain,
! [X3,X4] :
( ~ relation(X3)
| ~ function(X3)
| ~ finite(X4)
| finite(relation_image(X3,X4)) ),
inference(variable_rename,[status(thm)],[2724]) ).
cnf(2726,plain,
( finite(relation_image(X1,X2))
| ~ finite(X2)
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[2725]) ).
cnf(4276,plain,
( finite(relation_rng(X1))
| ~ finite(relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[2726,645,theory(equality)]) ).
cnf(89290,plain,
( ~ finite(relation_dom(esk185_0))
| ~ function(esk185_0)
| ~ relation(esk185_0) ),
inference(spm,[status(thm)],[2038,4276,theory(equality)]) ).
cnf(89310,plain,
( $false
| ~ function(esk185_0)
| ~ relation(esk185_0) ),
inference(rw,[status(thm)],[89290,2039,theory(equality)]) ).
cnf(89311,plain,
( $false
| $false
| ~ relation(esk185_0) ),
inference(rw,[status(thm)],[89310,2040,theory(equality)]) ).
cnf(89312,plain,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[89311,2041,theory(equality)]) ).
cnf(89313,plain,
$false,
inference(cn,[status(thm)],[89312,theory(equality)]) ).
cnf(89314,plain,
$false,
89313,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU303+2.p
% --creating new selector for []
% -running prover on /tmp/tmpw-OW_d/sel_SEU303+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU303+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU303+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU303+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
%
%------------------------------------------------------------------------------