%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT016+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:09 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 4
% Syntax : Number of formulae : 62 ( 18 unt; 0 def)
% Number of atoms : 373 ( 0 equ)
% Maximal formula atoms : 13 ( 6 avg)
% Number of connectives : 508 ( 197 ~; 205 |; 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 : 218 ( 0 sgn 98 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [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)
& complexity(X1,X5,X7)
& complexity(X2,X6,X7)
& greater(X6,X5) )
=> greater(X8,X9) ),
file('/tmp/tmpQse2fX/sel_MGT016+1.p_1',t16_FOL) ).
fof(2,axiom,
! [X1,X2,X3,X4,X10,X11,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,X10,X7)
& inertia(X2,X11,X7)
& greater(X11,X10) )
=> greater(X8,X9) ),
file('/tmp/tmpQse2fX/sel_MGT016+1.p_1',a14_FOL) ).
fof(3,axiom,
! [X1,X12] :
( organization(X1,X12)
=> ? [X13] : inertia(X1,X13,X12) ),
file('/tmp/tmpQse2fX/sel_MGT016+1.p_1',mp5) ).
fof(4,axiom,
! [X1,X2,X4,X5,X6,X10,X11,X14,X15] :
( ( organization(X1,X14)
& organization(X2,X15)
& class(X1,X4,X14)
& class(X2,X4,X15)
& complexity(X1,X5,X14)
& complexity(X2,X6,X15)
& inertia(X1,X10,X14)
& inertia(X2,X11,X15)
& greater(X6,X5) )
=> greater(X11,X10) ),
file('/tmp/tmpQse2fX/sel_MGT016+1.p_1',a12_FOL) ).
fof(5,negated_conjecture,
~ ! [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)
& complexity(X1,X5,X7)
& complexity(X2,X6,X7)
& greater(X6,X5) )
=> greater(X8,X9) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(6,negated_conjecture,
~ ! [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)
& complexity(X1,X5,X7)
& complexity(X2,X6,X7)
& greater(X6,X5) )
=> greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(7,plain,
! [X1,X2,X3,X4,X10,X11,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,X10,X7)
& inertia(X2,X11,X7)
& greater(X11,X10) )
=> greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(8,negated_conjecture,
? [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)
& complexity(X1,X5,X7)
& complexity(X2,X6,X7)
& greater(X6,X5)
& ~ greater(X8,X9) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(9,negated_conjecture,
? [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)
& complexity(X10,X14,X16)
& complexity(X11,X15,X16)
& greater(X15,X14)
& ~ greater(X17,X18) ),
inference(variable_rename,[status(thm)],[8]) ).
fof(10,negated_conjecture,
( organization(esk1_0,esk7_0)
& organization(esk2_0,esk7_0)
& ~ organization(esk2_0,esk9_0)
& class(esk1_0,esk4_0,esk7_0)
& class(esk2_0,esk4_0,esk7_0)
& reorganization(esk1_0,esk7_0,esk8_0)
& reorganization(esk2_0,esk7_0,esk9_0)
& reorganization_type(esk1_0,esk3_0,esk7_0)
& reorganization_type(esk2_0,esk3_0,esk7_0)
& complexity(esk1_0,esk5_0,esk7_0)
& complexity(esk2_0,esk6_0,esk7_0)
& greater(esk6_0,esk5_0)
& ~ greater(esk8_0,esk9_0) ),
inference(skolemize,[status(esa)],[9]) ).
cnf(11,negated_conjecture,
~ greater(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(12,negated_conjecture,
greater(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(13,negated_conjecture,
complexity(esk2_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(14,negated_conjecture,
complexity(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(15,negated_conjecture,
reorganization_type(esk2_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(16,negated_conjecture,
reorganization_type(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(17,negated_conjecture,
reorganization(esk2_0,esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(18,negated_conjecture,
reorganization(esk1_0,esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(19,negated_conjecture,
class(esk2_0,esk4_0,esk7_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(20,negated_conjecture,
class(esk1_0,esk4_0,esk7_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(21,negated_conjecture,
~ organization(esk2_0,esk9_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(22,negated_conjecture,
organization(esk2_0,esk7_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(23,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[10]) ).
fof(24,plain,
! [X1,X2,X3,X4,X10,X11,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,X10,X7)
| ~ inertia(X2,X11,X7)
| ~ greater(X11,X10)
| greater(X8,X9) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(25,plain,
! [X12,X13,X14,X15,X16,X17,X18,X19,X20] :
( ~ organization(X12,X18)
| ~ organization(X13,X18)
| organization(X13,X20)
| ~ class(X12,X15,X18)
| ~ class(X13,X15,X18)
| ~ reorganization(X12,X18,X19)
| ~ reorganization(X13,X18,X20)
| ~ reorganization_type(X12,X14,X18)
| ~ reorganization_type(X13,X14,X18)
| ~ inertia(X12,X16,X18)
| ~ inertia(X13,X17,X18)
| ~ greater(X17,X16)
| greater(X19,X20) ),
inference(variable_rename,[status(thm)],[24]) ).
cnf(26,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)],[25]) ).
fof(27,plain,
! [X1,X12] :
( ~ organization(X1,X12)
| ? [X13] : inertia(X1,X13,X12) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(28,plain,
! [X14,X15] :
( ~ organization(X14,X15)
| ? [X16] : inertia(X14,X16,X15) ),
inference(variable_rename,[status(thm)],[27]) ).
fof(29,plain,
! [X14,X15] :
( ~ organization(X14,X15)
| inertia(X14,esk10_2(X14,X15),X15) ),
inference(skolemize,[status(esa)],[28]) ).
cnf(30,plain,
( inertia(X1,esk10_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[29]) ).
fof(31,plain,
! [X1,X2,X4,X5,X6,X10,X11,X14,X15] :
( ~ organization(X1,X14)
| ~ organization(X2,X15)
| ~ class(X1,X4,X14)
| ~ class(X2,X4,X15)
| ~ complexity(X1,X5,X14)
| ~ complexity(X2,X6,X15)
| ~ inertia(X1,X10,X14)
| ~ inertia(X2,X11,X15)
| ~ greater(X6,X5)
| greater(X11,X10) ),
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)
| ~ complexity(X16,X19,X23)
| ~ complexity(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)
| ~ complexity(X5,X3,X6)
| ~ complexity(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,plain,
( greater(X1,esk10_2(X2,X3))
| ~ inertia(X4,X1,X5)
| ~ greater(X6,X7)
| ~ complexity(X2,X7,X3)
| ~ complexity(X4,X6,X5)
| ~ class(X2,X8,X3)
| ~ class(X4,X8,X5)
| ~ organization(X2,X3)
| ~ organization(X4,X5) ),
inference(spm,[status(thm)],[33,30,theory(equality)]) ).
cnf(35,plain,
( greater(X1,X2)
| organization(X3,X2)
| ~ inertia(X3,X6,X5)
| ~ greater(X6,esk10_2(X4,X5))
| ~ reorganization_type(X4,X7,X5)
| ~ reorganization_type(X3,X7,X5)
| ~ reorganization(X4,X5,X1)
| ~ reorganization(X3,X5,X2)
| ~ class(X4,X8,X5)
| ~ class(X3,X8,X5)
| ~ organization(X4,X5)
| ~ organization(X3,X5) ),
inference(spm,[status(thm)],[26,30,theory(equality)]) ).
cnf(36,plain,
( greater(esk10_2(X1,X2),esk10_2(X3,X4))
| ~ greater(X5,X6)
| ~ complexity(X3,X6,X4)
| ~ complexity(X1,X5,X2)
| ~ class(X3,X7,X4)
| ~ class(X1,X7,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2) ),
inference(spm,[status(thm)],[34,30,theory(equality)]) ).
cnf(37,negated_conjecture,
( greater(esk10_2(X1,X2),esk10_2(esk1_0,esk7_0))
| ~ greater(X3,esk5_0)
| ~ complexity(X1,X3,X2)
| ~ class(esk1_0,X4,esk7_0)
| ~ class(X1,X4,X2)
| ~ organization(esk1_0,esk7_0)
| ~ organization(X1,X2) ),
inference(spm,[status(thm)],[36,14,theory(equality)]) ).
cnf(39,negated_conjecture,
( greater(esk10_2(X1,X2),esk10_2(esk1_0,esk7_0))
| ~ greater(X3,esk5_0)
| ~ complexity(X1,X3,X2)
| ~ class(esk1_0,X4,esk7_0)
| ~ class(X1,X4,X2)
| $false
| ~ organization(X1,X2) ),
inference(rw,[status(thm)],[37,23,theory(equality)]) ).
cnf(40,negated_conjecture,
( greater(esk10_2(X1,X2),esk10_2(esk1_0,esk7_0))
| ~ greater(X3,esk5_0)
| ~ complexity(X1,X3,X2)
| ~ class(esk1_0,X4,esk7_0)
| ~ class(X1,X4,X2)
| ~ organization(X1,X2) ),
inference(cn,[status(thm)],[39,theory(equality)]) ).
cnf(43,negated_conjecture,
( greater(esk10_2(X1,X2),esk10_2(esk1_0,esk7_0))
| ~ greater(X3,esk5_0)
| ~ complexity(X1,X3,X2)
| ~ class(X1,esk4_0,X2)
| ~ organization(X1,X2) ),
inference(spm,[status(thm)],[40,20,theory(equality)]) ).
cnf(45,negated_conjecture,
( greater(esk10_2(esk2_0,esk7_0),esk10_2(esk1_0,esk7_0))
| ~ greater(esk6_0,esk5_0)
| ~ class(esk2_0,esk4_0,esk7_0)
| ~ organization(esk2_0,esk7_0) ),
inference(spm,[status(thm)],[43,13,theory(equality)]) ).
cnf(49,negated_conjecture,
( greater(esk10_2(esk2_0,esk7_0),esk10_2(esk1_0,esk7_0))
| $false
| ~ class(esk2_0,esk4_0,esk7_0)
| ~ organization(esk2_0,esk7_0) ),
inference(rw,[status(thm)],[45,12,theory(equality)]) ).
cnf(50,negated_conjecture,
( greater(esk10_2(esk2_0,esk7_0),esk10_2(esk1_0,esk7_0))
| $false
| $false
| ~ organization(esk2_0,esk7_0) ),
inference(rw,[status(thm)],[49,19,theory(equality)]) ).
cnf(51,negated_conjecture,
( greater(esk10_2(esk2_0,esk7_0),esk10_2(esk1_0,esk7_0))
| $false
| $false
| $false ),
inference(rw,[status(thm)],[50,22,theory(equality)]) ).
cnf(52,negated_conjecture,
greater(esk10_2(esk2_0,esk7_0),esk10_2(esk1_0,esk7_0)),
inference(cn,[status(thm)],[51,theory(equality)]) ).
cnf(53,negated_conjecture,
( greater(X1,X2)
| organization(X3,X2)
| ~ inertia(X3,esk10_2(esk2_0,esk7_0),esk7_0)
| ~ reorganization_type(esk1_0,X4,esk7_0)
| ~ reorganization_type(X3,X4,esk7_0)
| ~ reorganization(esk1_0,esk7_0,X1)
| ~ reorganization(X3,esk7_0,X2)
| ~ class(esk1_0,X5,esk7_0)
| ~ class(X3,X5,esk7_0)
| ~ organization(esk1_0,esk7_0)
| ~ organization(X3,esk7_0) ),
inference(spm,[status(thm)],[35,52,theory(equality)]) ).
cnf(54,negated_conjecture,
( greater(X1,X2)
| organization(X3,X2)
| ~ inertia(X3,esk10_2(esk2_0,esk7_0),esk7_0)
| ~ reorganization_type(esk1_0,X4,esk7_0)
| ~ reorganization_type(X3,X4,esk7_0)
| ~ reorganization(esk1_0,esk7_0,X1)
| ~ reorganization(X3,esk7_0,X2)
| ~ class(esk1_0,X5,esk7_0)
| ~ class(X3,X5,esk7_0)
| $false
| ~ organization(X3,esk7_0) ),
inference(rw,[status(thm)],[53,23,theory(equality)]) ).
cnf(55,negated_conjecture,
( greater(X1,X2)
| organization(X3,X2)
| ~ inertia(X3,esk10_2(esk2_0,esk7_0),esk7_0)
| ~ reorganization_type(esk1_0,X4,esk7_0)
| ~ reorganization_type(X3,X4,esk7_0)
| ~ reorganization(esk1_0,esk7_0,X1)
| ~ reorganization(X3,esk7_0,X2)
| ~ class(esk1_0,X5,esk7_0)
| ~ class(X3,X5,esk7_0)
| ~ organization(X3,esk7_0) ),
inference(cn,[status(thm)],[54,theory(equality)]) ).
cnf(71,negated_conjecture,
( greater(X1,X2)
| organization(esk2_0,X2)
| ~ reorganization_type(esk1_0,X3,esk7_0)
| ~ reorganization_type(esk2_0,X3,esk7_0)
| ~ reorganization(esk1_0,esk7_0,X1)
| ~ reorganization(esk2_0,esk7_0,X2)
| ~ class(esk1_0,X4,esk7_0)
| ~ class(esk2_0,X4,esk7_0)
| ~ organization(esk2_0,esk7_0) ),
inference(spm,[status(thm)],[55,30,theory(equality)]) ).
cnf(72,negated_conjecture,
( greater(X1,X2)
| organization(esk2_0,X2)
| ~ reorganization_type(esk1_0,X3,esk7_0)
| ~ reorganization_type(esk2_0,X3,esk7_0)
| ~ reorganization(esk1_0,esk7_0,X1)
| ~ reorganization(esk2_0,esk7_0,X2)
| ~ class(esk1_0,X4,esk7_0)
| ~ class(esk2_0,X4,esk7_0)
| $false ),
inference(rw,[status(thm)],[71,22,theory(equality)]) ).
cnf(73,negated_conjecture,
( greater(X1,X2)
| organization(esk2_0,X2)
| ~ reorganization_type(esk1_0,X3,esk7_0)
| ~ reorganization_type(esk2_0,X3,esk7_0)
| ~ reorganization(esk1_0,esk7_0,X1)
| ~ reorganization(esk2_0,esk7_0,X2)
| ~ class(esk1_0,X4,esk7_0)
| ~ class(esk2_0,X4,esk7_0) ),
inference(cn,[status(thm)],[72,theory(equality)]) ).
cnf(77,negated_conjecture,
( greater(X1,X2)
| organization(esk2_0,X2)
| ~ reorganization_type(esk2_0,esk3_0,esk7_0)
| ~ reorganization(esk1_0,esk7_0,X1)
| ~ reorganization(esk2_0,esk7_0,X2)
| ~ class(esk1_0,X3,esk7_0)
| ~ class(esk2_0,X3,esk7_0) ),
inference(spm,[status(thm)],[73,16,theory(equality)]) ).
cnf(78,negated_conjecture,
( greater(X1,X2)
| organization(esk2_0,X2)
| $false
| ~ reorganization(esk1_0,esk7_0,X1)
| ~ reorganization(esk2_0,esk7_0,X2)
| ~ class(esk1_0,X3,esk7_0)
| ~ class(esk2_0,X3,esk7_0) ),
inference(rw,[status(thm)],[77,15,theory(equality)]) ).
cnf(79,negated_conjecture,
( greater(X1,X2)
| organization(esk2_0,X2)
| ~ reorganization(esk1_0,esk7_0,X1)
| ~ reorganization(esk2_0,esk7_0,X2)
| ~ class(esk1_0,X3,esk7_0)
| ~ class(esk2_0,X3,esk7_0) ),
inference(cn,[status(thm)],[78,theory(equality)]) ).
cnf(80,negated_conjecture,
( greater(esk8_0,X1)
| organization(esk2_0,X1)
| ~ reorganization(esk2_0,esk7_0,X1)
| ~ class(esk1_0,X2,esk7_0)
| ~ class(esk2_0,X2,esk7_0) ),
inference(spm,[status(thm)],[79,18,theory(equality)]) ).
cnf(81,negated_conjecture,
( greater(esk8_0,esk9_0)
| organization(esk2_0,esk9_0)
| ~ class(esk1_0,X1,esk7_0)
| ~ class(esk2_0,X1,esk7_0) ),
inference(spm,[status(thm)],[80,17,theory(equality)]) ).
cnf(82,negated_conjecture,
( organization(esk2_0,esk9_0)
| ~ class(esk1_0,X1,esk7_0)
| ~ class(esk2_0,X1,esk7_0) ),
inference(sr,[status(thm)],[81,11,theory(equality)]) ).
cnf(83,negated_conjecture,
( ~ class(esk1_0,X1,esk7_0)
| ~ class(esk2_0,X1,esk7_0) ),
inference(sr,[status(thm)],[82,21,theory(equality)]) ).
cnf(89,negated_conjecture,
~ class(esk2_0,esk4_0,esk7_0),
inference(spm,[status(thm)],[83,20,theory(equality)]) ).
cnf(90,negated_conjecture,
$false,
inference(rw,[status(thm)],[89,19,theory(equality)]) ).
cnf(91,negated_conjecture,
$false,
inference(cn,[status(thm)],[90,theory(equality)]) ).
cnf(92,negated_conjecture,
$false,
91,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT016+1.p
% --creating new selector for []
% -running prover on /tmp/tmpQse2fX/sel_MGT016+1.p_1 with time limit 29
% -prover status Theorem
% Problem MGT016+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT016+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT016+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
%
%------------------------------------------------------------------------------