TSTP Solution File: SEU188+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU188+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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 05:17:46 EST 2010
% Result : Theorem 0.47s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 7 unt; 0 def)
% Number of atoms : 92 ( 27 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 91 ( 34 ~; 37 |; 11 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(11,conjecture,
! [X1] :
( relation(X1)
=> ( ( relation_dom(X1) = empty_set
| relation_rng(X1) = empty_set )
=> X1 = empty_set ) ),
file('/tmp/tmphVCTgg/sel_SEU188+2.p_1',t64_relat_1) ).
fof(83,axiom,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_dom(X1)) ),
file('/tmp/tmphVCTgg/sel_SEU188+2.p_1',fc5_relat_1) ).
fof(99,axiom,
( empty(empty_set)
& relation(empty_set) ),
file('/tmp/tmphVCTgg/sel_SEU188+2.p_1',fc4_relat_1) ).
fof(109,axiom,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_rng(X1)) ),
file('/tmp/tmphVCTgg/sel_SEU188+2.p_1',fc6_relat_1) ).
fof(121,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/tmp/tmphVCTgg/sel_SEU188+2.p_1',t6_boole) ).
fof(171,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( ( relation_dom(X1) = empty_set
| relation_rng(X1) = empty_set )
=> X1 = empty_set ) ),
inference(assume_negation,[status(cth)],[11]) ).
fof(181,plain,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_dom(X1)) ),
inference(fof_simplification,[status(thm)],[83,theory(equality)]) ).
fof(188,plain,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_rng(X1)) ),
inference(fof_simplification,[status(thm)],[109,theory(equality)]) ).
fof(235,negated_conjecture,
? [X1] :
( relation(X1)
& ( relation_dom(X1) = empty_set
| relation_rng(X1) = empty_set )
& X1 != empty_set ),
inference(fof_nnf,[status(thm)],[171]) ).
fof(236,negated_conjecture,
? [X2] :
( relation(X2)
& ( relation_dom(X2) = empty_set
| relation_rng(X2) = empty_set )
& X2 != empty_set ),
inference(variable_rename,[status(thm)],[235]) ).
fof(237,negated_conjecture,
( relation(esk4_0)
& ( relation_dom(esk4_0) = empty_set
| relation_rng(esk4_0) = empty_set )
& esk4_0 != empty_set ),
inference(skolemize,[status(esa)],[236]) ).
cnf(238,negated_conjecture,
esk4_0 != empty_set,
inference(split_conjunct,[status(thm)],[237]) ).
cnf(239,negated_conjecture,
( relation_rng(esk4_0) = empty_set
| relation_dom(esk4_0) = empty_set ),
inference(split_conjunct,[status(thm)],[237]) ).
cnf(240,negated_conjecture,
relation(esk4_0),
inference(split_conjunct,[status(thm)],[237]) ).
fof(528,plain,
! [X1] :
( empty(X1)
| ~ relation(X1)
| ~ empty(relation_dom(X1)) ),
inference(fof_nnf,[status(thm)],[181]) ).
fof(529,plain,
! [X2] :
( empty(X2)
| ~ relation(X2)
| ~ empty(relation_dom(X2)) ),
inference(variable_rename,[status(thm)],[528]) ).
cnf(530,plain,
( empty(X1)
| ~ empty(relation_dom(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[529]) ).
cnf(583,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[99]) ).
fof(622,plain,
! [X1] :
( empty(X1)
| ~ relation(X1)
| ~ empty(relation_rng(X1)) ),
inference(fof_nnf,[status(thm)],[188]) ).
fof(623,plain,
! [X2] :
( empty(X2)
| ~ relation(X2)
| ~ empty(relation_rng(X2)) ),
inference(variable_rename,[status(thm)],[622]) ).
cnf(624,plain,
( empty(X1)
| ~ empty(relation_rng(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[623]) ).
fof(660,plain,
! [X1] :
( ~ empty(X1)
| X1 = empty_set ),
inference(fof_nnf,[status(thm)],[121]) ).
fof(661,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[660]) ).
cnf(662,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[661]) ).
cnf(1049,negated_conjecture,
( empty(esk4_0)
| relation_rng(esk4_0) = empty_set
| ~ empty(empty_set)
| ~ relation(esk4_0) ),
inference(spm,[status(thm)],[530,239,theory(equality)]) ).
cnf(1056,negated_conjecture,
( empty(esk4_0)
| relation_rng(esk4_0) = empty_set
| $false
| ~ relation(esk4_0) ),
inference(rw,[status(thm)],[1049,583,theory(equality)]) ).
cnf(1057,negated_conjecture,
( empty(esk4_0)
| relation_rng(esk4_0) = empty_set
| $false
| $false ),
inference(rw,[status(thm)],[1056,240,theory(equality)]) ).
cnf(1058,negated_conjecture,
( empty(esk4_0)
| relation_rng(esk4_0) = empty_set ),
inference(cn,[status(thm)],[1057,theory(equality)]) ).
cnf(3989,negated_conjecture,
( empty(esk4_0)
| ~ empty(empty_set)
| ~ relation(esk4_0) ),
inference(spm,[status(thm)],[624,1058,theory(equality)]) ).
cnf(3997,negated_conjecture,
( empty(esk4_0)
| $false
| ~ relation(esk4_0) ),
inference(rw,[status(thm)],[3989,583,theory(equality)]) ).
cnf(3998,negated_conjecture,
( empty(esk4_0)
| $false
| $false ),
inference(rw,[status(thm)],[3997,240,theory(equality)]) ).
cnf(3999,negated_conjecture,
empty(esk4_0),
inference(cn,[status(thm)],[3998,theory(equality)]) ).
cnf(4011,negated_conjecture,
empty_set = esk4_0,
inference(spm,[status(thm)],[662,3999,theory(equality)]) ).
cnf(4016,negated_conjecture,
$false,
inference(sr,[status(thm)],[4011,238,theory(equality)]) ).
cnf(4017,negated_conjecture,
$false,
4016,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU188+2.p
% --creating new selector for []
% -running prover on /tmp/tmphVCTgg/sel_SEU188+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU188+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU188+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU188+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
%
%------------------------------------------------------------------------------