TSTP Solution File: MGT061+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT061+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:10:59 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP10322/MGT061+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10322/MGT061+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10322/MGT061+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 10418
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:((greater(X1,X2)&greater(X2,X3))=>greater(X1,X3)),file('/tmp/SRASS.s.p', meaning_postulate_greater_transitive)).
% fof(3, axiom,![X1]:![X4]:![X5]:((organization(X1)&age(X1,X4)=zero)=>(greater(age(X1,X5),sigma)<=>dissimilar(X1,X4,X5))),file('/tmp/SRASS.s.p', assumption_15)).
% fof(4, axiom,![X1]:(fragile_position(X1)<=>![X5]:((smaller_or_equal(age(X1,X5),sigma)=>positional_advantage(X1,X5))&(greater(age(X1,X5),sigma)=>~(positional_advantage(X1,X5))))),file('/tmp/SRASS.s.p', definition_3)).
% fof(5, axiom,![X1]:![X5]:((organization(X1)&age(X1,X5)=zero)=>is_aligned(X1,X5)),file('/tmp/SRASS.s.p', assumption_13)).
% fof(6, axiom,![X1]:![X2]:(smaller_or_equal(X1,X2)<=>(smaller(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', definition_smaller_or_equal)).
% fof(7, axiom,![X1]:![X5]:((organization(X1)&~(has_endowment(X1)))=>~(has_immunity(X1,X5))),file('/tmp/SRASS.s.p', assumption_1)).
% fof(13, axiom,greater(high,mod2),file('/tmp/SRASS.s.p', assumption_18d)).
% fof(14, axiom,greater(mod2,low),file('/tmp/SRASS.s.p', assumption_18e)).
% fof(15, axiom,![X1]:![X2]:(smaller(X1,X2)<=>greater(X2,X1)),file('/tmp/SRASS.s.p', definition_smaller)).
% fof(16, axiom,![X1]:![X4]:![X5]:(dissimilar(X1,X4,X5)<=>(organization(X1)&~((is_aligned(X1,X4)<=>is_aligned(X1,X5))))),file('/tmp/SRASS.s.p', definition_2)).
% fof(17, axiom,![X1]:![X5]:(organization(X1)=>((has_immunity(X1,X5)=>hazard_of_mortality(X1,X5)=very_low)&(~(has_immunity(X1,X5))=>(((((is_aligned(X1,X5)&positional_advantage(X1,X5))=>hazard_of_mortality(X1,X5)=low)&((~(is_aligned(X1,X5))&positional_advantage(X1,X5))=>hazard_of_mortality(X1,X5)=mod1))&((is_aligned(X1,X5)&~(positional_advantage(X1,X5)))=>hazard_of_mortality(X1,X5)=mod2))&((~(is_aligned(X1,X5))&~(positional_advantage(X1,X5)))=>hazard_of_mortality(X1,X5)=high))))),file('/tmp/SRASS.s.p', assumption_17)).
% fof(18, conjecture,![X1]:![X4]:![X6]:![X7]:(((((((organization(X1)&fragile_position(X1))&~(has_endowment(X1)))&age(X1,X4)=zero)&greater(sigma,zero))&smaller_or_equal(age(X1,X6),sigma))&greater(age(X1,X7),sigma))=>(greater(hazard_of_mortality(X1,X7),hazard_of_mortality(X1,X6))&hazard_of_mortality(X1,X6)=hazard_of_mortality(X1,X4))),file('/tmp/SRASS.s.p', theorem_7)).
% fof(19, negated_conjecture,~(![X1]:![X4]:![X6]:![X7]:(((((((organization(X1)&fragile_position(X1))&~(has_endowment(X1)))&age(X1,X4)=zero)&greater(sigma,zero))&smaller_or_equal(age(X1,X6),sigma))&greater(age(X1,X7),sigma))=>(greater(hazard_of_mortality(X1,X7),hazard_of_mortality(X1,X6))&hazard_of_mortality(X1,X6)=hazard_of_mortality(X1,X4)))),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X1]:(fragile_position(X1)<=>![X5]:((smaller_or_equal(age(X1,X5),sigma)=>positional_advantage(X1,X5))&(greater(age(X1,X5),sigma)=>~(positional_advantage(X1,X5))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(21, plain,![X1]:![X5]:((organization(X1)&~(has_endowment(X1)))=>~(has_immunity(X1,X5))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(22, plain,![X1]:![X5]:(organization(X1)=>((has_immunity(X1,X5)=>hazard_of_mortality(X1,X5)=very_low)&(~(has_immunity(X1,X5))=>(((((is_aligned(X1,X5)&positional_advantage(X1,X5))=>hazard_of_mortality(X1,X5)=low)&((~(is_aligned(X1,X5))&positional_advantage(X1,X5))=>hazard_of_mortality(X1,X5)=mod1))&((is_aligned(X1,X5)&~(positional_advantage(X1,X5)))=>hazard_of_mortality(X1,X5)=mod2))&((~(is_aligned(X1,X5))&~(positional_advantage(X1,X5)))=>hazard_of_mortality(X1,X5)=high))))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(23, negated_conjecture,~(![X1]:![X4]:![X6]:![X7]:(((((((organization(X1)&fragile_position(X1))&~(has_endowment(X1)))&age(X1,X4)=zero)&greater(sigma,zero))&smaller_or_equal(age(X1,X6),sigma))&greater(age(X1,X7),sigma))=>(greater(hazard_of_mortality(X1,X7),hazard_of_mortality(X1,X6))&hazard_of_mortality(X1,X6)=hazard_of_mortality(X1,X4)))),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(24, plain,![X5]:![X1]:(epred1_2(X1,X5)=>(((((is_aligned(X1,X5)&positional_advantage(X1,X5))=>hazard_of_mortality(X1,X5)=low)&((~(is_aligned(X1,X5))&positional_advantage(X1,X5))=>hazard_of_mortality(X1,X5)=mod1))&((is_aligned(X1,X5)&~(positional_advantage(X1,X5)))=>hazard_of_mortality(X1,X5)=mod2))&((~(is_aligned(X1,X5))&~(positional_advantage(X1,X5)))=>hazard_of_mortality(X1,X5)=high))),introduced(definition)).
% fof(25, plain,![X1]:![X5]:(organization(X1)=>((has_immunity(X1,X5)=>hazard_of_mortality(X1,X5)=very_low)&(~(has_immunity(X1,X5))=>epred1_2(X1,X5)))),inference(apply_def,[status(esa)],[22,24,theory(equality)])).
% fof(29, plain,![X1]:![X2]:![X3]:((~(greater(X1,X2))|~(greater(X2,X3)))|greater(X1,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(30, plain,![X4]:![X5]:![X6]:((~(greater(X4,X5))|~(greater(X5,X6)))|greater(X4,X6)),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X1]:![X4]:![X5]:((~(organization(X1))|~(age(X1,X4)=zero))|((~(greater(age(X1,X5),sigma))|dissimilar(X1,X4,X5))&(~(dissimilar(X1,X4,X5))|greater(age(X1,X5),sigma)))),inference(fof_nnf,[status(thm)],[3])).
% fof(33, plain,![X6]:![X7]:![X8]:((~(organization(X6))|~(age(X6,X7)=zero))|((~(greater(age(X6,X8),sigma))|dissimilar(X6,X7,X8))&(~(dissimilar(X6,X7,X8))|greater(age(X6,X8),sigma)))),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X6]:![X7]:![X8]:(((~(greater(age(X6,X8),sigma))|dissimilar(X6,X7,X8))|(~(organization(X6))|~(age(X6,X7)=zero)))&((~(dissimilar(X6,X7,X8))|greater(age(X6,X8),sigma))|(~(organization(X6))|~(age(X6,X7)=zero)))),inference(distribute,[status(thm)],[33])).
% cnf(35,plain,(greater(age(X1,X3),sigma)|age(X1,X2)!=zero|~organization(X1)|~dissimilar(X1,X2,X3)),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,plain,(dissimilar(X1,X2,X3)|age(X1,X2)!=zero|~organization(X1)|~greater(age(X1,X3),sigma)),inference(split_conjunct,[status(thm)],[34])).
% fof(37, plain,![X1]:((~(fragile_position(X1))|![X5]:((~(smaller_or_equal(age(X1,X5),sigma))|positional_advantage(X1,X5))&(~(greater(age(X1,X5),sigma))|~(positional_advantage(X1,X5)))))&(?[X5]:((smaller_or_equal(age(X1,X5),sigma)&~(positional_advantage(X1,X5)))|(greater(age(X1,X5),sigma)&positional_advantage(X1,X5)))|fragile_position(X1))),inference(fof_nnf,[status(thm)],[20])).
% fof(38, plain,![X6]:((~(fragile_position(X6))|![X7]:((~(smaller_or_equal(age(X6,X7),sigma))|positional_advantage(X6,X7))&(~(greater(age(X6,X7),sigma))|~(positional_advantage(X6,X7)))))&(?[X8]:((smaller_or_equal(age(X6,X8),sigma)&~(positional_advantage(X6,X8)))|(greater(age(X6,X8),sigma)&positional_advantage(X6,X8)))|fragile_position(X6))),inference(variable_rename,[status(thm)],[37])).
% fof(39, plain,![X6]:((~(fragile_position(X6))|![X7]:((~(smaller_or_equal(age(X6,X7),sigma))|positional_advantage(X6,X7))&(~(greater(age(X6,X7),sigma))|~(positional_advantage(X6,X7)))))&(((smaller_or_equal(age(X6,esk1_1(X6)),sigma)&~(positional_advantage(X6,esk1_1(X6))))|(greater(age(X6,esk1_1(X6)),sigma)&positional_advantage(X6,esk1_1(X6))))|fragile_position(X6))),inference(skolemize,[status(esa)],[38])).
% fof(40, plain,![X6]:![X7]:((((~(smaller_or_equal(age(X6,X7),sigma))|positional_advantage(X6,X7))&(~(greater(age(X6,X7),sigma))|~(positional_advantage(X6,X7))))|~(fragile_position(X6)))&(((smaller_or_equal(age(X6,esk1_1(X6)),sigma)&~(positional_advantage(X6,esk1_1(X6))))|(greater(age(X6,esk1_1(X6)),sigma)&positional_advantage(X6,esk1_1(X6))))|fragile_position(X6))),inference(shift_quantors,[status(thm)],[39])).
% fof(41, plain,![X6]:![X7]:((((~(smaller_or_equal(age(X6,X7),sigma))|positional_advantage(X6,X7))|~(fragile_position(X6)))&((~(greater(age(X6,X7),sigma))|~(positional_advantage(X6,X7)))|~(fragile_position(X6))))&((((greater(age(X6,esk1_1(X6)),sigma)|smaller_or_equal(age(X6,esk1_1(X6)),sigma))|fragile_position(X6))&((positional_advantage(X6,esk1_1(X6))|smaller_or_equal(age(X6,esk1_1(X6)),sigma))|fragile_position(X6)))&(((greater(age(X6,esk1_1(X6)),sigma)|~(positional_advantage(X6,esk1_1(X6))))|fragile_position(X6))&((positional_advantage(X6,esk1_1(X6))|~(positional_advantage(X6,esk1_1(X6))))|fragile_position(X6))))),inference(distribute,[status(thm)],[40])).
% cnf(46,plain,(~fragile_position(X1)|~positional_advantage(X1,X2)|~greater(age(X1,X2),sigma)),inference(split_conjunct,[status(thm)],[41])).
% cnf(47,plain,(positional_advantage(X1,X2)|~fragile_position(X1)|~smaller_or_equal(age(X1,X2),sigma)),inference(split_conjunct,[status(thm)],[41])).
% fof(48, plain,![X1]:![X5]:((~(organization(X1))|~(age(X1,X5)=zero))|is_aligned(X1,X5)),inference(fof_nnf,[status(thm)],[5])).
% fof(49, plain,![X6]:![X7]:((~(organization(X6))|~(age(X6,X7)=zero))|is_aligned(X6,X7)),inference(variable_rename,[status(thm)],[48])).
% cnf(50,plain,(is_aligned(X1,X2)|age(X1,X2)!=zero|~organization(X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(51, 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)],[6])).
% fof(52, 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)],[51])).
% fof(53, 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)],[52])).
% cnf(55,plain,(smaller_or_equal(X1,X2)|~smaller(X1,X2)),inference(split_conjunct,[status(thm)],[53])).
% fof(57, plain,![X1]:![X5]:((~(organization(X1))|has_endowment(X1))|~(has_immunity(X1,X5))),inference(fof_nnf,[status(thm)],[21])).
% fof(58, plain,![X6]:![X7]:((~(organization(X6))|has_endowment(X6))|~(has_immunity(X6,X7))),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(has_endowment(X1)|~has_immunity(X1,X2)|~organization(X1)),inference(split_conjunct,[status(thm)],[58])).
% cnf(71,plain,(greater(high,mod2)),inference(split_conjunct,[status(thm)],[13])).
% cnf(72,plain,(greater(mod2,low)),inference(split_conjunct,[status(thm)],[14])).
% fof(73, plain,![X1]:![X2]:((~(smaller(X1,X2))|greater(X2,X1))&(~(greater(X2,X1))|smaller(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(74, plain,![X3]:![X4]:((~(smaller(X3,X4))|greater(X4,X3))&(~(greater(X4,X3))|smaller(X3,X4))),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(smaller(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(77, plain,![X1]:![X4]:![X5]:((~(dissimilar(X1,X4,X5))|(organization(X1)&((~(is_aligned(X1,X4))|~(is_aligned(X1,X5)))&(is_aligned(X1,X4)|is_aligned(X1,X5)))))&((~(organization(X1))|((~(is_aligned(X1,X4))|is_aligned(X1,X5))&(~(is_aligned(X1,X5))|is_aligned(X1,X4))))|dissimilar(X1,X4,X5))),inference(fof_nnf,[status(thm)],[16])).
% fof(78, plain,![X6]:![X7]:![X8]:((~(dissimilar(X6,X7,X8))|(organization(X6)&((~(is_aligned(X6,X7))|~(is_aligned(X6,X8)))&(is_aligned(X6,X7)|is_aligned(X6,X8)))))&((~(organization(X6))|((~(is_aligned(X6,X7))|is_aligned(X6,X8))&(~(is_aligned(X6,X8))|is_aligned(X6,X7))))|dissimilar(X6,X7,X8))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,![X6]:![X7]:![X8]:(((organization(X6)|~(dissimilar(X6,X7,X8)))&(((~(is_aligned(X6,X7))|~(is_aligned(X6,X8)))|~(dissimilar(X6,X7,X8)))&((is_aligned(X6,X7)|is_aligned(X6,X8))|~(dissimilar(X6,X7,X8)))))&((((~(is_aligned(X6,X7))|is_aligned(X6,X8))|~(organization(X6)))|dissimilar(X6,X7,X8))&(((~(is_aligned(X6,X8))|is_aligned(X6,X7))|~(organization(X6)))|dissimilar(X6,X7,X8)))),inference(distribute,[status(thm)],[78])).
% cnf(81,plain,(dissimilar(X1,X2,X3)|is_aligned(X1,X3)|~organization(X1)|~is_aligned(X1,X2)),inference(split_conjunct,[status(thm)],[79])).
% cnf(83,plain,(~dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~is_aligned(X1,X2)),inference(split_conjunct,[status(thm)],[79])).
% cnf(84,plain,(organization(X1)|~dissimilar(X1,X2,X3)),inference(split_conjunct,[status(thm)],[79])).
% fof(85, plain,![X1]:![X5]:(~(organization(X1))|((~(has_immunity(X1,X5))|hazard_of_mortality(X1,X5)=very_low)&(has_immunity(X1,X5)|epred1_2(X1,X5)))),inference(fof_nnf,[status(thm)],[25])).
% fof(86, plain,![X6]:![X7]:(~(organization(X6))|((~(has_immunity(X6,X7))|hazard_of_mortality(X6,X7)=very_low)&(has_immunity(X6,X7)|epred1_2(X6,X7)))),inference(variable_rename,[status(thm)],[85])).
% fof(87, plain,![X6]:![X7]:(((~(has_immunity(X6,X7))|hazard_of_mortality(X6,X7)=very_low)|~(organization(X6)))&((has_immunity(X6,X7)|epred1_2(X6,X7))|~(organization(X6)))),inference(distribute,[status(thm)],[86])).
% cnf(88,plain,(epred1_2(X1,X2)|has_immunity(X1,X2)|~organization(X1)),inference(split_conjunct,[status(thm)],[87])).
% fof(90, negated_conjecture,?[X1]:?[X4]:?[X6]:?[X7]:(((((((organization(X1)&fragile_position(X1))&~(has_endowment(X1)))&age(X1,X4)=zero)&greater(sigma,zero))&smaller_or_equal(age(X1,X6),sigma))&greater(age(X1,X7),sigma))&(~(greater(hazard_of_mortality(X1,X7),hazard_of_mortality(X1,X6)))|~(hazard_of_mortality(X1,X6)=hazard_of_mortality(X1,X4)))),inference(fof_nnf,[status(thm)],[23])).
% fof(91, negated_conjecture,?[X8]:?[X9]:?[X10]:?[X11]:(((((((organization(X8)&fragile_position(X8))&~(has_endowment(X8)))&age(X8,X9)=zero)&greater(sigma,zero))&smaller_or_equal(age(X8,X10),sigma))&greater(age(X8,X11),sigma))&(~(greater(hazard_of_mortality(X8,X11),hazard_of_mortality(X8,X10)))|~(hazard_of_mortality(X8,X10)=hazard_of_mortality(X8,X9)))),inference(variable_rename,[status(thm)],[90])).
% fof(92, negated_conjecture,(((((((organization(esk2_0)&fragile_position(esk2_0))&~(has_endowment(esk2_0)))&age(esk2_0,esk3_0)=zero)&greater(sigma,zero))&smaller_or_equal(age(esk2_0,esk4_0),sigma))&greater(age(esk2_0,esk5_0),sigma))&(~(greater(hazard_of_mortality(esk2_0,esk5_0),hazard_of_mortality(esk2_0,esk4_0)))|~(hazard_of_mortality(esk2_0,esk4_0)=hazard_of_mortality(esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[91])).
% cnf(93,negated_conjecture,(hazard_of_mortality(esk2_0,esk4_0)!=hazard_of_mortality(esk2_0,esk3_0)|~greater(hazard_of_mortality(esk2_0,esk5_0),hazard_of_mortality(esk2_0,esk4_0))),inference(split_conjunct,[status(thm)],[92])).
% cnf(94,negated_conjecture,(greater(age(esk2_0,esk5_0),sigma)),inference(split_conjunct,[status(thm)],[92])).
% cnf(95,negated_conjecture,(smaller_or_equal(age(esk2_0,esk4_0),sigma)),inference(split_conjunct,[status(thm)],[92])).
% cnf(96,negated_conjecture,(greater(sigma,zero)),inference(split_conjunct,[status(thm)],[92])).
% cnf(97,negated_conjecture,(age(esk2_0,esk3_0)=zero),inference(split_conjunct,[status(thm)],[92])).
% cnf(98,negated_conjecture,(~has_endowment(esk2_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(99,negated_conjecture,(fragile_position(esk2_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(100,negated_conjecture,(organization(esk2_0)),inference(split_conjunct,[status(thm)],[92])).
% fof(101, plain,![X5]:![X1]:(~(epred1_2(X1,X5))|(((((~(is_aligned(X1,X5))|~(positional_advantage(X1,X5)))|hazard_of_mortality(X1,X5)=low)&((is_aligned(X1,X5)|~(positional_advantage(X1,X5)))|hazard_of_mortality(X1,X5)=mod1))&((~(is_aligned(X1,X5))|positional_advantage(X1,X5))|hazard_of_mortality(X1,X5)=mod2))&((is_aligned(X1,X5)|positional_advantage(X1,X5))|hazard_of_mortality(X1,X5)=high))),inference(fof_nnf,[status(thm)],[24])).
% fof(102, plain,![X6]:![X7]:(~(epred1_2(X7,X6))|(((((~(is_aligned(X7,X6))|~(positional_advantage(X7,X6)))|hazard_of_mortality(X7,X6)=low)&((is_aligned(X7,X6)|~(positional_advantage(X7,X6)))|hazard_of_mortality(X7,X6)=mod1))&((~(is_aligned(X7,X6))|positional_advantage(X7,X6))|hazard_of_mortality(X7,X6)=mod2))&((is_aligned(X7,X6)|positional_advantage(X7,X6))|hazard_of_mortality(X7,X6)=high))),inference(variable_rename,[status(thm)],[101])).
% fof(103, plain,![X6]:![X7]:((((((~(is_aligned(X7,X6))|~(positional_advantage(X7,X6)))|hazard_of_mortality(X7,X6)=low)|~(epred1_2(X7,X6)))&(((is_aligned(X7,X6)|~(positional_advantage(X7,X6)))|hazard_of_mortality(X7,X6)=mod1)|~(epred1_2(X7,X6))))&(((~(is_aligned(X7,X6))|positional_advantage(X7,X6))|hazard_of_mortality(X7,X6)=mod2)|~(epred1_2(X7,X6))))&(((is_aligned(X7,X6)|positional_advantage(X7,X6))|hazard_of_mortality(X7,X6)=high)|~(epred1_2(X7,X6)))),inference(distribute,[status(thm)],[102])).
% cnf(104,plain,(hazard_of_mortality(X1,X2)=high|positional_advantage(X1,X2)|is_aligned(X1,X2)|~epred1_2(X1,X2)),inference(split_conjunct,[status(thm)],[103])).
% cnf(107,plain,(hazard_of_mortality(X1,X2)=low|~epred1_2(X1,X2)|~positional_advantage(X1,X2)|~is_aligned(X1,X2)),inference(split_conjunct,[status(thm)],[103])).
% cnf(110,plain,(greater(age(X1,X3),sigma)|age(X1,X2)!=zero|~dissimilar(X1,X2,X3)),inference(csr,[status(thm)],[35,84])).
% cnf(116,negated_conjecture,(smaller(zero,sigma)),inference(spm,[status(thm)],[75,96,theory(equality)])).
% cnf(134,plain,(greater(X1,low)|~greater(X1,mod2)),inference(spm,[status(thm)],[31,72,theory(equality)])).
% cnf(141,negated_conjecture,(positional_advantage(esk2_0,esk3_0)|~smaller_or_equal(zero,sigma)|~fragile_position(esk2_0)),inference(spm,[status(thm)],[47,97,theory(equality)])).
% cnf(142,negated_conjecture,(positional_advantage(esk2_0,esk4_0)|~fragile_position(esk2_0)),inference(spm,[status(thm)],[47,95,theory(equality)])).
% cnf(143,negated_conjecture,(positional_advantage(esk2_0,esk3_0)|~smaller_or_equal(zero,sigma)|$false),inference(rw,[status(thm)],[141,99,theory(equality)])).
% cnf(144,negated_conjecture,(positional_advantage(esk2_0,esk3_0)|~smaller_or_equal(zero,sigma)),inference(cn,[status(thm)],[143,theory(equality)])).
% cnf(145,negated_conjecture,(positional_advantage(esk2_0,esk4_0)|$false),inference(rw,[status(thm)],[142,99,theory(equality)])).
% cnf(146,negated_conjecture,(positional_advantage(esk2_0,esk4_0)),inference(cn,[status(thm)],[145,theory(equality)])).
% cnf(147,plain,(has_endowment(X1)|epred1_2(X1,X2)|~organization(X1)),inference(spm,[status(thm)],[59,88,theory(equality)])).
% cnf(150,negated_conjecture,(is_aligned(esk2_0,esk3_0)|~organization(esk2_0)),inference(spm,[status(thm)],[50,97,theory(equality)])).
% cnf(151,negated_conjecture,(is_aligned(esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[150,100,theory(equality)])).
% cnf(152,negated_conjecture,(is_aligned(esk2_0,esk3_0)),inference(cn,[status(thm)],[151,theory(equality)])).
% cnf(153,negated_conjecture,(greater(age(esk2_0,X1),sigma)|~dissimilar(esk2_0,esk3_0,X1)),inference(spm,[status(thm)],[110,97,theory(equality)])).
% cnf(156,negated_conjecture,(dissimilar(esk2_0,esk3_0,X1)|~organization(esk2_0)|~greater(age(esk2_0,X1),sigma)),inference(spm,[status(thm)],[36,97,theory(equality)])).
% cnf(157,negated_conjecture,(dissimilar(esk2_0,esk3_0,X1)|$false|~greater(age(esk2_0,X1),sigma)),inference(rw,[status(thm)],[156,100,theory(equality)])).
% cnf(158,negated_conjecture,(dissimilar(esk2_0,esk3_0,X1)|~greater(age(esk2_0,X1),sigma)),inference(cn,[status(thm)],[157,theory(equality)])).
% cnf(167,negated_conjecture,(smaller_or_equal(zero,sigma)),inference(spm,[status(thm)],[55,116,theory(equality)])).
% cnf(190,negated_conjecture,(is_aligned(esk2_0,X1)|dissimilar(esk2_0,esk3_0,X1)|~organization(esk2_0)),inference(spm,[status(thm)],[81,152,theory(equality)])).
% cnf(192,negated_conjecture,(is_aligned(esk2_0,X1)|dissimilar(esk2_0,esk3_0,X1)|$false),inference(rw,[status(thm)],[190,100,theory(equality)])).
% cnf(193,negated_conjecture,(is_aligned(esk2_0,X1)|dissimilar(esk2_0,esk3_0,X1)),inference(cn,[status(thm)],[192,theory(equality)])).
% cnf(236,negated_conjecture,(positional_advantage(esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[144,167,theory(equality)])).
% cnf(237,negated_conjecture,(positional_advantage(esk2_0,esk3_0)),inference(cn,[status(thm)],[236,theory(equality)])).
% cnf(238,plain,(greater(high,low)),inference(spm,[status(thm)],[134,71,theory(equality)])).
% cnf(388,negated_conjecture,(epred1_2(esk2_0,X1)|~organization(esk2_0)),inference(spm,[status(thm)],[98,147,theory(equality)])).
% cnf(393,negated_conjecture,(epred1_2(esk2_0,X1)|$false),inference(rw,[status(thm)],[388,100,theory(equality)])).
% cnf(394,negated_conjecture,(epred1_2(esk2_0,X1)),inference(cn,[status(thm)],[393,theory(equality)])).
% cnf(395,plain,(hazard_of_mortality(esk2_0,X1)=high|is_aligned(esk2_0,X1)|positional_advantage(esk2_0,X1)),inference(spm,[status(thm)],[104,394,theory(equality)])).
% cnf(398,plain,(hazard_of_mortality(esk2_0,X1)=low|~is_aligned(esk2_0,X1)|~positional_advantage(esk2_0,X1)),inference(spm,[status(thm)],[107,394,theory(equality)])).
% cnf(492,negated_conjecture,(greater(age(esk2_0,X1),sigma)|is_aligned(esk2_0,X1)),inference(spm,[status(thm)],[153,193,theory(equality)])).
% cnf(513,negated_conjecture,(is_aligned(esk2_0,X1)|~positional_advantage(esk2_0,X1)|~fragile_position(esk2_0)),inference(spm,[status(thm)],[46,492,theory(equality)])).
% cnf(516,negated_conjecture,(is_aligned(esk2_0,X1)|~positional_advantage(esk2_0,X1)|$false),inference(rw,[status(thm)],[513,99,theory(equality)])).
% cnf(517,negated_conjecture,(is_aligned(esk2_0,X1)|~positional_advantage(esk2_0,X1)),inference(cn,[status(thm)],[516,theory(equality)])).
% cnf(521,plain,(is_aligned(esk2_0,X1)|hazard_of_mortality(esk2_0,X1)=high),inference(spm,[status(thm)],[517,395,theory(equality)])).
% cnf(526,negated_conjecture,(dissimilar(esk2_0,esk3_0,esk5_0)),inference(spm,[status(thm)],[158,94,theory(equality)])).
% cnf(546,negated_conjecture,(~is_aligned(esk2_0,esk5_0)|~is_aligned(esk2_0,esk3_0)),inference(spm,[status(thm)],[83,526,theory(equality)])).
% cnf(550,negated_conjecture,(~is_aligned(esk2_0,esk5_0)|$false),inference(rw,[status(thm)],[546,152,theory(equality)])).
% cnf(551,negated_conjecture,(~is_aligned(esk2_0,esk5_0)),inference(cn,[status(thm)],[550,theory(equality)])).
% cnf(792,plain,(hazard_of_mortality(esk2_0,X1)=low|~positional_advantage(esk2_0,X1)),inference(csr,[status(thm)],[398,517])).
% cnf(794,negated_conjecture,(hazard_of_mortality(esk2_0,esk4_0)=low),inference(spm,[status(thm)],[792,146,theory(equality)])).
% cnf(795,negated_conjecture,(hazard_of_mortality(esk2_0,esk3_0)=low),inference(spm,[status(thm)],[792,237,theory(equality)])).
% cnf(799,negated_conjecture,(hazard_of_mortality(esk2_0,esk3_0)!=low|~greater(hazard_of_mortality(esk2_0,esk5_0),hazard_of_mortality(esk2_0,esk4_0))),inference(rw,[status(thm)],[93,794,theory(equality)])).
% cnf(800,negated_conjecture,(hazard_of_mortality(esk2_0,esk3_0)!=low|~greater(hazard_of_mortality(esk2_0,esk5_0),low)),inference(rw,[status(thm)],[799,794,theory(equality)])).
% cnf(809,negated_conjecture,($false|~greater(hazard_of_mortality(esk2_0,esk5_0),low)),inference(rw,[status(thm)],[800,795,theory(equality)])).
% cnf(810,negated_conjecture,(~greater(hazard_of_mortality(esk2_0,esk5_0),low)),inference(cn,[status(thm)],[809,theory(equality)])).
% cnf(811,plain,(is_aligned(esk2_0,esk5_0)|~greater(high,low)),inference(spm,[status(thm)],[810,521,theory(equality)])).
% cnf(815,plain,(is_aligned(esk2_0,esk5_0)|$false),inference(rw,[status(thm)],[811,238,theory(equality)])).
% cnf(816,plain,(is_aligned(esk2_0,esk5_0)),inference(cn,[status(thm)],[815,theory(equality)])).
% cnf(817,plain,($false),inference(sr,[status(thm)],[816,551,theory(equality)])).
% cnf(818,plain,($false),817,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 296
% # ...of these trivial : 1
% # ...subsumed : 46
% # ...remaining for further processing: 249
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 1
% # Generated clauses : 500
% # ...of the previous two non-trivial : 370
% # Contextual simplify-reflections : 16
% # Paramodulations : 496
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 200
% # Positive orientable unit clauses: 62
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 16
% # Non-unit-clauses : 122
% # Current number of unprocessed clauses: 161
% # ...number of literals in the above : 615
% # Clause-clause subsumption calls (NU) : 697
% # Rec. Clause-clause subsumption calls : 488
% # Unit Clause-clause subsumption calls : 149
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 178 leaves, 1.08+/-0.389 terms/leaf
% # Paramod-from index: 113 leaves, 1.04+/-0.206 terms/leaf
% # Paramod-into index: 169 leaves, 1.06+/-0.282 terms/leaf
% # -------------------------------------------------
% # User time : 0.040 s
% # System time : 0.005 s
% # Total time : 0.045 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP10322/MGT061+1.tptp
%
%------------------------------------------------------------------------------