TSTP Solution File: SEU264+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU264+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 06:28:31 EST 2010
% Result : Theorem 1.26s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 64 ( 26 ~; 19 |; 11 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 61 ( 2 sgn 41 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(34,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
file('/tmp/tmpQelN9I/sel_SEU264+2.p_1',t12_relset_1) ).
fof(41,axiom,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(relation_rng(X4),X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/tmp/tmpQelN9I/sel_SEU264+2.p_1',t14_relset_1) ).
fof(139,conjecture,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(X1,X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/tmp/tmpQelN9I/sel_SEU264+2.p_1',t16_relset_1) ).
fof(207,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/tmp/tmpQelN9I/sel_SEU264+2.p_1',t1_xboole_1) ).
fof(332,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(X1,X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
inference(assume_negation,[status(cth)],[139]) ).
fof(526,plain,
! [X1,X2,X3] :
( ~ relation_of2_as_subset(X3,X1,X2)
| ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
inference(fof_nnf,[status(thm)],[34]) ).
fof(527,plain,
! [X4,X5,X6] :
( ~ relation_of2_as_subset(X6,X4,X5)
| ( subset(relation_dom(X6),X4)
& subset(relation_rng(X6),X5) ) ),
inference(variable_rename,[status(thm)],[526]) ).
fof(528,plain,
! [X4,X5,X6] :
( ( subset(relation_dom(X6),X4)
| ~ relation_of2_as_subset(X6,X4,X5) )
& ( subset(relation_rng(X6),X5)
| ~ relation_of2_as_subset(X6,X4,X5) ) ),
inference(distribute,[status(thm)],[527]) ).
cnf(529,plain,
( subset(relation_rng(X1),X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[528]) ).
fof(565,plain,
! [X1,X2,X3,X4] :
( ~ relation_of2_as_subset(X4,X3,X1)
| ~ subset(relation_rng(X4),X2)
| relation_of2_as_subset(X4,X3,X2) ),
inference(fof_nnf,[status(thm)],[41]) ).
fof(566,plain,
! [X5,X6,X7,X8] :
( ~ relation_of2_as_subset(X8,X7,X5)
| ~ subset(relation_rng(X8),X6)
| relation_of2_as_subset(X8,X7,X6) ),
inference(variable_rename,[status(thm)],[565]) ).
cnf(567,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ subset(relation_rng(X1),X3)
| ~ relation_of2_as_subset(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[566]) ).
fof(972,negated_conjecture,
? [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
& subset(X1,X2)
& ~ relation_of2_as_subset(X4,X3,X2) ),
inference(fof_nnf,[status(thm)],[332]) ).
fof(973,negated_conjecture,
? [X5,X6,X7,X8] :
( relation_of2_as_subset(X8,X7,X5)
& subset(X5,X6)
& ~ relation_of2_as_subset(X8,X7,X6) ),
inference(variable_rename,[status(thm)],[972]) ).
fof(974,negated_conjecture,
( relation_of2_as_subset(esk57_0,esk56_0,esk54_0)
& subset(esk54_0,esk55_0)
& ~ relation_of2_as_subset(esk57_0,esk56_0,esk55_0) ),
inference(skolemize,[status(esa)],[973]) ).
cnf(975,negated_conjecture,
~ relation_of2_as_subset(esk57_0,esk56_0,esk55_0),
inference(split_conjunct,[status(thm)],[974]) ).
cnf(976,negated_conjecture,
subset(esk54_0,esk55_0),
inference(split_conjunct,[status(thm)],[974]) ).
cnf(977,negated_conjecture,
relation_of2_as_subset(esk57_0,esk56_0,esk54_0),
inference(split_conjunct,[status(thm)],[974]) ).
fof(1281,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X2,X3)
| subset(X1,X3) ),
inference(fof_nnf,[status(thm)],[207]) ).
fof(1282,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[1281]) ).
cnf(1283,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[1282]) ).
cnf(2142,negated_conjecture,
( subset(X1,esk55_0)
| ~ subset(X1,esk54_0) ),
inference(spm,[status(thm)],[1283,976,theory(equality)]) ).
cnf(2173,negated_conjecture,
subset(relation_rng(esk57_0),esk54_0),
inference(spm,[status(thm)],[529,977,theory(equality)]) ).
cnf(2652,negated_conjecture,
( relation_of2_as_subset(esk57_0,esk56_0,X1)
| ~ subset(relation_rng(esk57_0),X1) ),
inference(spm,[status(thm)],[567,977,theory(equality)]) ).
cnf(12207,negated_conjecture,
~ subset(relation_rng(esk57_0),esk55_0),
inference(spm,[status(thm)],[975,2652,theory(equality)]) ).
cnf(12217,negated_conjecture,
~ subset(relation_rng(esk57_0),esk54_0),
inference(spm,[status(thm)],[12207,2142,theory(equality)]) ).
cnf(12221,negated_conjecture,
$false,
inference(rw,[status(thm)],[12217,2173,theory(equality)]) ).
cnf(12222,negated_conjecture,
$false,
inference(cn,[status(thm)],[12221,theory(equality)]) ).
cnf(12223,negated_conjecture,
$false,
12222,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU264+2.p
% --creating new selector for []
% -running prover on /tmp/tmpQelN9I/sel_SEU264+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU264+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU264+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU264+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
%
%------------------------------------------------------------------------------