TSTP Solution File: SEU189+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU189+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 05:22:17 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 73 ( 51 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 72 ( 26 ~; 30 |; 10 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( relation(X1)
=> ( ( relation_dom(X1) = empty_set
| relation_rng(X1) = empty_set )
=> X1 = empty_set ) ),
file('/tmp/tmpeuivtw/sel_SEU189+1.p_1',t64_relat_1) ).
fof(8,axiom,
( relation_dom(empty_set) = empty_set
& relation_rng(empty_set) = empty_set ),
file('/tmp/tmpeuivtw/sel_SEU189+1.p_1',t60_relat_1) ).
fof(14,conjecture,
! [X1] :
( relation(X1)
=> ( relation_dom(X1) = empty_set
<=> relation_rng(X1) = empty_set ) ),
file('/tmp/tmpeuivtw/sel_SEU189+1.p_1',t65_relat_1) ).
fof(26,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( relation_dom(X1) = empty_set
<=> relation_rng(X1) = empty_set ) ),
inference(assume_negation,[status(cth)],[14]) ).
fof(50,plain,
! [X1] :
( ~ relation(X1)
| ( relation_dom(X1) != empty_set
& relation_rng(X1) != empty_set )
| X1 = empty_set ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(51,plain,
! [X2] :
( ~ relation(X2)
| ( relation_dom(X2) != empty_set
& relation_rng(X2) != empty_set )
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,plain,
! [X2] :
( ( relation_dom(X2) != empty_set
| X2 = empty_set
| ~ relation(X2) )
& ( relation_rng(X2) != empty_set
| X2 = empty_set
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[51]) ).
cnf(53,plain,
( X1 = empty_set
| ~ relation(X1)
| relation_rng(X1) != empty_set ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(54,plain,
( X1 = empty_set
| ~ relation(X1)
| relation_dom(X1) != empty_set ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(58,plain,
relation_rng(empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[8]) ).
cnf(59,plain,
relation_dom(empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[8]) ).
fof(72,negated_conjecture,
? [X1] :
( relation(X1)
& ( relation_dom(X1) != empty_set
| relation_rng(X1) != empty_set )
& ( relation_dom(X1) = empty_set
| relation_rng(X1) = empty_set ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(73,negated_conjecture,
? [X2] :
( relation(X2)
& ( relation_dom(X2) != empty_set
| relation_rng(X2) != empty_set )
& ( relation_dom(X2) = empty_set
| relation_rng(X2) = empty_set ) ),
inference(variable_rename,[status(thm)],[72]) ).
fof(74,negated_conjecture,
( relation(esk3_0)
& ( relation_dom(esk3_0) != empty_set
| relation_rng(esk3_0) != empty_set )
& ( relation_dom(esk3_0) = empty_set
| relation_rng(esk3_0) = empty_set ) ),
inference(skolemize,[status(esa)],[73]) ).
cnf(75,negated_conjecture,
( relation_rng(esk3_0) = empty_set
| relation_dom(esk3_0) = empty_set ),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(76,negated_conjecture,
( relation_rng(esk3_0) != empty_set
| relation_dom(esk3_0) != empty_set ),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(77,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(120,negated_conjecture,
( empty_set = esk3_0
| relation_dom(esk3_0) = empty_set
| ~ relation(esk3_0) ),
inference(spm,[status(thm)],[53,75,theory(equality)]) ).
cnf(121,negated_conjecture,
( empty_set = esk3_0
| relation_dom(esk3_0) = empty_set
| $false ),
inference(rw,[status(thm)],[120,77,theory(equality)]) ).
cnf(122,negated_conjecture,
( empty_set = esk3_0
| relation_dom(esk3_0) = empty_set ),
inference(cn,[status(thm)],[121,theory(equality)]) ).
cnf(164,negated_conjecture,
( empty_set = esk3_0
| ~ relation(esk3_0) ),
inference(spm,[status(thm)],[54,122,theory(equality)]) ).
cnf(168,negated_conjecture,
( empty_set = esk3_0
| $false ),
inference(rw,[status(thm)],[164,77,theory(equality)]) ).
cnf(169,negated_conjecture,
empty_set = esk3_0,
inference(cn,[status(thm)],[168,theory(equality)]) ).
cnf(181,negated_conjecture,
( $false
| relation_rng(esk3_0) != empty_set ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[76,169,theory(equality)]),59,theory(equality)]) ).
cnf(182,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[181,169,theory(equality)]),58,theory(equality)]) ).
cnf(183,negated_conjecture,
$false,
inference(cn,[status(thm)],[182,theory(equality)]) ).
cnf(184,negated_conjecture,
$false,
183,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU189+1.p
% --creating new selector for []
% -running prover on /tmp/tmpeuivtw/sel_SEU189+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU189+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU189+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU189+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
%
%------------------------------------------------------------------------------