TSTP Solution File: SEU250+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU250+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:16:05 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 6 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 113 ( 46 ~; 42 |; 19 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 2 sgn 34 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(16,conjecture,
! [X1,X2] :
( relation(X2)
=> ( subset(relation_field(relation_restriction(X2,X1)),relation_field(X2))
& subset(relation_field(relation_restriction(X2,X1)),X1) ) ),
file('/tmp/tmpa2vOFb/sel_SEU250+1.p_1',t20_wellord1) ).
fof(36,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_field(relation_restriction(X3,X2)))
=> ( in(X1,relation_field(X3))
& in(X1,X2) ) ) ),
file('/tmp/tmpa2vOFb/sel_SEU250+1.p_1',t19_wellord1) ).
fof(41,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmpa2vOFb/sel_SEU250+1.p_1',d3_tarski) ).
fof(43,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( subset(relation_field(relation_restriction(X2,X1)),relation_field(X2))
& subset(relation_field(relation_restriction(X2,X1)),X1) ) ),
inference(assume_negation,[status(cth)],[16]) ).
fof(89,negated_conjecture,
? [X1,X2] :
( relation(X2)
& ( ~ subset(relation_field(relation_restriction(X2,X1)),relation_field(X2))
| ~ subset(relation_field(relation_restriction(X2,X1)),X1) ) ),
inference(fof_nnf,[status(thm)],[43]) ).
fof(90,negated_conjecture,
? [X3,X4] :
( relation(X4)
& ( ~ subset(relation_field(relation_restriction(X4,X3)),relation_field(X4))
| ~ subset(relation_field(relation_restriction(X4,X3)),X3) ) ),
inference(variable_rename,[status(thm)],[89]) ).
fof(91,negated_conjecture,
( relation(esk5_0)
& ( ~ subset(relation_field(relation_restriction(esk5_0,esk4_0)),relation_field(esk5_0))
| ~ subset(relation_field(relation_restriction(esk5_0,esk4_0)),esk4_0) ) ),
inference(skolemize,[status(esa)],[90]) ).
cnf(92,negated_conjecture,
( ~ subset(relation_field(relation_restriction(esk5_0,esk4_0)),esk4_0)
| ~ subset(relation_field(relation_restriction(esk5_0,esk4_0)),relation_field(esk5_0)) ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(93,negated_conjecture,
relation(esk5_0),
inference(split_conjunct,[status(thm)],[91]) ).
fof(140,plain,
! [X1,X2,X3] :
( ~ relation(X3)
| ~ in(X1,relation_field(relation_restriction(X3,X2)))
| ( in(X1,relation_field(X3))
& in(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(141,plain,
! [X4,X5,X6] :
( ~ relation(X6)
| ~ in(X4,relation_field(relation_restriction(X6,X5)))
| ( in(X4,relation_field(X6))
& in(X4,X5) ) ),
inference(variable_rename,[status(thm)],[140]) ).
fof(142,plain,
! [X4,X5,X6] :
( ( in(X4,relation_field(X6))
| ~ in(X4,relation_field(relation_restriction(X6,X5)))
| ~ relation(X6) )
& ( in(X4,X5)
| ~ in(X4,relation_field(relation_restriction(X6,X5)))
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[141]) ).
cnf(143,plain,
( in(X2,X3)
| ~ relation(X1)
| ~ in(X2,relation_field(relation_restriction(X1,X3))) ),
inference(split_conjunct,[status(thm)],[142]) ).
cnf(144,plain,
( in(X2,relation_field(X1))
| ~ relation(X1)
| ~ in(X2,relation_field(relation_restriction(X1,X3))) ),
inference(split_conjunct,[status(thm)],[142]) ).
fof(153,plain,
! [X1,X2] :
( ( ~ subset(X1,X2)
| ! [X3] :
( ~ in(X3,X1)
| in(X3,X2) ) )
& ( ? [X3] :
( in(X3,X1)
& ~ in(X3,X2) )
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[41]) ).
fof(154,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ? [X7] :
( in(X7,X4)
& ~ in(X7,X5) )
| subset(X4,X5) ) ),
inference(variable_rename,[status(thm)],[153]) ).
fof(155,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ( in(esk8_2(X4,X5),X4)
& ~ in(esk8_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[154]) ).
fof(156,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( ( in(esk8_2(X4,X5),X4)
& ~ in(esk8_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[155]) ).
fof(157,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( in(esk8_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk8_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[156]) ).
cnf(158,plain,
( subset(X1,X2)
| ~ in(esk8_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(159,plain,
( subset(X1,X2)
| in(esk8_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(209,plain,
( in(esk8_2(relation_field(relation_restriction(X1,X2)),X3),X2)
| subset(relation_field(relation_restriction(X1,X2)),X3)
| ~ relation(X1) ),
inference(spm,[status(thm)],[143,159,theory(equality)]) ).
cnf(210,plain,
( in(esk8_2(relation_field(relation_restriction(X1,X2)),X3),relation_field(X1))
| subset(relation_field(relation_restriction(X1,X2)),X3)
| ~ relation(X1) ),
inference(spm,[status(thm)],[144,159,theory(equality)]) ).
cnf(440,plain,
( subset(relation_field(relation_restriction(X1,X2)),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[158,209,theory(equality)]) ).
cnf(492,plain,
( subset(relation_field(relation_restriction(X1,X2)),relation_field(X1))
| ~ relation(X1) ),
inference(spm,[status(thm)],[158,210,theory(equality)]) ).
cnf(531,negated_conjecture,
( ~ subset(relation_field(relation_restriction(esk5_0,esk4_0)),esk4_0)
| ~ relation(esk5_0) ),
inference(spm,[status(thm)],[92,492,theory(equality)]) ).
cnf(540,negated_conjecture,
( ~ subset(relation_field(relation_restriction(esk5_0,esk4_0)),esk4_0)
| $false ),
inference(rw,[status(thm)],[531,93,theory(equality)]) ).
cnf(541,negated_conjecture,
~ subset(relation_field(relation_restriction(esk5_0,esk4_0)),esk4_0),
inference(cn,[status(thm)],[540,theory(equality)]) ).
cnf(550,negated_conjecture,
~ relation(esk5_0),
inference(spm,[status(thm)],[541,440,theory(equality)]) ).
cnf(554,negated_conjecture,
$false,
inference(rw,[status(thm)],[550,93,theory(equality)]) ).
cnf(555,negated_conjecture,
$false,
inference(cn,[status(thm)],[554,theory(equality)]) ).
cnf(556,negated_conjecture,
$false,
555,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU250+1.p
% --creating new selector for []
% -running prover on /tmp/tmpa2vOFb/sel_SEU250+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU250+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU250+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU250+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
%
%------------------------------------------------------------------------------