TSTP Solution File: MGT048+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT048+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %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 : Wed Dec 29 16:14:03 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP16150/MGT048+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16150/MGT048+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16150/MGT048+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 16282
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X4]:![X5]:((organization(X1)&greater(age(X1,X5),age(X1,X4)))=>greater(internal_friction(X1,X5),internal_friction(X1,X4))),file('/tmp/SRASS.s.p', assumption_12)).
% fof(6, axiom,![X1]:![X4]:![X5]:(organization(X1)=>((((greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))&smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)))=>greater(capability(X1,X5),capability(X1,X4)))&((smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))&greater(internal_friction(X1,X5),internal_friction(X1,X4)))=>smaller(capability(X1,X5),capability(X1,X4))))&((stock_of_knowledge(X1,X5)=stock_of_knowledge(X1,X4)&internal_friction(X1,X5)=internal_friction(X1,X4))=>capability(X1,X5)=capability(X1,X4)))),file('/tmp/SRASS.s.p', assumption_5)).
% fof(7, axiom,![X1]:![X4]:![X5]:(organization(X1)=>stock_of_knowledge(X1,X5)=stock_of_knowledge(X1,X4)),file('/tmp/SRASS.s.p', assumption_10)).
% fof(8, axiom,![X1]:![X2]:(smaller_or_equal(X1,X2)<=>(smaller(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', definition_smaller_or_equal)).
% fof(10, conjecture,![X1]:![X4]:![X5]:((organization(X1)&greater(age(X1,X5),age(X1,X4)))=>smaller(capability(X1,X5),capability(X1,X4))),file('/tmp/SRASS.s.p', lemma_5)).
% fof(11, negated_conjecture,~(![X1]:![X4]:![X5]:((organization(X1)&greater(age(X1,X5),age(X1,X4)))=>smaller(capability(X1,X5),capability(X1,X4)))),inference(assume_negation,[status(cth)],[10])).
% fof(12, plain,![X5]:![X4]:![X1]:(epred1_3(X1,X4,X5)=>((((greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))&smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)))=>greater(capability(X1,X5),capability(X1,X4)))&((smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))&greater(internal_friction(X1,X5),internal_friction(X1,X4)))=>smaller(capability(X1,X5),capability(X1,X4))))&((stock_of_knowledge(X1,X5)=stock_of_knowledge(X1,X4)&internal_friction(X1,X5)=internal_friction(X1,X4))=>capability(X1,X5)=capability(X1,X4)))),introduced(definition)).
% fof(13, plain,![X1]:![X4]:![X5]:(organization(X1)=>epred1_3(X1,X4,X5)),inference(apply_def,[status(esa)],[6,12,theory(equality)])).
% fof(24, plain,![X1]:![X4]:![X5]:((~(organization(X1))|~(greater(age(X1,X5),age(X1,X4))))|greater(internal_friction(X1,X5),internal_friction(X1,X4))),inference(fof_nnf,[status(thm)],[4])).
% fof(25, plain,![X6]:![X7]:![X8]:((~(organization(X6))|~(greater(age(X6,X8),age(X6,X7))))|greater(internal_friction(X6,X8),internal_friction(X6,X7))),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(greater(internal_friction(X1,X2),internal_friction(X1,X3))|~greater(age(X1,X2),age(X1,X3))|~organization(X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(29, plain,![X1]:![X4]:![X5]:(~(organization(X1))|epred1_3(X1,X4,X5)),inference(fof_nnf,[status(thm)],[13])).
% fof(30, plain,![X6]:![X7]:![X8]:(~(organization(X6))|epred1_3(X6,X7,X8)),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(epred1_3(X1,X2,X3)|~organization(X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X1]:![X4]:![X5]:(~(organization(X1))|stock_of_knowledge(X1,X5)=stock_of_knowledge(X1,X4)),inference(fof_nnf,[status(thm)],[7])).
% fof(33, plain,![X6]:![X7]:![X8]:(~(organization(X6))|stock_of_knowledge(X6,X8)=stock_of_knowledge(X6,X7)),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(stock_of_knowledge(X1,X2)=stock_of_knowledge(X1,X3)|~organization(X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X1]:![X2]:((~(smaller_or_equal(X1,X2))|(smaller(X1,X2)|X1=X2))&((~(smaller(X1,X2))&~(X1=X2))|smaller_or_equal(X1,X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(36, plain,![X3]:![X4]:((~(smaller_or_equal(X3,X4))|(smaller(X3,X4)|X3=X4))&((~(smaller(X3,X4))&~(X3=X4))|smaller_or_equal(X3,X4))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:((~(smaller_or_equal(X3,X4))|(smaller(X3,X4)|X3=X4))&((~(smaller(X3,X4))|smaller_or_equal(X3,X4))&(~(X3=X4)|smaller_or_equal(X3,X4)))),inference(distribute,[status(thm)],[36])).
% cnf(38,plain,(smaller_or_equal(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[37])).
% fof(47, negated_conjecture,?[X1]:?[X4]:?[X5]:((organization(X1)&greater(age(X1,X5),age(X1,X4)))&~(smaller(capability(X1,X5),capability(X1,X4)))),inference(fof_nnf,[status(thm)],[11])).
% fof(48, negated_conjecture,?[X6]:?[X7]:?[X8]:((organization(X6)&greater(age(X6,X8),age(X6,X7)))&~(smaller(capability(X6,X8),capability(X6,X7)))),inference(variable_rename,[status(thm)],[47])).
% fof(49, negated_conjecture,((organization(esk1_0)&greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)))&~(smaller(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)))),inference(skolemize,[status(esa)],[48])).
% cnf(50,negated_conjecture,(~smaller(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,negated_conjecture,(greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,negated_conjecture,(organization(esk1_0)),inference(split_conjunct,[status(thm)],[49])).
% fof(53, plain,![X5]:![X4]:![X1]:(~(epred1_3(X1,X4,X5))|((((~(greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)))|~(smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4))))|greater(capability(X1,X5),capability(X1,X4)))&((~(smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)))|~(greater(internal_friction(X1,X5),internal_friction(X1,X4))))|smaller(capability(X1,X5),capability(X1,X4))))&((~(stock_of_knowledge(X1,X5)=stock_of_knowledge(X1,X4))|~(internal_friction(X1,X5)=internal_friction(X1,X4)))|capability(X1,X5)=capability(X1,X4)))),inference(fof_nnf,[status(thm)],[12])).
% fof(54, plain,![X6]:![X7]:![X8]:(~(epred1_3(X8,X7,X6))|((((~(greater(stock_of_knowledge(X8,X6),stock_of_knowledge(X8,X7)))|~(smaller_or_equal(internal_friction(X8,X6),internal_friction(X8,X7))))|greater(capability(X8,X6),capability(X8,X7)))&((~(smaller_or_equal(stock_of_knowledge(X8,X6),stock_of_knowledge(X8,X7)))|~(greater(internal_friction(X8,X6),internal_friction(X8,X7))))|smaller(capability(X8,X6),capability(X8,X7))))&((~(stock_of_knowledge(X8,X6)=stock_of_knowledge(X8,X7))|~(internal_friction(X8,X6)=internal_friction(X8,X7)))|capability(X8,X6)=capability(X8,X7)))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X6]:![X7]:![X8]:(((((~(greater(stock_of_knowledge(X8,X6),stock_of_knowledge(X8,X7)))|~(smaller_or_equal(internal_friction(X8,X6),internal_friction(X8,X7))))|greater(capability(X8,X6),capability(X8,X7)))|~(epred1_3(X8,X7,X6)))&(((~(smaller_or_equal(stock_of_knowledge(X8,X6),stock_of_knowledge(X8,X7)))|~(greater(internal_friction(X8,X6),internal_friction(X8,X7))))|smaller(capability(X8,X6),capability(X8,X7)))|~(epred1_3(X8,X7,X6))))&(((~(stock_of_knowledge(X8,X6)=stock_of_knowledge(X8,X7))|~(internal_friction(X8,X6)=internal_friction(X8,X7)))|capability(X8,X6)=capability(X8,X7))|~(epred1_3(X8,X7,X6)))),inference(distribute,[status(thm)],[54])).
% cnf(57,plain,(smaller(capability(X1,X3),capability(X1,X2))|~epred1_3(X1,X2,X3)|~greater(internal_friction(X1,X3),internal_friction(X1,X2))|~smaller_or_equal(stock_of_knowledge(X1,X3),stock_of_knowledge(X1,X2))),inference(split_conjunct,[status(thm)],[55])).
% cnf(59,plain,(smaller_or_equal(X1,X1)),inference(er,[status(thm)],[38,theory(equality)])).
% cnf(69,negated_conjecture,(stock_of_knowledge(esk1_0,X1)=stock_of_knowledge(esk1_0,X2)),inference(spm,[status(thm)],[34,52,theory(equality)])).
% cnf(70,negated_conjecture,(greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0))|~organization(esk1_0)),inference(spm,[status(thm)],[26,51,theory(equality)])).
% cnf(71,negated_conjecture,(greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[70,52,theory(equality)])).
% cnf(72,negated_conjecture,(greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0))),inference(cn,[status(thm)],[71,theory(equality)])).
% cnf(107,plain,(smaller(capability(esk1_0,X1),capability(esk1_0,X2))|~epred1_3(esk1_0,X2,X1)|~smaller_or_equal(stock_of_knowledge(esk1_0,X3),stock_of_knowledge(esk1_0,X2))|~greater(internal_friction(esk1_0,X1),internal_friction(esk1_0,X2))),inference(spm,[status(thm)],[57,69,theory(equality)])).
% cnf(396,plain,(smaller(capability(esk1_0,X1),capability(esk1_0,X2))|~epred1_3(esk1_0,X2,X1)|~greater(internal_friction(esk1_0,X1),internal_friction(esk1_0,X2))),inference(spm,[status(thm)],[107,59,theory(equality)])).
% cnf(4307,negated_conjecture,(~epred1_3(esk1_0,esk2_0,esk3_0)|~greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0))),inference(spm,[status(thm)],[50,396,theory(equality)])).
% cnf(4316,negated_conjecture,(~epred1_3(esk1_0,esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[4307,72,theory(equality)])).
% cnf(4317,negated_conjecture,(~epred1_3(esk1_0,esk2_0,esk3_0)),inference(cn,[status(thm)],[4316,theory(equality)])).
% cnf(4318,negated_conjecture,(~organization(esk1_0)),inference(spm,[status(thm)],[4317,31,theory(equality)])).
% cnf(4319,negated_conjecture,($false),inference(rw,[status(thm)],[4318,52,theory(equality)])).
% cnf(4320,negated_conjecture,($false),inference(cn,[status(thm)],[4319,theory(equality)])).
% cnf(4321,negated_conjecture,($false),4320,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 352
% # ...of these trivial : 0
% # ...subsumed : 174
% # ...remaining for further processing: 178
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 2
% # Generated clauses : 3918
% # ...of the previous two non-trivial : 3648
% # Contextual simplify-reflections : 56
% # Paramodulations : 3830
% # Factorizations : 78
% # Equation resolutions : 7
% # Current number of processed clauses: 143
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 7
% # Non-unit-clauses : 129
% # Current number of unprocessed clauses: 3243
% # ...number of literals in the above : 26006
% # Clause-clause subsumption calls (NU) : 4396
% # Rec. Clause-clause subsumption calls : 3176
% # Unit Clause-clause subsumption calls : 86
% # Rewrite failures with RHS unbound : 10
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 82 leaves, 1.48+/-1.192 terms/leaf
% # Paramod-from index: 29 leaves, 1.66+/-1.469 terms/leaf
% # Paramod-into index: 72 leaves, 1.44+/-1.223 terms/leaf
% # -------------------------------------------------
% # User time : 0.186 s
% # System time : 0.008 s
% # Total time : 0.194 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.36 CPU 0.43 WC
% FINAL PrfWatch: 0.36 CPU 0.43 WC
% SZS output end Solution for /tmp/SystemOnTPTP16150/MGT048+1.tptp
%
%------------------------------------------------------------------------------