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