%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT002+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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 : Wed Dec 29 16:02:03 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP32642/MGT002+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP32642/MGT002+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32642/MGT002+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 32738
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(organization(X1,X2)=>?[X3]:reproducibility(X1,X3,X2)),file('/tmp/SRASS.s.p', mp3)).
% fof(2, axiom,![X1]:![X4]:![X5]:(reorganization_free(X1,X4,X5)=>(reorganization_free(X1,X4,X4)&reorganization_free(X1,X5,X5))),file('/tmp/SRASS.s.p', mp4)).
% fof(3, axiom,![X1]:![X6]:![X4]:![X5]:![X7]:![X8]:![X9]:![X10]:((((((((organization(X1,X4)&organization(X6,X5))&reorganization_free(X1,X4,X4))&reorganization_free(X6,X5,X5))&reproducibility(X1,X7,X4))&reproducibility(X6,X8,X5))&inertia(X1,X9,X4))&inertia(X6,X10,X5))=>(greater(X8,X7)<=>greater(X10,X9))),file('/tmp/SRASS.s.p', a3_FOL)).
% fof(4, axiom,![X1]:![X7]:![X8]:![X4]:![X5]:((((((organization(X1,X4)&organization(X1,X5))&reorganization_free(X1,X4,X5))&reproducibility(X1,X7,X4))&reproducibility(X1,X8,X5))&greater(X5,X4))=>greater(X8,X7)),file('/tmp/SRASS.s.p', a4_FOL)).
% fof(5, conjecture,![X1]:![X9]:![X10]:![X4]:![X5]:((((((organization(X1,X4)&organization(X1,X5))&reorganization_free(X1,X4,X5))&inertia(X1,X9,X4))&inertia(X1,X10,X5))&greater(X5,X4))=>greater(X10,X9)),file('/tmp/SRASS.s.p', t2_FOL)).
% fof(6, negated_conjecture,~(![X1]:![X9]:![X10]:![X4]:![X5]:((((((organization(X1,X4)&organization(X1,X5))&reorganization_free(X1,X4,X5))&inertia(X1,X9,X4))&inertia(X1,X10,X5))&greater(X5,X4))=>greater(X10,X9))),inference(assume_negation,[status(cth)],[5])).
% fof(7, plain,![X1]:![X2]:(~(organization(X1,X2))|?[X3]:reproducibility(X1,X3,X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(8, plain,![X4]:![X5]:(~(organization(X4,X5))|?[X6]:reproducibility(X4,X6,X5)),inference(variable_rename,[status(thm)],[7])).
% fof(9, plain,![X4]:![X5]:(~(organization(X4,X5))|reproducibility(X4,esk1_2(X4,X5),X5)),inference(skolemize,[status(esa)],[8])).
% cnf(10,plain,(reproducibility(X1,esk1_2(X1,X2),X2)|~organization(X1,X2)),inference(split_conjunct,[status(thm)],[9])).
% fof(11, plain,![X1]:![X4]:![X5]:(~(reorganization_free(X1,X4,X5))|(reorganization_free(X1,X4,X4)&reorganization_free(X1,X5,X5))),inference(fof_nnf,[status(thm)],[2])).
% fof(12, plain,![X6]:![X7]:![X8]:(~(reorganization_free(X6,X7,X8))|(reorganization_free(X6,X7,X7)&reorganization_free(X6,X8,X8))),inference(variable_rename,[status(thm)],[11])).
% fof(13, plain,![X6]:![X7]:![X8]:((reorganization_free(X6,X7,X7)|~(reorganization_free(X6,X7,X8)))&(reorganization_free(X6,X8,X8)|~(reorganization_free(X6,X7,X8)))),inference(distribute,[status(thm)],[12])).
% cnf(14,plain,(reorganization_free(X1,X3,X3)|~reorganization_free(X1,X2,X3)),inference(split_conjunct,[status(thm)],[13])).
% cnf(15,plain,(reorganization_free(X1,X2,X2)|~reorganization_free(X1,X2,X3)),inference(split_conjunct,[status(thm)],[13])).
% fof(16, plain,![X1]:![X6]:![X4]:![X5]:![X7]:![X8]:![X9]:![X10]:((((((((~(organization(X1,X4))|~(organization(X6,X5)))|~(reorganization_free(X1,X4,X4)))|~(reorganization_free(X6,X5,X5)))|~(reproducibility(X1,X7,X4)))|~(reproducibility(X6,X8,X5)))|~(inertia(X1,X9,X4)))|~(inertia(X6,X10,X5)))|((~(greater(X8,X7))|greater(X10,X9))&(~(greater(X10,X9))|greater(X8,X7)))),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)))|~(reproducibility(X11,X15,X13)))|~(reproducibility(X12,X16,X14)))|~(inertia(X11,X17,X13)))|~(inertia(X12,X18,X14)))|((~(greater(X16,X15))|greater(X18,X17))&(~(greater(X18,X17))|greater(X16,X15)))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:(((~(greater(X16,X15))|greater(X18,X17))|(((((((~(organization(X11,X13))|~(organization(X12,X14)))|~(reorganization_free(X11,X13,X13)))|~(reorganization_free(X12,X14,X14)))|~(reproducibility(X11,X15,X13)))|~(reproducibility(X12,X16,X14)))|~(inertia(X11,X17,X13)))|~(inertia(X12,X18,X14))))&((~(greater(X18,X17))|greater(X16,X15))|(((((((~(organization(X11,X13))|~(organization(X12,X14)))|~(reorganization_free(X11,X13,X13)))|~(reorganization_free(X12,X14,X14)))|~(reproducibility(X11,X15,X13)))|~(reproducibility(X12,X16,X14)))|~(inertia(X11,X17,X13)))|~(inertia(X12,X18,X14))))),inference(distribute,[status(thm)],[17])).
% cnf(20,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)],[18])).
% fof(21, plain,![X1]:![X7]:![X8]:![X4]:![X5]:((((((~(organization(X1,X4))|~(organization(X1,X5)))|~(reorganization_free(X1,X4,X5)))|~(reproducibility(X1,X7,X4)))|~(reproducibility(X1,X8,X5)))|~(greater(X5,X4)))|greater(X8,X7)),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X9]:![X10]:![X11]:![X12]:![X13]:((((((~(organization(X9,X12))|~(organization(X9,X13)))|~(reorganization_free(X9,X12,X13)))|~(reproducibility(X9,X10,X12)))|~(reproducibility(X9,X11,X13)))|~(greater(X13,X12)))|greater(X11,X10)),inference(variable_rename,[status(thm)],[21])).
% cnf(23,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)],[22])).
% fof(24, negated_conjecture,?[X1]:?[X9]:?[X10]:?[X4]:?[X5]:((((((organization(X1,X4)&organization(X1,X5))&reorganization_free(X1,X4,X5))&inertia(X1,X9,X4))&inertia(X1,X10,X5))&greater(X5,X4))&~(greater(X10,X9))),inference(fof_nnf,[status(thm)],[6])).
% fof(25, negated_conjecture,?[X11]:?[X12]:?[X13]:?[X14]:?[X15]:((((((organization(X11,X14)&organization(X11,X15))&reorganization_free(X11,X14,X15))&inertia(X11,X12,X14))&inertia(X11,X13,X15))&greater(X15,X14))&~(greater(X13,X12))),inference(variable_rename,[status(thm)],[24])).
% fof(26, 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)],[25])).
% cnf(27,negated_conjecture,(~greater(esk4_0,esk3_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,negated_conjecture,(greater(esk6_0,esk5_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,negated_conjecture,(inertia(esk2_0,esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(30,negated_conjecture,(inertia(esk2_0,esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(31,negated_conjecture,(reorganization_free(esk2_0,esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(32,negated_conjecture,(organization(esk2_0,esk6_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(33,negated_conjecture,(organization(esk2_0,esk5_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(34,negated_conjecture,(reorganization_free(esk2_0,esk6_0,esk6_0)),inference(spm,[status(thm)],[14,31,theory(equality)])).
% cnf(35,negated_conjecture,(reorganization_free(esk2_0,esk5_0,esk5_0)),inference(spm,[status(thm)],[15,31,theory(equality)])).
% cnf(36,negated_conjecture,(greater(X1,X2)|~greater(esk6_0,esk5_0)|~reproducibility(esk2_0,X2,esk5_0)|~reproducibility(esk2_0,X1,esk6_0)|~organization(esk2_0,esk5_0)|~organization(esk2_0,esk6_0)),inference(spm,[status(thm)],[23,31,theory(equality)])).
% cnf(37,negated_conjecture,(greater(X1,X2)|$false|~reproducibility(esk2_0,X2,esk5_0)|~reproducibility(esk2_0,X1,esk6_0)|~organization(esk2_0,esk5_0)|~organization(esk2_0,esk6_0)),inference(rw,[status(thm)],[36,28,theory(equality)])).
% cnf(38,negated_conjecture,(greater(X1,X2)|$false|~reproducibility(esk2_0,X2,esk5_0)|~reproducibility(esk2_0,X1,esk6_0)|$false|~organization(esk2_0,esk6_0)),inference(rw,[status(thm)],[37,33,theory(equality)])).
% cnf(39,negated_conjecture,(greater(X1,X2)|$false|~reproducibility(esk2_0,X2,esk5_0)|~reproducibility(esk2_0,X1,esk6_0)|$false|$false),inference(rw,[status(thm)],[38,32,theory(equality)])).
% cnf(40,negated_conjecture,(greater(X1,X2)|~reproducibility(esk2_0,X2,esk5_0)|~reproducibility(esk2_0,X1,esk6_0)),inference(cn,[status(thm)],[39,theory(equality)])).
% cnf(48,negated_conjecture,(greater(X1,esk3_0)|~greater(X2,X3)|~inertia(X4,X1,X5)|~reorganization_free(esk2_0,esk5_0,esk5_0)|~reorganization_free(X4,X5,X5)|~reproducibility(esk2_0,X3,esk5_0)|~reproducibility(X4,X2,X5)|~organization(esk2_0,esk5_0)|~organization(X4,X5)),inference(spm,[status(thm)],[20,30,theory(equality)])).
% cnf(51,negated_conjecture,(greater(X1,esk3_0)|~greater(X2,X3)|~inertia(X4,X1,X5)|~reorganization_free(esk2_0,esk5_0,esk5_0)|~reorganization_free(X4,X5,X5)|~reproducibility(esk2_0,X3,esk5_0)|~reproducibility(X4,X2,X5)|$false|~organization(X4,X5)),inference(rw,[status(thm)],[48,33,theory(equality)])).
% cnf(52,negated_conjecture,(greater(X1,esk3_0)|~greater(X2,X3)|~inertia(X4,X1,X5)|~reorganization_free(esk2_0,esk5_0,esk5_0)|~reorganization_free(X4,X5,X5)|~reproducibility(esk2_0,X3,esk5_0)|~reproducibility(X4,X2,X5)|~organization(X4,X5)),inference(cn,[status(thm)],[51,theory(equality)])).
% cnf(67,negated_conjecture,(greater(X1,esk1_2(esk2_0,esk5_0))|~reproducibility(esk2_0,X1,esk6_0)|~organization(esk2_0,esk5_0)),inference(spm,[status(thm)],[40,10,theory(equality)])).
% cnf(68,negated_conjecture,(greater(X1,esk1_2(esk2_0,esk5_0))|~reproducibility(esk2_0,X1,esk6_0)|$false),inference(rw,[status(thm)],[67,33,theory(equality)])).
% cnf(69,negated_conjecture,(greater(X1,esk1_2(esk2_0,esk5_0))|~reproducibility(esk2_0,X1,esk6_0)),inference(cn,[status(thm)],[68,theory(equality)])).
% cnf(111,negated_conjecture,(greater(X1,esk3_0)|~greater(X2,X3)|~inertia(X4,X1,X5)|$false|~reorganization_free(X4,X5,X5)|~reproducibility(esk2_0,X3,esk5_0)|~reproducibility(X4,X2,X5)|~organization(X4,X5)),inference(rw,[status(thm)],[52,35,theory(equality)])).
% cnf(112,negated_conjecture,(greater(X1,esk3_0)|~greater(X2,X3)|~inertia(X4,X1,X5)|~reorganization_free(X4,X5,X5)|~reproducibility(esk2_0,X3,esk5_0)|~reproducibility(X4,X2,X5)|~organization(X4,X5)),inference(cn,[status(thm)],[111,theory(equality)])).
% cnf(113,negated_conjecture,(greater(X1,esk3_0)|~greater(X2,esk1_2(esk2_0,esk5_0))|~inertia(X3,X1,X4)|~reorganization_free(X3,X4,X4)|~reproducibility(X3,X2,X4)|~organization(X3,X4)|~organization(esk2_0,esk5_0)),inference(spm,[status(thm)],[112,10,theory(equality)])).
% cnf(114,negated_conjecture,(greater(X1,esk3_0)|~greater(X2,esk1_2(esk2_0,esk5_0))|~inertia(X3,X1,X4)|~reorganization_free(X3,X4,X4)|~reproducibility(X3,X2,X4)|~organization(X3,X4)|$false),inference(rw,[status(thm)],[113,33,theory(equality)])).
% cnf(115,negated_conjecture,(greater(X1,esk3_0)|~greater(X2,esk1_2(esk2_0,esk5_0))|~inertia(X3,X1,X4)|~reorganization_free(X3,X4,X4)|~reproducibility(X3,X2,X4)|~organization(X3,X4)),inference(cn,[status(thm)],[114,theory(equality)])).
% cnf(116,negated_conjecture,(greater(X1,esk3_0)|~inertia(X3,X1,X4)|~reorganization_free(X3,X4,X4)|~reproducibility(X3,X2,X4)|~organization(X3,X4)|~reproducibility(esk2_0,X2,esk6_0)),inference(spm,[status(thm)],[115,69,theory(equality)])).
% cnf(119,negated_conjecture,(greater(X1,esk3_0)|~inertia(X2,X1,X3)|~reorganization_free(X2,X3,X3)|~reproducibility(X2,esk1_2(esk2_0,esk6_0),X3)|~organization(X2,X3)|~organization(esk2_0,esk6_0)),inference(spm,[status(thm)],[116,10,theory(equality)])).
% cnf(120,negated_conjecture,(greater(X1,esk3_0)|~inertia(X2,X1,X3)|~reorganization_free(X2,X3,X3)|~reproducibility(X2,esk1_2(esk2_0,esk6_0),X3)|~organization(X2,X3)|$false),inference(rw,[status(thm)],[119,32,theory(equality)])).
% cnf(121,negated_conjecture,(greater(X1,esk3_0)|~inertia(X2,X1,X3)|~reorganization_free(X2,X3,X3)|~reproducibility(X2,esk1_2(esk2_0,esk6_0),X3)|~organization(X2,X3)),inference(cn,[status(thm)],[120,theory(equality)])).
% cnf(122,negated_conjecture,(greater(X1,esk3_0)|~inertia(esk2_0,X1,esk6_0)|~reorganization_free(esk2_0,esk6_0,esk6_0)|~organization(esk2_0,esk6_0)),inference(spm,[status(thm)],[121,10,theory(equality)])).
% cnf(123,negated_conjecture,(greater(X1,esk3_0)|~inertia(esk2_0,X1,esk6_0)|$false|~organization(esk2_0,esk6_0)),inference(rw,[status(thm)],[122,34,theory(equality)])).
% cnf(124,negated_conjecture,(greater(X1,esk3_0)|~inertia(esk2_0,X1,esk6_0)|$false|$false),inference(rw,[status(thm)],[123,32,theory(equality)])).
% cnf(125,negated_conjecture,(greater(X1,esk3_0)|~inertia(esk2_0,X1,esk6_0)),inference(cn,[status(thm)],[124,theory(equality)])).
% cnf(126,negated_conjecture,(greater(esk4_0,esk3_0)),inference(spm,[status(thm)],[125,29,theory(equality)])).
% cnf(127,negated_conjecture,($false),inference(sr,[status(thm)],[126,27,theory(equality)])).
% cnf(128,negated_conjecture,($false),127,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 49
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 48
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 33
% # ...of the previous two non-trivial : 28
% # Contextual simplify-reflections : 1
% # Paramodulations : 33
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 35
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 26
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 35
% # Clause-clause subsumption calls (NU) : 51
% # Rec. Clause-clause subsumption calls : 46
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 35 leaves, 2.37+/-2.737 terms/leaf
% # Paramod-from index: 10 leaves, 1.10+/-0.300 terms/leaf
% # Paramod-into index: 24 leaves, 1.46+/-0.957 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.006 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP32642/MGT002+1.tptp
%
%------------------------------------------------------------------------------