TSTP Solution File: MGT008+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT008+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:35 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 4
% Syntax : Number of formulae : 60 ( 15 unt; 0 def)
% Number of atoms : 331 ( 0 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 457 ( 186 ~; 197 |; 69 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 8 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 : 206 ( 0 sgn 77 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/tmp/tmpW6Fvfn/sel_MGT008+1.p_1',mp5) ).
fof(2,conjecture,
! [X1,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( organization(X1,X10)
& organization(X4,X11)
& reorganization_free(X1,X10,X10)
& reorganization_free(X4,X11,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& survival_chance(X1,X6,X10)
& survival_chance(X4,X7,X11)
& size(X1,X8,X10)
& size(X4,X9,X11)
& greater(X9,X8) )
=> greater(X7,X6) ),
file('/tmp/tmpW6Fvfn/sel_MGT008+1.p_1',t8_FOL) ).
fof(3,axiom,
! [X1,X4,X10,X11,X12,X13,X6,X7] :
( ( organization(X1,X10)
& organization(X4,X11)
& reorganization_free(X1,X10,X10)
& reorganization_free(X4,X11,X11)
& inertia(X1,X12,X10)
& inertia(X4,X13,X11)
& survival_chance(X1,X6,X10)
& survival_chance(X4,X7,X11)
& greater(X13,X12) )
=> greater(X7,X6) ),
file('/tmp/tmpW6Fvfn/sel_MGT008+1.p_1',t1_FOL) ).
fof(4,axiom,
! [X1,X4,X5,X8,X9,X12,X13,X10,X11] :
( ( organization(X1,X10)
& organization(X4,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& size(X1,X8,X10)
& size(X4,X9,X11)
& inertia(X1,X12,X10)
& inertia(X4,X13,X11)
& greater(X9,X8) )
=> greater(X13,X12) ),
file('/tmp/tmpW6Fvfn/sel_MGT008+1.p_1',a5_FOL) ).
fof(5,negated_conjecture,
~ ! [X1,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( organization(X1,X10)
& organization(X4,X11)
& reorganization_free(X1,X10,X10)
& reorganization_free(X4,X11,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& survival_chance(X1,X6,X10)
& survival_chance(X4,X7,X11)
& size(X1,X8,X10)
& size(X4,X9,X11)
& greater(X9,X8) )
=> greater(X7,X6) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(6,plain,
! [X1,X2] :
( ~ organization(X1,X2)
| ? [X3] : inertia(X1,X3,X2) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(7,plain,
! [X4,X5] :
( ~ organization(X4,X5)
| ? [X6] : inertia(X4,X6,X5) ),
inference(variable_rename,[status(thm)],[6]) ).
fof(8,plain,
! [X4,X5] :
( ~ organization(X4,X5)
| inertia(X4,esk1_2(X4,X5),X5) ),
inference(skolemize,[status(esa)],[7]) ).
cnf(9,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[8]) ).
fof(10,negated_conjecture,
? [X1,X4,X5,X6,X7,X8,X9,X10,X11] :
( organization(X1,X10)
& organization(X4,X11)
& reorganization_free(X1,X10,X10)
& reorganization_free(X4,X11,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& survival_chance(X1,X6,X10)
& survival_chance(X4,X7,X11)
& size(X1,X8,X10)
& size(X4,X9,X11)
& greater(X9,X8)
& ~ greater(X7,X6) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(11,negated_conjecture,
? [X12,X13,X14,X15,X16,X17,X18,X19,X20] :
( organization(X12,X19)
& organization(X13,X20)
& reorganization_free(X12,X19,X19)
& reorganization_free(X13,X20,X20)
& class(X12,X14,X19)
& class(X13,X14,X20)
& survival_chance(X12,X15,X19)
& survival_chance(X13,X16,X20)
& size(X12,X17,X19)
& size(X13,X18,X20)
& greater(X18,X17)
& ~ greater(X16,X15) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(12,negated_conjecture,
( organization(esk2_0,esk9_0)
& organization(esk3_0,esk10_0)
& reorganization_free(esk2_0,esk9_0,esk9_0)
& reorganization_free(esk3_0,esk10_0,esk10_0)
& class(esk2_0,esk4_0,esk9_0)
& class(esk3_0,esk4_0,esk10_0)
& survival_chance(esk2_0,esk5_0,esk9_0)
& survival_chance(esk3_0,esk6_0,esk10_0)
& size(esk2_0,esk7_0,esk9_0)
& size(esk3_0,esk8_0,esk10_0)
& greater(esk8_0,esk7_0)
& ~ greater(esk6_0,esk5_0) ),
inference(skolemize,[status(esa)],[11]) ).
cnf(13,negated_conjecture,
~ greater(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(14,negated_conjecture,
greater(esk8_0,esk7_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(15,negated_conjecture,
size(esk3_0,esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(16,negated_conjecture,
size(esk2_0,esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(17,negated_conjecture,
survival_chance(esk3_0,esk6_0,esk10_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(18,negated_conjecture,
survival_chance(esk2_0,esk5_0,esk9_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(19,negated_conjecture,
class(esk3_0,esk4_0,esk10_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(20,negated_conjecture,
class(esk2_0,esk4_0,esk9_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(21,negated_conjecture,
reorganization_free(esk3_0,esk10_0,esk10_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(22,negated_conjecture,
reorganization_free(esk2_0,esk9_0,esk9_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(23,negated_conjecture,
organization(esk3_0,esk10_0),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(24,negated_conjecture,
organization(esk2_0,esk9_0),
inference(split_conjunct,[status(thm)],[12]) ).
fof(25,plain,
! [X1,X4,X10,X11,X12,X13,X6,X7] :
( ~ organization(X1,X10)
| ~ organization(X4,X11)
| ~ reorganization_free(X1,X10,X10)
| ~ reorganization_free(X4,X11,X11)
| ~ inertia(X1,X12,X10)
| ~ inertia(X4,X13,X11)
| ~ survival_chance(X1,X6,X10)
| ~ survival_chance(X4,X7,X11)
| ~ greater(X13,X12)
| greater(X7,X6) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(26,plain,
! [X14,X15,X16,X17,X18,X19,X20,X21] :
( ~ organization(X14,X16)
| ~ organization(X15,X17)
| ~ reorganization_free(X14,X16,X16)
| ~ reorganization_free(X15,X17,X17)
| ~ inertia(X14,X18,X16)
| ~ inertia(X15,X19,X17)
| ~ survival_chance(X14,X20,X16)
| ~ survival_chance(X15,X21,X17)
| ~ greater(X19,X18)
| greater(X21,X20) ),
inference(variable_rename,[status(thm)],[25]) ).
cnf(27,plain,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ survival_chance(X5,X1,X6)
| ~ survival_chance(X7,X2,X8)
| ~ inertia(X5,X3,X6)
| ~ inertia(X7,X4,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ organization(X5,X6)
| ~ organization(X7,X8) ),
inference(split_conjunct,[status(thm)],[26]) ).
fof(28,plain,
! [X1,X4,X5,X8,X9,X12,X13,X10,X11] :
( ~ organization(X1,X10)
| ~ organization(X4,X11)
| ~ class(X1,X5,X10)
| ~ class(X4,X5,X11)
| ~ size(X1,X8,X10)
| ~ size(X4,X9,X11)
| ~ inertia(X1,X12,X10)
| ~ inertia(X4,X13,X11)
| ~ greater(X9,X8)
| greater(X13,X12) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(29,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)],[28]) ).
cnf(30,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)],[29]) ).
cnf(31,negated_conjecture,
( greater(X1,esk5_0)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| ~ reorganization_free(esk2_0,esk9_0,esk9_0)
| ~ reorganization_free(X4,X5,X5)
| ~ inertia(esk2_0,X3,esk9_0)
| ~ inertia(X4,X2,X5)
| ~ organization(esk2_0,esk9_0)
| ~ organization(X4,X5) ),
inference(spm,[status(thm)],[27,18,theory(equality)]) ).
cnf(33,negated_conjecture,
( greater(X1,esk5_0)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| $false
| ~ reorganization_free(X4,X5,X5)
| ~ inertia(esk2_0,X3,esk9_0)
| ~ inertia(X4,X2,X5)
| ~ organization(esk2_0,esk9_0)
| ~ organization(X4,X5) ),
inference(rw,[status(thm)],[31,22,theory(equality)]) ).
cnf(34,negated_conjecture,
( greater(X1,esk5_0)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| $false
| ~ reorganization_free(X4,X5,X5)
| ~ inertia(esk2_0,X3,esk9_0)
| ~ inertia(X4,X2,X5)
| $false
| ~ organization(X4,X5) ),
inference(rw,[status(thm)],[33,24,theory(equality)]) ).
cnf(35,negated_conjecture,
( greater(X1,esk5_0)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| ~ reorganization_free(X4,X5,X5)
| ~ inertia(esk2_0,X3,esk9_0)
| ~ inertia(X4,X2,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[34,theory(equality)]) ).
cnf(39,negated_conjecture,
( greater(X1,X2)
| ~ greater(X3,esk7_0)
| ~ size(X4,X3,X5)
| ~ class(esk2_0,X6,esk9_0)
| ~ class(X4,X6,X5)
| ~ inertia(esk2_0,X2,esk9_0)
| ~ inertia(X4,X1,X5)
| ~ organization(esk2_0,esk9_0)
| ~ organization(X4,X5) ),
inference(spm,[status(thm)],[30,16,theory(equality)]) ).
cnf(41,negated_conjecture,
( greater(X1,X2)
| ~ greater(X3,esk7_0)
| ~ size(X4,X3,X5)
| ~ class(esk2_0,X6,esk9_0)
| ~ class(X4,X6,X5)
| ~ inertia(esk2_0,X2,esk9_0)
| ~ inertia(X4,X1,X5)
| $false
| ~ organization(X4,X5) ),
inference(rw,[status(thm)],[39,24,theory(equality)]) ).
cnf(42,negated_conjecture,
( greater(X1,X2)
| ~ greater(X3,esk7_0)
| ~ size(X4,X3,X5)
| ~ class(esk2_0,X6,esk9_0)
| ~ class(X4,X6,X5)
| ~ inertia(esk2_0,X2,esk9_0)
| ~ inertia(X4,X1,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[41,theory(equality)]) ).
cnf(45,negated_conjecture,
( greater(X1,esk5_0)
| ~ greater(X2,esk1_2(esk2_0,esk9_0))
| ~ survival_chance(X3,X1,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4)
| ~ organization(esk2_0,esk9_0) ),
inference(spm,[status(thm)],[35,9,theory(equality)]) ).
cnf(46,negated_conjecture,
( greater(X1,esk5_0)
| ~ greater(X2,esk1_2(esk2_0,esk9_0))
| ~ survival_chance(X3,X1,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4)
| $false ),
inference(rw,[status(thm)],[45,24,theory(equality)]) ).
cnf(47,negated_conjecture,
( greater(X1,esk5_0)
| ~ greater(X2,esk1_2(esk2_0,esk9_0))
| ~ survival_chance(X3,X1,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[46,theory(equality)]) ).
cnf(51,negated_conjecture,
( greater(X1,X2)
| ~ greater(X3,esk7_0)
| ~ size(X4,X3,X5)
| ~ class(X4,esk4_0,X5)
| ~ inertia(esk2_0,X2,esk9_0)
| ~ inertia(X4,X1,X5)
| ~ organization(X4,X5) ),
inference(spm,[status(thm)],[42,20,theory(equality)]) ).
cnf(52,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk9_0))
| ~ greater(X2,esk7_0)
| ~ size(X3,X2,X4)
| ~ class(X3,esk4_0,X4)
| ~ inertia(X3,X1,X4)
| ~ organization(X3,X4)
| ~ organization(esk2_0,esk9_0) ),
inference(spm,[status(thm)],[51,9,theory(equality)]) ).
cnf(53,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk9_0))
| ~ greater(X2,esk7_0)
| ~ size(X3,X2,X4)
| ~ class(X3,esk4_0,X4)
| ~ inertia(X3,X1,X4)
| ~ organization(X3,X4)
| $false ),
inference(rw,[status(thm)],[52,24,theory(equality)]) ).
cnf(54,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk9_0))
| ~ greater(X2,esk7_0)
| ~ size(X3,X2,X4)
| ~ class(X3,esk4_0,X4)
| ~ inertia(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[53,theory(equality)]) ).
cnf(56,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk9_0))
| ~ greater(esk8_0,esk7_0)
| ~ class(esk3_0,esk4_0,esk10_0)
| ~ inertia(esk3_0,X1,esk10_0)
| ~ organization(esk3_0,esk10_0) ),
inference(spm,[status(thm)],[54,15,theory(equality)]) ).
cnf(60,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk9_0))
| $false
| ~ class(esk3_0,esk4_0,esk10_0)
| ~ inertia(esk3_0,X1,esk10_0)
| ~ organization(esk3_0,esk10_0) ),
inference(rw,[status(thm)],[56,14,theory(equality)]) ).
cnf(61,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk9_0))
| $false
| $false
| ~ inertia(esk3_0,X1,esk10_0)
| ~ organization(esk3_0,esk10_0) ),
inference(rw,[status(thm)],[60,19,theory(equality)]) ).
cnf(62,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk9_0))
| $false
| $false
| ~ inertia(esk3_0,X1,esk10_0)
| $false ),
inference(rw,[status(thm)],[61,23,theory(equality)]) ).
cnf(63,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk9_0))
| ~ inertia(esk3_0,X1,esk10_0) ),
inference(cn,[status(thm)],[62,theory(equality)]) ).
cnf(64,negated_conjecture,
( greater(X1,esk5_0)
| ~ survival_chance(X3,X1,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4)
| ~ inertia(esk3_0,X2,esk10_0) ),
inference(spm,[status(thm)],[47,63,theory(equality)]) ).
cnf(66,negated_conjecture,
( greater(X1,esk5_0)
| ~ survival_chance(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,esk1_2(esk3_0,esk10_0),X3)
| ~ organization(X2,X3)
| ~ organization(esk3_0,esk10_0) ),
inference(spm,[status(thm)],[64,9,theory(equality)]) ).
cnf(67,negated_conjecture,
( greater(X1,esk5_0)
| ~ survival_chance(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,esk1_2(esk3_0,esk10_0),X3)
| ~ organization(X2,X3)
| $false ),
inference(rw,[status(thm)],[66,23,theory(equality)]) ).
cnf(68,negated_conjecture,
( greater(X1,esk5_0)
| ~ survival_chance(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,esk1_2(esk3_0,esk10_0),X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[67,theory(equality)]) ).
cnf(69,negated_conjecture,
( greater(X1,esk5_0)
| ~ survival_chance(esk3_0,X1,esk10_0)
| ~ reorganization_free(esk3_0,esk10_0,esk10_0)
| ~ organization(esk3_0,esk10_0) ),
inference(spm,[status(thm)],[68,9,theory(equality)]) ).
cnf(70,negated_conjecture,
( greater(X1,esk5_0)
| ~ survival_chance(esk3_0,X1,esk10_0)
| $false
| ~ organization(esk3_0,esk10_0) ),
inference(rw,[status(thm)],[69,21,theory(equality)]) ).
cnf(71,negated_conjecture,
( greater(X1,esk5_0)
| ~ survival_chance(esk3_0,X1,esk10_0)
| $false
| $false ),
inference(rw,[status(thm)],[70,23,theory(equality)]) ).
cnf(72,negated_conjecture,
( greater(X1,esk5_0)
| ~ survival_chance(esk3_0,X1,esk10_0) ),
inference(cn,[status(thm)],[71,theory(equality)]) ).
cnf(74,negated_conjecture,
greater(esk6_0,esk5_0),
inference(spm,[status(thm)],[72,17,theory(equality)]) ).
cnf(75,negated_conjecture,
$false,
inference(sr,[status(thm)],[74,13,theory(equality)]) ).
cnf(76,negated_conjecture,
$false,
75,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT008+1.p
% --creating new selector for []
% -running prover on /tmp/tmpW6Fvfn/sel_MGT008+1.p_1 with time limit 29
% -prover status Theorem
% Problem MGT008+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT008+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT008+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
%
%------------------------------------------------------------------------------