%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU198+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:24:38 EST 2010
% Result : Theorem 1.85s
% Output : CNFRefutation 1.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 6 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 105 ( 41 ~; 38 |; 20 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 52 ( 0 sgn 34 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(21,conjecture,
! [X1,X2] :
( relation(X2)
=> subset(relation_rng(relation_rng_restriction(X1,X2)),X1) ),
file('/tmp/tmpWT_oJo/sel_SEU198+2.p_1',t116_relat_1) ).
fof(89,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmpWT_oJo/sel_SEU198+2.p_1',d3_tarski) ).
fof(118,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_rng(relation_rng_restriction(X2,X3)))
<=> ( in(X1,X2)
& in(X1,relation_rng(X3)) ) ) ),
file('/tmp/tmpWT_oJo/sel_SEU198+2.p_1',t115_relat_1) ).
fof(192,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> subset(relation_rng(relation_rng_restriction(X1,X2)),X1) ),
inference(assume_negation,[status(cth)],[21]) ).
fof(302,negated_conjecture,
? [X1,X2] :
( relation(X2)
& ~ subset(relation_rng(relation_rng_restriction(X1,X2)),X1) ),
inference(fof_nnf,[status(thm)],[192]) ).
fof(303,negated_conjecture,
? [X3,X4] :
( relation(X4)
& ~ subset(relation_rng(relation_rng_restriction(X3,X4)),X3) ),
inference(variable_rename,[status(thm)],[302]) ).
fof(304,negated_conjecture,
( relation(esk9_0)
& ~ subset(relation_rng(relation_rng_restriction(esk8_0,esk9_0)),esk8_0) ),
inference(skolemize,[status(esa)],[303]) ).
cnf(305,negated_conjecture,
~ subset(relation_rng(relation_rng_restriction(esk8_0,esk9_0)),esk8_0),
inference(split_conjunct,[status(thm)],[304]) ).
cnf(306,negated_conjecture,
relation(esk9_0),
inference(split_conjunct,[status(thm)],[304]) ).
fof(574,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)],[89]) ).
fof(575,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)],[574]) ).
fof(576,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ( in(esk31_2(X4,X5),X4)
& ~ in(esk31_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[575]) ).
fof(577,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( ( in(esk31_2(X4,X5),X4)
& ~ in(esk31_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[576]) ).
fof(578,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( in(esk31_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk31_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[577]) ).
cnf(579,plain,
( subset(X1,X2)
| ~ in(esk31_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[578]) ).
cnf(580,plain,
( subset(X1,X2)
| in(esk31_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[578]) ).
fof(690,plain,
! [X1,X2,X3] :
( ~ relation(X3)
| ( ( ~ in(X1,relation_rng(relation_rng_restriction(X2,X3)))
| ( in(X1,X2)
& in(X1,relation_rng(X3)) ) )
& ( ~ in(X1,X2)
| ~ in(X1,relation_rng(X3))
| in(X1,relation_rng(relation_rng_restriction(X2,X3))) ) ) ),
inference(fof_nnf,[status(thm)],[118]) ).
fof(691,plain,
! [X4,X5,X6] :
( ~ relation(X6)
| ( ( ~ in(X4,relation_rng(relation_rng_restriction(X5,X6)))
| ( in(X4,X5)
& in(X4,relation_rng(X6)) ) )
& ( ~ in(X4,X5)
| ~ in(X4,relation_rng(X6))
| in(X4,relation_rng(relation_rng_restriction(X5,X6))) ) ) ),
inference(variable_rename,[status(thm)],[690]) ).
fof(692,plain,
! [X4,X5,X6] :
( ( in(X4,X5)
| ~ in(X4,relation_rng(relation_rng_restriction(X5,X6)))
| ~ relation(X6) )
& ( in(X4,relation_rng(X6))
| ~ in(X4,relation_rng(relation_rng_restriction(X5,X6)))
| ~ relation(X6) )
& ( ~ in(X4,X5)
| ~ in(X4,relation_rng(X6))
| in(X4,relation_rng(relation_rng_restriction(X5,X6)))
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[691]) ).
cnf(695,plain,
( in(X2,X3)
| ~ relation(X1)
| ~ in(X2,relation_rng(relation_rng_restriction(X3,X1))) ),
inference(split_conjunct,[status(thm)],[692]) ).
cnf(1742,plain,
( in(esk31_2(relation_rng(relation_rng_restriction(X1,X2)),X3),X1)
| subset(relation_rng(relation_rng_restriction(X1,X2)),X3)
| ~ relation(X2) ),
inference(spm,[status(thm)],[695,580,theory(equality)]) ).
cnf(26613,plain,
( subset(relation_rng(relation_rng_restriction(X1,X2)),X1)
| ~ relation(X2) ),
inference(spm,[status(thm)],[579,1742,theory(equality)]) ).
cnf(27332,plain,
~ relation(esk9_0),
inference(spm,[status(thm)],[305,26613,theory(equality)]) ).
cnf(27410,plain,
$false,
inference(rw,[status(thm)],[27332,306,theory(equality)]) ).
cnf(27411,plain,
$false,
inference(cn,[status(thm)],[27410,theory(equality)]) ).
cnf(27412,plain,
$false,
27411,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU198+2.p
% --creating new selector for []
% -running prover on /tmp/tmpWT_oJo/sel_SEU198+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU198+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU198+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU198+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
%
%------------------------------------------------------------------------------