%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU062+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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 04:23:48 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 5 unt; 0 def)
% Number of atoms : 101 ( 15 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 123 ( 51 ~; 41 |; 23 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 36 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,conjecture,
! [X1,X2] :
( relation(X2)
=> ( ! [X3] :
~ ( in(X3,X1)
& relation_inverse_image(X2,singleton(X3)) = empty_set )
=> subset(X1,relation_rng(X2)) ) ),
file('/tmp/tmpnzy7pZ/sel_SEU062+1.p_1',t143_funct_1) ).
fof(15,axiom,
! [X1,X2] :
( relation(X2)
=> ( in(X1,relation_rng(X2))
<=> relation_inverse_image(X2,singleton(X1)) != empty_set ) ),
file('/tmp/tmpnzy7pZ/sel_SEU062+1.p_1',t142_funct_1) ).
fof(33,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmpnzy7pZ/sel_SEU062+1.p_1',d3_tarski) ).
fof(35,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( ! [X3] :
~ ( in(X3,X1)
& relation_inverse_image(X2,singleton(X3)) = empty_set )
=> subset(X1,relation_rng(X2)) ) ),
inference(assume_negation,[status(cth)],[8]) ).
fof(67,negated_conjecture,
? [X1,X2] :
( relation(X2)
& ! [X3] :
( ~ in(X3,X1)
| relation_inverse_image(X2,singleton(X3)) != empty_set )
& ~ subset(X1,relation_rng(X2)) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(68,negated_conjecture,
? [X4,X5] :
( relation(X5)
& ! [X6] :
( ~ in(X6,X4)
| relation_inverse_image(X5,singleton(X6)) != empty_set )
& ~ subset(X4,relation_rng(X5)) ),
inference(variable_rename,[status(thm)],[67]) ).
fof(69,negated_conjecture,
( relation(esk6_0)
& ! [X6] :
( ~ in(X6,esk5_0)
| relation_inverse_image(esk6_0,singleton(X6)) != empty_set )
& ~ subset(esk5_0,relation_rng(esk6_0)) ),
inference(skolemize,[status(esa)],[68]) ).
fof(70,negated_conjecture,
! [X6] :
( ( ~ in(X6,esk5_0)
| relation_inverse_image(esk6_0,singleton(X6)) != empty_set )
& ~ subset(esk5_0,relation_rng(esk6_0))
& relation(esk6_0) ),
inference(shift_quantors,[status(thm)],[69]) ).
cnf(71,negated_conjecture,
relation(esk6_0),
inference(split_conjunct,[status(thm)],[70]) ).
cnf(72,negated_conjecture,
~ subset(esk5_0,relation_rng(esk6_0)),
inference(split_conjunct,[status(thm)],[70]) ).
cnf(73,negated_conjecture,
( relation_inverse_image(esk6_0,singleton(X1)) != empty_set
| ~ in(X1,esk5_0) ),
inference(split_conjunct,[status(thm)],[70]) ).
fof(92,plain,
! [X1,X2] :
( ~ relation(X2)
| ( ( ~ in(X1,relation_rng(X2))
| relation_inverse_image(X2,singleton(X1)) != empty_set )
& ( relation_inverse_image(X2,singleton(X1)) = empty_set
| in(X1,relation_rng(X2)) ) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(93,plain,
! [X3,X4] :
( ~ relation(X4)
| ( ( ~ in(X3,relation_rng(X4))
| relation_inverse_image(X4,singleton(X3)) != empty_set )
& ( relation_inverse_image(X4,singleton(X3)) = empty_set
| in(X3,relation_rng(X4)) ) ) ),
inference(variable_rename,[status(thm)],[92]) ).
fof(94,plain,
! [X3,X4] :
( ( ~ in(X3,relation_rng(X4))
| relation_inverse_image(X4,singleton(X3)) != empty_set
| ~ relation(X4) )
& ( relation_inverse_image(X4,singleton(X3)) = empty_set
| in(X3,relation_rng(X4))
| ~ relation(X4) ) ),
inference(distribute,[status(thm)],[93]) ).
cnf(95,plain,
( in(X2,relation_rng(X1))
| relation_inverse_image(X1,singleton(X2)) = empty_set
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[94]) ).
fof(155,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)],[33]) ).
fof(156,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)],[155]) ).
fof(157,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ( in(esk13_2(X4,X5),X4)
& ~ in(esk13_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[156]) ).
fof(158,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( ( in(esk13_2(X4,X5),X4)
& ~ in(esk13_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[157]) ).
fof(159,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( in(esk13_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk13_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[158]) ).
cnf(160,plain,
( subset(X1,X2)
| ~ in(esk13_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(161,plain,
( subset(X1,X2)
| in(esk13_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(183,negated_conjecture,
( in(X1,relation_rng(esk6_0))
| ~ in(X1,esk5_0)
| ~ relation(esk6_0) ),
inference(spm,[status(thm)],[73,95,theory(equality)]) ).
cnf(184,negated_conjecture,
( in(X1,relation_rng(esk6_0))
| ~ in(X1,esk5_0)
| $false ),
inference(rw,[status(thm)],[183,71,theory(equality)]) ).
cnf(185,negated_conjecture,
( in(X1,relation_rng(esk6_0))
| ~ in(X1,esk5_0) ),
inference(cn,[status(thm)],[184,theory(equality)]) ).
cnf(223,negated_conjecture,
( subset(X1,relation_rng(esk6_0))
| ~ in(esk13_2(X1,relation_rng(esk6_0)),esk5_0) ),
inference(spm,[status(thm)],[160,185,theory(equality)]) ).
cnf(331,negated_conjecture,
subset(esk5_0,relation_rng(esk6_0)),
inference(spm,[status(thm)],[223,161,theory(equality)]) ).
cnf(333,negated_conjecture,
$false,
inference(sr,[status(thm)],[331,72,theory(equality)]) ).
cnf(334,negated_conjecture,
$false,
333,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU062+1.p
% --creating new selector for []
% -running prover on /tmp/tmpnzy7pZ/sel_SEU062+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU062+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU062+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU062+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
%
%------------------------------------------------------------------------------