TSTP Solution File: MGT026+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT026+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 : art07.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:05:35 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP439/MGT026+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP439/MGT026+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP439/MGT026+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 541
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:(((environment(X1)&subpopulations(X2,X3,X1,X4))&greater(growth_rate(X3,X4),growth_rate(X2,X4)))=>selection_favors(X3,X2,X4)),file('/tmp/SRASS.s.p', mp1_high_growth_rates)).
% fof(2, axiom,![X1]:![X4]:((((environment(X1)&in_environment(X1,X4))&greater(cardinality_at_time(first_movers,X4),zero))&greater(cardinality_at_time(efficient_producers,X4),zero))=>subpopulations(first_movers,efficient_producers,X1,X4)),file('/tmp/SRASS.s.p', mp_non_empty_fm_and_ep)).
% fof(3, axiom,![X1]:![X4]:((environment(X1)&in_environment(X1,X4))=>greater_or_equal(cardinality_at_time(first_movers,X4),zero)),file('/tmp/SRASS.s.p', mp_first_movers_exist)).
% fof(4, axiom,![X1]:(environment(X1)=>greater_or_equal(critical_point(X1),appear(efficient_producers,X1))),file('/tmp/SRASS.s.p', mp_critical_point_after_EP)).
% fof(5, axiom,![X5]:![X6]:![X7]:((greater(X5,X6)&greater(X6,X7))=>greater(X5,X7)),file('/tmp/SRASS.s.p', mp_greater_transitivity)).
% fof(6, axiom,![X5]:![X6]:(greater_or_equal(X5,X6)<=>(greater(X5,X6)|X5=X6)),file('/tmp/SRASS.s.p', mp_greater_or_equal)).
% fof(7, axiom,![X1]:![X8]:((environment(X1)&X8=critical_point(X1))=>(~(greater(growth_rate(efficient_producers,X8),growth_rate(first_movers,X8)))&![X4]:((subpopulations(first_movers,efficient_producers,X1,X4)&greater(X4,X8))=>greater(growth_rate(efficient_producers,X4),growth_rate(first_movers,X4))))),file('/tmp/SRASS.s.p', d1)).
% fof(8, axiom,![X1]:![X4]:(((environment(X1)&in_environment(X1,X4))&greater_or_equal(X4,appear(efficient_producers,X1)))=>greater(cardinality_at_time(efficient_producers,X4),zero)),file('/tmp/SRASS.s.p', t6)).
% fof(9, axiom,![X1]:![X2]:![X3]:![X4]:(((((environment(X1)&subpopulation(X2,X1,X4))&subpopulation(X3,X1,X4))&greater(cardinality_at_time(X2,X4),zero))&cardinality_at_time(X3,X4)=zero)=>selection_favors(X2,X3,X4)),file('/tmp/SRASS.s.p', mp2_favour_members)).
% fof(10, axiom,![X1]:![X4]:((environment(X1)&in_environment(X1,X4))=>(subpopulation(first_movers,X1,X4)&subpopulation(efficient_producers,X1,X4))),file('/tmp/SRASS.s.p', mp_subpopulations)).
% fof(11, conjecture,![X1]:![X4]:(((environment(X1)&in_environment(X1,X4))&greater(X4,critical_point(X1)))=>selection_favors(efficient_producers,first_movers,X4)),file('/tmp/SRASS.s.p', prove_l8)).
% fof(12, negated_conjecture,~(![X1]:![X4]:(((environment(X1)&in_environment(X1,X4))&greater(X4,critical_point(X1)))=>selection_favors(efficient_producers,first_movers,X4))),inference(assume_negation,[status(cth)],[11])).
% fof(13, plain,![X1]:![X8]:((environment(X1)&X8=critical_point(X1))=>(~(greater(growth_rate(efficient_producers,X8),growth_rate(first_movers,X8)))&![X4]:((subpopulations(first_movers,efficient_producers,X1,X4)&greater(X4,X8))=>greater(growth_rate(efficient_producers,X4),growth_rate(first_movers,X4))))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(14, plain,![X1]:![X2]:![X3]:![X4]:(((~(environment(X1))|~(subpopulations(X2,X3,X1,X4)))|~(greater(growth_rate(X3,X4),growth_rate(X2,X4))))|selection_favors(X3,X2,X4)),inference(fof_nnf,[status(thm)],[1])).
% fof(15, plain,![X5]:![X6]:![X7]:![X8]:(((~(environment(X5))|~(subpopulations(X6,X7,X5,X8)))|~(greater(growth_rate(X7,X8),growth_rate(X6,X8))))|selection_favors(X7,X6,X8)),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(selection_favors(X1,X2,X3)|~greater(growth_rate(X1,X3),growth_rate(X2,X3))|~subpopulations(X2,X1,X4,X3)|~environment(X4)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X1]:![X4]:((((~(environment(X1))|~(in_environment(X1,X4)))|~(greater(cardinality_at_time(first_movers,X4),zero)))|~(greater(cardinality_at_time(efficient_producers,X4),zero)))|subpopulations(first_movers,efficient_producers,X1,X4)),inference(fof_nnf,[status(thm)],[2])).
% fof(18, plain,![X5]:![X6]:((((~(environment(X5))|~(in_environment(X5,X6)))|~(greater(cardinality_at_time(first_movers,X6),zero)))|~(greater(cardinality_at_time(efficient_producers,X6),zero)))|subpopulations(first_movers,efficient_producers,X5,X6)),inference(variable_rename,[status(thm)],[17])).
% cnf(19,plain,(subpopulations(first_movers,efficient_producers,X1,X2)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~greater(cardinality_at_time(first_movers,X2),zero)|~in_environment(X1,X2)|~environment(X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X1]:![X4]:((~(environment(X1))|~(in_environment(X1,X4)))|greater_or_equal(cardinality_at_time(first_movers,X4),zero)),inference(fof_nnf,[status(thm)],[3])).
% fof(21, plain,![X5]:![X6]:((~(environment(X5))|~(in_environment(X5,X6)))|greater_or_equal(cardinality_at_time(first_movers,X6),zero)),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(greater_or_equal(cardinality_at_time(first_movers,X1),zero)|~in_environment(X2,X1)|~environment(X2)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X1]:(~(environment(X1))|greater_or_equal(critical_point(X1),appear(efficient_producers,X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(24, plain,![X2]:(~(environment(X2))|greater_or_equal(critical_point(X2),appear(efficient_producers,X2))),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(greater_or_equal(critical_point(X1),appear(efficient_producers,X1))|~environment(X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:((~(greater(X5,X6))|~(greater(X6,X7)))|greater(X5,X7)),inference(fof_nnf,[status(thm)],[5])).
% fof(27, plain,![X8]:![X9]:![X10]:((~(greater(X8,X9))|~(greater(X9,X10)))|greater(X8,X10)),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X5]:![X6]:((~(greater_or_equal(X5,X6))|(greater(X5,X6)|X5=X6))&((~(greater(X5,X6))&~(X5=X6))|greater_or_equal(X5,X6))),inference(fof_nnf,[status(thm)],[6])).
% fof(30, plain,![X7]:![X8]:((~(greater_or_equal(X7,X8))|(greater(X7,X8)|X7=X8))&((~(greater(X7,X8))&~(X7=X8))|greater_or_equal(X7,X8))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X7]:![X8]:((~(greater_or_equal(X7,X8))|(greater(X7,X8)|X7=X8))&((~(greater(X7,X8))|greater_or_equal(X7,X8))&(~(X7=X8)|greater_or_equal(X7,X8)))),inference(distribute,[status(thm)],[30])).
% cnf(33,plain,(greater_or_equal(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[31])).
% cnf(34,plain,(X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2)),inference(split_conjunct,[status(thm)],[31])).
% fof(35, plain,![X1]:![X8]:((~(environment(X1))|~(X8=critical_point(X1)))|(~(greater(growth_rate(efficient_producers,X8),growth_rate(first_movers,X8)))&![X4]:((~(subpopulations(first_movers,efficient_producers,X1,X4))|~(greater(X4,X8)))|greater(growth_rate(efficient_producers,X4),growth_rate(first_movers,X4))))),inference(fof_nnf,[status(thm)],[13])).
% fof(36, plain,![X9]:![X10]:((~(environment(X9))|~(X10=critical_point(X9)))|(~(greater(growth_rate(efficient_producers,X10),growth_rate(first_movers,X10)))&![X11]:((~(subpopulations(first_movers,efficient_producers,X9,X11))|~(greater(X11,X10)))|greater(growth_rate(efficient_producers,X11),growth_rate(first_movers,X11))))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X9]:![X10]:![X11]:((((~(subpopulations(first_movers,efficient_producers,X9,X11))|~(greater(X11,X10)))|greater(growth_rate(efficient_producers,X11),growth_rate(first_movers,X11)))&~(greater(growth_rate(efficient_producers,X10),growth_rate(first_movers,X10))))|(~(environment(X9))|~(X10=critical_point(X9)))),inference(shift_quantors,[status(thm)],[36])).
% fof(38, plain,![X9]:![X10]:![X11]:((((~(subpopulations(first_movers,efficient_producers,X9,X11))|~(greater(X11,X10)))|greater(growth_rate(efficient_producers,X11),growth_rate(first_movers,X11)))|(~(environment(X9))|~(X10=critical_point(X9))))&(~(greater(growth_rate(efficient_producers,X10),growth_rate(first_movers,X10)))|(~(environment(X9))|~(X10=critical_point(X9))))),inference(distribute,[status(thm)],[37])).
% cnf(40,plain,(greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3))|X1!=critical_point(X2)|~environment(X2)|~greater(X3,X1)|~subpopulations(first_movers,efficient_producers,X2,X3)),inference(split_conjunct,[status(thm)],[38])).
% fof(41, plain,![X1]:![X4]:(((~(environment(X1))|~(in_environment(X1,X4)))|~(greater_or_equal(X4,appear(efficient_producers,X1))))|greater(cardinality_at_time(efficient_producers,X4),zero)),inference(fof_nnf,[status(thm)],[8])).
% fof(42, plain,![X5]:![X6]:(((~(environment(X5))|~(in_environment(X5,X6)))|~(greater_or_equal(X6,appear(efficient_producers,X5))))|greater(cardinality_at_time(efficient_producers,X6),zero)),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(greater(cardinality_at_time(efficient_producers,X1),zero)|~greater_or_equal(X1,appear(efficient_producers,X2))|~in_environment(X2,X1)|~environment(X2)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X1]:![X2]:![X3]:![X4]:(((((~(environment(X1))|~(subpopulation(X2,X1,X4)))|~(subpopulation(X3,X1,X4)))|~(greater(cardinality_at_time(X2,X4),zero)))|~(cardinality_at_time(X3,X4)=zero))|selection_favors(X2,X3,X4)),inference(fof_nnf,[status(thm)],[9])).
% fof(45, plain,![X5]:![X6]:![X7]:![X8]:(((((~(environment(X5))|~(subpopulation(X6,X5,X8)))|~(subpopulation(X7,X5,X8)))|~(greater(cardinality_at_time(X6,X8),zero)))|~(cardinality_at_time(X7,X8)=zero))|selection_favors(X6,X7,X8)),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(selection_favors(X1,X2,X3)|cardinality_at_time(X2,X3)!=zero|~greater(cardinality_at_time(X1,X3),zero)|~subpopulation(X2,X4,X3)|~subpopulation(X1,X4,X3)|~environment(X4)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X1]:![X4]:((~(environment(X1))|~(in_environment(X1,X4)))|(subpopulation(first_movers,X1,X4)&subpopulation(efficient_producers,X1,X4))),inference(fof_nnf,[status(thm)],[10])).
% fof(48, plain,![X5]:![X6]:((~(environment(X5))|~(in_environment(X5,X6)))|(subpopulation(first_movers,X5,X6)&subpopulation(efficient_producers,X5,X6))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X5]:![X6]:((subpopulation(first_movers,X5,X6)|(~(environment(X5))|~(in_environment(X5,X6))))&(subpopulation(efficient_producers,X5,X6)|(~(environment(X5))|~(in_environment(X5,X6))))),inference(distribute,[status(thm)],[48])).
% cnf(50,plain,(subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1)),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(52, negated_conjecture,?[X1]:?[X4]:(((environment(X1)&in_environment(X1,X4))&greater(X4,critical_point(X1)))&~(selection_favors(efficient_producers,first_movers,X4))),inference(fof_nnf,[status(thm)],[12])).
% fof(53, negated_conjecture,?[X5]:?[X6]:(((environment(X5)&in_environment(X5,X6))&greater(X6,critical_point(X5)))&~(selection_favors(efficient_producers,first_movers,X6))),inference(variable_rename,[status(thm)],[52])).
% fof(54, negated_conjecture,(((environment(esk1_0)&in_environment(esk1_0,esk2_0))&greater(esk2_0,critical_point(esk1_0)))&~(selection_favors(efficient_producers,first_movers,esk2_0))),inference(skolemize,[status(esa)],[53])).
% cnf(55,negated_conjecture,(~selection_favors(efficient_producers,first_movers,esk2_0)),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,negated_conjecture,(greater(esk2_0,critical_point(esk1_0))),inference(split_conjunct,[status(thm)],[54])).
% cnf(57,negated_conjecture,(in_environment(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[54])).
% cnf(58,negated_conjecture,(environment(esk1_0)),inference(split_conjunct,[status(thm)],[54])).
% cnf(61,plain,(critical_point(X1)=appear(efficient_producers,X1)|greater(critical_point(X1),appear(efficient_producers,X1))|~environment(X1)),inference(spm,[status(thm)],[34,25,theory(equality)])).
% cnf(63,negated_conjecture,(greater_or_equal(cardinality_at_time(first_movers,esk2_0),zero)|~environment(esk1_0)),inference(spm,[status(thm)],[22,57,theory(equality)])).
% cnf(64,negated_conjecture,(greater_or_equal(cardinality_at_time(first_movers,esk2_0),zero)|$false),inference(rw,[status(thm)],[63,58,theory(equality)])).
% cnf(65,negated_conjecture,(greater_or_equal(cardinality_at_time(first_movers,esk2_0),zero)),inference(cn,[status(thm)],[64,theory(equality)])).
% cnf(67,plain,(greater(cardinality_at_time(efficient_producers,X1),zero)|~in_environment(X2,X1)|~environment(X2)|~greater(X1,appear(efficient_producers,X2))),inference(spm,[status(thm)],[43,33,theory(equality)])).
% cnf(69,plain,(greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|critical_point(X2)!=X3|~greater(X1,X3)|~environment(X2)|~in_environment(X2,X1)|~greater(cardinality_at_time(first_movers,X1),zero)|~greater(cardinality_at_time(efficient_producers,X1),zero)),inference(spm,[status(thm)],[40,19,theory(equality)])).
% cnf(71,plain,(selection_favors(X1,first_movers,X2)|cardinality_at_time(first_movers,X2)!=zero|~subpopulation(X1,X3,X2)|~greater(cardinality_at_time(X1,X2),zero)|~environment(X3)|~in_environment(X3,X2)),inference(spm,[status(thm)],[46,51,theory(equality)])).
% cnf(72,negated_conjecture,(cardinality_at_time(first_movers,esk2_0)=zero|greater(cardinality_at_time(first_movers,esk2_0),zero)),inference(spm,[status(thm)],[34,65,theory(equality)])).
% cnf(75,plain,(greater(X1,appear(efficient_producers,X2))|appear(efficient_producers,X2)=critical_point(X2)|~greater(X1,critical_point(X2))|~environment(X2)),inference(spm,[status(thm)],[28,61,theory(equality)])).
% cnf(78,plain,(greater(cardinality_at_time(efficient_producers,X1),zero)|appear(efficient_producers,X2)=critical_point(X2)|~in_environment(X2,X1)|~environment(X2)|~greater(X1,critical_point(X2))),inference(spm,[status(thm)],[67,75,theory(equality)])).
% cnf(91,negated_conjecture,(greater(growth_rate(efficient_producers,esk2_0),growth_rate(first_movers,esk2_0))|critical_point(esk1_0)!=X1|~greater(cardinality_at_time(first_movers,esk2_0),zero)|~greater(cardinality_at_time(efficient_producers,esk2_0),zero)|~greater(esk2_0,X1)|~environment(esk1_0)),inference(spm,[status(thm)],[69,57,theory(equality)])).
% cnf(92,negated_conjecture,(greater(growth_rate(efficient_producers,esk2_0),growth_rate(first_movers,esk2_0))|critical_point(esk1_0)!=X1|~greater(cardinality_at_time(first_movers,esk2_0),zero)|~greater(cardinality_at_time(efficient_producers,esk2_0),zero)|~greater(esk2_0,X1)|$false),inference(rw,[status(thm)],[91,58,theory(equality)])).
% cnf(93,negated_conjecture,(greater(growth_rate(efficient_producers,esk2_0),growth_rate(first_movers,esk2_0))|critical_point(esk1_0)!=X1|~greater(cardinality_at_time(first_movers,esk2_0),zero)|~greater(cardinality_at_time(efficient_producers,esk2_0),zero)|~greater(esk2_0,X1)),inference(cn,[status(thm)],[92,theory(equality)])).
% cnf(110,negated_conjecture,(appear(efficient_producers,esk1_0)=critical_point(esk1_0)|greater(cardinality_at_time(efficient_producers,esk2_0),zero)|~in_environment(esk1_0,esk2_0)|~environment(esk1_0)),inference(spm,[status(thm)],[78,56,theory(equality)])).
% cnf(112,negated_conjecture,(appear(efficient_producers,esk1_0)=critical_point(esk1_0)|greater(cardinality_at_time(efficient_producers,esk2_0),zero)|$false|~environment(esk1_0)),inference(rw,[status(thm)],[110,57,theory(equality)])).
% cnf(113,negated_conjecture,(appear(efficient_producers,esk1_0)=critical_point(esk1_0)|greater(cardinality_at_time(efficient_producers,esk2_0),zero)|$false|$false),inference(rw,[status(thm)],[112,58,theory(equality)])).
% cnf(114,negated_conjecture,(appear(efficient_producers,esk1_0)=critical_point(esk1_0)|greater(cardinality_at_time(efficient_producers,esk2_0),zero)),inference(cn,[status(thm)],[113,theory(equality)])).
% cnf(122,negated_conjecture,(greater(cardinality_at_time(efficient_producers,X1),zero)|greater(cardinality_at_time(efficient_producers,esk2_0),zero)|~in_environment(esk1_0,X1)|~greater(X1,critical_point(esk1_0))|~environment(esk1_0)),inference(spm,[status(thm)],[67,114,theory(equality)])).
% cnf(130,negated_conjecture,(greater(cardinality_at_time(efficient_producers,X1),zero)|greater(cardinality_at_time(efficient_producers,esk2_0),zero)|~in_environment(esk1_0,X1)|~greater(X1,critical_point(esk1_0))|$false),inference(rw,[status(thm)],[122,58,theory(equality)])).
% cnf(131,negated_conjecture,(greater(cardinality_at_time(efficient_producers,X1),zero)|greater(cardinality_at_time(efficient_producers,esk2_0),zero)|~in_environment(esk1_0,X1)|~greater(X1,critical_point(esk1_0))),inference(cn,[status(thm)],[130,theory(equality)])).
% cnf(138,plain,(selection_favors(efficient_producers,first_movers,X1)|cardinality_at_time(first_movers,X1)!=zero|~in_environment(X2,X1)|~greater(cardinality_at_time(efficient_producers,X1),zero)|~environment(X2)),inference(spm,[status(thm)],[71,50,theory(equality)])).
% cnf(143,negated_conjecture,(selection_favors(efficient_producers,first_movers,esk2_0)|cardinality_at_time(first_movers,esk2_0)!=zero|~greater(cardinality_at_time(efficient_producers,esk2_0),zero)|~environment(esk1_0)),inference(spm,[status(thm)],[138,57,theory(equality)])).
% cnf(144,negated_conjecture,(selection_favors(efficient_producers,first_movers,esk2_0)|cardinality_at_time(first_movers,esk2_0)!=zero|~greater(cardinality_at_time(efficient_producers,esk2_0),zero)|$false),inference(rw,[status(thm)],[143,58,theory(equality)])).
% cnf(145,negated_conjecture,(selection_favors(efficient_producers,first_movers,esk2_0)|cardinality_at_time(first_movers,esk2_0)!=zero|~greater(cardinality_at_time(efficient_producers,esk2_0),zero)),inference(cn,[status(thm)],[144,theory(equality)])).
% cnf(146,negated_conjecture,(cardinality_at_time(first_movers,esk2_0)!=zero|~greater(cardinality_at_time(efficient_producers,esk2_0),zero)),inference(sr,[status(thm)],[145,55,theory(equality)])).
% cnf(150,negated_conjecture,(greater(cardinality_at_time(efficient_producers,esk2_0),zero)|~in_environment(esk1_0,esk2_0)),inference(spm,[status(thm)],[131,56,theory(equality)])).
% cnf(152,negated_conjecture,(greater(cardinality_at_time(efficient_producers,esk2_0),zero)|$false),inference(rw,[status(thm)],[150,57,theory(equality)])).
% cnf(153,negated_conjecture,(greater(cardinality_at_time(efficient_producers,esk2_0),zero)),inference(cn,[status(thm)],[152,theory(equality)])).
% cnf(155,negated_conjecture,(cardinality_at_time(first_movers,esk2_0)!=zero|$false),inference(rw,[status(thm)],[146,153,theory(equality)])).
% cnf(156,negated_conjecture,(cardinality_at_time(first_movers,esk2_0)!=zero),inference(cn,[status(thm)],[155,theory(equality)])).
% cnf(164,negated_conjecture,(greater(cardinality_at_time(first_movers,esk2_0),zero)),inference(sr,[status(thm)],[72,156,theory(equality)])).
% cnf(170,negated_conjecture,(greater(growth_rate(efficient_producers,esk2_0),growth_rate(first_movers,esk2_0))|critical_point(esk1_0)!=X1|$false|~greater(cardinality_at_time(efficient_producers,esk2_0),zero)|~greater(esk2_0,X1)),inference(rw,[status(thm)],[93,164,theory(equality)])).
% cnf(171,negated_conjecture,(greater(growth_rate(efficient_producers,esk2_0),growth_rate(first_movers,esk2_0))|critical_point(esk1_0)!=X1|$false|$false|~greater(esk2_0,X1)),inference(rw,[status(thm)],[170,153,theory(equality)])).
% cnf(172,negated_conjecture,(greater(growth_rate(efficient_producers,esk2_0),growth_rate(first_movers,esk2_0))|critical_point(esk1_0)!=X1|~greater(esk2_0,X1)),inference(cn,[status(thm)],[171,theory(equality)])).
% cnf(176,negated_conjecture,(greater(growth_rate(efficient_producers,esk2_0),growth_rate(first_movers,esk2_0))),inference(spm,[status(thm)],[172,56,theory(equality)])).
% cnf(178,negated_conjecture,(selection_favors(efficient_producers,first_movers,esk2_0)|~subpopulations(first_movers,efficient_producers,X1,esk2_0)|~environment(X1)),inference(spm,[status(thm)],[16,176,theory(equality)])).
% cnf(181,negated_conjecture,(~subpopulations(first_movers,efficient_producers,X1,esk2_0)|~environment(X1)),inference(sr,[status(thm)],[178,55,theory(equality)])).
% cnf(185,negated_conjecture,(~environment(X1)|~in_environment(X1,esk2_0)|~greater(cardinality_at_time(first_movers,esk2_0),zero)|~greater(cardinality_at_time(efficient_producers,esk2_0),zero)),inference(spm,[status(thm)],[181,19,theory(equality)])).
% cnf(186,negated_conjecture,(~environment(X1)|~in_environment(X1,esk2_0)|$false|~greater(cardinality_at_time(efficient_producers,esk2_0),zero)),inference(rw,[status(thm)],[185,164,theory(equality)])).
% cnf(187,negated_conjecture,(~environment(X1)|~in_environment(X1,esk2_0)|$false|$false),inference(rw,[status(thm)],[186,153,theory(equality)])).
% cnf(188,negated_conjecture,(~environment(X1)|~in_environment(X1,esk2_0)),inference(cn,[status(thm)],[187,theory(equality)])).
% cnf(189,negated_conjecture,(~environment(esk1_0)),inference(spm,[status(thm)],[188,57,theory(equality)])).
% cnf(190,negated_conjecture,($false),inference(rw,[status(thm)],[189,58,theory(equality)])).
% cnf(191,negated_conjecture,($false),inference(cn,[status(thm)],[190,theory(equality)])).
% cnf(192,negated_conjecture,($false),191,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 93
% # ...of these trivial : 0
% # ...subsumed : 7
% # ...remaining for further processing: 86
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 10
% # Generated clauses : 65
% # ...of the previous two non-trivial : 64
% # Contextual simplify-reflections : 1
% # Paramodulations : 63
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 50
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 40
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 10
% # Clause-clause subsumption calls (NU) : 113
% # Rec. Clause-clause subsumption calls : 83
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 70 leaves, 1.46+/-0.731 terms/leaf
% # Paramod-from index: 19 leaves, 1.05+/-0.223 terms/leaf
% # Paramod-into index: 50 leaves, 1.16+/-0.418 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.003 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP439/MGT026+1.tptp
%
%------------------------------------------------------------------------------