TSTP Solution File: MGT018+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT018+1 : TPTP v5.0.0. Released v2.0.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 : Sat Dec 25 21:04:18 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 4
% Syntax : Number of formulae : 66 ( 17 unt; 0 def)
% Number of atoms : 426 ( 0 equ)
% Maximal formula atoms : 13 ( 6 avg)
% Number of connectives : 601 ( 241 ~; 254 |; 99 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 248 ( 0 sgn 98 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( organization(X1,X7)
& organization(X2,X7)
& ~ organization(X2,X9)
& class(X1,X4,X7)
& class(X2,X4,X7)
& reorganization(X1,X7,X8)
& reorganization(X2,X7,X9)
& reorganization_type(X1,X3,X7)
& reorganization_type(X2,X3,X7)
& inertia(X1,X5,X7)
& inertia(X2,X6,X7)
& greater(X6,X5) )
=> greater(X8,X9) ),
file('/tmp/tmpXwT35x/sel_MGT018+1.p_1',a14_FOL) ).
fof(2,axiom,
! [X1,X10] :
( organization(X1,X10)
=> ? [X11] : inertia(X1,X11,X10) ),
file('/tmp/tmpXwT35x/sel_MGT018+1.p_1',mp5) ).
fof(3,conjecture,
! [X1,X2,X3,X4,X12,X13,X7,X8,X9] :
( ( organization(X1,X7)
& organization(X2,X7)
& ~ organization(X2,X9)
& class(X1,X4,X7)
& class(X2,X4,X7)
& reorganization(X1,X7,X8)
& reorganization(X2,X7,X9)
& reorganization_type(X1,X3,X7)
& reorganization_type(X2,X3,X7)
& size(X1,X12,X7)
& size(X2,X13,X7)
& greater(X13,X12) )
=> greater(X8,X9) ),
file('/tmp/tmpXwT35x/sel_MGT018+1.p_1',t18_FOL) ).
fof(4,axiom,
! [X1,X2,X4,X12,X13,X5,X6,X14,X15] :
( ( organization(X1,X14)
& organization(X2,X15)
& class(X1,X4,X14)
& class(X2,X4,X15)
& size(X1,X12,X14)
& size(X2,X13,X15)
& inertia(X1,X5,X14)
& inertia(X2,X6,X15)
& greater(X13,X12) )
=> greater(X6,X5) ),
file('/tmp/tmpXwT35x/sel_MGT018+1.p_1',a5_FOL) ).
fof(5,negated_conjecture,
~ ! [X1,X2,X3,X4,X12,X13,X7,X8,X9] :
( ( organization(X1,X7)
& organization(X2,X7)
& ~ organization(X2,X9)
& class(X1,X4,X7)
& class(X2,X4,X7)
& reorganization(X1,X7,X8)
& reorganization(X2,X7,X9)
& reorganization_type(X1,X3,X7)
& reorganization_type(X2,X3,X7)
& size(X1,X12,X7)
& size(X2,X13,X7)
& greater(X13,X12) )
=> greater(X8,X9) ),
inference(assume_negation,[status(cth)],[3]) ).
fof(6,plain,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( organization(X1,X7)
& organization(X2,X7)
& ~ organization(X2,X9)
& class(X1,X4,X7)
& class(X2,X4,X7)
& reorganization(X1,X7,X8)
& reorganization(X2,X7,X9)
& reorganization_type(X1,X3,X7)
& reorganization_type(X2,X3,X7)
& inertia(X1,X5,X7)
& inertia(X2,X6,X7)
& greater(X6,X5) )
=> greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(7,negated_conjecture,
~ ! [X1,X2,X3,X4,X12,X13,X7,X8,X9] :
( ( organization(X1,X7)
& organization(X2,X7)
& ~ organization(X2,X9)
& class(X1,X4,X7)
& class(X2,X4,X7)
& reorganization(X1,X7,X8)
& reorganization(X2,X7,X9)
& reorganization_type(X1,X3,X7)
& reorganization_type(X2,X3,X7)
& size(X1,X12,X7)
& size(X2,X13,X7)
& greater(X13,X12) )
=> greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(8,plain,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ~ organization(X1,X7)
| ~ organization(X2,X7)
| organization(X2,X9)
| ~ class(X1,X4,X7)
| ~ class(X2,X4,X7)
| ~ reorganization(X1,X7,X8)
| ~ reorganization(X2,X7,X9)
| ~ reorganization_type(X1,X3,X7)
| ~ reorganization_type(X2,X3,X7)
| ~ inertia(X1,X5,X7)
| ~ inertia(X2,X6,X7)
| ~ greater(X6,X5)
| greater(X8,X9) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(9,plain,
! [X10,X11,X12,X13,X14,X15,X16,X17,X18] :
( ~ organization(X10,X16)
| ~ organization(X11,X16)
| organization(X11,X18)
| ~ class(X10,X13,X16)
| ~ class(X11,X13,X16)
| ~ reorganization(X10,X16,X17)
| ~ reorganization(X11,X16,X18)
| ~ reorganization_type(X10,X12,X16)
| ~ reorganization_type(X11,X12,X16)
| ~ inertia(X10,X14,X16)
| ~ inertia(X11,X15,X16)
| ~ greater(X15,X14)
| greater(X17,X18) ),
inference(variable_rename,[status(thm)],[8]) ).
cnf(10,plain,
( greater(X1,X2)
| organization(X5,X2)
| ~ greater(X3,X4)
| ~ inertia(X5,X3,X6)
| ~ inertia(X7,X4,X6)
| ~ reorganization_type(X5,X8,X6)
| ~ reorganization_type(X7,X8,X6)
| ~ reorganization(X5,X6,X2)
| ~ reorganization(X7,X6,X1)
| ~ class(X5,X9,X6)
| ~ class(X7,X9,X6)
| ~ organization(X5,X6)
| ~ organization(X7,X6) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(11,plain,
! [X1,X10] :
( ~ organization(X1,X10)
| ? [X11] : inertia(X1,X11,X10) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(12,plain,
! [X12,X13] :
( ~ organization(X12,X13)
| ? [X14] : inertia(X12,X14,X13) ),
inference(variable_rename,[status(thm)],[11]) ).
fof(13,plain,
! [X12,X13] :
( ~ organization(X12,X13)
| inertia(X12,esk1_2(X12,X13),X13) ),
inference(skolemize,[status(esa)],[12]) ).
cnf(14,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[13]) ).
fof(15,negated_conjecture,
? [X1,X2,X3,X4,X12,X13,X7,X8,X9] :
( organization(X1,X7)
& organization(X2,X7)
& ~ organization(X2,X9)
& class(X1,X4,X7)
& class(X2,X4,X7)
& reorganization(X1,X7,X8)
& reorganization(X2,X7,X9)
& reorganization_type(X1,X3,X7)
& reorganization_type(X2,X3,X7)
& size(X1,X12,X7)
& size(X2,X13,X7)
& greater(X13,X12)
& ~ greater(X8,X9) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(16,negated_conjecture,
? [X14,X15,X16,X17,X18,X19,X20,X21,X22] :
( organization(X14,X20)
& organization(X15,X20)
& ~ organization(X15,X22)
& class(X14,X17,X20)
& class(X15,X17,X20)
& reorganization(X14,X20,X21)
& reorganization(X15,X20,X22)
& reorganization_type(X14,X16,X20)
& reorganization_type(X15,X16,X20)
& size(X14,X18,X20)
& size(X15,X19,X20)
& greater(X19,X18)
& ~ greater(X21,X22) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(17,negated_conjecture,
( organization(esk2_0,esk8_0)
& organization(esk3_0,esk8_0)
& ~ organization(esk3_0,esk10_0)
& class(esk2_0,esk5_0,esk8_0)
& class(esk3_0,esk5_0,esk8_0)
& reorganization(esk2_0,esk8_0,esk9_0)
& reorganization(esk3_0,esk8_0,esk10_0)
& reorganization_type(esk2_0,esk4_0,esk8_0)
& reorganization_type(esk3_0,esk4_0,esk8_0)
& size(esk2_0,esk6_0,esk8_0)
& size(esk3_0,esk7_0,esk8_0)
& greater(esk7_0,esk6_0)
& ~ greater(esk9_0,esk10_0) ),
inference(skolemize,[status(esa)],[16]) ).
cnf(18,negated_conjecture,
~ greater(esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(19,negated_conjecture,
greater(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(20,negated_conjecture,
size(esk3_0,esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(21,negated_conjecture,
size(esk2_0,esk6_0,esk8_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(22,negated_conjecture,
reorganization_type(esk3_0,esk4_0,esk8_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(23,negated_conjecture,
reorganization_type(esk2_0,esk4_0,esk8_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(24,negated_conjecture,
reorganization(esk3_0,esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(25,negated_conjecture,
reorganization(esk2_0,esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(26,negated_conjecture,
class(esk3_0,esk5_0,esk8_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(27,negated_conjecture,
class(esk2_0,esk5_0,esk8_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(28,negated_conjecture,
~ organization(esk3_0,esk10_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(29,negated_conjecture,
organization(esk3_0,esk8_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(30,negated_conjecture,
organization(esk2_0,esk8_0),
inference(split_conjunct,[status(thm)],[17]) ).
fof(31,plain,
! [X1,X2,X4,X12,X13,X5,X6,X14,X15] :
( ~ organization(X1,X14)
| ~ organization(X2,X15)
| ~ class(X1,X4,X14)
| ~ class(X2,X4,X15)
| ~ size(X1,X12,X14)
| ~ size(X2,X13,X15)
| ~ inertia(X1,X5,X14)
| ~ inertia(X2,X6,X15)
| ~ greater(X13,X12)
| greater(X6,X5) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(32,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23,X24] :
( ~ organization(X16,X23)
| ~ organization(X17,X24)
| ~ class(X16,X18,X23)
| ~ class(X17,X18,X24)
| ~ size(X16,X19,X23)
| ~ size(X17,X20,X24)
| ~ inertia(X16,X21,X23)
| ~ inertia(X17,X22,X24)
| ~ greater(X20,X19)
| greater(X22,X21) ),
inference(variable_rename,[status(thm)],[31]) ).
cnf(33,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)],[32]) ).
cnf(34,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ greater(X4,esk6_0)
| ~ inertia(esk2_0,X2,esk8_0)
| ~ inertia(X3,X1,X5)
| ~ class(esk2_0,X6,esk8_0)
| ~ class(X3,X6,X5)
| ~ organization(esk2_0,esk8_0)
| ~ organization(X3,X5) ),
inference(spm,[status(thm)],[33,21,theory(equality)]) ).
cnf(36,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ greater(X4,esk6_0)
| ~ inertia(esk2_0,X2,esk8_0)
| ~ inertia(X3,X1,X5)
| ~ class(esk2_0,X6,esk8_0)
| ~ class(X3,X6,X5)
| $false
| ~ organization(X3,X5) ),
inference(rw,[status(thm)],[34,30,theory(equality)]) ).
cnf(37,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ greater(X4,esk6_0)
| ~ inertia(esk2_0,X2,esk8_0)
| ~ inertia(X3,X1,X5)
| ~ class(esk2_0,X6,esk8_0)
| ~ class(X3,X6,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[36,theory(equality)]) ).
cnf(40,plain,
( greater(X1,X2)
| organization(X3,X2)
| ~ greater(X4,esk1_2(X5,X6))
| ~ inertia(X3,X4,X6)
| ~ reorganization_type(X5,X7,X6)
| ~ reorganization_type(X3,X7,X6)
| ~ reorganization(X5,X6,X1)
| ~ reorganization(X3,X6,X2)
| ~ class(X5,X8,X6)
| ~ class(X3,X8,X6)
| ~ organization(X5,X6)
| ~ organization(X3,X6) ),
inference(spm,[status(thm)],[10,14,theory(equality)]) ).
cnf(41,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk8_0))
| ~ size(X2,X3,X4)
| ~ greater(X3,esk6_0)
| ~ inertia(X2,X1,X4)
| ~ class(esk2_0,X5,esk8_0)
| ~ class(X2,X5,X4)
| ~ organization(X2,X4)
| ~ organization(esk2_0,esk8_0) ),
inference(spm,[status(thm)],[37,14,theory(equality)]) ).
cnf(42,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk8_0))
| ~ size(X2,X3,X4)
| ~ greater(X3,esk6_0)
| ~ inertia(X2,X1,X4)
| ~ class(esk2_0,X5,esk8_0)
| ~ class(X2,X5,X4)
| ~ organization(X2,X4)
| $false ),
inference(rw,[status(thm)],[41,30,theory(equality)]) ).
cnf(43,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk8_0))
| ~ size(X2,X3,X4)
| ~ greater(X3,esk6_0)
| ~ inertia(X2,X1,X4)
| ~ class(esk2_0,X5,esk8_0)
| ~ class(X2,X5,X4)
| ~ organization(X2,X4) ),
inference(cn,[status(thm)],[42,theory(equality)]) ).
cnf(47,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk8_0))
| ~ size(X2,X3,X4)
| ~ greater(X3,esk6_0)
| ~ inertia(X2,X1,X4)
| ~ class(X2,esk5_0,X4)
| ~ organization(X2,X4) ),
inference(spm,[status(thm)],[43,27,theory(equality)]) ).
cnf(49,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk8_0))
| ~ greater(esk7_0,esk6_0)
| ~ inertia(esk3_0,X1,esk8_0)
| ~ class(esk3_0,esk5_0,esk8_0)
| ~ organization(esk3_0,esk8_0) ),
inference(spm,[status(thm)],[47,20,theory(equality)]) ).
cnf(53,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk8_0))
| $false
| ~ inertia(esk3_0,X1,esk8_0)
| ~ class(esk3_0,esk5_0,esk8_0)
| ~ organization(esk3_0,esk8_0) ),
inference(rw,[status(thm)],[49,19,theory(equality)]) ).
cnf(54,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk8_0))
| $false
| ~ inertia(esk3_0,X1,esk8_0)
| $false
| ~ organization(esk3_0,esk8_0) ),
inference(rw,[status(thm)],[53,26,theory(equality)]) ).
cnf(55,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk8_0))
| $false
| ~ inertia(esk3_0,X1,esk8_0)
| $false
| $false ),
inference(rw,[status(thm)],[54,29,theory(equality)]) ).
cnf(56,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk8_0))
| ~ inertia(esk3_0,X1,esk8_0) ),
inference(cn,[status(thm)],[55,theory(equality)]) ).
cnf(66,negated_conjecture,
( greater(X1,X2)
| organization(X3,X2)
| ~ inertia(X3,X4,esk8_0)
| ~ reorganization_type(esk2_0,X5,esk8_0)
| ~ reorganization_type(X3,X5,esk8_0)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(X3,esk8_0,X2)
| ~ class(esk2_0,X6,esk8_0)
| ~ class(X3,X6,esk8_0)
| ~ organization(esk2_0,esk8_0)
| ~ organization(X3,esk8_0)
| ~ inertia(esk3_0,X4,esk8_0) ),
inference(spm,[status(thm)],[40,56,theory(equality)]) ).
cnf(70,negated_conjecture,
( greater(X1,X2)
| organization(X3,X2)
| ~ inertia(X3,X4,esk8_0)
| ~ reorganization_type(esk2_0,X5,esk8_0)
| ~ reorganization_type(X3,X5,esk8_0)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(X3,esk8_0,X2)
| ~ class(esk2_0,X6,esk8_0)
| ~ class(X3,X6,esk8_0)
| $false
| ~ organization(X3,esk8_0)
| ~ inertia(esk3_0,X4,esk8_0) ),
inference(rw,[status(thm)],[66,30,theory(equality)]) ).
cnf(71,negated_conjecture,
( greater(X1,X2)
| organization(X3,X2)
| ~ inertia(X3,X4,esk8_0)
| ~ reorganization_type(esk2_0,X5,esk8_0)
| ~ reorganization_type(X3,X5,esk8_0)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(X3,esk8_0,X2)
| ~ class(esk2_0,X6,esk8_0)
| ~ class(X3,X6,esk8_0)
| ~ organization(X3,esk8_0)
| ~ inertia(esk3_0,X4,esk8_0) ),
inference(cn,[status(thm)],[70,theory(equality)]) ).
cnf(78,negated_conjecture,
( greater(X1,X2)
| organization(X3,X2)
| ~ inertia(X3,esk1_2(esk3_0,esk8_0),esk8_0)
| ~ reorganization_type(esk2_0,X4,esk8_0)
| ~ reorganization_type(X3,X4,esk8_0)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(X3,esk8_0,X2)
| ~ class(esk2_0,X5,esk8_0)
| ~ class(X3,X5,esk8_0)
| ~ organization(X3,esk8_0)
| ~ organization(esk3_0,esk8_0) ),
inference(spm,[status(thm)],[71,14,theory(equality)]) ).
cnf(79,negated_conjecture,
( greater(X1,X2)
| organization(X3,X2)
| ~ inertia(X3,esk1_2(esk3_0,esk8_0),esk8_0)
| ~ reorganization_type(esk2_0,X4,esk8_0)
| ~ reorganization_type(X3,X4,esk8_0)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(X3,esk8_0,X2)
| ~ class(esk2_0,X5,esk8_0)
| ~ class(X3,X5,esk8_0)
| ~ organization(X3,esk8_0)
| $false ),
inference(rw,[status(thm)],[78,29,theory(equality)]) ).
cnf(80,negated_conjecture,
( greater(X1,X2)
| organization(X3,X2)
| ~ inertia(X3,esk1_2(esk3_0,esk8_0),esk8_0)
| ~ reorganization_type(esk2_0,X4,esk8_0)
| ~ reorganization_type(X3,X4,esk8_0)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(X3,esk8_0,X2)
| ~ class(esk2_0,X5,esk8_0)
| ~ class(X3,X5,esk8_0)
| ~ organization(X3,esk8_0) ),
inference(cn,[status(thm)],[79,theory(equality)]) ).
cnf(81,negated_conjecture,
( greater(X1,X2)
| organization(esk3_0,X2)
| ~ reorganization_type(esk2_0,X3,esk8_0)
| ~ reorganization_type(esk3_0,X3,esk8_0)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(esk3_0,esk8_0,X2)
| ~ class(esk2_0,X4,esk8_0)
| ~ class(esk3_0,X4,esk8_0)
| ~ organization(esk3_0,esk8_0) ),
inference(spm,[status(thm)],[80,14,theory(equality)]) ).
cnf(82,negated_conjecture,
( greater(X1,X2)
| organization(esk3_0,X2)
| ~ reorganization_type(esk2_0,X3,esk8_0)
| ~ reorganization_type(esk3_0,X3,esk8_0)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(esk3_0,esk8_0,X2)
| ~ class(esk2_0,X4,esk8_0)
| ~ class(esk3_0,X4,esk8_0)
| $false ),
inference(rw,[status(thm)],[81,29,theory(equality)]) ).
cnf(83,negated_conjecture,
( greater(X1,X2)
| organization(esk3_0,X2)
| ~ reorganization_type(esk2_0,X3,esk8_0)
| ~ reorganization_type(esk3_0,X3,esk8_0)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(esk3_0,esk8_0,X2)
| ~ class(esk2_0,X4,esk8_0)
| ~ class(esk3_0,X4,esk8_0) ),
inference(cn,[status(thm)],[82,theory(equality)]) ).
cnf(84,negated_conjecture,
( greater(X1,X2)
| organization(esk3_0,X2)
| ~ reorganization_type(esk3_0,esk4_0,esk8_0)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(esk3_0,esk8_0,X2)
| ~ class(esk2_0,X3,esk8_0)
| ~ class(esk3_0,X3,esk8_0) ),
inference(spm,[status(thm)],[83,23,theory(equality)]) ).
cnf(85,negated_conjecture,
( greater(X1,X2)
| organization(esk3_0,X2)
| $false
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(esk3_0,esk8_0,X2)
| ~ class(esk2_0,X3,esk8_0)
| ~ class(esk3_0,X3,esk8_0) ),
inference(rw,[status(thm)],[84,22,theory(equality)]) ).
cnf(86,negated_conjecture,
( greater(X1,X2)
| organization(esk3_0,X2)
| ~ reorganization(esk2_0,esk8_0,X1)
| ~ reorganization(esk3_0,esk8_0,X2)
| ~ class(esk2_0,X3,esk8_0)
| ~ class(esk3_0,X3,esk8_0) ),
inference(cn,[status(thm)],[85,theory(equality)]) ).
cnf(87,negated_conjecture,
( greater(esk9_0,X1)
| organization(esk3_0,X1)
| ~ reorganization(esk3_0,esk8_0,X1)
| ~ class(esk2_0,X2,esk8_0)
| ~ class(esk3_0,X2,esk8_0) ),
inference(spm,[status(thm)],[86,25,theory(equality)]) ).
cnf(88,negated_conjecture,
( greater(esk9_0,esk10_0)
| organization(esk3_0,esk10_0)
| ~ class(esk2_0,X1,esk8_0)
| ~ class(esk3_0,X1,esk8_0) ),
inference(spm,[status(thm)],[87,24,theory(equality)]) ).
cnf(89,negated_conjecture,
( organization(esk3_0,esk10_0)
| ~ class(esk2_0,X1,esk8_0)
| ~ class(esk3_0,X1,esk8_0) ),
inference(sr,[status(thm)],[88,18,theory(equality)]) ).
cnf(90,negated_conjecture,
( ~ class(esk2_0,X1,esk8_0)
| ~ class(esk3_0,X1,esk8_0) ),
inference(sr,[status(thm)],[89,28,theory(equality)]) ).
cnf(97,negated_conjecture,
~ class(esk3_0,esk5_0,esk8_0),
inference(spm,[status(thm)],[90,27,theory(equality)]) ).
cnf(98,negated_conjecture,
$false,
inference(rw,[status(thm)],[97,26,theory(equality)]) ).
cnf(99,negated_conjecture,
$false,
inference(cn,[status(thm)],[98,theory(equality)]) ).
cnf(100,negated_conjecture,
$false,
99,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT018+1.p
% --creating new selector for []
% -running prover on /tmp/tmpXwT35x/sel_MGT018+1.p_1 with time limit 29
% -prover status Theorem
% Problem MGT018+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT018+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT018+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
%
%------------------------------------------------------------------------------