TSTP Solution File: MGT009+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT009+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 : art01.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:03:16 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP25828/MGT009+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25828/MGT009+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25828/MGT009+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 25924
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.04 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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/SRASS.s.p', a3_FOL)).
% fof(2, axiom,![X1]:![X2]:![X9]:![X10]:![X11]:![X7]:![X8]:![X3]:![X4]:(((((((((organization(X1,X3)&organization(X2,X4))&class(X1,X9,X3))&class(X2,X9,X4))&size(X1,X10,X3))&size(X2,X11,X4))&inertia(X1,X7,X3))&inertia(X2,X8,X4))&greater(X11,X10))=>greater(X8,X7)),file('/tmp/SRASS.s.p', a5_FOL)).
% fof(3, axiom,![X1]:![X12]:(organization(X1,X12)=>?[X13]:inertia(X1,X13,X12)),file('/tmp/SRASS.s.p', mp5)).
% fof(4, conjecture,![X1]:![X2]:![X9]:![X5]:![X6]:![X10]:![X11]:![X3]:![X4]:(((((((((((organization(X1,X3)&organization(X2,X4))&reorganization_free(X1,X3,X3))&reorganization_free(X2,X4,X4))&class(X1,X9,X3))&class(X2,X9,X4))&reproducibility(X1,X5,X3))&reproducibility(X2,X6,X4))&size(X1,X10,X3))&size(X2,X11,X4))&greater(X11,X10))=>greater(X6,X5)),file('/tmp/SRASS.s.p', t9_FOL)).
% fof(5, negated_conjecture,~(![X1]:![X2]:![X9]:![X5]:![X6]:![X10]:![X11]:![X3]:![X4]:(((((((((((organization(X1,X3)&organization(X2,X4))&reorganization_free(X1,X3,X3))&reorganization_free(X2,X4,X4))&class(X1,X9,X3))&class(X2,X9,X4))&reproducibility(X1,X5,X3))&reproducibility(X2,X6,X4))&size(X1,X10,X3))&size(X2,X11,X4))&greater(X11,X10))=>greater(X6,X5))),inference(assume_negation,[status(cth)],[4])).
% 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]:![X2]:![X9]:![X10]:![X11]:![X7]:![X8]:![X3]:![X4]:(((((((((~(organization(X1,X3))|~(organization(X2,X4)))|~(class(X1,X9,X3)))|~(class(X2,X9,X4)))|~(size(X1,X10,X3)))|~(size(X2,X11,X4)))|~(inertia(X1,X7,X3)))|~(inertia(X2,X8,X4)))|~(greater(X11,X10)))|greater(X8,X7)),inference(fof_nnf,[status(thm)],[2])).
% fof(12, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:![X19]:![X20]:(((((((((~(organization(X12,X19))|~(organization(X13,X20)))|~(class(X12,X14,X19)))|~(class(X13,X14,X20)))|~(size(X12,X15,X19)))|~(size(X13,X16,X20)))|~(inertia(X12,X17,X19)))|~(inertia(X13,X18,X20)))|~(greater(X16,X15)))|greater(X18,X17)),inference(variable_rename,[status(thm)],[11])).
% cnf(13,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)],[12])).
% fof(14, plain,![X1]:![X12]:(~(organization(X1,X12))|?[X13]:inertia(X1,X13,X12)),inference(fof_nnf,[status(thm)],[3])).
% fof(15, plain,![X14]:![X15]:(~(organization(X14,X15))|?[X16]:inertia(X14,X16,X15)),inference(variable_rename,[status(thm)],[14])).
% fof(16, plain,![X14]:![X15]:(~(organization(X14,X15))|inertia(X14,esk1_2(X14,X15),X15)),inference(skolemize,[status(esa)],[15])).
% cnf(17,plain,(inertia(X1,esk1_2(X1,X2),X2)|~organization(X1,X2)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, negated_conjecture,?[X1]:?[X2]:?[X9]:?[X5]:?[X6]:?[X10]:?[X11]:?[X3]:?[X4]:(((((((((((organization(X1,X3)&organization(X2,X4))&reorganization_free(X1,X3,X3))&reorganization_free(X2,X4,X4))&class(X1,X9,X3))&class(X2,X9,X4))&reproducibility(X1,X5,X3))&reproducibility(X2,X6,X4))&size(X1,X10,X3))&size(X2,X11,X4))&greater(X11,X10))&~(greater(X6,X5))),inference(fof_nnf,[status(thm)],[5])).
% fof(19, 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))&reproducibility(X12,X15,X19))&reproducibility(X13,X16,X20))&size(X12,X17,X19))&size(X13,X18,X20))&greater(X18,X17))&~(greater(X16,X15))),inference(variable_rename,[status(thm)],[18])).
% fof(20, 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)],[19])).
% cnf(21,negated_conjecture,(~greater(esk6_0,esk5_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,negated_conjecture,(greater(esk8_0,esk7_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,negated_conjecture,(size(esk3_0,esk8_0,esk10_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(24,negated_conjecture,(size(esk2_0,esk7_0,esk9_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(25,negated_conjecture,(reproducibility(esk3_0,esk6_0,esk10_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(26,negated_conjecture,(reproducibility(esk2_0,esk5_0,esk9_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(27,negated_conjecture,(class(esk3_0,esk4_0,esk10_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(28,negated_conjecture,(class(esk2_0,esk4_0,esk9_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(29,negated_conjecture,(reorganization_free(esk3_0,esk10_0,esk10_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(30,negated_conjecture,(reorganization_free(esk2_0,esk9_0,esk9_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(31,negated_conjecture,(organization(esk3_0,esk10_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(32,negated_conjecture,(organization(esk2_0,esk9_0)),inference(split_conjunct,[status(thm)],[20])).
% 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,17,theory(equality)])).
% cnf(36,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)],[13,24,theory(equality)])).
% cnf(39,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)],[36,32,theory(equality)])).
% cnf(40,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)],[39,theory(equality)])).
% cnf(70,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)],[40,28,theory(equality)])).
% cnf(72,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)],[70,17,theory(equality)])).
% cnf(73,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)],[72,32,theory(equality)])).
% cnf(74,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)],[73,theory(equality)])).
% cnf(75,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)],[74,23,theory(equality)])).
% cnf(77,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)],[75,27,theory(equality)])).
% cnf(78,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)],[77,22,theory(equality)])).
% cnf(79,negated_conjecture,(greater(X1,esk1_2(esk2_0,esk9_0))|$false|$false|~inertia(esk3_0,X1,esk10_0)|$false),inference(rw,[status(thm)],[78,31,theory(equality)])).
% cnf(80,negated_conjecture,(greater(X1,esk1_2(esk2_0,esk9_0))|~inertia(esk3_0,X1,esk10_0)),inference(cn,[status(thm)],[79,theory(equality)])).
% cnf(84,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,80,theory(equality)])).
% cnf(85,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)],[84,30,theory(equality)])).
% cnf(86,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)],[85,32,theory(equality)])).
% cnf(87,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)],[86,theory(equality)])).
% cnf(92,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)],[87,17,theory(equality)])).
% cnf(93,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)],[92,31,theory(equality)])).
% cnf(94,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)],[93,theory(equality)])).
% cnf(95,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)],[94,17,theory(equality)])).
% cnf(96,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)],[95,29,theory(equality)])).
% cnf(97,negated_conjecture,(greater(X1,X2)|~reproducibility(esk2_0,X2,esk9_0)|~reproducibility(esk3_0,X1,esk10_0)|$false|$false),inference(rw,[status(thm)],[96,31,theory(equality)])).
% cnf(98,negated_conjecture,(greater(X1,X2)|~reproducibility(esk2_0,X2,esk9_0)|~reproducibility(esk3_0,X1,esk10_0)),inference(cn,[status(thm)],[97,theory(equality)])).
% cnf(99,negated_conjecture,(greater(X1,esk5_0)|~reproducibility(esk3_0,X1,esk10_0)),inference(spm,[status(thm)],[98,26,theory(equality)])).
% cnf(100,negated_conjecture,(greater(esk6_0,esk5_0)),inference(spm,[status(thm)],[99,25,theory(equality)])).
% cnf(101,negated_conjecture,($false),inference(sr,[status(thm)],[100,21,theory(equality)])).
% cnf(102,negated_conjecture,($false),101,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 53
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 53
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 25
% # ...of the previous two non-trivial : 24
% # Contextual simplify-reflections : 0
% # Paramodulations : 25
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 37
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 25
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 24
% # Clause-clause subsumption calls (NU) : 13
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 52 leaves, 1.96+/-2.278 terms/leaf
% # Paramod-from index: 15 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 38 leaves, 1.16+/-0.431 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.003 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.23 WC
% FINAL PrfWatch: 0.13 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP25828/MGT009+1.tptp
%
%------------------------------------------------------------------------------