%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT003+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:02:55 EST 2010
% Result : Theorem 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 5
% Syntax : Number of formulae : 54 ( 11 unt; 0 def)
% Number of atoms : 266 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 368 ( 156 ~; 161 |; 45 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 163 ( 2 sgn 69 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( reorganization_free(X1,X2,X3)
=> ( reorganization_free(X1,X2,X2)
& reorganization_free(X1,X3,X3) ) ),
file('/tmp/tmpLfOnHb/sel_MGT003+1.p_1',mp4) ).
fof(2,axiom,
! [X1,X4] :
( organization(X1,X4)
=> ? [X5] : inertia(X1,X5,X4) ),
file('/tmp/tmpLfOnHb/sel_MGT003+1.p_1',mp5) ).
fof(3,axiom,
! [X1,X6,X2,X3,X7,X8,X9,X10] :
( ( organization(X1,X2)
& organization(X6,X3)
& reorganization_free(X1,X2,X2)
& reorganization_free(X6,X3,X3)
& inertia(X1,X7,X2)
& inertia(X6,X8,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X6,X10,X3)
& greater(X8,X7) )
=> greater(X10,X9) ),
file('/tmp/tmpLfOnHb/sel_MGT003+1.p_1',t1_FOL) ).
fof(4,axiom,
! [X1,X7,X8,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& inertia(X1,X7,X2)
& inertia(X1,X8,X3)
& greater(X3,X2) )
=> greater(X8,X7) ),
file('/tmp/tmpLfOnHb/sel_MGT003+1.p_1',t2_FOL) ).
fof(5,conjecture,
! [X1,X9,X10,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X1,X10,X3)
& greater(X3,X2) )
=> greater(X10,X9) ),
file('/tmp/tmpLfOnHb/sel_MGT003+1.p_1',t3_FOL) ).
fof(6,negated_conjecture,
~ ! [X1,X9,X10,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X1,X10,X3)
& greater(X3,X2) )
=> greater(X10,X9) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(7,plain,
! [X1,X2,X3] :
( ~ reorganization_free(X1,X2,X3)
| ( reorganization_free(X1,X2,X2)
& reorganization_free(X1,X3,X3) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(8,plain,
! [X4,X5,X6] :
( ~ reorganization_free(X4,X5,X6)
| ( reorganization_free(X4,X5,X5)
& reorganization_free(X4,X6,X6) ) ),
inference(variable_rename,[status(thm)],[7]) ).
fof(9,plain,
! [X4,X5,X6] :
( ( reorganization_free(X4,X5,X5)
| ~ reorganization_free(X4,X5,X6) )
& ( reorganization_free(X4,X6,X6)
| ~ reorganization_free(X4,X5,X6) ) ),
inference(distribute,[status(thm)],[8]) ).
cnf(10,plain,
( reorganization_free(X1,X3,X3)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(11,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(12,plain,
! [X1,X4] :
( ~ organization(X1,X4)
| ? [X5] : inertia(X1,X5,X4) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(13,plain,
! [X6,X7] :
( ~ organization(X6,X7)
| ? [X8] : inertia(X6,X8,X7) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,plain,
! [X6,X7] :
( ~ organization(X6,X7)
| inertia(X6,esk1_2(X6,X7),X7) ),
inference(skolemize,[status(esa)],[13]) ).
cnf(15,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[14]) ).
fof(16,plain,
! [X1,X6,X2,X3,X7,X8,X9,X10] :
( ~ organization(X1,X2)
| ~ organization(X6,X3)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X6,X3,X3)
| ~ inertia(X1,X7,X2)
| ~ inertia(X6,X8,X3)
| ~ survival_chance(X1,X9,X2)
| ~ survival_chance(X6,X10,X3)
| ~ greater(X8,X7)
| greater(X10,X9) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(17,plain,
! [X11,X12,X13,X14,X15,X16,X17,X18] :
( ~ organization(X11,X13)
| ~ organization(X12,X14)
| ~ reorganization_free(X11,X13,X13)
| ~ reorganization_free(X12,X14,X14)
| ~ inertia(X11,X15,X13)
| ~ inertia(X12,X16,X14)
| ~ survival_chance(X11,X17,X13)
| ~ survival_chance(X12,X18,X14)
| ~ greater(X16,X15)
| greater(X18,X17) ),
inference(variable_rename,[status(thm)],[16]) ).
cnf(18,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)],[17]) ).
fof(19,plain,
! [X1,X7,X8,X2,X3] :
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ inertia(X1,X7,X2)
| ~ inertia(X1,X8,X3)
| ~ greater(X3,X2)
| greater(X8,X7) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(20,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)],[19]) ).
cnf(21,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)],[20]) ).
fof(22,negated_conjecture,
? [X1,X9,X10,X2,X3] :
( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X1,X10,X3)
& greater(X3,X2)
& ~ greater(X10,X9) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(23,negated_conjecture,
? [X11,X12,X13,X14,X15] :
( organization(X11,X14)
& organization(X11,X15)
& reorganization_free(X11,X14,X15)
& survival_chance(X11,X12,X14)
& survival_chance(X11,X13,X15)
& greater(X15,X14)
& ~ greater(X13,X12) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,negated_conjecture,
( organization(esk2_0,esk5_0)
& organization(esk2_0,esk6_0)
& reorganization_free(esk2_0,esk5_0,esk6_0)
& survival_chance(esk2_0,esk3_0,esk5_0)
& survival_chance(esk2_0,esk4_0,esk6_0)
& greater(esk6_0,esk5_0)
& ~ greater(esk4_0,esk3_0) ),
inference(skolemize,[status(esa)],[23]) ).
cnf(25,negated_conjecture,
~ greater(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(26,negated_conjecture,
greater(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(27,negated_conjecture,
survival_chance(esk2_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(28,negated_conjecture,
survival_chance(esk2_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(29,negated_conjecture,
reorganization_free(esk2_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(30,negated_conjecture,
organization(esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(31,negated_conjecture,
organization(esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(33,negated_conjecture,
reorganization_free(esk2_0,esk5_0,esk5_0),
inference(spm,[status(thm)],[11,29,theory(equality)]) ).
cnf(34,plain,
( greater(X1,esk1_2(X2,X3))
| ~ greater(X4,X3)
| ~ inertia(X2,X1,X4)
| ~ organization(X2,X3)
| ~ organization(X2,X4)
| ~ reorganization_free(X2,X3,X4) ),
inference(spm,[status(thm)],[21,15,theory(equality)]) ).
cnf(35,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| ~ inertia(esk2_0,X3,esk5_0)
| ~ inertia(X4,X2,X5)
| ~ organization(esk2_0,esk5_0)
| ~ organization(X4,X5)
| ~ reorganization_free(esk2_0,esk5_0,esk5_0)
| ~ reorganization_free(X4,X5,X5) ),
inference(spm,[status(thm)],[18,28,theory(equality)]) ).
cnf(37,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| ~ inertia(esk2_0,X3,esk5_0)
| ~ inertia(X4,X2,X5)
| $false
| ~ organization(X4,X5)
| ~ reorganization_free(esk2_0,esk5_0,esk5_0)
| ~ reorganization_free(X4,X5,X5) ),
inference(rw,[status(thm)],[35,31,theory(equality)]) ).
cnf(38,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| ~ inertia(esk2_0,X3,esk5_0)
| ~ inertia(X4,X2,X5)
| ~ organization(X4,X5)
| ~ reorganization_free(esk2_0,esk5_0,esk5_0)
| ~ reorganization_free(X4,X5,X5) ),
inference(cn,[status(thm)],[37,theory(equality)]) ).
cnf(49,plain,
( greater(esk1_2(X1,X2),esk1_2(X1,X3))
| ~ greater(X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| ~ reorganization_free(X1,X3,X2) ),
inference(spm,[status(thm)],[34,15,theory(equality)]) ).
cnf(50,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| ~ inertia(esk2_0,X3,esk5_0)
| ~ inertia(X4,X2,X5)
| ~ organization(X4,X5)
| $false
| ~ reorganization_free(X4,X5,X5) ),
inference(rw,[status(thm)],[38,33,theory(equality)]) ).
cnf(51,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| ~ inertia(esk2_0,X3,esk5_0)
| ~ inertia(X4,X2,X5)
| ~ organization(X4,X5)
| ~ reorganization_free(X4,X5,X5) ),
inference(cn,[status(thm)],[50,theory(equality)]) ).
cnf(52,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,esk1_2(esk2_0,esk5_0))
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ organization(esk2_0,esk5_0) ),
inference(spm,[status(thm)],[51,15,theory(equality)]) ).
cnf(53,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,esk1_2(esk2_0,esk5_0))
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4)
| ~ reorganization_free(X3,X4,X4)
| $false ),
inference(rw,[status(thm)],[52,31,theory(equality)]) ).
cnf(54,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,esk1_2(esk2_0,esk5_0))
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4)
| ~ reorganization_free(X3,X4,X4) ),
inference(cn,[status(thm)],[53,theory(equality)]) ).
cnf(60,plain,
( greater(X1,esk3_0)
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,esk1_2(esk2_0,X2),X4)
| ~ organization(X3,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ greater(X2,esk5_0)
| ~ organization(esk2_0,esk5_0)
| ~ organization(esk2_0,X2)
| ~ reorganization_free(esk2_0,esk5_0,X2) ),
inference(spm,[status(thm)],[54,49,theory(equality)]) ).
cnf(61,plain,
( greater(X1,esk3_0)
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,esk1_2(esk2_0,X2),X4)
| ~ organization(X3,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ greater(X2,esk5_0)
| $false
| ~ organization(esk2_0,X2)
| ~ reorganization_free(esk2_0,esk5_0,X2) ),
inference(rw,[status(thm)],[60,31,theory(equality)]) ).
cnf(62,plain,
( greater(X1,esk3_0)
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,esk1_2(esk2_0,X2),X4)
| ~ organization(X3,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ greater(X2,esk5_0)
| ~ organization(esk2_0,X2)
| ~ reorganization_free(esk2_0,esk5_0,X2) ),
inference(cn,[status(thm)],[61,theory(equality)]) ).
cnf(66,plain,
( greater(X1,esk3_0)
| ~ greater(X2,esk5_0)
| ~ survival_chance(esk2_0,X1,X2)
| ~ organization(esk2_0,X2)
| ~ reorganization_free(esk2_0,esk5_0,X2)
| ~ reorganization_free(esk2_0,X2,X2) ),
inference(spm,[status(thm)],[62,15,theory(equality)]) ).
cnf(67,plain,
( greater(X1,esk3_0)
| ~ greater(X2,esk5_0)
| ~ survival_chance(esk2_0,X1,X2)
| ~ organization(esk2_0,X2)
| ~ reorganization_free(esk2_0,esk5_0,X2) ),
inference(csr,[status(thm)],[66,10]) ).
cnf(69,negated_conjecture,
( greater(esk4_0,esk3_0)
| ~ greater(esk6_0,esk5_0)
| ~ organization(esk2_0,esk6_0)
| ~ reorganization_free(esk2_0,esk5_0,esk6_0) ),
inference(spm,[status(thm)],[67,27,theory(equality)]) ).
cnf(73,negated_conjecture,
( greater(esk4_0,esk3_0)
| $false
| ~ organization(esk2_0,esk6_0)
| ~ reorganization_free(esk2_0,esk5_0,esk6_0) ),
inference(rw,[status(thm)],[69,26,theory(equality)]) ).
cnf(74,negated_conjecture,
( greater(esk4_0,esk3_0)
| $false
| $false
| ~ reorganization_free(esk2_0,esk5_0,esk6_0) ),
inference(rw,[status(thm)],[73,30,theory(equality)]) ).
cnf(75,negated_conjecture,
( greater(esk4_0,esk3_0)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[74,29,theory(equality)]) ).
cnf(76,negated_conjecture,
greater(esk4_0,esk3_0),
inference(cn,[status(thm)],[75,theory(equality)]) ).
cnf(77,negated_conjecture,
$false,
inference(sr,[status(thm)],[76,25,theory(equality)]) ).
cnf(78,negated_conjecture,
$false,
77,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT003+1.p
% --creating new selector for []
% -running prover on /tmp/tmpLfOnHb/sel_MGT003+1.p_1 with time limit 29
% -prover status Theorem
% Problem MGT003+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT003+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT003+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
%
%------------------------------------------------------------------------------