%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU368+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 07:56:19 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 51 ( 10 unt; 0 def)
% Number of atoms : 125 ( 55 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 138 ( 64 ~; 57 |; 11 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 78 ( 8 sgn 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( rel_str(X1)
=> relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1)) ),
file('/tmp/tmpjrWcv1/sel_SEU368+1.p_1',dt_u1_orders_2) ).
fof(7,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/tmp/tmpjrWcv1/sel_SEU368+1.p_1',redefinition_m2_relset_1) ).
fof(12,axiom,
! [X1] :
( rel_str(X1)
=> ( strict_rel_str(X1)
=> X1 = rel_str_of(the_carrier(X1),the_InternalRel(X1)) ) ),
file('/tmp/tmpjrWcv1/sel_SEU368+1.p_1',abstractness_v1_orders_2) ).
fof(13,axiom,
! [X1] :
( strict_rel_str(incl_POSet(X1))
& rel_str(incl_POSet(X1)) ),
file('/tmp/tmpjrWcv1/sel_SEU368+1.p_1',dt_k2_yellow_1) ).
fof(31,axiom,
! [X1,X2] :
( relation_of2(X2,X1,X1)
=> ! [X3,X4] :
( rel_str_of(X1,X2) = rel_str_of(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ) ),
file('/tmp/tmpjrWcv1/sel_SEU368+1.p_1',free_g1_orders_2) ).
fof(35,axiom,
! [X1] : incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
file('/tmp/tmpjrWcv1/sel_SEU368+1.p_1',d1_yellow_1) ).
fof(44,conjecture,
! [X1] :
( the_carrier(incl_POSet(X1)) = X1
& the_InternalRel(incl_POSet(X1)) = inclusion_order(X1) ),
file('/tmp/tmpjrWcv1/sel_SEU368+1.p_1',t1_yellow_1) ).
fof(54,negated_conjecture,
~ ! [X1] :
( the_carrier(incl_POSet(X1)) = X1
& the_InternalRel(incl_POSet(X1)) = inclusion_order(X1) ),
inference(assume_negation,[status(cth)],[44]) ).
fof(73,plain,
! [X1] :
( ~ rel_str(X1)
| relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1)) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(74,plain,
! [X2] :
( ~ rel_str(X2)
| relation_of2_as_subset(the_InternalRel(X2),the_carrier(X2),the_carrier(X2)) ),
inference(variable_rename,[status(thm)],[73]) ).
cnf(75,plain,
( relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[74]) ).
fof(82,plain,
! [X1,X2,X3] :
( ( ~ relation_of2_as_subset(X3,X1,X2)
| relation_of2(X3,X1,X2) )
& ( ~ relation_of2(X3,X1,X2)
| relation_of2_as_subset(X3,X1,X2) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(83,plain,
! [X4,X5,X6] :
( ( ~ relation_of2_as_subset(X6,X4,X5)
| relation_of2(X6,X4,X5) )
& ( ~ relation_of2(X6,X4,X5)
| relation_of2_as_subset(X6,X4,X5) ) ),
inference(variable_rename,[status(thm)],[82]) ).
cnf(85,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[83]) ).
fof(101,plain,
! [X1] :
( ~ rel_str(X1)
| ~ strict_rel_str(X1)
| X1 = rel_str_of(the_carrier(X1),the_InternalRel(X1)) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(102,plain,
! [X2] :
( ~ rel_str(X2)
| ~ strict_rel_str(X2)
| X2 = rel_str_of(the_carrier(X2),the_InternalRel(X2)) ),
inference(variable_rename,[status(thm)],[101]) ).
cnf(103,plain,
( X1 = rel_str_of(the_carrier(X1),the_InternalRel(X1))
| ~ strict_rel_str(X1)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[102]) ).
fof(104,plain,
! [X2] :
( strict_rel_str(incl_POSet(X2))
& rel_str(incl_POSet(X2)) ),
inference(variable_rename,[status(thm)],[13]) ).
cnf(105,plain,
rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[104]) ).
cnf(106,plain,
strict_rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[104]) ).
fof(163,plain,
! [X1,X2] :
( ~ relation_of2(X2,X1,X1)
| ! [X3,X4] :
( rel_str_of(X1,X2) != rel_str_of(X3,X4)
| ( X1 = X3
& X2 = X4 ) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(164,plain,
! [X5,X6] :
( ~ relation_of2(X6,X5,X5)
| ! [X7,X8] :
( rel_str_of(X5,X6) != rel_str_of(X7,X8)
| ( X5 = X7
& X6 = X8 ) ) ),
inference(variable_rename,[status(thm)],[163]) ).
fof(165,plain,
! [X5,X6,X7,X8] :
( rel_str_of(X5,X6) != rel_str_of(X7,X8)
| ( X5 = X7
& X6 = X8 )
| ~ relation_of2(X6,X5,X5) ),
inference(shift_quantors,[status(thm)],[164]) ).
fof(166,plain,
! [X5,X6,X7,X8] :
( ( X5 = X7
| rel_str_of(X5,X6) != rel_str_of(X7,X8)
| ~ relation_of2(X6,X5,X5) )
& ( X6 = X8
| rel_str_of(X5,X6) != rel_str_of(X7,X8)
| ~ relation_of2(X6,X5,X5) ) ),
inference(distribute,[status(thm)],[165]) ).
cnf(167,plain,
( X1 = X4
| ~ relation_of2(X1,X2,X2)
| rel_str_of(X2,X1) != rel_str_of(X3,X4) ),
inference(split_conjunct,[status(thm)],[166]) ).
cnf(168,plain,
( X2 = X3
| ~ relation_of2(X1,X2,X2)
| rel_str_of(X2,X1) != rel_str_of(X3,X4) ),
inference(split_conjunct,[status(thm)],[166]) ).
fof(178,plain,
! [X2] : incl_POSet(X2) = rel_str_of(X2,inclusion_order(X2)),
inference(variable_rename,[status(thm)],[35]) ).
cnf(179,plain,
incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
inference(split_conjunct,[status(thm)],[178]) ).
fof(202,negated_conjecture,
? [X1] :
( the_carrier(incl_POSet(X1)) != X1
| the_InternalRel(incl_POSet(X1)) != inclusion_order(X1) ),
inference(fof_nnf,[status(thm)],[54]) ).
fof(203,negated_conjecture,
? [X2] :
( the_carrier(incl_POSet(X2)) != X2
| the_InternalRel(incl_POSet(X2)) != inclusion_order(X2) ),
inference(variable_rename,[status(thm)],[202]) ).
fof(204,negated_conjecture,
( the_carrier(incl_POSet(esk8_0)) != esk8_0
| the_InternalRel(incl_POSet(esk8_0)) != inclusion_order(esk8_0) ),
inference(skolemize,[status(esa)],[203]) ).
cnf(205,negated_conjecture,
( the_InternalRel(incl_POSet(esk8_0)) != inclusion_order(esk8_0)
| the_carrier(incl_POSet(esk8_0)) != esk8_0 ),
inference(split_conjunct,[status(thm)],[204]) ).
cnf(248,plain,
rel_str(rel_str_of(X1,inclusion_order(X1))),
inference(rw,[status(thm)],[105,179,theory(equality)]),
[unfolding] ).
cnf(249,plain,
strict_rel_str(rel_str_of(X1,inclusion_order(X1))),
inference(rw,[status(thm)],[106,179,theory(equality)]),
[unfolding] ).
cnf(259,negated_conjecture,
( the_carrier(rel_str_of(esk8_0,inclusion_order(esk8_0))) != esk8_0
| the_InternalRel(rel_str_of(esk8_0,inclusion_order(esk8_0))) != inclusion_order(esk8_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[205,179,theory(equality)]),179,theory(equality)]),
[unfolding] ).
cnf(280,plain,
( relation_of2(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))
| ~ rel_str(X1) ),
inference(spm,[status(thm)],[85,75,theory(equality)]) ).
cnf(397,plain,
( the_carrier(X1) = X2
| rel_str_of(the_carrier(X1),the_InternalRel(X1)) != rel_str_of(X2,X3)
| ~ rel_str(X1) ),
inference(spm,[status(thm)],[168,280,theory(equality)]) ).
cnf(398,plain,
( the_InternalRel(X1) = X2
| rel_str_of(the_carrier(X1),the_InternalRel(X1)) != rel_str_of(X3,X2)
| ~ rel_str(X1) ),
inference(spm,[status(thm)],[167,280,theory(equality)]) ).
cnf(461,plain,
( the_carrier(X1) = X2
| X1 != rel_str_of(X2,X3)
| ~ rel_str(X1)
| ~ strict_rel_str(X1) ),
inference(spm,[status(thm)],[397,103,theory(equality)]) ).
cnf(464,plain,
( the_InternalRel(X1) = X2
| X1 != rel_str_of(X3,X2)
| ~ rel_str(X1)
| ~ strict_rel_str(X1) ),
inference(spm,[status(thm)],[398,103,theory(equality)]) ).
cnf(482,plain,
( the_carrier(rel_str_of(X1,X2)) = X1
| ~ strict_rel_str(rel_str_of(X1,X2))
| ~ rel_str(rel_str_of(X1,X2)) ),
inference(er,[status(thm)],[461,theory(equality)]) ).
cnf(485,negated_conjecture,
( the_InternalRel(rel_str_of(esk8_0,inclusion_order(esk8_0))) != inclusion_order(esk8_0)
| ~ strict_rel_str(rel_str_of(esk8_0,inclusion_order(esk8_0)))
| ~ rel_str(rel_str_of(esk8_0,inclusion_order(esk8_0))) ),
inference(spm,[status(thm)],[259,482,theory(equality)]) ).
cnf(496,negated_conjecture,
( the_InternalRel(rel_str_of(esk8_0,inclusion_order(esk8_0))) != inclusion_order(esk8_0)
| $false
| ~ rel_str(rel_str_of(esk8_0,inclusion_order(esk8_0))) ),
inference(rw,[status(thm)],[485,249,theory(equality)]) ).
cnf(497,negated_conjecture,
( the_InternalRel(rel_str_of(esk8_0,inclusion_order(esk8_0))) != inclusion_order(esk8_0)
| $false
| $false ),
inference(rw,[status(thm)],[496,248,theory(equality)]) ).
cnf(498,negated_conjecture,
the_InternalRel(rel_str_of(esk8_0,inclusion_order(esk8_0))) != inclusion_order(esk8_0),
inference(cn,[status(thm)],[497,theory(equality)]) ).
cnf(508,plain,
( the_InternalRel(rel_str_of(X1,X2)) = X2
| ~ strict_rel_str(rel_str_of(X1,X2))
| ~ rel_str(rel_str_of(X1,X2)) ),
inference(er,[status(thm)],[464,theory(equality)]) ).
cnf(511,negated_conjecture,
( ~ strict_rel_str(rel_str_of(esk8_0,inclusion_order(esk8_0)))
| ~ rel_str(rel_str_of(esk8_0,inclusion_order(esk8_0))) ),
inference(spm,[status(thm)],[498,508,theory(equality)]) ).
cnf(524,negated_conjecture,
( $false
| ~ rel_str(rel_str_of(esk8_0,inclusion_order(esk8_0))) ),
inference(rw,[status(thm)],[511,249,theory(equality)]) ).
cnf(525,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[524,248,theory(equality)]) ).
cnf(526,negated_conjecture,
$false,
inference(cn,[status(thm)],[525,theory(equality)]) ).
cnf(527,negated_conjecture,
$false,
526,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU368+1.p
% --creating new selector for []
% -running prover on /tmp/tmpjrWcv1/sel_SEU368+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU368+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU368+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU368+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
%
%------------------------------------------------------------------------------