TSTP Solution File: MGT046+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT046+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 : art05.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:09:07 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP9286/MGT046+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9286/MGT046+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9286/MGT046+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 9382
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X4]:![X5]:((organization(X1)&greater(age(X1,X5),age(X1,X4)))=>greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))),file('/tmp/SRASS.s.p', assumption_7)).
% fof(6, axiom,![X1]:![X4]:![X5]:((organization(X1)&greater(age(X1,X5),age(X1,X4)))=>greater(external_ties(X1,X5),external_ties(X1,X4))),file('/tmp/SRASS.s.p', assumption_8)).
% fof(7, axiom,![X1]:![X5]:((organization(X1)&~(has_endowment(X1)))=>~(has_immunity(X1,X5))),file('/tmp/SRASS.s.p', assumption_1)).
% fof(8, axiom,![X1]:![X4]:![X5]:(((organization(X1)&~(has_immunity(X1,X4)))&~(has_immunity(X1,X5)))=>((((greater(capability(X1,X5),capability(X1,X4))&greater_or_equal(position(X1,X5),position(X1,X4)))=>smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)))&((greater_or_equal(capability(X1,X5),capability(X1,X4))&greater(position(X1,X5),position(X1,X4)))=>smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4))))&((capability(X1,X5)=capability(X1,X4)&position(X1,X5)=position(X1,X4))=>hazard_of_mortality(X1,X5)=hazard_of_mortality(X1,X4)))),file('/tmp/SRASS.s.p', assumption_4)).
% fof(9, axiom,![X1]:![X2]:(smaller_or_equal(X1,X2)<=>(smaller(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', definition_smaller_or_equal)).
% fof(10, axiom,![X1]:![X4]:![X5]:(organization(X1)=>((greater(external_ties(X1,X5),external_ties(X1,X4))=>greater(position(X1,X5),position(X1,X4)))&(external_ties(X1,X5)=external_ties(X1,X4)=>position(X1,X5)=position(X1,X4)))),file('/tmp/SRASS.s.p', assumption_6)).
% fof(11, axiom,![X1]:![X4]:![X5]:(organization(X1)=>internal_friction(X1,X5)=internal_friction(X1,X4)),file('/tmp/SRASS.s.p', assumption_9)).
% fof(12, 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(13, axiom,![X1]:![X2]:(greater_or_equal(X1,X2)<=>(greater(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', definition_greater_or_equal)).
% fof(14, conjecture,![X1]:![X4]:![X5]:(((organization(X1)&~(has_endowment(X1)))&greater(age(X1,X5),age(X1,X4)))=>smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4))),file('/tmp/SRASS.s.p', theorem_1)).
% fof(15, negated_conjecture,~(![X1]:![X4]:![X5]:(((organization(X1)&~(has_endowment(X1)))&greater(age(X1,X5),age(X1,X4)))=>smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)))),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X1]:![X5]:((organization(X1)&~(has_endowment(X1)))=>~(has_immunity(X1,X5))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(17, plain,![X1]:![X4]:![X5]:(((organization(X1)&~(has_immunity(X1,X4)))&~(has_immunity(X1,X5)))=>((((greater(capability(X1,X5),capability(X1,X4))&greater_or_equal(position(X1,X5),position(X1,X4)))=>smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)))&((greater_or_equal(capability(X1,X5),capability(X1,X4))&greater(position(X1,X5),position(X1,X4)))=>smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4))))&((capability(X1,X5)=capability(X1,X4)&position(X1,X5)=position(X1,X4))=>hazard_of_mortality(X1,X5)=hazard_of_mortality(X1,X4)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(18, negated_conjecture,~(![X1]:![X4]:![X5]:(((organization(X1)&~(has_endowment(X1)))&greater(age(X1,X5),age(X1,X4)))=>smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)))),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(19, plain,![X5]:![X4]:![X1]:(epred1_3(X1,X4,X5)=>((((greater(capability(X1,X5),capability(X1,X4))&greater_or_equal(position(X1,X5),position(X1,X4)))=>smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)))&((greater_or_equal(capability(X1,X5),capability(X1,X4))&greater(position(X1,X5),position(X1,X4)))=>smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4))))&((capability(X1,X5)=capability(X1,X4)&position(X1,X5)=position(X1,X4))=>hazard_of_mortality(X1,X5)=hazard_of_mortality(X1,X4)))),introduced(definition)).
% fof(20, plain,![X5]:![X4]:![X1]:(epred2_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(21, plain,![X1]:![X4]:![X5]:(((organization(X1)&~(has_immunity(X1,X4)))&~(has_immunity(X1,X5)))=>epred1_3(X1,X4,X5)),inference(apply_def,[status(esa)],[17,19,theory(equality)])).
% fof(22, plain,![X1]:![X4]:![X5]:(organization(X1)=>epred2_3(X1,X4,X5)),inference(apply_def,[status(esa)],[12,20,theory(equality)])).
% fof(35, plain,![X1]:![X4]:![X5]:((~(organization(X1))|~(greater(age(X1,X5),age(X1,X4))))|greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))),inference(fof_nnf,[status(thm)],[5])).
% fof(36, plain,![X6]:![X7]:![X8]:((~(organization(X6))|~(greater(age(X6,X8),age(X6,X7))))|greater(stock_of_knowledge(X6,X8),stock_of_knowledge(X6,X7))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~greater(age(X1,X2),age(X1,X3))|~organization(X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X4]:![X5]:((~(organization(X1))|~(greater(age(X1,X5),age(X1,X4))))|greater(external_ties(X1,X5),external_ties(X1,X4))),inference(fof_nnf,[status(thm)],[6])).
% fof(39, plain,![X6]:![X7]:![X8]:((~(organization(X6))|~(greater(age(X6,X8),age(X6,X7))))|greater(external_ties(X6,X8),external_ties(X6,X7))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(greater(external_ties(X1,X2),external_ties(X1,X3))|~greater(age(X1,X2),age(X1,X3))|~organization(X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X1]:![X5]:((~(organization(X1))|has_endowment(X1))|~(has_immunity(X1,X5))),inference(fof_nnf,[status(thm)],[16])).
% fof(42, plain,![X6]:![X7]:((~(organization(X6))|has_endowment(X6))|~(has_immunity(X6,X7))),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(has_endowment(X1)|~has_immunity(X1,X2)|~organization(X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X1]:![X4]:![X5]:(((~(organization(X1))|has_immunity(X1,X4))|has_immunity(X1,X5))|epred1_3(X1,X4,X5)),inference(fof_nnf,[status(thm)],[21])).
% fof(45, plain,![X6]:![X7]:![X8]:(((~(organization(X6))|has_immunity(X6,X7))|has_immunity(X6,X8))|epred1_3(X6,X7,X8)),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(epred1_3(X1,X2,X3)|has_immunity(X1,X3)|has_immunity(X1,X2)|~organization(X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, 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)],[9])).
% fof(48, 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)],[47])).
% fof(49, 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)],[48])).
% cnf(50,plain,(smaller_or_equal(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[49])).
% fof(53, plain,![X1]:![X4]:![X5]:(~(organization(X1))|((~(greater(external_ties(X1,X5),external_ties(X1,X4)))|greater(position(X1,X5),position(X1,X4)))&(~(external_ties(X1,X5)=external_ties(X1,X4))|position(X1,X5)=position(X1,X4)))),inference(fof_nnf,[status(thm)],[10])).
% fof(54, plain,![X6]:![X7]:![X8]:(~(organization(X6))|((~(greater(external_ties(X6,X8),external_ties(X6,X7)))|greater(position(X6,X8),position(X6,X7)))&(~(external_ties(X6,X8)=external_ties(X6,X7))|position(X6,X8)=position(X6,X7)))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X6]:![X7]:![X8]:(((~(greater(external_ties(X6,X8),external_ties(X6,X7)))|greater(position(X6,X8),position(X6,X7)))|~(organization(X6)))&((~(external_ties(X6,X8)=external_ties(X6,X7))|position(X6,X8)=position(X6,X7))|~(organization(X6)))),inference(distribute,[status(thm)],[54])).
% cnf(57,plain,(greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3))),inference(split_conjunct,[status(thm)],[55])).
% fof(58, plain,![X1]:![X4]:![X5]:(~(organization(X1))|internal_friction(X1,X5)=internal_friction(X1,X4)),inference(fof_nnf,[status(thm)],[11])).
% fof(59, plain,![X6]:![X7]:![X8]:(~(organization(X6))|internal_friction(X6,X8)=internal_friction(X6,X7)),inference(variable_rename,[status(thm)],[58])).
% cnf(60,plain,(internal_friction(X1,X2)=internal_friction(X1,X3)|~organization(X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X1]:![X4]:![X5]:(~(organization(X1))|epred2_3(X1,X4,X5)),inference(fof_nnf,[status(thm)],[22])).
% fof(62, plain,![X6]:![X7]:![X8]:(~(organization(X6))|epred2_3(X6,X7,X8)),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(epred2_3(X1,X2,X3)|~organization(X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(64, plain,![X1]:![X2]:((~(greater_or_equal(X1,X2))|(greater(X1,X2)|X1=X2))&((~(greater(X1,X2))&~(X1=X2))|greater_or_equal(X1,X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(65, plain,![X3]:![X4]:((~(greater_or_equal(X3,X4))|(greater(X3,X4)|X3=X4))&((~(greater(X3,X4))&~(X3=X4))|greater_or_equal(X3,X4))),inference(variable_rename,[status(thm)],[64])).
% fof(66, plain,![X3]:![X4]:((~(greater_or_equal(X3,X4))|(greater(X3,X4)|X3=X4))&((~(greater(X3,X4))|greater_or_equal(X3,X4))&(~(X3=X4)|greater_or_equal(X3,X4)))),inference(distribute,[status(thm)],[65])).
% cnf(68,plain,(greater_or_equal(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(70, negated_conjecture,?[X1]:?[X4]:?[X5]:(((organization(X1)&~(has_endowment(X1)))&greater(age(X1,X5),age(X1,X4)))&~(smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)))),inference(fof_nnf,[status(thm)],[18])).
% fof(71, negated_conjecture,?[X6]:?[X7]:?[X8]:(((organization(X6)&~(has_endowment(X6)))&greater(age(X6,X8),age(X6,X7)))&~(smaller(hazard_of_mortality(X6,X8),hazard_of_mortality(X6,X7)))),inference(variable_rename,[status(thm)],[70])).
% fof(72, negated_conjecture,(((organization(esk1_0)&~(has_endowment(esk1_0)))&greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)))&~(smaller(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)))),inference(skolemize,[status(esa)],[71])).
% cnf(73,negated_conjecture,(~smaller(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[72])).
% cnf(74,negated_conjecture,(greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[72])).
% cnf(75,negated_conjecture,(~has_endowment(esk1_0)),inference(split_conjunct,[status(thm)],[72])).
% cnf(76,negated_conjecture,(organization(esk1_0)),inference(split_conjunct,[status(thm)],[72])).
% fof(77, plain,![X5]:![X4]:![X1]:(~(epred1_3(X1,X4,X5))|((((~(greater(capability(X1,X5),capability(X1,X4)))|~(greater_or_equal(position(X1,X5),position(X1,X4))))|smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4)))&((~(greater_or_equal(capability(X1,X5),capability(X1,X4)))|~(greater(position(X1,X5),position(X1,X4))))|smaller(hazard_of_mortality(X1,X5),hazard_of_mortality(X1,X4))))&((~(capability(X1,X5)=capability(X1,X4))|~(position(X1,X5)=position(X1,X4)))|hazard_of_mortality(X1,X5)=hazard_of_mortality(X1,X4)))),inference(fof_nnf,[status(thm)],[19])).
% fof(78, plain,![X6]:![X7]:![X8]:(~(epred1_3(X8,X7,X6))|((((~(greater(capability(X8,X6),capability(X8,X7)))|~(greater_or_equal(position(X8,X6),position(X8,X7))))|smaller(hazard_of_mortality(X8,X6),hazard_of_mortality(X8,X7)))&((~(greater_or_equal(capability(X8,X6),capability(X8,X7)))|~(greater(position(X8,X6),position(X8,X7))))|smaller(hazard_of_mortality(X8,X6),hazard_of_mortality(X8,X7))))&((~(capability(X8,X6)=capability(X8,X7))|~(position(X8,X6)=position(X8,X7)))|hazard_of_mortality(X8,X6)=hazard_of_mortality(X8,X7)))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,![X6]:![X7]:![X8]:(((((~(greater(capability(X8,X6),capability(X8,X7)))|~(greater_or_equal(position(X8,X6),position(X8,X7))))|smaller(hazard_of_mortality(X8,X6),hazard_of_mortality(X8,X7)))|~(epred1_3(X8,X7,X6)))&(((~(greater_or_equal(capability(X8,X6),capability(X8,X7)))|~(greater(position(X8,X6),position(X8,X7))))|smaller(hazard_of_mortality(X8,X6),hazard_of_mortality(X8,X7)))|~(epred1_3(X8,X7,X6))))&(((~(capability(X8,X6)=capability(X8,X7))|~(position(X8,X6)=position(X8,X7)))|hazard_of_mortality(X8,X6)=hazard_of_mortality(X8,X7))|~(epred1_3(X8,X7,X6)))),inference(distribute,[status(thm)],[78])).
% cnf(82,plain,(smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))|~epred1_3(X1,X2,X3)|~greater_or_equal(position(X1,X3),position(X1,X2))|~greater(capability(X1,X3),capability(X1,X2))),inference(split_conjunct,[status(thm)],[79])).
% fof(83, plain,![X5]:![X4]:![X1]:(~(epred2_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)],[20])).
% fof(84, plain,![X6]:![X7]:![X8]:(~(epred2_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)],[83])).
% fof(85, 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)))|~(epred2_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)))|~(epred2_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))|~(epred2_3(X8,X7,X6)))),inference(distribute,[status(thm)],[84])).
% cnf(88,plain,(greater(capability(X1,X3),capability(X1,X2))|~epred2_3(X1,X2,X3)|~smaller_or_equal(internal_friction(X1,X3),internal_friction(X1,X2))|~greater(stock_of_knowledge(X1,X3),stock_of_knowledge(X1,X2))),inference(split_conjunct,[status(thm)],[85])).
% cnf(90,plain,(smaller_or_equal(X1,X1)),inference(er,[status(thm)],[50,theory(equality)])).
% cnf(103,negated_conjecture,(greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))|~organization(esk1_0)),inference(spm,[status(thm)],[37,74,theory(equality)])).
% cnf(104,negated_conjecture,(greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[103,76,theory(equality)])).
% cnf(105,negated_conjecture,(greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))),inference(cn,[status(thm)],[104,theory(equality)])).
% cnf(106,negated_conjecture,(greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))|~organization(esk1_0)),inference(spm,[status(thm)],[40,74,theory(equality)])).
% cnf(107,negated_conjecture,(greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[106,76,theory(equality)])).
% cnf(108,negated_conjecture,(greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))),inference(cn,[status(thm)],[107,theory(equality)])).
% cnf(109,negated_conjecture,(epred1_3(esk1_0,X1,X2)|has_immunity(esk1_0,X2)|has_immunity(esk1_0,X1)),inference(spm,[status(thm)],[46,76,theory(equality)])).
% cnf(113,negated_conjecture,(~epred1_3(esk1_0,esk2_0,esk3_0)|~greater_or_equal(position(esk1_0,esk3_0),position(esk1_0,esk2_0))|~greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))),inference(spm,[status(thm)],[73,82,theory(equality)])).
% cnf(118,plain,(greater(capability(X1,X2),capability(X1,X3))|~epred2_3(X1,X3,X2)|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X4))|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~organization(X1)),inference(spm,[status(thm)],[88,60,theory(equality)])).
% cnf(133,negated_conjecture,(greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0))|~organization(esk1_0)),inference(spm,[status(thm)],[57,108,theory(equality)])).
% cnf(134,negated_conjecture,(greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[133,76,theory(equality)])).
% cnf(135,negated_conjecture,(greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0))),inference(cn,[status(thm)],[134,theory(equality)])).
% cnf(250,negated_conjecture,(has_endowment(esk1_0)|epred1_3(esk1_0,X2,X1)|has_immunity(esk1_0,X2)|~organization(esk1_0)),inference(spm,[status(thm)],[43,109,theory(equality)])).
% cnf(253,negated_conjecture,(has_endowment(esk1_0)|epred1_3(esk1_0,X2,X1)|has_immunity(esk1_0,X2)|$false),inference(rw,[status(thm)],[250,76,theory(equality)])).
% cnf(254,negated_conjecture,(has_endowment(esk1_0)|epred1_3(esk1_0,X2,X1)|has_immunity(esk1_0,X2)),inference(cn,[status(thm)],[253,theory(equality)])).
% cnf(255,negated_conjecture,(epred1_3(esk1_0,X2,X1)|has_immunity(esk1_0,X2)),inference(sr,[status(thm)],[254,75,theory(equality)])).
% cnf(261,negated_conjecture,(has_endowment(esk1_0)|epred1_3(esk1_0,X1,X2)|~organization(esk1_0)),inference(spm,[status(thm)],[43,255,theory(equality)])).
% cnf(263,negated_conjecture,(has_endowment(esk1_0)|epred1_3(esk1_0,X1,X2)|$false),inference(rw,[status(thm)],[261,76,theory(equality)])).
% cnf(264,negated_conjecture,(has_endowment(esk1_0)|epred1_3(esk1_0,X1,X2)),inference(cn,[status(thm)],[263,theory(equality)])).
% cnf(265,negated_conjecture,(epred1_3(esk1_0,X1,X2)),inference(sr,[status(thm)],[264,75,theory(equality)])).
% cnf(377,negated_conjecture,($false|~greater_or_equal(position(esk1_0,esk3_0),position(esk1_0,esk2_0))|~greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))),inference(rw,[status(thm)],[113,265,theory(equality)])).
% cnf(378,negated_conjecture,(~greater_or_equal(position(esk1_0,esk3_0),position(esk1_0,esk2_0))|~greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))),inference(cn,[status(thm)],[377,theory(equality)])).
% cnf(379,negated_conjecture,(~greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))|~greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0))),inference(spm,[status(thm)],[378,68,theory(equality)])).
% cnf(380,negated_conjecture,(~greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[379,135,theory(equality)])).
% cnf(381,negated_conjecture,(~greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))),inference(cn,[status(thm)],[380,theory(equality)])).
% cnf(610,plain,(greater(capability(X1,X2),capability(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X4))|~organization(X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))),inference(csr,[status(thm)],[118,63])).
% cnf(616,plain,(greater(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))),inference(spm,[status(thm)],[610,90,theory(equality)])).
% cnf(809,negated_conjecture,(greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))|~organization(esk1_0)),inference(spm,[status(thm)],[616,105,theory(equality)])).
% cnf(816,negated_conjecture,(greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[809,76,theory(equality)])).
% cnf(817,negated_conjecture,(greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))),inference(cn,[status(thm)],[816,theory(equality)])).
% cnf(818,negated_conjecture,($false),inference(sr,[status(thm)],[817,381,theory(equality)])).
% cnf(819,negated_conjecture,($false),818,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 206
% # ...of these trivial : 0
% # ...subsumed : 70
% # ...remaining for further processing: 136
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 0
% # Generated clauses : 607
% # ...of the previous two non-trivial : 572
% # Contextual simplify-reflections : 28
% # Paramodulations : 591
% # Factorizations : 12
% # Equation resolutions : 4
% # Current number of processed clauses: 101
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 84
% # Current number of unprocessed clauses: 408
% # ...number of literals in the above : 1986
% # Clause-clause subsumption calls (NU) : 934
% # Rec. Clause-clause subsumption calls : 708
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 109 leaves, 1.28+/-0.633 terms/leaf
% # Paramod-from index: 26 leaves, 1.27+/-0.654 terms/leaf
% # Paramod-into index: 89 leaves, 1.15+/-0.438 terms/leaf
% # -------------------------------------------------
% # User time : 0.043 s
% # System time : 0.005 s
% # Total time : 0.048 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.23 WC
% FINAL PrfWatch: 0.14 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP9286/MGT046+1.tptp
%
%------------------------------------------------------------------------------