TSTP Solution File: MGT011+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT011+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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 : Sat Dec 25 21:03:48 EST 2010
% Result : Theorem 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 7
% Syntax : Number of formulae : 83 ( 12 unt; 0 def)
% Number of atoms : 344 ( 13 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 462 ( 201 ~; 202 |; 51 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 208 ( 0 sgn 94 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& greater(X2,X1) ),
file('/tmp/tmpdC5vE1/sel_MGT011+1.p_1',mp6_2) ).
fof(3,axiom,
! [X1,X3,X4,X5,X6] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& class(X1,X5,X3)
& class(X1,X6,X4) )
=> X5 = X6 ),
file('/tmp/tmpdC5vE1/sel_MGT011+1.p_1',mp10) ).
fof(4,axiom,
! [X1,X7,X8,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& inertia(X1,X7,X3)
& inertia(X1,X8,X4)
& greater(X4,X3) )
=> greater(X8,X7) ),
file('/tmp/tmpdC5vE1/sel_MGT011+1.p_1',t2_FOL) ).
fof(5,axiom,
! [X1,X9] :
( organization(X1,X9)
=> ? [X10] : inertia(X1,X10,X9) ),
file('/tmp/tmpdC5vE1/sel_MGT011+1.p_1',mp5) ).
fof(6,conjecture,
! [X1,X11,X12,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& size(X1,X11,X3)
& size(X1,X12,X4)
& greater(X4,X3) )
=> ~ greater(X11,X12) ),
file('/tmp/tmpdC5vE1/sel_MGT011+1.p_1',t11_FOL) ).
fof(7,axiom,
! [X1,X2,X13,X11,X12,X7,X8,X3,X4] :
( ( organization(X1,X3)
& organization(X2,X4)
& class(X1,X13,X3)
& class(X2,X13,X4)
& size(X1,X11,X3)
& size(X2,X12,X4)
& inertia(X1,X7,X3)
& inertia(X2,X8,X4)
& greater(X12,X11) )
=> greater(X8,X7) ),
file('/tmp/tmpdC5vE1/sel_MGT011+1.p_1',a5_FOL) ).
fof(8,axiom,
! [X1,X9] :
( organization(X1,X9)
=> ? [X13] : class(X1,X13,X9) ),
file('/tmp/tmpdC5vE1/sel_MGT011+1.p_1',mp9) ).
fof(9,negated_conjecture,
~ ! [X1,X11,X12,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& size(X1,X11,X3)
& size(X1,X12,X4)
& greater(X4,X3) )
=> ~ greater(X11,X12) ),
inference(assume_negation,[status(cth)],[6]) ).
fof(10,negated_conjecture,
~ ! [X1,X11,X12,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& size(X1,X11,X3)
& size(X1,X12,X4)
& greater(X4,X3) )
=> ~ greater(X11,X12) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(11,plain,
! [X1,X2] :
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(12,plain,
! [X3,X4] :
( ~ greater(X3,X4)
| ~ greater(X4,X3) ),
inference(variable_rename,[status(thm)],[11]) ).
cnf(13,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[12]) ).
fof(17,plain,
! [X1,X3,X4,X5,X6] :
( ~ organization(X1,X3)
| ~ organization(X1,X4)
| ~ reorganization_free(X1,X3,X4)
| ~ class(X1,X5,X3)
| ~ class(X1,X6,X4)
| X5 = X6 ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(18,plain,
! [X7,X8,X9,X10,X11] :
( ~ organization(X7,X8)
| ~ organization(X7,X9)
| ~ reorganization_free(X7,X8,X9)
| ~ class(X7,X10,X8)
| ~ class(X7,X11,X9)
| X10 = X11 ),
inference(variable_rename,[status(thm)],[17]) ).
cnf(19,plain,
( X1 = X2
| ~ class(X3,X2,X4)
| ~ class(X3,X1,X5)
| ~ reorganization_free(X3,X5,X4)
| ~ organization(X3,X4)
| ~ organization(X3,X5) ),
inference(split_conjunct,[status(thm)],[18]) ).
fof(20,plain,
! [X1,X7,X8,X3,X4] :
( ~ organization(X1,X3)
| ~ organization(X1,X4)
| ~ reorganization_free(X1,X3,X4)
| ~ inertia(X1,X7,X3)
| ~ inertia(X1,X8,X4)
| ~ greater(X4,X3)
| greater(X8,X7) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(21,plain,
! [X9,X10,X11,X12,X13] :
( ~ organization(X9,X12)
| ~ organization(X9,X13)
| ~ reorganization_free(X9,X12,X13)
| ~ inertia(X9,X10,X12)
| ~ inertia(X9,X11,X13)
| ~ greater(X13,X12)
| greater(X11,X10) ),
inference(variable_rename,[status(thm)],[20]) ).
cnf(22,plain,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X1,X3)
| ~ inertia(X5,X2,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(23,plain,
! [X1,X9] :
( ~ organization(X1,X9)
| ? [X10] : inertia(X1,X10,X9) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(24,plain,
! [X11,X12] :
( ~ organization(X11,X12)
| ? [X13] : inertia(X11,X13,X12) ),
inference(variable_rename,[status(thm)],[23]) ).
fof(25,plain,
! [X11,X12] :
( ~ organization(X11,X12)
| inertia(X11,esk1_2(X11,X12),X12) ),
inference(skolemize,[status(esa)],[24]) ).
cnf(26,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[25]) ).
fof(27,negated_conjecture,
? [X1,X11,X12,X3,X4] :
( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& size(X1,X11,X3)
& size(X1,X12,X4)
& greater(X4,X3)
& greater(X11,X12) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(28,negated_conjecture,
? [X13,X14,X15,X16,X17] :
( organization(X13,X16)
& organization(X13,X17)
& reorganization_free(X13,X16,X17)
& size(X13,X14,X16)
& size(X13,X15,X17)
& greater(X17,X16)
& greater(X14,X15) ),
inference(variable_rename,[status(thm)],[27]) ).
fof(29,negated_conjecture,
( organization(esk2_0,esk5_0)
& organization(esk2_0,esk6_0)
& reorganization_free(esk2_0,esk5_0,esk6_0)
& size(esk2_0,esk3_0,esk5_0)
& size(esk2_0,esk4_0,esk6_0)
& greater(esk6_0,esk5_0)
& greater(esk3_0,esk4_0) ),
inference(skolemize,[status(esa)],[28]) ).
cnf(30,negated_conjecture,
greater(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(31,negated_conjecture,
greater(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(32,negated_conjecture,
size(esk2_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(33,negated_conjecture,
size(esk2_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(34,negated_conjecture,
reorganization_free(esk2_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(35,negated_conjecture,
organization(esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(36,negated_conjecture,
organization(esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[29]) ).
fof(37,plain,
! [X1,X2,X13,X11,X12,X7,X8,X3,X4] :
( ~ organization(X1,X3)
| ~ organization(X2,X4)
| ~ class(X1,X13,X3)
| ~ class(X2,X13,X4)
| ~ size(X1,X11,X3)
| ~ size(X2,X12,X4)
| ~ inertia(X1,X7,X3)
| ~ inertia(X2,X8,X4)
| ~ greater(X12,X11)
| greater(X8,X7) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(38,plain,
! [X14,X15,X16,X17,X18,X19,X20,X21,X22] :
( ~ organization(X14,X21)
| ~ organization(X15,X22)
| ~ class(X14,X16,X21)
| ~ class(X15,X16,X22)
| ~ size(X14,X17,X21)
| ~ size(X15,X18,X22)
| ~ inertia(X14,X19,X21)
| ~ inertia(X15,X20,X22)
| ~ greater(X18,X17)
| greater(X20,X19) ),
inference(variable_rename,[status(thm)],[37]) ).
cnf(39,plain,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X1,X6)
| ~ inertia(X7,X2,X8)
| ~ size(X5,X3,X6)
| ~ size(X7,X4,X8)
| ~ class(X5,X9,X6)
| ~ class(X7,X9,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
inference(split_conjunct,[status(thm)],[38]) ).
fof(40,plain,
! [X1,X9] :
( ~ organization(X1,X9)
| ? [X13] : class(X1,X13,X9) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(41,plain,
! [X14,X15] :
( ~ organization(X14,X15)
| ? [X16] : class(X14,X16,X15) ),
inference(variable_rename,[status(thm)],[40]) ).
fof(42,plain,
! [X14,X15] :
( ~ organization(X14,X15)
| class(X14,esk7_2(X14,X15),X15) ),
inference(skolemize,[status(esa)],[41]) ).
cnf(43,plain,
( class(X1,esk7_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(47,plain,
( X1 = esk7_2(X2,X3)
| ~ class(X2,X1,X4)
| ~ reorganization_free(X2,X4,X3)
| ~ organization(X2,X4)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[19,43,theory(equality)]) ).
cnf(48,plain,
( greater(X1,esk1_2(X2,X3))
| ~ inertia(X2,X1,X4)
| ~ reorganization_free(X2,X3,X4)
| ~ organization(X2,X3)
| ~ organization(X2,X4)
| ~ greater(X4,X3) ),
inference(spm,[status(thm)],[22,26,theory(equality)]) ).
cnf(50,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ inertia(esk2_0,X2,esk6_0)
| ~ inertia(X3,X1,X5)
| ~ class(esk2_0,X6,esk6_0)
| ~ class(X3,X6,X5)
| ~ organization(esk2_0,esk6_0)
| ~ organization(X3,X5)
| ~ greater(X4,esk4_0) ),
inference(spm,[status(thm)],[39,32,theory(equality)]) ).
cnf(53,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ inertia(esk2_0,X2,esk6_0)
| ~ inertia(X3,X1,X5)
| ~ class(esk2_0,X6,esk6_0)
| ~ class(X3,X6,X5)
| $false
| ~ organization(X3,X5)
| ~ greater(X4,esk4_0) ),
inference(rw,[status(thm)],[50,35,theory(equality)]) ).
cnf(54,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ inertia(esk2_0,X2,esk6_0)
| ~ inertia(X3,X1,X5)
| ~ class(esk2_0,X6,esk6_0)
| ~ class(X3,X6,X5)
| ~ organization(X3,X5)
| ~ greater(X4,esk4_0) ),
inference(cn,[status(thm)],[53,theory(equality)]) ).
cnf(55,plain,
( esk7_2(X1,X2) = esk7_2(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X2)
| ~ organization(X1,X3) ),
inference(spm,[status(thm)],[47,43,theory(equality)]) ).
cnf(56,negated_conjecture,
( esk7_2(esk2_0,esk5_0) = esk7_2(esk2_0,esk6_0)
| ~ organization(esk2_0,esk5_0)
| ~ organization(esk2_0,esk6_0) ),
inference(spm,[status(thm)],[55,34,theory(equality)]) ).
cnf(57,negated_conjecture,
( esk7_2(esk2_0,esk5_0) = esk7_2(esk2_0,esk6_0)
| $false
| ~ organization(esk2_0,esk6_0) ),
inference(rw,[status(thm)],[56,36,theory(equality)]) ).
cnf(58,negated_conjecture,
( esk7_2(esk2_0,esk5_0) = esk7_2(esk2_0,esk6_0)
| $false
| $false ),
inference(rw,[status(thm)],[57,35,theory(equality)]) ).
cnf(59,negated_conjecture,
esk7_2(esk2_0,esk5_0) = esk7_2(esk2_0,esk6_0),
inference(cn,[status(thm)],[58,theory(equality)]) ).
cnf(60,negated_conjecture,
( class(esk2_0,esk7_2(esk2_0,esk6_0),esk5_0)
| ~ organization(esk2_0,esk5_0) ),
inference(spm,[status(thm)],[43,59,theory(equality)]) ).
cnf(61,negated_conjecture,
( class(esk2_0,esk7_2(esk2_0,esk6_0),esk5_0)
| $false ),
inference(rw,[status(thm)],[60,36,theory(equality)]) ).
cnf(62,negated_conjecture,
class(esk2_0,esk7_2(esk2_0,esk6_0),esk5_0),
inference(cn,[status(thm)],[61,theory(equality)]) ).
cnf(64,negated_conjecture,
( esk7_2(esk2_0,esk6_0) = esk7_2(esk2_0,X1)
| ~ reorganization_free(esk2_0,esk5_0,X1)
| ~ organization(esk2_0,esk5_0)
| ~ organization(esk2_0,X1) ),
inference(spm,[status(thm)],[47,62,theory(equality)]) ).
cnf(67,negated_conjecture,
( esk7_2(esk2_0,esk6_0) = esk7_2(esk2_0,X1)
| ~ reorganization_free(esk2_0,esk5_0,X1)
| $false
| ~ organization(esk2_0,X1) ),
inference(rw,[status(thm)],[64,36,theory(equality)]) ).
cnf(68,negated_conjecture,
( esk7_2(esk2_0,esk6_0) = esk7_2(esk2_0,X1)
| ~ reorganization_free(esk2_0,esk5_0,X1)
| ~ organization(esk2_0,X1) ),
inference(cn,[status(thm)],[67,theory(equality)]) ).
cnf(71,negated_conjecture,
( class(esk2_0,esk7_2(esk2_0,X1),esk6_0)
| ~ organization(esk2_0,esk6_0)
| ~ reorganization_free(esk2_0,esk5_0,X1)
| ~ organization(esk2_0,X1) ),
inference(spm,[status(thm)],[43,68,theory(equality)]) ).
cnf(80,negated_conjecture,
( class(esk2_0,esk7_2(esk2_0,X1),esk6_0)
| $false
| ~ reorganization_free(esk2_0,esk5_0,X1)
| ~ organization(esk2_0,X1) ),
inference(rw,[status(thm)],[71,35,theory(equality)]) ).
cnf(81,negated_conjecture,
( class(esk2_0,esk7_2(esk2_0,X1),esk6_0)
| ~ reorganization_free(esk2_0,esk5_0,X1)
| ~ organization(esk2_0,X1) ),
inference(cn,[status(thm)],[80,theory(equality)]) ).
cnf(108,negated_conjecture,
( class(esk2_0,esk7_2(esk2_0,esk6_0),esk6_0)
| ~ reorganization_free(esk2_0,esk5_0,X1)
| ~ organization(esk2_0,X1) ),
inference(spm,[status(thm)],[81,68,theory(equality)]) ).
cnf(118,plain,
( greater(esk1_2(X1,X2),esk1_2(X1,X3))
| ~ reorganization_free(X1,X3,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[48,26,theory(equality)]) ).
cnf(137,negated_conjecture,
( class(esk2_0,esk7_2(esk2_0,esk6_0),esk6_0)
| ~ organization(esk2_0,esk6_0) ),
inference(spm,[status(thm)],[108,34,theory(equality)]) ).
cnf(138,negated_conjecture,
( class(esk2_0,esk7_2(esk2_0,esk6_0),esk6_0)
| $false ),
inference(rw,[status(thm)],[137,35,theory(equality)]) ).
cnf(139,negated_conjecture,
class(esk2_0,esk7_2(esk2_0,esk6_0),esk6_0),
inference(cn,[status(thm)],[138,theory(equality)]) ).
cnf(253,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk6_0))
| ~ size(X2,X3,X4)
| ~ inertia(X2,X1,X4)
| ~ class(esk2_0,X5,esk6_0)
| ~ class(X2,X5,X4)
| ~ organization(X2,X4)
| ~ greater(X3,esk4_0)
| ~ organization(esk2_0,esk6_0) ),
inference(spm,[status(thm)],[54,26,theory(equality)]) ).
cnf(254,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk6_0))
| ~ size(X2,X3,X4)
| ~ inertia(X2,X1,X4)
| ~ class(esk2_0,X5,esk6_0)
| ~ class(X2,X5,X4)
| ~ organization(X2,X4)
| ~ greater(X3,esk4_0)
| $false ),
inference(rw,[status(thm)],[253,35,theory(equality)]) ).
cnf(255,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk6_0))
| ~ size(X2,X3,X4)
| ~ inertia(X2,X1,X4)
| ~ class(esk2_0,X5,esk6_0)
| ~ class(X2,X5,X4)
| ~ organization(X2,X4)
| ~ greater(X3,esk4_0) ),
inference(cn,[status(thm)],[254,theory(equality)]) ).
cnf(349,plain,
( ~ greater(esk1_2(X1,X3),esk1_2(X1,X2))
| ~ reorganization_free(X1,X3,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[13,118,theory(equality)]) ).
cnf(700,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk6_0))
| ~ size(X2,X3,X4)
| ~ inertia(X2,X1,X4)
| ~ class(X2,esk7_2(esk2_0,esk6_0),X4)
| ~ organization(X2,X4)
| ~ greater(X3,esk4_0) ),
inference(spm,[status(thm)],[255,139,theory(equality)]) ).
cnf(986,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk6_0))
| ~ size(esk2_0,X2,esk5_0)
| ~ inertia(esk2_0,X1,esk5_0)
| ~ organization(esk2_0,esk5_0)
| ~ greater(X2,esk4_0) ),
inference(spm,[status(thm)],[700,62,theory(equality)]) ).
cnf(1009,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk6_0))
| ~ size(esk2_0,X2,esk5_0)
| ~ inertia(esk2_0,X1,esk5_0)
| $false
| ~ greater(X2,esk4_0) ),
inference(rw,[status(thm)],[986,36,theory(equality)]) ).
cnf(1010,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk6_0))
| ~ size(esk2_0,X2,esk5_0)
| ~ inertia(esk2_0,X1,esk5_0)
| ~ greater(X2,esk4_0) ),
inference(cn,[status(thm)],[1009,theory(equality)]) ).
cnf(1060,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk6_0))
| ~ inertia(esk2_0,X1,esk5_0)
| ~ greater(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[1010,33,theory(equality)]) ).
cnf(1061,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk6_0))
| ~ inertia(esk2_0,X1,esk5_0)
| $false ),
inference(rw,[status(thm)],[1060,30,theory(equality)]) ).
cnf(1062,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk6_0))
| ~ inertia(esk2_0,X1,esk5_0) ),
inference(cn,[status(thm)],[1061,theory(equality)]) ).
cnf(1065,negated_conjecture,
( ~ reorganization_free(esk2_0,X1,esk6_0)
| ~ organization(esk2_0,X1)
| ~ organization(esk2_0,esk6_0)
| ~ greater(esk6_0,X1)
| ~ inertia(esk2_0,esk1_2(esk2_0,X1),esk5_0) ),
inference(spm,[status(thm)],[349,1062,theory(equality)]) ).
cnf(1066,negated_conjecture,
( ~ reorganization_free(esk2_0,X1,esk6_0)
| ~ organization(esk2_0,X1)
| $false
| ~ greater(esk6_0,X1)
| ~ inertia(esk2_0,esk1_2(esk2_0,X1),esk5_0) ),
inference(rw,[status(thm)],[1065,35,theory(equality)]) ).
cnf(1067,negated_conjecture,
( ~ reorganization_free(esk2_0,X1,esk6_0)
| ~ organization(esk2_0,X1)
| ~ greater(esk6_0,X1)
| ~ inertia(esk2_0,esk1_2(esk2_0,X1),esk5_0) ),
inference(cn,[status(thm)],[1066,theory(equality)]) ).
cnf(1076,negated_conjecture,
( ~ reorganization_free(esk2_0,esk5_0,esk6_0)
| ~ organization(esk2_0,esk5_0)
| ~ greater(esk6_0,esk5_0) ),
inference(spm,[status(thm)],[1067,26,theory(equality)]) ).
cnf(1077,negated_conjecture,
( $false
| ~ organization(esk2_0,esk5_0)
| ~ greater(esk6_0,esk5_0) ),
inference(rw,[status(thm)],[1076,34,theory(equality)]) ).
cnf(1078,negated_conjecture,
( $false
| $false
| ~ greater(esk6_0,esk5_0) ),
inference(rw,[status(thm)],[1077,36,theory(equality)]) ).
cnf(1079,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[1078,31,theory(equality)]) ).
cnf(1080,negated_conjecture,
$false,
inference(cn,[status(thm)],[1079,theory(equality)]) ).
cnf(1081,negated_conjecture,
$false,
1080,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT011+1.p
% --creating new selector for []
% -running prover on /tmp/tmpdC5vE1/sel_MGT011+1.p_1 with time limit 29
% -prover status Theorem
% Problem MGT011+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT011+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT011+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
%
%------------------------------------------------------------------------------