%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU257+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:21:56 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 8
% Syntax : Number of formulae : 72 ( 6 unt; 0 def)
% Number of atoms : 295 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 415 ( 192 ~; 181 |; 25 &)
% ( 1 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 78 ( 7 sgn 44 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( relation(X2)
=> ( reflexive(X2)
=> reflexive(relation_restriction(X2,X1)) ) ),
file('/tmp/tmpaDlQoP/sel_SEU257+1.p_1',t22_wellord1) ).
fof(3,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/tmp/tmpaDlQoP/sel_SEU257+1.p_1',dt_k2_wellord1) ).
fof(5,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( reflexive(X1)
& transitive(X1)
& antisymmetric(X1)
& connected(X1)
& well_founded_relation(X1) ) ) ),
file('/tmp/tmpaDlQoP/sel_SEU257+1.p_1',d4_wellord1) ).
fof(8,axiom,
! [X1,X2] :
( relation(X2)
=> ( well_founded_relation(X2)
=> well_founded_relation(relation_restriction(X2,X1)) ) ),
file('/tmp/tmpaDlQoP/sel_SEU257+1.p_1',t31_wellord1) ).
fof(10,conjecture,
! [X1,X2] :
( relation(X2)
=> ( well_ordering(X2)
=> well_ordering(relation_restriction(X2,X1)) ) ),
file('/tmp/tmpaDlQoP/sel_SEU257+1.p_1',t32_wellord1) ).
fof(11,axiom,
! [X1,X2] :
( relation(X2)
=> ( transitive(X2)
=> transitive(relation_restriction(X2,X1)) ) ),
file('/tmp/tmpaDlQoP/sel_SEU257+1.p_1',t24_wellord1) ).
fof(12,axiom,
! [X1,X2] :
( relation(X2)
=> ( antisymmetric(X2)
=> antisymmetric(relation_restriction(X2,X1)) ) ),
file('/tmp/tmpaDlQoP/sel_SEU257+1.p_1',t25_wellord1) ).
fof(13,axiom,
! [X1,X2] :
( relation(X2)
=> ( connected(X2)
=> connected(relation_restriction(X2,X1)) ) ),
file('/tmp/tmpaDlQoP/sel_SEU257+1.p_1',t23_wellord1) ).
fof(14,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( well_ordering(X2)
=> well_ordering(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[10]) ).
fof(15,plain,
! [X1,X2] :
( ~ relation(X2)
| ~ reflexive(X2)
| reflexive(relation_restriction(X2,X1)) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(16,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ reflexive(X4)
| reflexive(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[15]) ).
cnf(17,plain,
( reflexive(relation_restriction(X1,X2))
| ~ reflexive(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(20,plain,
! [X1,X2] :
( ~ relation(X1)
| relation(relation_restriction(X1,X2)) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(21,plain,
! [X3,X4] :
( ~ relation(X3)
| relation(relation_restriction(X3,X4)) ),
inference(variable_rename,[status(thm)],[20]) ).
cnf(22,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(25,plain,
! [X1] :
( ~ relation(X1)
| ( ( ~ well_ordering(X1)
| ( reflexive(X1)
& transitive(X1)
& antisymmetric(X1)
& connected(X1)
& well_founded_relation(X1) ) )
& ( ~ reflexive(X1)
| ~ transitive(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ well_founded_relation(X1)
| well_ordering(X1) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(26,plain,
! [X2] :
( ~ relation(X2)
| ( ( ~ well_ordering(X2)
| ( reflexive(X2)
& transitive(X2)
& antisymmetric(X2)
& connected(X2)
& well_founded_relation(X2) ) )
& ( ~ reflexive(X2)
| ~ transitive(X2)
| ~ antisymmetric(X2)
| ~ connected(X2)
| ~ well_founded_relation(X2)
| well_ordering(X2) ) ) ),
inference(variable_rename,[status(thm)],[25]) ).
fof(27,plain,
! [X2] :
( ( reflexive(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( transitive(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( antisymmetric(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( connected(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( well_founded_relation(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( ~ reflexive(X2)
| ~ transitive(X2)
| ~ antisymmetric(X2)
| ~ connected(X2)
| ~ well_founded_relation(X2)
| well_ordering(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[26]) ).
cnf(28,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(29,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(30,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(31,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(32,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(33,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[27]) ).
fof(36,plain,
! [X1,X2] :
( ~ relation(X2)
| ~ well_founded_relation(X2)
| well_founded_relation(relation_restriction(X2,X1)) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(37,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ well_founded_relation(X4)
| well_founded_relation(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[36]) ).
cnf(38,plain,
( well_founded_relation(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
fof(43,negated_conjecture,
? [X1,X2] :
( relation(X2)
& well_ordering(X2)
& ~ well_ordering(relation_restriction(X2,X1)) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(44,negated_conjecture,
? [X3,X4] :
( relation(X4)
& well_ordering(X4)
& ~ well_ordering(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[43]) ).
fof(45,negated_conjecture,
( relation(esk2_0)
& well_ordering(esk2_0)
& ~ well_ordering(relation_restriction(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[44]) ).
cnf(46,negated_conjecture,
~ well_ordering(relation_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[45]) ).
cnf(47,negated_conjecture,
well_ordering(esk2_0),
inference(split_conjunct,[status(thm)],[45]) ).
cnf(48,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[45]) ).
fof(49,plain,
! [X1,X2] :
( ~ relation(X2)
| ~ transitive(X2)
| transitive(relation_restriction(X2,X1)) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(50,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ transitive(X4)
| transitive(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[49]) ).
cnf(51,plain,
( transitive(relation_restriction(X1,X2))
| ~ transitive(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[50]) ).
fof(52,plain,
! [X1,X2] :
( ~ relation(X2)
| ~ antisymmetric(X2)
| antisymmetric(relation_restriction(X2,X1)) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(53,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ antisymmetric(X4)
| antisymmetric(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[52]) ).
cnf(54,plain,
( antisymmetric(relation_restriction(X1,X2))
| ~ antisymmetric(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[53]) ).
fof(55,plain,
! [X1,X2] :
( ~ relation(X2)
| ~ connected(X2)
| connected(relation_restriction(X2,X1)) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(56,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ connected(X4)
| connected(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[55]) ).
cnf(57,plain,
( connected(relation_restriction(X1,X2))
| ~ connected(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[56]) ).
cnf(66,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ connected(relation_restriction(X1,X2))
| ~ antisymmetric(relation_restriction(X1,X2))
| ~ transitive(relation_restriction(X1,X2))
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[28,38,theory(equality)]) ).
cnf(91,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(relation_restriction(X1,X2))
| ~ antisymmetric(relation_restriction(X1,X2))
| ~ transitive(relation_restriction(X1,X2))
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(csr,[status(thm)],[66,22]) ).
cnf(93,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ antisymmetric(relation_restriction(X1,X2))
| ~ transitive(relation_restriction(X1,X2))
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ connected(X1) ),
inference(spm,[status(thm)],[91,57,theory(equality)]) ).
cnf(100,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ transitive(relation_restriction(X1,X2))
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ antisymmetric(X1) ),
inference(spm,[status(thm)],[93,54,theory(equality)]) ).
cnf(105,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ transitive(X1) ),
inference(spm,[status(thm)],[100,51,theory(equality)]) ).
cnf(110,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ relation(X1)
| ~ reflexive(X1) ),
inference(spm,[status(thm)],[105,17,theory(equality)]) ).
cnf(114,negated_conjecture,
( ~ well_founded_relation(esk2_0)
| ~ connected(esk2_0)
| ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| ~ relation(esk2_0) ),
inference(spm,[status(thm)],[46,110,theory(equality)]) ).
cnf(118,negated_conjecture,
( ~ well_founded_relation(esk2_0)
| ~ connected(esk2_0)
| ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| $false ),
inference(rw,[status(thm)],[114,48,theory(equality)]) ).
cnf(119,negated_conjecture,
( ~ well_founded_relation(esk2_0)
| ~ connected(esk2_0)
| ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0) ),
inference(cn,[status(thm)],[118,theory(equality)]) ).
cnf(120,negated_conjecture,
( ~ connected(esk2_0)
| ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| ~ well_ordering(esk2_0)
| ~ relation(esk2_0) ),
inference(spm,[status(thm)],[119,29,theory(equality)]) ).
cnf(121,negated_conjecture,
( ~ connected(esk2_0)
| ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| $false
| ~ relation(esk2_0) ),
inference(rw,[status(thm)],[120,47,theory(equality)]) ).
cnf(122,negated_conjecture,
( ~ connected(esk2_0)
| ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[121,48,theory(equality)]) ).
cnf(123,negated_conjecture,
( ~ connected(esk2_0)
| ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0) ),
inference(cn,[status(thm)],[122,theory(equality)]) ).
cnf(125,negated_conjecture,
( ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| ~ well_ordering(esk2_0)
| ~ relation(esk2_0) ),
inference(spm,[status(thm)],[123,30,theory(equality)]) ).
cnf(126,negated_conjecture,
( ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| $false
| ~ relation(esk2_0) ),
inference(rw,[status(thm)],[125,47,theory(equality)]) ).
cnf(127,negated_conjecture,
( ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[126,48,theory(equality)]) ).
cnf(128,negated_conjecture,
( ~ antisymmetric(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0) ),
inference(cn,[status(thm)],[127,theory(equality)]) ).
cnf(129,negated_conjecture,
( ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| ~ well_ordering(esk2_0)
| ~ relation(esk2_0) ),
inference(spm,[status(thm)],[128,31,theory(equality)]) ).
cnf(130,negated_conjecture,
( ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| $false
| ~ relation(esk2_0) ),
inference(rw,[status(thm)],[129,47,theory(equality)]) ).
cnf(131,negated_conjecture,
( ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[130,48,theory(equality)]) ).
cnf(132,negated_conjecture,
( ~ transitive(esk2_0)
| ~ reflexive(esk2_0) ),
inference(cn,[status(thm)],[131,theory(equality)]) ).
cnf(133,negated_conjecture,
( ~ reflexive(esk2_0)
| ~ well_ordering(esk2_0)
| ~ relation(esk2_0) ),
inference(spm,[status(thm)],[132,32,theory(equality)]) ).
cnf(134,negated_conjecture,
( ~ reflexive(esk2_0)
| $false
| ~ relation(esk2_0) ),
inference(rw,[status(thm)],[133,47,theory(equality)]) ).
cnf(135,negated_conjecture,
( ~ reflexive(esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[134,48,theory(equality)]) ).
cnf(136,negated_conjecture,
~ reflexive(esk2_0),
inference(cn,[status(thm)],[135,theory(equality)]) ).
cnf(137,negated_conjecture,
( ~ well_ordering(esk2_0)
| ~ relation(esk2_0) ),
inference(spm,[status(thm)],[136,33,theory(equality)]) ).
cnf(138,negated_conjecture,
( $false
| ~ relation(esk2_0) ),
inference(rw,[status(thm)],[137,47,theory(equality)]) ).
cnf(139,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[138,48,theory(equality)]) ).
cnf(140,negated_conjecture,
$false,
inference(cn,[status(thm)],[139,theory(equality)]) ).
cnf(141,negated_conjecture,
$false,
140,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU257+1.p
% --creating new selector for []
% -running prover on /tmp/tmpaDlQoP/sel_SEU257+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU257+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU257+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU257+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
%
%------------------------------------------------------------------------------