%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU261+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 06:27:10 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 4
% Syntax : Number of formulae : 77 ( 16 unt; 0 def)
% Number of atoms : 352 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 423 ( 148 ~; 183 |; 63 &)
% ( 1 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 58 ( 0 sgn 33 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( relation_isomorphism(X1,X2,X3)
=> ( ( reflexive(X1)
=> reflexive(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( connected(X1)
=> connected(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( well_founded_relation(X1)
=> well_founded_relation(X2) ) ) ) ) ) ),
file('/tmp/tmpW-vAPh/sel_SEU261+1.p_1',t53_wellord1) ).
fof(2,conjecture,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( ( well_ordering(X1)
& relation_isomorphism(X1,X2,X3) )
=> well_ordering(X2) ) ) ) ),
file('/tmp/tmpW-vAPh/sel_SEU261+1.p_1',t54_wellord1) ).
fof(4,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( reflexive(X1)
& transitive(X1)
& antisymmetric(X1)
& connected(X1)
& well_founded_relation(X1) ) ) ),
file('/tmp/tmpW-vAPh/sel_SEU261+1.p_1',d4_wellord1) ).
fof(5,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( ( well_ordering(X1)
& relation_isomorphism(X1,X2,X3) )
=> well_ordering(X2) ) ) ) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(6,plain,
! [X1,X2] :
( epred1_2(X2,X1)
=> ( ( reflexive(X1)
=> reflexive(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( connected(X1)
=> connected(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( well_founded_relation(X1)
=> well_founded_relation(X2) ) ) ),
introduced(definition) ).
fof(7,plain,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( relation_isomorphism(X1,X2,X3)
=> epred1_2(X2,X1) ) ) ) ),
inference(apply_def,[status(esa)],[1,6,theory(equality)]) ).
fof(8,plain,
! [X1] :
( ~ relation(X1)
| ! [X2] :
( ~ relation(X2)
| ! [X3] :
( ~ relation(X3)
| ~ function(X3)
| ~ relation_isomorphism(X1,X2,X3)
| epred1_2(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(9,plain,
! [X4] :
( ~ relation(X4)
| ! [X5] :
( ~ relation(X5)
| ! [X6] :
( ~ relation(X6)
| ~ function(X6)
| ~ relation_isomorphism(X4,X5,X6)
| epred1_2(X5,X4) ) ) ),
inference(variable_rename,[status(thm)],[8]) ).
fof(10,plain,
! [X4,X5,X6] :
( ~ relation(X6)
| ~ function(X6)
| ~ relation_isomorphism(X4,X5,X6)
| epred1_2(X5,X4)
| ~ relation(X5)
| ~ relation(X4) ),
inference(shift_quantors,[status(thm)],[9]) ).
cnf(11,plain,
( epred1_2(X2,X1)
| ~ relation(X1)
| ~ relation(X2)
| ~ relation_isomorphism(X1,X2,X3)
| ~ function(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[10]) ).
fof(12,negated_conjecture,
? [X1] :
( relation(X1)
& ? [X2] :
( relation(X2)
& ? [X3] :
( relation(X3)
& function(X3)
& well_ordering(X1)
& relation_isomorphism(X1,X2,X3)
& ~ well_ordering(X2) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(13,negated_conjecture,
? [X4] :
( relation(X4)
& ? [X5] :
( relation(X5)
& ? [X6] :
( relation(X6)
& function(X6)
& well_ordering(X4)
& relation_isomorphism(X4,X5,X6)
& ~ well_ordering(X5) ) ) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,negated_conjecture,
( relation(esk1_0)
& relation(esk2_0)
& relation(esk3_0)
& function(esk3_0)
& well_ordering(esk1_0)
& relation_isomorphism(esk1_0,esk2_0,esk3_0)
& ~ well_ordering(esk2_0) ),
inference(skolemize,[status(esa)],[13]) ).
cnf(15,negated_conjecture,
~ well_ordering(esk2_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(16,negated_conjecture,
relation_isomorphism(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(17,negated_conjecture,
well_ordering(esk1_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(18,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(19,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(20,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(21,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[14]) ).
fof(26,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)],[4]) ).
fof(27,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)],[26]) ).
fof(28,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)],[27]) ).
cnf(29,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(30,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(31,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(32,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(33,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(34,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
fof(35,plain,
! [X1,X2] :
( ~ epred1_2(X2,X1)
| ( ( ~ reflexive(X1)
| reflexive(X2) )
& ( ~ transitive(X1)
| transitive(X2) )
& ( ~ connected(X1)
| connected(X2) )
& ( ~ antisymmetric(X1)
| antisymmetric(X2) )
& ( ~ well_founded_relation(X1)
| well_founded_relation(X2) ) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(36,plain,
! [X3,X4] :
( ~ epred1_2(X4,X3)
| ( ( ~ reflexive(X3)
| reflexive(X4) )
& ( ~ transitive(X3)
| transitive(X4) )
& ( ~ connected(X3)
| connected(X4) )
& ( ~ antisymmetric(X3)
| antisymmetric(X4) )
& ( ~ well_founded_relation(X3)
| well_founded_relation(X4) ) ) ),
inference(variable_rename,[status(thm)],[35]) ).
fof(37,plain,
! [X3,X4] :
( ( ~ reflexive(X3)
| reflexive(X4)
| ~ epred1_2(X4,X3) )
& ( ~ transitive(X3)
| transitive(X4)
| ~ epred1_2(X4,X3) )
& ( ~ connected(X3)
| connected(X4)
| ~ epred1_2(X4,X3) )
& ( ~ antisymmetric(X3)
| antisymmetric(X4)
| ~ epred1_2(X4,X3) )
& ( ~ well_founded_relation(X3)
| well_founded_relation(X4)
| ~ epred1_2(X4,X3) ) ),
inference(distribute,[status(thm)],[36]) ).
cnf(38,plain,
( well_founded_relation(X1)
| ~ epred1_2(X1,X2)
| ~ well_founded_relation(X2) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(39,plain,
( antisymmetric(X1)
| ~ epred1_2(X1,X2)
| ~ antisymmetric(X2) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(40,plain,
( connected(X1)
| ~ epred1_2(X1,X2)
| ~ connected(X2) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(41,plain,
( transitive(X1)
| ~ epred1_2(X1,X2)
| ~ transitive(X2) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(42,plain,
( reflexive(X1)
| ~ epred1_2(X1,X2)
| ~ reflexive(X2) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(43,negated_conjecture,
( epred1_2(esk2_0,esk1_0)
| ~ function(esk3_0)
| ~ relation(esk3_0)
| ~ relation(esk2_0)
| ~ relation(esk1_0) ),
inference(spm,[status(thm)],[11,16,theory(equality)]) ).
cnf(44,negated_conjecture,
( epred1_2(esk2_0,esk1_0)
| $false
| ~ relation(esk3_0)
| ~ relation(esk2_0)
| ~ relation(esk1_0) ),
inference(rw,[status(thm)],[43,18,theory(equality)]) ).
cnf(45,negated_conjecture,
( epred1_2(esk2_0,esk1_0)
| $false
| $false
| ~ relation(esk2_0)
| ~ relation(esk1_0) ),
inference(rw,[status(thm)],[44,19,theory(equality)]) ).
cnf(46,negated_conjecture,
( epred1_2(esk2_0,esk1_0)
| $false
| $false
| $false
| ~ relation(esk1_0) ),
inference(rw,[status(thm)],[45,20,theory(equality)]) ).
cnf(47,negated_conjecture,
( epred1_2(esk2_0,esk1_0)
| $false
| $false
| $false
| $false ),
inference(rw,[status(thm)],[46,21,theory(equality)]) ).
cnf(48,negated_conjecture,
epred1_2(esk2_0,esk1_0),
inference(cn,[status(thm)],[47,theory(equality)]) ).
cnf(50,negated_conjecture,
( reflexive(esk2_0)
| ~ reflexive(esk1_0) ),
inference(spm,[status(thm)],[42,48,theory(equality)]) ).
cnf(51,negated_conjecture,
( transitive(esk2_0)
| ~ transitive(esk1_0) ),
inference(spm,[status(thm)],[41,48,theory(equality)]) ).
cnf(52,negated_conjecture,
( connected(esk2_0)
| ~ connected(esk1_0) ),
inference(spm,[status(thm)],[40,48,theory(equality)]) ).
cnf(53,negated_conjecture,
( antisymmetric(esk2_0)
| ~ antisymmetric(esk1_0) ),
inference(spm,[status(thm)],[39,48,theory(equality)]) ).
cnf(54,negated_conjecture,
( well_founded_relation(esk2_0)
| ~ well_founded_relation(esk1_0) ),
inference(spm,[status(thm)],[38,48,theory(equality)]) ).
cnf(55,negated_conjecture,
( reflexive(esk2_0)
| ~ well_ordering(esk1_0)
| ~ relation(esk1_0) ),
inference(spm,[status(thm)],[50,34,theory(equality)]) ).
cnf(56,negated_conjecture,
( reflexive(esk2_0)
| $false
| ~ relation(esk1_0) ),
inference(rw,[status(thm)],[55,17,theory(equality)]) ).
cnf(57,negated_conjecture,
( reflexive(esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[56,21,theory(equality)]) ).
cnf(58,negated_conjecture,
reflexive(esk2_0),
inference(cn,[status(thm)],[57,theory(equality)]) ).
cnf(60,negated_conjecture,
( transitive(esk2_0)
| ~ well_ordering(esk1_0)
| ~ relation(esk1_0) ),
inference(spm,[status(thm)],[51,33,theory(equality)]) ).
cnf(61,negated_conjecture,
( transitive(esk2_0)
| $false
| ~ relation(esk1_0) ),
inference(rw,[status(thm)],[60,17,theory(equality)]) ).
cnf(62,negated_conjecture,
( transitive(esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[61,21,theory(equality)]) ).
cnf(63,negated_conjecture,
transitive(esk2_0),
inference(cn,[status(thm)],[62,theory(equality)]) ).
cnf(65,negated_conjecture,
( connected(esk2_0)
| ~ well_ordering(esk1_0)
| ~ relation(esk1_0) ),
inference(spm,[status(thm)],[52,31,theory(equality)]) ).
cnf(66,negated_conjecture,
( connected(esk2_0)
| $false
| ~ relation(esk1_0) ),
inference(rw,[status(thm)],[65,17,theory(equality)]) ).
cnf(67,negated_conjecture,
( connected(esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[66,21,theory(equality)]) ).
cnf(68,negated_conjecture,
connected(esk2_0),
inference(cn,[status(thm)],[67,theory(equality)]) ).
cnf(70,negated_conjecture,
( antisymmetric(esk2_0)
| ~ well_ordering(esk1_0)
| ~ relation(esk1_0) ),
inference(spm,[status(thm)],[53,32,theory(equality)]) ).
cnf(71,negated_conjecture,
( antisymmetric(esk2_0)
| $false
| ~ relation(esk1_0) ),
inference(rw,[status(thm)],[70,17,theory(equality)]) ).
cnf(72,negated_conjecture,
( antisymmetric(esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[71,21,theory(equality)]) ).
cnf(73,negated_conjecture,
antisymmetric(esk2_0),
inference(cn,[status(thm)],[72,theory(equality)]) ).
cnf(75,negated_conjecture,
( well_founded_relation(esk2_0)
| ~ well_ordering(esk1_0)
| ~ relation(esk1_0) ),
inference(spm,[status(thm)],[54,30,theory(equality)]) ).
cnf(76,negated_conjecture,
( well_founded_relation(esk2_0)
| $false
| ~ relation(esk1_0) ),
inference(rw,[status(thm)],[75,17,theory(equality)]) ).
cnf(77,negated_conjecture,
( well_founded_relation(esk2_0)
| $false
| $false ),
inference(rw,[status(thm)],[76,21,theory(equality)]) ).
cnf(78,negated_conjecture,
well_founded_relation(esk2_0),
inference(cn,[status(thm)],[77,theory(equality)]) ).
cnf(79,negated_conjecture,
( well_ordering(esk2_0)
| ~ antisymmetric(esk2_0)
| ~ connected(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| ~ relation(esk2_0) ),
inference(spm,[status(thm)],[29,78,theory(equality)]) ).
cnf(81,negated_conjecture,
( well_ordering(esk2_0)
| $false
| ~ connected(esk2_0)
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| ~ relation(esk2_0) ),
inference(rw,[status(thm)],[79,73,theory(equality)]) ).
cnf(82,negated_conjecture,
( well_ordering(esk2_0)
| $false
| $false
| ~ transitive(esk2_0)
| ~ reflexive(esk2_0)
| ~ relation(esk2_0) ),
inference(rw,[status(thm)],[81,68,theory(equality)]) ).
cnf(83,negated_conjecture,
( well_ordering(esk2_0)
| $false
| $false
| $false
| ~ reflexive(esk2_0)
| ~ relation(esk2_0) ),
inference(rw,[status(thm)],[82,63,theory(equality)]) ).
cnf(84,negated_conjecture,
( well_ordering(esk2_0)
| $false
| $false
| $false
| $false
| ~ relation(esk2_0) ),
inference(rw,[status(thm)],[83,58,theory(equality)]) ).
cnf(85,negated_conjecture,
( well_ordering(esk2_0)
| $false
| $false
| $false
| $false
| $false ),
inference(rw,[status(thm)],[84,20,theory(equality)]) ).
cnf(86,negated_conjecture,
well_ordering(esk2_0),
inference(cn,[status(thm)],[85,theory(equality)]) ).
cnf(87,negated_conjecture,
$false,
inference(sr,[status(thm)],[86,15,theory(equality)]) ).
cnf(88,negated_conjecture,
$false,
87,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU261+1.p
% --creating new selector for []
% -running prover on /tmp/tmpW-vAPh/sel_SEU261+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU261+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU261+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU261+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
%
%------------------------------------------------------------------------------