TSTP Solution File: SEU264+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU264+1 : 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:19 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 11 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 68 ( 27 ~; 22 |; 11 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 70 ( 5 sgn 45 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/tmp/tmpVhu7Pu/sel_SEU264+1.p_1',t1_xboole_1) ).
fof(8,conjecture,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(X1,X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/tmp/tmpVhu7Pu/sel_SEU264+1.p_1',t16_relset_1) ).
fof(10,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
file('/tmp/tmpVhu7Pu/sel_SEU264+1.p_1',t12_relset_1) ).
fof(16,axiom,
! [X1,X2] : subset(X1,X1),
file('/tmp/tmpVhu7Pu/sel_SEU264+1.p_1',reflexivity_r1_tarski) ).
fof(17,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/tmpVhu7Pu/sel_SEU264+1.p_1',t14_relset_1) ).
fof(19,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)],[8]) ).
fof(40,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X2,X3)
| subset(X1,X3) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(41,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[40]) ).
cnf(42,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(43,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)],[19]) ).
fof(44,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)],[43]) ).
fof(45,negated_conjecture,
( relation_of2_as_subset(esk6_0,esk5_0,esk3_0)
& subset(esk3_0,esk4_0)
& ~ relation_of2_as_subset(esk6_0,esk5_0,esk4_0) ),
inference(skolemize,[status(esa)],[44]) ).
cnf(46,negated_conjecture,
~ relation_of2_as_subset(esk6_0,esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[45]) ).
cnf(47,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[45]) ).
cnf(48,negated_conjecture,
relation_of2_as_subset(esk6_0,esk5_0,esk3_0),
inference(split_conjunct,[status(thm)],[45]) ).
fof(50,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)],[10]) ).
fof(51,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)],[50]) ).
fof(52,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)],[51]) ).
cnf(53,plain,
( subset(relation_rng(X1),X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[52]) ).
fof(62,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[16]) ).
cnf(63,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[62]) ).
fof(64,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)],[17]) ).
fof(65,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)],[64]) ).
cnf(66,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)],[65]) ).
cnf(72,negated_conjecture,
subset(relation_rng(esk6_0),esk3_0),
inference(spm,[status(thm)],[53,48,theory(equality)]) ).
cnf(76,negated_conjecture,
( subset(X1,esk4_0)
| ~ subset(X1,esk3_0) ),
inference(spm,[status(thm)],[42,47,theory(equality)]) ).
cnf(92,negated_conjecture,
( subset(X1,esk4_0)
| ~ subset(X1,X2)
| ~ subset(X2,esk3_0) ),
inference(spm,[status(thm)],[42,76,theory(equality)]) ).
cnf(244,negated_conjecture,
( subset(X1,esk4_0)
| ~ subset(X1,relation_rng(esk6_0)) ),
inference(spm,[status(thm)],[92,72,theory(equality)]) ).
cnf(271,negated_conjecture,
subset(relation_rng(esk6_0),esk4_0),
inference(spm,[status(thm)],[244,63,theory(equality)]) ).
cnf(285,negated_conjecture,
( relation_of2_as_subset(esk6_0,X1,esk4_0)
| ~ relation_of2_as_subset(esk6_0,X1,X2) ),
inference(spm,[status(thm)],[66,271,theory(equality)]) ).
cnf(346,negated_conjecture,
relation_of2_as_subset(esk6_0,esk5_0,esk4_0),
inference(spm,[status(thm)],[285,48,theory(equality)]) ).
cnf(348,negated_conjecture,
$false,
inference(sr,[status(thm)],[346,46,theory(equality)]) ).
cnf(349,negated_conjecture,
$false,
348,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU264+1.p
% --creating new selector for []
% -running prover on /tmp/tmpVhu7Pu/sel_SEU264+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU264+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU264+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU264+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
%
%------------------------------------------------------------------------------