%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU193+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 05:19:08 EST 2010
% Result : Theorem 26.97s
% Output : CNFRefutation 26.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 12 unt; 0 def)
% Number of atoms : 241 ( 25 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 329 ( 135 ~; 144 |; 39 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-3 aty)
% Number of variables : 131 ( 6 sgn 72 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X1)
=> in(ordered_pair(X3,X4),X2) ) ) ) ),
file('/tmp/tmpXQujff/sel_SEU193+1.p_1',d3_relat_1) ).
fof(12,axiom,
! [X1] :
( relation(X1)
=> ! [X2,X3] :
( relation(X3)
=> ( X3 = relation_dom_restriction(X1,X2)
<=> ! [X4,X5] :
( in(ordered_pair(X4,X5),X3)
<=> ( in(X4,X2)
& in(ordered_pair(X4,X5),X1) ) ) ) ) ),
file('/tmp/tmpXQujff/sel_SEU193+1.p_1',d11_relat_1) ).
fof(14,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/tmp/tmpXQujff/sel_SEU193+1.p_1',commutativity_k2_tarski) ).
fof(20,conjecture,
! [X1,X2] :
( relation(X2)
=> subset(relation_dom_restriction(X2,X1),X2) ),
file('/tmp/tmpXQujff/sel_SEU193+1.p_1',t88_relat_1) ).
fof(29,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/tmp/tmpXQujff/sel_SEU193+1.p_1',d5_tarski) ).
fof(31,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/tmp/tmpXQujff/sel_SEU193+1.p_1',dt_k7_relat_1) ).
fof(37,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> subset(relation_dom_restriction(X2,X1),X2) ),
inference(assume_negation,[status(cth)],[20]) ).
fof(52,plain,
! [X1] :
( ~ relation(X1)
| ! [X2] :
( ~ relation(X2)
| ( ( ~ subset(X1,X2)
| ! [X3,X4] :
( ~ in(ordered_pair(X3,X4),X1)
| in(ordered_pair(X3,X4),X2) ) )
& ( ? [X3,X4] :
( in(ordered_pair(X3,X4),X1)
& ~ in(ordered_pair(X3,X4),X2) )
| subset(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(53,plain,
! [X5] :
( ~ relation(X5)
| ! [X6] :
( ~ relation(X6)
| ( ( ~ subset(X5,X6)
| ! [X7,X8] :
( ~ in(ordered_pair(X7,X8),X5)
| in(ordered_pair(X7,X8),X6) ) )
& ( ? [X9,X10] :
( in(ordered_pair(X9,X10),X5)
& ~ in(ordered_pair(X9,X10),X6) )
| subset(X5,X6) ) ) ) ),
inference(variable_rename,[status(thm)],[52]) ).
fof(54,plain,
! [X5] :
( ~ relation(X5)
| ! [X6] :
( ~ relation(X6)
| ( ( ~ subset(X5,X6)
| ! [X7,X8] :
( ~ in(ordered_pair(X7,X8),X5)
| in(ordered_pair(X7,X8),X6) ) )
& ( ( in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X5)
& ~ in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X6) )
| subset(X5,X6) ) ) ) ),
inference(skolemize,[status(esa)],[53]) ).
fof(55,plain,
! [X5,X6,X7,X8] :
( ( ( ~ in(ordered_pair(X7,X8),X5)
| in(ordered_pair(X7,X8),X6)
| ~ subset(X5,X6) )
& ( ( in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X5)
& ~ in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X6) )
| subset(X5,X6) ) )
| ~ relation(X6)
| ~ relation(X5) ),
inference(shift_quantors,[status(thm)],[54]) ).
fof(56,plain,
! [X5,X6,X7,X8] :
( ( ~ in(ordered_pair(X7,X8),X5)
| in(ordered_pair(X7,X8),X6)
| ~ subset(X5,X6)
| ~ relation(X6)
| ~ relation(X5) )
& ( in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X5)
| subset(X5,X6)
| ~ relation(X6)
| ~ relation(X5) )
& ( ~ in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X6)
| subset(X5,X6)
| ~ relation(X6)
| ~ relation(X5) ) ),
inference(distribute,[status(thm)],[55]) ).
cnf(57,plain,
( subset(X1,X2)
| ~ relation(X1)
| ~ relation(X2)
| ~ in(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X2) ),
inference(split_conjunct,[status(thm)],[56]) ).
cnf(58,plain,
( subset(X1,X2)
| in(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X1)
| ~ relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[56]) ).
fof(85,plain,
! [X1] :
( ~ relation(X1)
| ! [X2,X3] :
( ~ relation(X3)
| ( ( X3 != relation_dom_restriction(X1,X2)
| ! [X4,X5] :
( ( ~ in(ordered_pair(X4,X5),X3)
| ( in(X4,X2)
& in(ordered_pair(X4,X5),X1) ) )
& ( ~ in(X4,X2)
| ~ in(ordered_pair(X4,X5),X1)
| in(ordered_pair(X4,X5),X3) ) ) )
& ( ? [X4,X5] :
( ( ~ in(ordered_pair(X4,X5),X3)
| ~ in(X4,X2)
| ~ in(ordered_pair(X4,X5),X1) )
& ( in(ordered_pair(X4,X5),X3)
| ( in(X4,X2)
& in(ordered_pair(X4,X5),X1) ) ) )
| X3 = relation_dom_restriction(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(86,plain,
! [X6] :
( ~ relation(X6)
| ! [X7,X8] :
( ~ relation(X8)
| ( ( X8 != relation_dom_restriction(X6,X7)
| ! [X9,X10] :
( ( ~ in(ordered_pair(X9,X10),X8)
| ( in(X9,X7)
& in(ordered_pair(X9,X10),X6) ) )
& ( ~ in(X9,X7)
| ~ in(ordered_pair(X9,X10),X6)
| in(ordered_pair(X9,X10),X8) ) ) )
& ( ? [X11,X12] :
( ( ~ in(ordered_pair(X11,X12),X8)
| ~ in(X11,X7)
| ~ in(ordered_pair(X11,X12),X6) )
& ( in(ordered_pair(X11,X12),X8)
| ( in(X11,X7)
& in(ordered_pair(X11,X12),X6) ) ) )
| X8 = relation_dom_restriction(X6,X7) ) ) ) ),
inference(variable_rename,[status(thm)],[85]) ).
fof(87,plain,
! [X6] :
( ~ relation(X6)
| ! [X7,X8] :
( ~ relation(X8)
| ( ( X8 != relation_dom_restriction(X6,X7)
| ! [X9,X10] :
( ( ~ in(ordered_pair(X9,X10),X8)
| ( in(X9,X7)
& in(ordered_pair(X9,X10),X6) ) )
& ( ~ in(X9,X7)
| ~ in(ordered_pair(X9,X10),X6)
| in(ordered_pair(X9,X10),X8) ) ) )
& ( ( ( ~ in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8)
| ~ in(esk7_3(X6,X7,X8),X7)
| ~ in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6) )
& ( in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8)
| ( in(esk7_3(X6,X7,X8),X7)
& in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6) ) ) )
| X8 = relation_dom_restriction(X6,X7) ) ) ) ),
inference(skolemize,[status(esa)],[86]) ).
fof(88,plain,
! [X6,X7,X8,X9,X10] :
( ( ( ( ( ~ in(ordered_pair(X9,X10),X8)
| ( in(X9,X7)
& in(ordered_pair(X9,X10),X6) ) )
& ( ~ in(X9,X7)
| ~ in(ordered_pair(X9,X10),X6)
| in(ordered_pair(X9,X10),X8) ) )
| X8 != relation_dom_restriction(X6,X7) )
& ( ( ( ~ in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8)
| ~ in(esk7_3(X6,X7,X8),X7)
| ~ in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6) )
& ( in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8)
| ( in(esk7_3(X6,X7,X8),X7)
& in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6) ) ) )
| X8 = relation_dom_restriction(X6,X7) ) )
| ~ relation(X8)
| ~ relation(X6) ),
inference(shift_quantors,[status(thm)],[87]) ).
fof(89,plain,
! [X6,X7,X8,X9,X10] :
( ( in(X9,X7)
| ~ in(ordered_pair(X9,X10),X8)
| X8 != relation_dom_restriction(X6,X7)
| ~ relation(X8)
| ~ relation(X6) )
& ( in(ordered_pair(X9,X10),X6)
| ~ in(ordered_pair(X9,X10),X8)
| X8 != relation_dom_restriction(X6,X7)
| ~ relation(X8)
| ~ relation(X6) )
& ( ~ in(X9,X7)
| ~ in(ordered_pair(X9,X10),X6)
| in(ordered_pair(X9,X10),X8)
| X8 != relation_dom_restriction(X6,X7)
| ~ relation(X8)
| ~ relation(X6) )
& ( ~ in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8)
| ~ in(esk7_3(X6,X7,X8),X7)
| ~ in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6)
| X8 = relation_dom_restriction(X6,X7)
| ~ relation(X8)
| ~ relation(X6) )
& ( in(esk7_3(X6,X7,X8),X7)
| in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8)
| X8 = relation_dom_restriction(X6,X7)
| ~ relation(X8)
| ~ relation(X6) )
& ( in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6)
| in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8)
| X8 = relation_dom_restriction(X6,X7)
| ~ relation(X8)
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[88]) ).
cnf(94,plain,
( in(ordered_pair(X4,X5),X1)
| ~ relation(X1)
| ~ relation(X2)
| X2 != relation_dom_restriction(X1,X3)
| ~ in(ordered_pair(X4,X5),X2) ),
inference(split_conjunct,[status(thm)],[89]) ).
fof(98,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[14]) ).
cnf(99,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[98]) ).
fof(112,negated_conjecture,
? [X1,X2] :
( relation(X2)
& ~ subset(relation_dom_restriction(X2,X1),X2) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(113,negated_conjecture,
? [X3,X4] :
( relation(X4)
& ~ subset(relation_dom_restriction(X4,X3),X4) ),
inference(variable_rename,[status(thm)],[112]) ).
fof(114,negated_conjecture,
( relation(esk10_0)
& ~ subset(relation_dom_restriction(esk10_0,esk9_0),esk10_0) ),
inference(skolemize,[status(esa)],[113]) ).
cnf(115,negated_conjecture,
~ subset(relation_dom_restriction(esk10_0,esk9_0),esk10_0),
inference(split_conjunct,[status(thm)],[114]) ).
cnf(116,negated_conjecture,
relation(esk10_0),
inference(split_conjunct,[status(thm)],[114]) ).
fof(131,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(unordered_pair(X3,X4),singleton(X3)),
inference(variable_rename,[status(thm)],[29]) ).
cnf(132,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[131]) ).
fof(136,plain,
! [X1,X2] :
( ~ relation(X1)
| relation(relation_dom_restriction(X1,X2)) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(137,plain,
! [X3,X4] :
( ~ relation(X3)
| relation(relation_dom_restriction(X3,X4)) ),
inference(variable_rename,[status(thm)],[136]) ).
cnf(138,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(154,plain,
( subset(X1,X2)
| in(unordered_pair(unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),singleton(esk2_2(X1,X2))),X1)
| ~ relation(X2)
| ~ relation(X1) ),
inference(rw,[status(thm)],[58,132,theory(equality)]),
[unfolding] ).
cnf(157,plain,
( subset(X1,X2)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),singleton(esk2_2(X1,X2))),X2) ),
inference(rw,[status(thm)],[57,132,theory(equality)]),
[unfolding] ).
cnf(159,plain,
( in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X1)
| relation_dom_restriction(X1,X3) != X2
| ~ relation(X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[94,132,theory(equality)]),132,theory(equality)]),
[unfolding] ).
cnf(211,plain,
( subset(X1,X2)
| in(unordered_pair(singleton(esk2_2(X1,X2)),unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2))),X1)
| ~ relation(X2)
| ~ relation(X1) ),
inference(rw,[status(thm)],[154,99,theory(equality)]) ).
cnf(214,plain,
( subset(X1,X2)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(unordered_pair(singleton(esk2_2(X1,X2)),unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2))),X2) ),
inference(rw,[status(thm)],[157,99,theory(equality)]) ).
cnf(218,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3)
| relation_dom_restriction(X3,X4) != X5
| ~ relation(X5)
| ~ relation(X3)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X5) ),
inference(spm,[status(thm)],[159,99,theory(equality)]) ).
cnf(668,plain,
( in(unordered_pair(singleton(esk2_2(X1,X2)),unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2))),X3)
| subset(X1,X2)
| relation_dom_restriction(X3,X4) != X1
| ~ relation(X1)
| ~ relation(X3)
| ~ relation(X2) ),
inference(spm,[status(thm)],[218,211,theory(equality)]) ).
cnf(7896,plain,
( subset(relation_dom_restriction(X1,X2),X3)
| in(unordered_pair(singleton(esk2_2(relation_dom_restriction(X1,X2),X3)),unordered_pair(esk2_2(relation_dom_restriction(X1,X2),X3),esk3_2(relation_dom_restriction(X1,X2),X3))),X1)
| ~ relation(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ relation(X3) ),
inference(er,[status(thm)],[668,theory(equality)]) ).
cnf(437189,plain,
( subset(relation_dom_restriction(X1,X2),X3)
| in(unordered_pair(singleton(esk2_2(relation_dom_restriction(X1,X2),X3)),unordered_pair(esk2_2(relation_dom_restriction(X1,X2),X3),esk3_2(relation_dom_restriction(X1,X2),X3))),X1)
| ~ relation(X1)
| ~ relation(X3) ),
inference(csr,[status(thm)],[7896,138]) ).
cnf(437194,plain,
( subset(relation_dom_restriction(X1,X2),X1)
| ~ relation(X1)
| ~ relation(relation_dom_restriction(X1,X2)) ),
inference(spm,[status(thm)],[214,437189,theory(equality)]) ).
cnf(437657,plain,
( subset(relation_dom_restriction(X1,X2),X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[437194,138]) ).
cnf(437659,negated_conjecture,
~ relation(esk10_0),
inference(spm,[status(thm)],[115,437657,theory(equality)]) ).
cnf(438003,negated_conjecture,
$false,
inference(rw,[status(thm)],[437659,116,theory(equality)]) ).
cnf(438004,negated_conjecture,
$false,
inference(cn,[status(thm)],[438003,theory(equality)]) ).
cnf(438005,negated_conjecture,
$false,
438004,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU193+1.p
% --creating new selector for []
% -running prover on /tmp/tmpXQujff/sel_SEU193+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU193+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU193+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU193+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
%
%------------------------------------------------------------------------------