TSTP Solution File: MGT014+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT014+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:58 EST 2010
% Result : Theorem 1.07s
% Output : Solution 1.07s
% 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/SystemOnTPTP26864/MGT014+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26864/MGT014+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26864/MGT014+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 26960
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X3]:![X4]:(reorganization_free(X1,X3,X4)=>reorganization_free(X1,X4,X3)),file('/tmp/SRASS.s.p', mp17)).
% fof(3, axiom,![X1]:![X5]:![X6]:![X3]:![X4]:((((((organization(X1,X3)&organization(X1,X4))&reorganization_free(X1,X3,X4))&size(X1,X5,X3))&size(X1,X6,X4))&greater(X4,X3))=>~(greater(X5,X6))),file('/tmp/SRASS.s.p', t11_FOL)).
% fof(4, axiom,![X1]:![X7]:![X8]:![X3]:![X4]:((((((organization(X1,X3)&organization(X1,X4))&reorganization_free(X1,X3,X4))&complexity(X1,X7,X3))&complexity(X1,X8,X4))&greater(X4,X3))=>~(greater(X7,X8))),file('/tmp/SRASS.s.p', t12_FOL)).
% fof(5, axiom,![X1]:![X5]:![X6]:![X3]:![X4]:(((((organization(X1,X3)&organization(X1,X4))&size(X1,X5,X3))&size(X1,X6,X4))&X3=X4)=>X5=X6),file('/tmp/SRASS.s.p', mp19)).
% fof(6, axiom,![X1]:![X2]:~((greater(X1,X2)&X1=X2)),file('/tmp/SRASS.s.p', mp6_1)).
% fof(7, axiom,![X1]:![X9]:(organization(X1,X9)=>time(X9)),file('/tmp/SRASS.s.p', mp15)).
% fof(8, axiom,![X3]:![X4]:((time(X3)&time(X4))=>((greater(X3,X4)|X3=X4)|greater(X4,X3))),file('/tmp/SRASS.s.p', mp16)).
% fof(9, conjecture,![X1]:![X7]:![X8]:![X5]:![X6]:![X3]:![X4]:((((((((organization(X1,X3)&organization(X1,X4))&reorganization_free(X1,X3,X4))&complexity(X1,X7,X3))&complexity(X1,X8,X4))&size(X1,X5,X3))&size(X1,X6,X4))&greater(X6,X5))=>~(greater(X7,X8))),file('/tmp/SRASS.s.p', t14_FOL)).
% fof(10, negated_conjecture,~(![X1]:![X7]:![X8]:![X5]:![X6]:![X3]:![X4]:((((((((organization(X1,X3)&organization(X1,X4))&reorganization_free(X1,X3,X4))&complexity(X1,X7,X3))&complexity(X1,X8,X4))&size(X1,X5,X3))&size(X1,X6,X4))&greater(X6,X5))=>~(greater(X7,X8)))),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:![X5]:![X6]:![X3]:![X4]:((((((organization(X1,X3)&organization(X1,X4))&reorganization_free(X1,X3,X4))&size(X1,X5,X3))&size(X1,X6,X4))&greater(X4,X3))=>~(greater(X5,X6))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(12, plain,![X1]:![X7]:![X8]:![X3]:![X4]:((((((organization(X1,X3)&organization(X1,X4))&reorganization_free(X1,X3,X4))&complexity(X1,X7,X3))&complexity(X1,X8,X4))&greater(X4,X3))=>~(greater(X7,X8))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(13, negated_conjecture,~(![X1]:![X7]:![X8]:![X5]:![X6]:![X3]:![X4]:((((((((organization(X1,X3)&organization(X1,X4))&reorganization_free(X1,X3,X4))&complexity(X1,X7,X3))&complexity(X1,X8,X4))&size(X1,X5,X3))&size(X1,X6,X4))&greater(X6,X5))=>~(greater(X7,X8)))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(17, plain,![X1]:![X3]:![X4]:(~(reorganization_free(X1,X3,X4))|reorganization_free(X1,X4,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(18, plain,![X5]:![X6]:![X7]:(~(reorganization_free(X5,X6,X7))|reorganization_free(X5,X7,X6)),inference(variable_rename,[status(thm)],[17])).
% cnf(19,plain,(reorganization_free(X1,X2,X3)|~reorganization_free(X1,X3,X2)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X1]:![X5]:![X6]:![X3]:![X4]:((((((~(organization(X1,X3))|~(organization(X1,X4)))|~(reorganization_free(X1,X3,X4)))|~(size(X1,X5,X3)))|~(size(X1,X6,X4)))|~(greater(X4,X3)))|~(greater(X5,X6))),inference(fof_nnf,[status(thm)],[11])).
% fof(21, plain,![X7]:![X8]:![X9]:![X10]:![X11]:((((((~(organization(X7,X10))|~(organization(X7,X11)))|~(reorganization_free(X7,X10,X11)))|~(size(X7,X8,X10)))|~(size(X7,X9,X11)))|~(greater(X11,X10)))|~(greater(X8,X9))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(~greater(X1,X2)|~greater(X3,X4)|~size(X5,X2,X3)|~size(X5,X1,X4)|~reorganization_free(X5,X4,X3)|~organization(X5,X3)|~organization(X5,X4)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X1]:![X7]:![X8]:![X3]:![X4]:((((((~(organization(X1,X3))|~(organization(X1,X4)))|~(reorganization_free(X1,X3,X4)))|~(complexity(X1,X7,X3)))|~(complexity(X1,X8,X4)))|~(greater(X4,X3)))|~(greater(X7,X8))),inference(fof_nnf,[status(thm)],[12])).
% fof(24, plain,![X9]:![X10]:![X11]:![X12]:![X13]:((((((~(organization(X9,X12))|~(organization(X9,X13)))|~(reorganization_free(X9,X12,X13)))|~(complexity(X9,X10,X12)))|~(complexity(X9,X11,X13)))|~(greater(X13,X12)))|~(greater(X10,X11))),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(~greater(X1,X2)|~greater(X3,X4)|~complexity(X5,X2,X3)|~complexity(X5,X1,X4)|~reorganization_free(X5,X4,X3)|~organization(X5,X3)|~organization(X5,X4)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X1]:![X5]:![X6]:![X3]:![X4]:(((((~(organization(X1,X3))|~(organization(X1,X4)))|~(size(X1,X5,X3)))|~(size(X1,X6,X4)))|~(X3=X4))|X5=X6),inference(fof_nnf,[status(thm)],[5])).
% fof(27, plain,![X7]:![X8]:![X9]:![X10]:![X11]:(((((~(organization(X7,X10))|~(organization(X7,X11)))|~(size(X7,X8,X10)))|~(size(X7,X9,X11)))|~(X10=X11))|X8=X9),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(X1=X2|X3!=X4|~size(X5,X2,X4)|~size(X5,X1,X3)|~organization(X5,X4)|~organization(X5,X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X1]:![X2]:(~(greater(X1,X2))|~(X1=X2)),inference(fof_nnf,[status(thm)],[6])).
% fof(30, plain,![X3]:![X4]:(~(greater(X3,X4))|~(X3=X4)),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(X1!=X2|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X1]:![X9]:(~(organization(X1,X9))|time(X9)),inference(fof_nnf,[status(thm)],[7])).
% fof(33, plain,![X10]:![X11]:(~(organization(X10,X11))|time(X11)),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(time(X1)|~organization(X2,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:((~(time(X3))|~(time(X4)))|((greater(X3,X4)|X3=X4)|greater(X4,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(36, plain,![X5]:![X6]:((~(time(X5))|~(time(X6)))|((greater(X5,X6)|X5=X6)|greater(X6,X5))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(greater(X1,X2)|X2=X1|greater(X2,X1)|~time(X1)|~time(X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, negated_conjecture,?[X1]:?[X7]:?[X8]:?[X5]:?[X6]:?[X3]:?[X4]:((((((((organization(X1,X3)&organization(X1,X4))&reorganization_free(X1,X3,X4))&complexity(X1,X7,X3))&complexity(X1,X8,X4))&size(X1,X5,X3))&size(X1,X6,X4))&greater(X6,X5))&greater(X7,X8)),inference(fof_nnf,[status(thm)],[13])).
% fof(39, negated_conjecture,?[X9]:?[X10]:?[X11]:?[X12]:?[X13]:?[X14]:?[X15]:((((((((organization(X9,X14)&organization(X9,X15))&reorganization_free(X9,X14,X15))&complexity(X9,X10,X14))&complexity(X9,X11,X15))&size(X9,X12,X14))&size(X9,X13,X15))&greater(X13,X12))&greater(X10,X11)),inference(variable_rename,[status(thm)],[38])).
% fof(40, negated_conjecture,((((((((organization(esk1_0,esk6_0)&organization(esk1_0,esk7_0))&reorganization_free(esk1_0,esk6_0,esk7_0))&complexity(esk1_0,esk2_0,esk6_0))&complexity(esk1_0,esk3_0,esk7_0))&size(esk1_0,esk4_0,esk6_0))&size(esk1_0,esk5_0,esk7_0))&greater(esk5_0,esk4_0))&greater(esk2_0,esk3_0)),inference(skolemize,[status(esa)],[39])).
% cnf(41,negated_conjecture,(greater(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,negated_conjecture,(greater(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,negated_conjecture,(size(esk1_0,esk5_0,esk7_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(44,negated_conjecture,(size(esk1_0,esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(45,negated_conjecture,(complexity(esk1_0,esk3_0,esk7_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(46,negated_conjecture,(complexity(esk1_0,esk2_0,esk6_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(47,negated_conjecture,(reorganization_free(esk1_0,esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(48,negated_conjecture,(organization(esk1_0,esk7_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(49,negated_conjecture,(organization(esk1_0,esk6_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(50,plain,(~greater(X1,X1)),inference(er,[status(thm)],[31,theory(equality)])).
% cnf(51,plain,(X1=X2|~size(X3,X2,X4)|~size(X3,X1,X4)|~organization(X3,X4)),inference(er,[status(thm)],[28,theory(equality)])).
% cnf(54,negated_conjecture,(time(esk7_0)),inference(spm,[status(thm)],[34,48,theory(equality)])).
% cnf(55,negated_conjecture,(time(esk6_0)),inference(spm,[status(thm)],[34,49,theory(equality)])).
% cnf(56,negated_conjecture,(reorganization_free(esk1_0,esk7_0,esk6_0)),inference(spm,[status(thm)],[19,47,theory(equality)])).
% cnf(58,negated_conjecture,(X1=esk4_0|~size(esk1_0,X1,esk6_0)|~organization(esk1_0,esk6_0)),inference(spm,[status(thm)],[51,44,theory(equality)])).
% cnf(61,negated_conjecture,(X1=esk4_0|~size(esk1_0,X1,esk6_0)|$false),inference(rw,[status(thm)],[58,49,theory(equality)])).
% cnf(62,negated_conjecture,(X1=esk4_0|~size(esk1_0,X1,esk6_0)),inference(cn,[status(thm)],[61,theory(equality)])).
% cnf(64,negated_conjecture,(~size(esk1_0,X1,X2)|~organization(esk1_0,X2)|~organization(esk1_0,esk6_0)|~reorganization_free(esk1_0,X2,esk6_0)|~greater(esk6_0,X2)|~greater(X1,esk4_0)),inference(spm,[status(thm)],[22,44,theory(equality)])).
% cnf(67,negated_conjecture,(~size(esk1_0,X1,X2)|~organization(esk1_0,X2)|$false|~reorganization_free(esk1_0,X2,esk6_0)|~greater(esk6_0,X2)|~greater(X1,esk4_0)),inference(rw,[status(thm)],[64,49,theory(equality)])).
% cnf(68,negated_conjecture,(~size(esk1_0,X1,X2)|~organization(esk1_0,X2)|~reorganization_free(esk1_0,X2,esk6_0)|~greater(esk6_0,X2)|~greater(X1,esk4_0)),inference(cn,[status(thm)],[67,theory(equality)])).
% cnf(69,negated_conjecture,(~complexity(esk1_0,X1,X2)|~organization(esk1_0,X2)|~organization(esk1_0,esk7_0)|~reorganization_free(esk1_0,X2,esk7_0)|~greater(esk7_0,X2)|~greater(X1,esk3_0)),inference(spm,[status(thm)],[25,45,theory(equality)])).
% cnf(71,negated_conjecture,(~complexity(esk1_0,X1,X2)|~organization(esk1_0,X2)|$false|~reorganization_free(esk1_0,X2,esk7_0)|~greater(esk7_0,X2)|~greater(X1,esk3_0)),inference(rw,[status(thm)],[69,48,theory(equality)])).
% cnf(72,negated_conjecture,(~complexity(esk1_0,X1,X2)|~organization(esk1_0,X2)|~reorganization_free(esk1_0,X2,esk7_0)|~greater(esk7_0,X2)|~greater(X1,esk3_0)),inference(cn,[status(thm)],[71,theory(equality)])).
% cnf(76,negated_conjecture,(~organization(esk1_0,esk6_0)|~reorganization_free(esk1_0,esk6_0,esk7_0)|~greater(esk7_0,esk6_0)|~greater(esk2_0,esk3_0)),inference(spm,[status(thm)],[72,46,theory(equality)])).
% cnf(79,negated_conjecture,($false|~reorganization_free(esk1_0,esk6_0,esk7_0)|~greater(esk7_0,esk6_0)|~greater(esk2_0,esk3_0)),inference(rw,[status(thm)],[76,49,theory(equality)])).
% cnf(80,negated_conjecture,($false|$false|~greater(esk7_0,esk6_0)|~greater(esk2_0,esk3_0)),inference(rw,[status(thm)],[79,47,theory(equality)])).
% cnf(81,negated_conjecture,($false|$false|~greater(esk7_0,esk6_0)|$false),inference(rw,[status(thm)],[80,41,theory(equality)])).
% cnf(82,negated_conjecture,(~greater(esk7_0,esk6_0)),inference(cn,[status(thm)],[81,theory(equality)])).
% cnf(85,negated_conjecture,(X1=esk7_0|greater(esk7_0,X1)|greater(X1,esk7_0)|~time(X1)),inference(spm,[status(thm)],[37,54,theory(equality)])).
% cnf(94,negated_conjecture,(esk6_0=esk7_0|greater(esk6_0,esk7_0)|greater(esk7_0,esk6_0)),inference(spm,[status(thm)],[85,55,theory(equality)])).
% cnf(95,negated_conjecture,(esk7_0=esk6_0|greater(esk6_0,esk7_0)),inference(sr,[status(thm)],[94,82,theory(equality)])).
% cnf(102,negated_conjecture,(~size(esk1_0,X1,esk7_0)|~organization(esk1_0,esk7_0)|~greater(esk6_0,esk7_0)|~greater(X1,esk4_0)),inference(spm,[status(thm)],[68,56,theory(equality)])).
% cnf(103,negated_conjecture,(~size(esk1_0,X1,esk7_0)|$false|~greater(esk6_0,esk7_0)|~greater(X1,esk4_0)),inference(rw,[status(thm)],[102,48,theory(equality)])).
% cnf(104,negated_conjecture,(~size(esk1_0,X1,esk7_0)|~greater(esk6_0,esk7_0)|~greater(X1,esk4_0)),inference(cn,[status(thm)],[103,theory(equality)])).
% cnf(105,negated_conjecture,(~greater(esk6_0,esk7_0)|~greater(esk5_0,esk4_0)),inference(spm,[status(thm)],[104,43,theory(equality)])).
% cnf(106,negated_conjecture,(~greater(esk6_0,esk7_0)|$false),inference(rw,[status(thm)],[105,42,theory(equality)])).
% cnf(107,negated_conjecture,(~greater(esk6_0,esk7_0)),inference(cn,[status(thm)],[106,theory(equality)])).
% cnf(108,negated_conjecture,(esk7_0=esk6_0),inference(sr,[status(thm)],[95,107,theory(equality)])).
% cnf(124,negated_conjecture,(size(esk1_0,esk5_0,esk6_0)),inference(rw,[status(thm)],[43,108,theory(equality)])).
% cnf(141,negated_conjecture,(esk5_0=esk4_0),inference(spm,[status(thm)],[62,124,theory(equality)])).
% cnf(150,negated_conjecture,(greater(esk5_0,esk5_0)),inference(rw,[status(thm)],[42,141,theory(equality)])).
% cnf(151,negated_conjecture,($false),inference(sr,[status(thm)],[150,50,theory(equality)])).
% cnf(152,negated_conjecture,($false),151,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 67
% # ...of these trivial : 0
% # ...subsumed : 9
% # ...remaining for further processing: 58
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 18
% # Generated clauses : 34
% # ...of the previous two non-trivial : 46
% # Contextual simplify-reflections : 0
% # Paramodulations : 31
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 12
% # ...number of literals in the above : 39
% # Clause-clause subsumption calls (NU) : 58
% # Rec. Clause-clause subsumption calls : 51
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 28 leaves, 1.54+/-1.085 terms/leaf
% # Paramod-from index: 9 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 22 leaves, 1.14+/-0.343 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.005 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.22 WC
% FINAL PrfWatch: 0.11 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP26864/MGT014+1.tptp
%
%------------------------------------------------------------------------------