%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT002+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 21:07:10 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 5
% Syntax : Number of formulae : 55 ( 11 unt; 0 def)
% Number of atoms : 290 ( 0 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 411 ( 176 ~; 181 |; 47 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 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 : 171 ( 2 sgn 77 !; 13 ?)
% 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/tmpgAVf9f/sel_MGT002+1.p_1',a3_FOL) ).
fof(2,axiom,
! [X1,X3,X4] :
( reorganization_free(X1,X3,X4)
=> ( reorganization_free(X1,X3,X3)
& reorganization_free(X1,X4,X4) ) ),
file('/tmp/tmpgAVf9f/sel_MGT002+1.p_1',mp4) ).
fof(3,axiom,
! [X1,X9] :
( organization(X1,X9)
=> ? [X10] : reproducibility(X1,X10,X9) ),
file('/tmp/tmpgAVf9f/sel_MGT002+1.p_1',mp3) ).
fof(4,conjecture,
! [X1,X7,X8,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& inertia(X1,X7,X3)
& inertia(X1,X8,X4)
& greater(X4,X3) )
=> greater(X8,X7) ),
file('/tmp/tmpgAVf9f/sel_MGT002+1.p_1',t2_FOL) ).
fof(5,axiom,
! [X1,X5,X6,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& reproducibility(X1,X5,X3)
& reproducibility(X1,X6,X4)
& greater(X4,X3) )
=> greater(X6,X5) ),
file('/tmp/tmpgAVf9f/sel_MGT002+1.p_1',a4_FOL) ).
fof(6,negated_conjecture,
~ ! [X1,X7,X8,X3,X4] :
( ( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& inertia(X1,X7,X3)
& inertia(X1,X8,X4)
& greater(X4,X3) )
=> greater(X8,X7) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(7,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(8,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)],[7]) ).
fof(9,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)],[8]) ).
cnf(11,plain,
( greater(X2,X5)
| ~ 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(X7,X8) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(12,plain,
! [X1,X3,X4] :
( ~ reorganization_free(X1,X3,X4)
| ( reorganization_free(X1,X3,X3)
& reorganization_free(X1,X4,X4) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(13,plain,
! [X5,X6,X7] :
( ~ reorganization_free(X5,X6,X7)
| ( reorganization_free(X5,X6,X6)
& reorganization_free(X5,X7,X7) ) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,plain,
! [X5,X6,X7] :
( ( reorganization_free(X5,X6,X6)
| ~ reorganization_free(X5,X6,X7) )
& ( reorganization_free(X5,X7,X7)
| ~ reorganization_free(X5,X6,X7) ) ),
inference(distribute,[status(thm)],[13]) ).
cnf(15,plain,
( reorganization_free(X1,X3,X3)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(16,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[14]) ).
fof(17,plain,
! [X1,X9] :
( ~ organization(X1,X9)
| ? [X10] : reproducibility(X1,X10,X9) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(18,plain,
! [X11,X12] :
( ~ organization(X11,X12)
| ? [X13] : reproducibility(X11,X13,X12) ),
inference(variable_rename,[status(thm)],[17]) ).
fof(19,plain,
! [X11,X12] :
( ~ organization(X11,X12)
| reproducibility(X11,esk1_2(X11,X12),X12) ),
inference(skolemize,[status(esa)],[18]) ).
cnf(20,plain,
( reproducibility(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[19]) ).
fof(21,negated_conjecture,
? [X1,X7,X8,X3,X4] :
( organization(X1,X3)
& organization(X1,X4)
& reorganization_free(X1,X3,X4)
& inertia(X1,X7,X3)
& inertia(X1,X8,X4)
& greater(X4,X3)
& ~ greater(X8,X7) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(22,negated_conjecture,
? [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)],[21]) ).
fof(23,negated_conjecture,
( organization(esk2_0,esk5_0)
& organization(esk2_0,esk6_0)
& reorganization_free(esk2_0,esk5_0,esk6_0)
& inertia(esk2_0,esk3_0,esk5_0)
& inertia(esk2_0,esk4_0,esk6_0)
& greater(esk6_0,esk5_0)
& ~ greater(esk4_0,esk3_0) ),
inference(skolemize,[status(esa)],[22]) ).
cnf(24,negated_conjecture,
~ greater(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(25,negated_conjecture,
greater(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(26,negated_conjecture,
inertia(esk2_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(27,negated_conjecture,
inertia(esk2_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(28,negated_conjecture,
reorganization_free(esk2_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(29,negated_conjecture,
organization(esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(30,negated_conjecture,
organization(esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[23]) ).
fof(31,plain,
! [X1,X5,X6,X3,X4] :
( ~ organization(X1,X3)
| ~ organization(X1,X4)
| ~ reorganization_free(X1,X3,X4)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X1,X6,X4)
| ~ greater(X4,X3)
| greater(X6,X5) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(32,plain,
! [X7,X8,X9,X10,X11] :
( ~ organization(X7,X10)
| ~ organization(X7,X11)
| ~ reorganization_free(X7,X10,X11)
| ~ reproducibility(X7,X8,X10)
| ~ reproducibility(X7,X9,X11)
| ~ greater(X11,X10)
| greater(X9,X8) ),
inference(variable_rename,[status(thm)],[31]) ).
cnf(33,plain,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ reproducibility(X5,X1,X3)
| ~ reproducibility(X5,X2,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(35,negated_conjecture,
reorganization_free(esk2_0,esk5_0,esk5_0),
inference(spm,[status(thm)],[16,28,theory(equality)]) ).
cnf(36,plain,
( greater(X1,esk1_2(X2,X3))
| ~ greater(X4,X3)
| ~ reproducibility(X2,X1,X4)
| ~ reorganization_free(X2,X3,X4)
| ~ organization(X2,X3)
| ~ organization(X2,X4) ),
inference(spm,[status(thm)],[33,20,theory(equality)]) ).
cnf(43,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,X3)
| ~ inertia(X4,X1,X5)
| ~ reproducibility(esk2_0,X3,esk5_0)
| ~ reproducibility(X4,X2,X5)
| ~ reorganization_free(esk2_0,esk5_0,esk5_0)
| ~ reorganization_free(X4,X5,X5)
| ~ organization(esk2_0,esk5_0)
| ~ organization(X4,X5) ),
inference(spm,[status(thm)],[11,27,theory(equality)]) ).
cnf(45,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,X3)
| ~ inertia(X4,X1,X5)
| ~ reproducibility(esk2_0,X3,esk5_0)
| ~ reproducibility(X4,X2,X5)
| ~ reorganization_free(esk2_0,esk5_0,esk5_0)
| ~ reorganization_free(X4,X5,X5)
| $false
| ~ organization(X4,X5) ),
inference(rw,[status(thm)],[43,30,theory(equality)]) ).
cnf(46,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,X3)
| ~ inertia(X4,X1,X5)
| ~ reproducibility(esk2_0,X3,esk5_0)
| ~ reproducibility(X4,X2,X5)
| ~ reorganization_free(esk2_0,esk5_0,esk5_0)
| ~ reorganization_free(X4,X5,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[45,theory(equality)]) ).
cnf(57,plain,
( greater(esk1_2(X1,X2),esk1_2(X1,X3))
| ~ greater(X2,X3)
| ~ reorganization_free(X1,X3,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
inference(spm,[status(thm)],[36,20,theory(equality)]) ).
cnf(84,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,X3)
| ~ inertia(X4,X1,X5)
| ~ reproducibility(esk2_0,X3,esk5_0)
| ~ reproducibility(X4,X2,X5)
| $false
| ~ reorganization_free(X4,X5,X5)
| ~ organization(X4,X5) ),
inference(rw,[status(thm)],[46,35,theory(equality)]) ).
cnf(85,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,X3)
| ~ inertia(X4,X1,X5)
| ~ reproducibility(esk2_0,X3,esk5_0)
| ~ reproducibility(X4,X2,X5)
| ~ reorganization_free(X4,X5,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[84,theory(equality)]) ).
cnf(86,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,esk1_2(esk2_0,esk5_0))
| ~ inertia(X3,X1,X4)
| ~ reproducibility(X3,X2,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ organization(X3,X4)
| ~ organization(esk2_0,esk5_0) ),
inference(spm,[status(thm)],[85,20,theory(equality)]) ).
cnf(87,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,esk1_2(esk2_0,esk5_0))
| ~ inertia(X3,X1,X4)
| ~ reproducibility(X3,X2,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ organization(X3,X4)
| $false ),
inference(rw,[status(thm)],[86,30,theory(equality)]) ).
cnf(88,negated_conjecture,
( greater(X1,esk3_0)
| ~ greater(X2,esk1_2(esk2_0,esk5_0))
| ~ inertia(X3,X1,X4)
| ~ reproducibility(X3,X2,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[87,theory(equality)]) ).
cnf(94,plain,
( greater(X1,esk3_0)
| ~ inertia(X3,X1,X4)
| ~ reproducibility(X3,esk1_2(esk2_0,X2),X4)
| ~ reorganization_free(X3,X4,X4)
| ~ organization(X3,X4)
| ~ greater(X2,esk5_0)
| ~ reorganization_free(esk2_0,esk5_0,X2)
| ~ organization(esk2_0,esk5_0)
| ~ organization(esk2_0,X2) ),
inference(spm,[status(thm)],[88,57,theory(equality)]) ).
cnf(96,plain,
( greater(X1,esk3_0)
| ~ inertia(X3,X1,X4)
| ~ reproducibility(X3,esk1_2(esk2_0,X2),X4)
| ~ reorganization_free(X3,X4,X4)
| ~ organization(X3,X4)
| ~ greater(X2,esk5_0)
| ~ reorganization_free(esk2_0,esk5_0,X2)
| $false
| ~ organization(esk2_0,X2) ),
inference(rw,[status(thm)],[94,30,theory(equality)]) ).
cnf(97,plain,
( greater(X1,esk3_0)
| ~ inertia(X3,X1,X4)
| ~ reproducibility(X3,esk1_2(esk2_0,X2),X4)
| ~ reorganization_free(X3,X4,X4)
| ~ organization(X3,X4)
| ~ greater(X2,esk5_0)
| ~ reorganization_free(esk2_0,esk5_0,X2)
| ~ organization(esk2_0,X2) ),
inference(cn,[status(thm)],[96,theory(equality)]) ).
cnf(119,plain,
( greater(X1,esk3_0)
| ~ greater(X2,esk5_0)
| ~ inertia(esk2_0,X1,X2)
| ~ reorganization_free(esk2_0,esk5_0,X2)
| ~ reorganization_free(esk2_0,X2,X2)
| ~ organization(esk2_0,X2) ),
inference(spm,[status(thm)],[97,20,theory(equality)]) ).
cnf(120,plain,
( greater(X1,esk3_0)
| ~ greater(X2,esk5_0)
| ~ inertia(esk2_0,X1,X2)
| ~ reorganization_free(esk2_0,esk5_0,X2)
| ~ organization(esk2_0,X2) ),
inference(csr,[status(thm)],[119,15]) ).
cnf(122,negated_conjecture,
( greater(esk4_0,esk3_0)
| ~ greater(esk6_0,esk5_0)
| ~ reorganization_free(esk2_0,esk5_0,esk6_0)
| ~ organization(esk2_0,esk6_0) ),
inference(spm,[status(thm)],[120,26,theory(equality)]) ).
cnf(126,negated_conjecture,
( greater(esk4_0,esk3_0)
| $false
| ~ reorganization_free(esk2_0,esk5_0,esk6_0)
| ~ organization(esk2_0,esk6_0) ),
inference(rw,[status(thm)],[122,25,theory(equality)]) ).
cnf(127,negated_conjecture,
( greater(esk4_0,esk3_0)
| $false
| $false
| ~ organization(esk2_0,esk6_0) ),
inference(rw,[status(thm)],[126,28,theory(equality)]) ).
cnf(128,negated_conjecture,
( greater(esk4_0,esk3_0)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[127,29,theory(equality)]) ).
cnf(129,negated_conjecture,
greater(esk4_0,esk3_0),
inference(cn,[status(thm)],[128,theory(equality)]) ).
cnf(130,negated_conjecture,
$false,
inference(sr,[status(thm)],[129,24,theory(equality)]) ).
cnf(131,negated_conjecture,
$false,
130,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT002+1.p
% --creating new selector for []
% -running prover on /tmp/tmpgAVf9f/sel_MGT002+1.p_1 with time limit 29
% -prover status Theorem
% Problem MGT002+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT002+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT002+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
%
%------------------------------------------------------------------------------