TSTP Solution File: MGT027+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : MGT027+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 : art04.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:44 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/SystemOnTPTP18930/MGT027+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP18930/MGT027+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18930/MGT027+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 19026
% 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(1, axiom,![X1]:![X2]:((((environment(X1)&stable(X1))&in_environment(X1,X2))&![X3]:((greater(cardinality_at_time(first_movers,X3),zero)&greater_or_equal(X3,X2))=>greater(zero,growth_rate(first_movers,X3))))=>contracts_from(X2,first_movers)),file('/tmp/SRASS.s.p', mp_contracts_from)).
% fof(2, axiom,![X1]:![X3]:((((environment(X1)&in_environment(X1,X3))&greater(cardinality_at_time(first_movers,X3),zero))&greater(cardinality_at_time(efficient_producers,X3),zero))=>subpopulations(first_movers,efficient_producers,X1,X3)),file('/tmp/SRASS.s.p', mp_non_empty_fm_and_ep)).
% fof(3, axiom,![X1]:![X4]:![X5]:((((environment(X1)&stable(X1))&in_environment(X1,X4))&greater(X5,X4))=>in_environment(X1,X5)),file('/tmp/SRASS.s.p', mp_long_stable_environments)).
% fof(4, axiom,![X1]:((environment(X1)&stable(X1))=>in_environment(X1,appear(efficient_producers,X1))),file('/tmp/SRASS.s.p', mp_EP_in_stable_environments)).
% fof(5, axiom,![X6]:![X7]:![X8]:((greater(X6,X7)&greater(X7,X8))=>greater(X6,X8)),file('/tmp/SRASS.s.p', mp_greater_transitivity)).
% fof(6, axiom,![X1]:![X3]:(((environment(X1)&in_environment(X1,X3))&greater_or_equal(X3,appear(efficient_producers,X1)))=>greater(cardinality_at_time(efficient_producers,X3),zero)),file('/tmp/SRASS.s.p', t6)).
% fof(7, axiom,![X1]:((environment(X1)&stable(X1))=>?[X2]:(greater(X2,appear(efficient_producers,X1))&![X3]:((subpopulations(first_movers,efficient_producers,X1,X3)&greater_or_equal(X3,X2))=>greater(zero,growth_rate(first_movers,X3))))),file('/tmp/SRASS.s.p', l10)).
% fof(8, axiom,![X6]:![X7]:(greater_or_equal(X6,X7)<=>(greater(X6,X7)|X6=X7)),file('/tmp/SRASS.s.p', mp_greater_or_equal)).
% fof(9, conjecture,![X1]:((environment(X1)&stable(X1))=>?[X2]:(greater(X2,appear(efficient_producers,X1))&contracts_from(X2,first_movers))),file('/tmp/SRASS.s.p', prove_l9)).
% fof(10, negated_conjecture,~(![X1]:((environment(X1)&stable(X1))=>?[X2]:(greater(X2,appear(efficient_producers,X1))&contracts_from(X2,first_movers)))),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:![X2]:((((~(environment(X1))|~(stable(X1)))|~(in_environment(X1,X2)))|?[X3]:((greater(cardinality_at_time(first_movers,X3),zero)&greater_or_equal(X3,X2))&~(greater(zero,growth_rate(first_movers,X3)))))|contracts_from(X2,first_movers)),inference(fof_nnf,[status(thm)],[1])).
% fof(12, plain,![X4]:![X5]:((((~(environment(X4))|~(stable(X4)))|~(in_environment(X4,X5)))|?[X6]:((greater(cardinality_at_time(first_movers,X6),zero)&greater_or_equal(X6,X5))&~(greater(zero,growth_rate(first_movers,X6)))))|contracts_from(X5,first_movers)),inference(variable_rename,[status(thm)],[11])).
% fof(13, plain,![X4]:![X5]:((((~(environment(X4))|~(stable(X4)))|~(in_environment(X4,X5)))|((greater(cardinality_at_time(first_movers,esk1_2(X4,X5)),zero)&greater_or_equal(esk1_2(X4,X5),X5))&~(greater(zero,growth_rate(first_movers,esk1_2(X4,X5))))))|contracts_from(X5,first_movers)),inference(skolemize,[status(esa)],[12])).
% fof(14, plain,![X4]:![X5]:((((greater(cardinality_at_time(first_movers,esk1_2(X4,X5)),zero)|((~(environment(X4))|~(stable(X4)))|~(in_environment(X4,X5))))|contracts_from(X5,first_movers))&((greater_or_equal(esk1_2(X4,X5),X5)|((~(environment(X4))|~(stable(X4)))|~(in_environment(X4,X5))))|contracts_from(X5,first_movers)))&((~(greater(zero,growth_rate(first_movers,esk1_2(X4,X5))))|((~(environment(X4))|~(stable(X4)))|~(in_environment(X4,X5))))|contracts_from(X5,first_movers))),inference(distribute,[status(thm)],[13])).
% cnf(15,plain,(contracts_from(X1,first_movers)|~in_environment(X2,X1)|~stable(X2)|~environment(X2)|~greater(zero,growth_rate(first_movers,esk1_2(X2,X1)))),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,plain,(contracts_from(X1,first_movers)|greater_or_equal(esk1_2(X2,X1),X1)|~in_environment(X2,X1)|~stable(X2)|~environment(X2)),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,plain,(contracts_from(X1,first_movers)|greater(cardinality_at_time(first_movers,esk1_2(X2,X1)),zero)|~in_environment(X2,X1)|~stable(X2)|~environment(X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(18, plain,![X1]:![X3]:((((~(environment(X1))|~(in_environment(X1,X3)))|~(greater(cardinality_at_time(first_movers,X3),zero)))|~(greater(cardinality_at_time(efficient_producers,X3),zero)))|subpopulations(first_movers,efficient_producers,X1,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(19, plain,![X4]:![X5]:((((~(environment(X4))|~(in_environment(X4,X5)))|~(greater(cardinality_at_time(first_movers,X5),zero)))|~(greater(cardinality_at_time(efficient_producers,X5),zero)))|subpopulations(first_movers,efficient_producers,X4,X5)),inference(variable_rename,[status(thm)],[18])).
% cnf(20,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)],[19])).
% fof(21, plain,![X1]:![X4]:![X5]:((((~(environment(X1))|~(stable(X1)))|~(in_environment(X1,X4)))|~(greater(X5,X4)))|in_environment(X1,X5)),inference(fof_nnf,[status(thm)],[3])).
% fof(22, plain,![X6]:![X7]:![X8]:((((~(environment(X6))|~(stable(X6)))|~(in_environment(X6,X7)))|~(greater(X8,X7)))|in_environment(X6,X8)),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(in_environment(X1,X2)|~greater(X2,X3)|~in_environment(X1,X3)|~stable(X1)|~environment(X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X1]:((~(environment(X1))|~(stable(X1)))|in_environment(X1,appear(efficient_producers,X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(25, plain,![X2]:((~(environment(X2))|~(stable(X2)))|in_environment(X2,appear(efficient_producers,X2))),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(in_environment(X1,appear(efficient_producers,X1))|~stable(X1)|~environment(X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X6]:![X7]:![X8]:((~(greater(X6,X7))|~(greater(X7,X8)))|greater(X6,X8)),inference(fof_nnf,[status(thm)],[5])).
% fof(28, plain,![X9]:![X10]:![X11]:((~(greater(X9,X10))|~(greater(X10,X11)))|greater(X9,X11)),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X3]:(((~(environment(X1))|~(in_environment(X1,X3)))|~(greater_or_equal(X3,appear(efficient_producers,X1))))|greater(cardinality_at_time(efficient_producers,X3),zero)),inference(fof_nnf,[status(thm)],[6])).
% fof(31, plain,![X4]:![X5]:(((~(environment(X4))|~(in_environment(X4,X5)))|~(greater_or_equal(X5,appear(efficient_producers,X4))))|greater(cardinality_at_time(efficient_producers,X5),zero)),inference(variable_rename,[status(thm)],[30])).
% cnf(32,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)],[31])).
% fof(33, plain,![X1]:((~(environment(X1))|~(stable(X1)))|?[X2]:(greater(X2,appear(efficient_producers,X1))&![X3]:((~(subpopulations(first_movers,efficient_producers,X1,X3))|~(greater_or_equal(X3,X2)))|greater(zero,growth_rate(first_movers,X3))))),inference(fof_nnf,[status(thm)],[7])).
% fof(34, plain,![X4]:((~(environment(X4))|~(stable(X4)))|?[X5]:(greater(X5,appear(efficient_producers,X4))&![X6]:((~(subpopulations(first_movers,efficient_producers,X4,X6))|~(greater_or_equal(X6,X5)))|greater(zero,growth_rate(first_movers,X6))))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X4]:((~(environment(X4))|~(stable(X4)))|(greater(esk2_1(X4),appear(efficient_producers,X4))&![X6]:((~(subpopulations(first_movers,efficient_producers,X4,X6))|~(greater_or_equal(X6,esk2_1(X4))))|greater(zero,growth_rate(first_movers,X6))))),inference(skolemize,[status(esa)],[34])).
% fof(36, plain,![X4]:![X6]:((((~(subpopulations(first_movers,efficient_producers,X4,X6))|~(greater_or_equal(X6,esk2_1(X4))))|greater(zero,growth_rate(first_movers,X6)))&greater(esk2_1(X4),appear(efficient_producers,X4)))|(~(environment(X4))|~(stable(X4)))),inference(shift_quantors,[status(thm)],[35])).
% fof(37, plain,![X4]:![X6]:((((~(subpopulations(first_movers,efficient_producers,X4,X6))|~(greater_or_equal(X6,esk2_1(X4))))|greater(zero,growth_rate(first_movers,X6)))|(~(environment(X4))|~(stable(X4))))&(greater(esk2_1(X4),appear(efficient_producers,X4))|(~(environment(X4))|~(stable(X4))))),inference(distribute,[status(thm)],[36])).
% cnf(38,plain,(greater(esk2_1(X1),appear(efficient_producers,X1))|~stable(X1)|~environment(X1)),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,plain,(greater(zero,growth_rate(first_movers,X2))|~stable(X1)|~environment(X1)|~greater_or_equal(X2,esk2_1(X1))|~subpopulations(first_movers,efficient_producers,X1,X2)),inference(split_conjunct,[status(thm)],[37])).
% fof(40, plain,![X6]:![X7]:((~(greater_or_equal(X6,X7))|(greater(X6,X7)|X6=X7))&((~(greater(X6,X7))&~(X6=X7))|greater_or_equal(X6,X7))),inference(fof_nnf,[status(thm)],[8])).
% fof(41, plain,![X8]:![X9]:((~(greater_or_equal(X8,X9))|(greater(X8,X9)|X8=X9))&((~(greater(X8,X9))&~(X8=X9))|greater_or_equal(X8,X9))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X8]:![X9]:((~(greater_or_equal(X8,X9))|(greater(X8,X9)|X8=X9))&((~(greater(X8,X9))|greater_or_equal(X8,X9))&(~(X8=X9)|greater_or_equal(X8,X9)))),inference(distribute,[status(thm)],[41])).
% cnf(43,plain,(greater_or_equal(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,plain,(greater_or_equal(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[42])).
% cnf(45,plain,(X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2)),inference(split_conjunct,[status(thm)],[42])).
% fof(46, negated_conjecture,?[X1]:((environment(X1)&stable(X1))&![X2]:(~(greater(X2,appear(efficient_producers,X1)))|~(contracts_from(X2,first_movers)))),inference(fof_nnf,[status(thm)],[10])).
% fof(47, negated_conjecture,?[X3]:((environment(X3)&stable(X3))&![X4]:(~(greater(X4,appear(efficient_producers,X3)))|~(contracts_from(X4,first_movers)))),inference(variable_rename,[status(thm)],[46])).
% fof(48, negated_conjecture,((environment(esk3_0)&stable(esk3_0))&![X4]:(~(greater(X4,appear(efficient_producers,esk3_0)))|~(contracts_from(X4,first_movers)))),inference(skolemize,[status(esa)],[47])).
% fof(49, negated_conjecture,![X4]:((~(greater(X4,appear(efficient_producers,esk3_0)))|~(contracts_from(X4,first_movers)))&(environment(esk3_0)&stable(esk3_0))),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,negated_conjecture,(stable(esk3_0)),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,negated_conjecture,(environment(esk3_0)),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,negated_conjecture,(~contracts_from(X1,first_movers)|~greater(X1,appear(efficient_producers,esk3_0))),inference(split_conjunct,[status(thm)],[49])).
% cnf(53,plain,(greater_or_equal(X1,X1)),inference(er,[status(thm)],[43,theory(equality)])).
% cnf(55,plain,(greater(X1,appear(efficient_producers,X2))|~greater(X1,esk2_1(X2))|~stable(X2)|~environment(X2)),inference(spm,[status(thm)],[29,38,theory(equality)])).
% cnf(56,negated_conjecture,(~contracts_from(esk2_1(esk3_0),first_movers)|~stable(esk3_0)|~environment(esk3_0)),inference(spm,[status(thm)],[52,38,theory(equality)])).
% cnf(57,negated_conjecture,(~contracts_from(esk2_1(esk3_0),first_movers)|$false|~environment(esk3_0)),inference(rw,[status(thm)],[56,50,theory(equality)])).
% cnf(58,negated_conjecture,(~contracts_from(esk2_1(esk3_0),first_movers)|$false|$false),inference(rw,[status(thm)],[57,51,theory(equality)])).
% cnf(59,negated_conjecture,(~contracts_from(esk2_1(esk3_0),first_movers)),inference(cn,[status(thm)],[58,theory(equality)])).
% cnf(60,plain,(in_environment(X1,esk2_1(X2))|~in_environment(X1,appear(efficient_producers,X2))|~stable(X1)|~environment(X1)|~stable(X2)|~environment(X2)),inference(spm,[status(thm)],[23,38,theory(equality)])).
% cnf(61,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)],[32,44,theory(equality)])).
% cnf(64,plain,(esk1_2(X1,X2)=X2|greater(esk1_2(X1,X2),X2)|contracts_from(X2,first_movers)|~in_environment(X1,X2)|~stable(X1)|~environment(X1)),inference(spm,[status(thm)],[45,16,theory(equality)])).
% cnf(67,plain,(greater(zero,growth_rate(first_movers,esk1_2(X1,esk2_1(X2))))|contracts_from(esk2_1(X2),first_movers)|~subpopulations(first_movers,efficient_producers,X2,esk1_2(X1,esk2_1(X2)))|~stable(X2)|~environment(X2)|~in_environment(X1,esk2_1(X2))|~stable(X1)|~environment(X1)),inference(spm,[status(thm)],[39,16,theory(equality)])).
% cnf(69,plain,(greater(zero,growth_rate(first_movers,esk2_1(X1)))|~subpopulations(first_movers,efficient_producers,X1,esk2_1(X1))|~stable(X1)|~environment(X1)),inference(spm,[status(thm)],[39,53,theory(equality)])).
% cnf(73,plain,(greater(cardinality_at_time(efficient_producers,esk2_1(X1)),zero)|~in_environment(X1,esk2_1(X1))|~environment(X1)|~stable(X1)),inference(spm,[status(thm)],[61,38,theory(equality)])).
% cnf(74,plain,(greater(esk1_2(X1,esk2_1(X2)),appear(efficient_producers,X2))|esk1_2(X1,esk2_1(X2))=esk2_1(X2)|contracts_from(esk2_1(X2),first_movers)|~stable(X2)|~environment(X2)|~in_environment(X1,esk2_1(X2))|~stable(X1)|~environment(X1)),inference(spm,[status(thm)],[55,64,theory(equality)])).
% cnf(81,plain,(greater(cardinality_at_time(efficient_producers,esk2_1(X1)),zero)|~stable(X1)|~environment(X1)|~in_environment(X1,appear(efficient_producers,X1))),inference(spm,[status(thm)],[73,60,theory(equality)])).
% cnf(82,plain,(greater(cardinality_at_time(efficient_producers,esk2_1(X1)),zero)|~stable(X1)|~environment(X1)),inference(csr,[status(thm)],[81,26])).
% cnf(88,plain,(greater(zero,growth_rate(first_movers,esk2_1(X1)))|~stable(X1)|~environment(X1)|~greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)|~greater(cardinality_at_time(efficient_producers,esk2_1(X1)),zero)|~in_environment(X1,esk2_1(X1))),inference(spm,[status(thm)],[69,20,theory(equality)])).
% cnf(89,plain,(contracts_from(esk2_1(X2),first_movers)|~subpopulations(first_movers,efficient_producers,X2,esk1_2(X1,esk2_1(X2)))|~in_environment(X1,esk2_1(X2))|~stable(X2)|~stable(X1)|~environment(X2)|~environment(X1)),inference(csr,[status(thm)],[67,15])).
% cnf(90,plain,(contracts_from(esk2_1(X1),first_movers)|~in_environment(X2,esk2_1(X1))|~stable(X1)|~stable(X2)|~environment(X1)|~environment(X2)|~greater(cardinality_at_time(first_movers,esk1_2(X2,esk2_1(X1))),zero)|~greater(cardinality_at_time(efficient_producers,esk1_2(X2,esk2_1(X1))),zero)|~in_environment(X1,esk1_2(X2,esk2_1(X1)))),inference(spm,[status(thm)],[89,20,theory(equality)])).
% cnf(94,plain,(in_environment(X1,esk1_2(X2,esk2_1(X3)))|esk1_2(X2,esk2_1(X3))=esk2_1(X3)|contracts_from(esk2_1(X3),first_movers)|~in_environment(X1,appear(efficient_producers,X3))|~stable(X1)|~environment(X1)|~in_environment(X2,esk2_1(X3))|~stable(X3)|~stable(X2)|~environment(X3)|~environment(X2)),inference(spm,[status(thm)],[23,74,theory(equality)])).
% cnf(96,plain,(greater(cardinality_at_time(efficient_producers,esk1_2(X1,esk2_1(X2))),zero)|esk1_2(X1,esk2_1(X2))=esk2_1(X2)|contracts_from(esk2_1(X2),first_movers)|~in_environment(X2,esk1_2(X1,esk2_1(X2)))|~environment(X2)|~in_environment(X1,esk2_1(X2))|~stable(X2)|~stable(X1)|~environment(X1)),inference(spm,[status(thm)],[61,74,theory(equality)])).
% cnf(101,plain,(greater(zero,growth_rate(first_movers,esk2_1(X1)))|~greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)|~in_environment(X1,esk2_1(X1))|~stable(X1)|~environment(X1)),inference(csr,[status(thm)],[88,82])).
% cnf(102,plain,(greater(zero,growth_rate(first_movers,esk2_1(X1)))|~greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)|~stable(X1)|~environment(X1)|~in_environment(X1,appear(efficient_producers,X1))),inference(spm,[status(thm)],[101,60,theory(equality)])).
% cnf(103,plain,(greater(zero,growth_rate(first_movers,esk2_1(X1)))|~greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)|~stable(X1)|~environment(X1)),inference(csr,[status(thm)],[102,26])).
% cnf(127,plain,(esk1_2(X1,esk2_1(X2))=esk2_1(X2)|contracts_from(esk2_1(X2),first_movers)|greater(cardinality_at_time(efficient_producers,esk1_2(X1,esk2_1(X2))),zero)|~in_environment(X1,esk2_1(X2))|~stable(X2)|~stable(X1)|~environment(X2)|~environment(X1)|~in_environment(X2,appear(efficient_producers,X2))),inference(spm,[status(thm)],[96,94,theory(equality)])).
% cnf(129,plain,(esk1_2(X1,esk2_1(X2))=esk2_1(X2)|contracts_from(esk2_1(X2),first_movers)|greater(cardinality_at_time(efficient_producers,esk1_2(X1,esk2_1(X2))),zero)|~in_environment(X1,esk2_1(X2))|~stable(X2)|~stable(X1)|~environment(X2)|~environment(X1)),inference(csr,[status(thm)],[127,26])).
% cnf(134,plain,(contracts_from(esk2_1(X1),first_movers)|~greater(cardinality_at_time(efficient_producers,esk1_2(X2,esk2_1(X1))),zero)|~in_environment(X1,esk1_2(X2,esk2_1(X1)))|~in_environment(X2,esk2_1(X1))|~stable(X1)|~stable(X2)|~environment(X1)|~environment(X2)),inference(csr,[status(thm)],[90,17])).
% cnf(135,plain,(contracts_from(esk2_1(X1),first_movers)|esk1_2(X2,esk2_1(X1))=esk2_1(X1)|~in_environment(X1,esk1_2(X2,esk2_1(X1)))|~in_environment(X2,esk2_1(X1))|~stable(X1)|~stable(X2)|~environment(X1)|~environment(X2)),inference(spm,[status(thm)],[134,129,theory(equality)])).
% cnf(140,plain,(esk1_2(X1,esk2_1(X2))=esk2_1(X2)|contracts_from(esk2_1(X2),first_movers)|~in_environment(X1,esk2_1(X2))|~stable(X2)|~stable(X1)|~environment(X2)|~environment(X1)|~in_environment(X2,appear(efficient_producers,X2))),inference(spm,[status(thm)],[135,94,theory(equality)])).
% cnf(141,plain,(esk1_2(X1,esk2_1(X2))=esk2_1(X2)|contracts_from(esk2_1(X2),first_movers)|~in_environment(X1,esk2_1(X2))|~stable(X2)|~stable(X1)|~environment(X2)|~environment(X1)),inference(csr,[status(thm)],[140,26])).
% cnf(143,plain,(contracts_from(esk2_1(X1),first_movers)|greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)|~in_environment(X2,esk2_1(X1))|~stable(X2)|~environment(X2)|~stable(X1)|~environment(X1)),inference(spm,[status(thm)],[17,141,theory(equality)])).
% cnf(144,plain,(contracts_from(esk2_1(X1),first_movers)|~greater(zero,growth_rate(first_movers,esk2_1(X1)))|~in_environment(X2,esk2_1(X1))|~stable(X2)|~environment(X2)|~stable(X1)|~environment(X1)),inference(spm,[status(thm)],[15,141,theory(equality)])).
% cnf(152,plain,(contracts_from(esk2_1(X1),first_movers)|greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)|~stable(X2)|~stable(X1)|~environment(X2)|~environment(X1)|~in_environment(X2,appear(efficient_producers,X1))),inference(spm,[status(thm)],[143,60,theory(equality)])).
% cnf(153,plain,(contracts_from(esk2_1(X1),first_movers)|greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)|~stable(X1)|~environment(X1)),inference(spm,[status(thm)],[152,26,theory(equality)])).
% cnf(163,plain,(contracts_from(esk2_1(X1),first_movers)|~in_environment(X2,esk2_1(X1))|~stable(X2)|~stable(X1)|~environment(X2)|~environment(X1)|~greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)),inference(spm,[status(thm)],[144,103,theory(equality)])).
% cnf(164,plain,(contracts_from(esk2_1(X1),first_movers)|~in_environment(X2,esk2_1(X1))|~stable(X2)|~stable(X1)|~environment(X2)|~environment(X1)),inference(csr,[status(thm)],[163,153])).
% cnf(165,plain,(contracts_from(esk2_1(X1),first_movers)|~stable(X2)|~stable(X1)|~environment(X2)|~environment(X1)|~in_environment(X2,appear(efficient_producers,X1))),inference(spm,[status(thm)],[164,60,theory(equality)])).
% cnf(166,plain,(contracts_from(esk2_1(X1),first_movers)|~stable(X1)|~environment(X1)),inference(spm,[status(thm)],[165,26,theory(equality)])).
% cnf(167,negated_conjecture,(~stable(esk3_0)|~environment(esk3_0)),inference(spm,[status(thm)],[59,166,theory(equality)])).
% cnf(168,negated_conjecture,($false|~environment(esk3_0)),inference(rw,[status(thm)],[167,50,theory(equality)])).
% cnf(169,negated_conjecture,($false|$false),inference(rw,[status(thm)],[168,51,theory(equality)])).
% cnf(170,negated_conjecture,($false),inference(cn,[status(thm)],[169,theory(equality)])).
% cnf(171,negated_conjecture,($false),170,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 94
% # ...of these trivial                : 0
% # ...subsumed                        : 1
% # ...remaining for further processing: 93
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 21
% # Backward-rewritten                 : 0
% # Generated clauses                  : 97
% # ...of the previous two non-trivial : 94
% # Contextual simplify-reflections    : 10
% # Paramodulations                    : 96
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 55
% #    Positive orientable unit clauses: 3
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 51
% # Current number of unprocessed clauses: 17
% # ...number of literals in the above : 202
% # Clause-clause subsumption calls (NU) : 485
% # Rec. Clause-clause subsumption calls : 132
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 5
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    86 leaves,   1.73+/-1.125 terms/leaf
% # Paramod-from index:           22 leaves,   1.14+/-0.457 terms/leaf
% # Paramod-into index:           64 leaves,   1.44+/-0.864 terms/leaf
% # -------------------------------------------------
% # User time              : 0.024 s
% # System time            : 0.004 s
% # Total time             : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP18930/MGT027+1.tptp
% 
%------------------------------------------------------------------------------