TSTP Solution File: MGT039+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT039+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 16:12:51 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP15103/MGT039+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15103/MGT039+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15103/MGT039+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 15235
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:((observational_period(X1)&slow_change(X1))=>![X2]:((environment(X2)&in_environment(X1,X2))=>?[X3]:(in_environment(X2,X3)&greater(X3,critical_point(X2))))),file('/tmp/SRASS.s.p', mp4_critical_point)).
% fof(2, axiom,![X4]:![X5]:![X6]:((greater(X4,X5)&greater(X5,X6))=>greater(X4,X6)),file('/tmp/SRASS.s.p', mp_greater_transitivity)).
% fof(3, axiom,![X2]:![X3]:(((environment(X2)&in_environment(X2,X3))&greater(X3,critical_point(X2)))=>selection_favors(efficient_producers,first_movers,X3)),file('/tmp/SRASS.s.p', l8)).
% fof(4, axiom,![X1]:((((observational_period(X1)&propagation_strategy(first_movers))&propagation_strategy(efficient_producers))&![X2]:((environment(X2)&in_environment(X1,X2))=>selection_favors(efficient_producers,first_movers,end_time(X2))))=>selection_favors(efficient_producers,first_movers,X1)),file('/tmp/SRASS.s.p', mp3_favoured_trategy)).
% fof(5, axiom,propagation_strategy(first_movers),file('/tmp/SRASS.s.p', mp_organizational_sets1)).
% fof(6, axiom,propagation_strategy(efficient_producers),file('/tmp/SRASS.s.p', mp_organizational_sets2)).
% fof(7, axiom,![X2]:(environment(X2)=>greater_or_equal(critical_point(X2),start_time(X2))),file('/tmp/SRASS.s.p', mp_time_of_critical_point)).
% fof(8, axiom,![X2]:![X3]:((environment(X2)&in_environment(X2,X3))=>greater_or_equal(end_time(X2),X3)),file('/tmp/SRASS.s.p', mp_environment_end_point)).
% fof(10, axiom,![X4]:![X5]:(greater_or_equal(X4,X5)<=>(greater(X4,X5)|X4=X5)),file('/tmp/SRASS.s.p', mp_greater_or_equal)).
% fof(11, axiom,![X2]:![X3]:(((environment(X2)&greater_or_equal(X3,start_time(X2)))&greater_or_equal(end_time(X2),X3))=>in_environment(X2,X3)),file('/tmp/SRASS.s.p', mp_time_in_environment)).
% fof(12, conjecture,![X1]:((observational_period(X1)&slow_change(X1))=>selection_favors(efficient_producers,first_movers,X1)),file('/tmp/SRASS.s.p', prove_t8)).
% fof(13, negated_conjecture,~(![X1]:((observational_period(X1)&slow_change(X1))=>selection_favors(efficient_producers,first_movers,X1))),inference(assume_negation,[status(cth)],[12])).
% fof(15, plain,![X1]:((~(observational_period(X1))|~(slow_change(X1)))|![X2]:((~(environment(X2))|~(in_environment(X1,X2)))|?[X3]:(in_environment(X2,X3)&greater(X3,critical_point(X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(16, plain,![X4]:((~(observational_period(X4))|~(slow_change(X4)))|![X5]:((~(environment(X5))|~(in_environment(X4,X5)))|?[X6]:(in_environment(X5,X6)&greater(X6,critical_point(X5))))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X4]:((~(observational_period(X4))|~(slow_change(X4)))|![X5]:((~(environment(X5))|~(in_environment(X4,X5)))|(in_environment(X5,esk1_2(X4,X5))&greater(esk1_2(X4,X5),critical_point(X5))))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X4]:![X5]:(((~(environment(X5))|~(in_environment(X4,X5)))|(in_environment(X5,esk1_2(X4,X5))&greater(esk1_2(X4,X5),critical_point(X5))))|(~(observational_period(X4))|~(slow_change(X4)))),inference(shift_quantors,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:(((in_environment(X5,esk1_2(X4,X5))|(~(environment(X5))|~(in_environment(X4,X5))))|(~(observational_period(X4))|~(slow_change(X4))))&((greater(esk1_2(X4,X5),critical_point(X5))|(~(environment(X5))|~(in_environment(X4,X5))))|(~(observational_period(X4))|~(slow_change(X4))))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(greater(esk1_2(X1,X2),critical_point(X2))|~slow_change(X1)|~observational_period(X1)|~in_environment(X1,X2)|~environment(X2)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(in_environment(X2,esk1_2(X1,X2))|~slow_change(X1)|~observational_period(X1)|~in_environment(X1,X2)|~environment(X2)),inference(split_conjunct,[status(thm)],[19])).
% fof(22, plain,![X4]:![X5]:![X6]:((~(greater(X4,X5))|~(greater(X5,X6)))|greater(X4,X6)),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X7]:![X8]:![X9]:((~(greater(X7,X8))|~(greater(X8,X9)))|greater(X7,X9)),inference(variable_rename,[status(thm)],[22])).
% cnf(24,plain,(greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X2]:![X3]:(((~(environment(X2))|~(in_environment(X2,X3)))|~(greater(X3,critical_point(X2))))|selection_favors(efficient_producers,first_movers,X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(26, plain,![X4]:![X5]:(((~(environment(X4))|~(in_environment(X4,X5)))|~(greater(X5,critical_point(X4))))|selection_favors(efficient_producers,first_movers,X5)),inference(variable_rename,[status(thm)],[25])).
% cnf(27,plain,(selection_favors(efficient_producers,first_movers,X1)|~greater(X1,critical_point(X2))|~in_environment(X2,X1)|~environment(X2)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X1]:((((~(observational_period(X1))|~(propagation_strategy(first_movers)))|~(propagation_strategy(efficient_producers)))|?[X2]:((environment(X2)&in_environment(X1,X2))&~(selection_favors(efficient_producers,first_movers,end_time(X2)))))|selection_favors(efficient_producers,first_movers,X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(29, plain,![X3]:((((~(observational_period(X3))|~(propagation_strategy(first_movers)))|~(propagation_strategy(efficient_producers)))|?[X4]:((environment(X4)&in_environment(X3,X4))&~(selection_favors(efficient_producers,first_movers,end_time(X4)))))|selection_favors(efficient_producers,first_movers,X3)),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X3]:((((~(observational_period(X3))|~(propagation_strategy(first_movers)))|~(propagation_strategy(efficient_producers)))|((environment(esk2_1(X3))&in_environment(X3,esk2_1(X3)))&~(selection_favors(efficient_producers,first_movers,end_time(esk2_1(X3))))))|selection_favors(efficient_producers,first_movers,X3)),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X3]:((((environment(esk2_1(X3))|((~(observational_period(X3))|~(propagation_strategy(first_movers)))|~(propagation_strategy(efficient_producers))))|selection_favors(efficient_producers,first_movers,X3))&((in_environment(X3,esk2_1(X3))|((~(observational_period(X3))|~(propagation_strategy(first_movers)))|~(propagation_strategy(efficient_producers))))|selection_favors(efficient_producers,first_movers,X3)))&((~(selection_favors(efficient_producers,first_movers,end_time(esk2_1(X3))))|((~(observational_period(X3))|~(propagation_strategy(first_movers)))|~(propagation_strategy(efficient_producers))))|selection_favors(efficient_producers,first_movers,X3))),inference(distribute,[status(thm)],[30])).
% cnf(32,plain,(selection_favors(efficient_producers,first_movers,X1)|~propagation_strategy(efficient_producers)|~propagation_strategy(first_movers)|~observational_period(X1)|~selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,plain,(selection_favors(efficient_producers,first_movers,X1)|in_environment(X1,esk2_1(X1))|~propagation_strategy(efficient_producers)|~propagation_strategy(first_movers)|~observational_period(X1)),inference(split_conjunct,[status(thm)],[31])).
% cnf(34,plain,(selection_favors(efficient_producers,first_movers,X1)|environment(esk2_1(X1))|~propagation_strategy(efficient_producers)|~propagation_strategy(first_movers)|~observational_period(X1)),inference(split_conjunct,[status(thm)],[31])).
% cnf(35,plain,(propagation_strategy(first_movers)),inference(split_conjunct,[status(thm)],[5])).
% cnf(36,plain,(propagation_strategy(efficient_producers)),inference(split_conjunct,[status(thm)],[6])).
% fof(37, plain,![X2]:(~(environment(X2))|greater_or_equal(critical_point(X2),start_time(X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(38, plain,![X3]:(~(environment(X3))|greater_or_equal(critical_point(X3),start_time(X3))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(greater_or_equal(critical_point(X1),start_time(X1))|~environment(X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:![X3]:((~(environment(X2))|~(in_environment(X2,X3)))|greater_or_equal(end_time(X2),X3)),inference(fof_nnf,[status(thm)],[8])).
% fof(41, plain,![X4]:![X5]:((~(environment(X4))|~(in_environment(X4,X5)))|greater_or_equal(end_time(X4),X5)),inference(variable_rename,[status(thm)],[40])).
% cnf(42,plain,(greater_or_equal(end_time(X1),X2)|~in_environment(X1,X2)|~environment(X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(46, plain,![X4]:![X5]:((~(greater_or_equal(X4,X5))|(greater(X4,X5)|X4=X5))&((~(greater(X4,X5))&~(X4=X5))|greater_or_equal(X4,X5))),inference(fof_nnf,[status(thm)],[10])).
% fof(47, plain,![X6]:![X7]:((~(greater_or_equal(X6,X7))|(greater(X6,X7)|X6=X7))&((~(greater(X6,X7))&~(X6=X7))|greater_or_equal(X6,X7))),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,![X6]:![X7]:((~(greater_or_equal(X6,X7))|(greater(X6,X7)|X6=X7))&((~(greater(X6,X7))|greater_or_equal(X6,X7))&(~(X6=X7)|greater_or_equal(X6,X7)))),inference(distribute,[status(thm)],[47])).
% cnf(49,plain,(greater_or_equal(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(greater_or_equal(X1,X2)|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,plain,(X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% fof(52, plain,![X2]:![X3]:(((~(environment(X2))|~(greater_or_equal(X3,start_time(X2))))|~(greater_or_equal(end_time(X2),X3)))|in_environment(X2,X3)),inference(fof_nnf,[status(thm)],[11])).
% fof(53, plain,![X4]:![X5]:(((~(environment(X4))|~(greater_or_equal(X5,start_time(X4))))|~(greater_or_equal(end_time(X4),X5)))|in_environment(X4,X5)),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(in_environment(X1,X2)|~greater_or_equal(end_time(X1),X2)|~greater_or_equal(X2,start_time(X1))|~environment(X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(55, negated_conjecture,?[X1]:((observational_period(X1)&slow_change(X1))&~(selection_favors(efficient_producers,first_movers,X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(56, negated_conjecture,?[X2]:((observational_period(X2)&slow_change(X2))&~(selection_favors(efficient_producers,first_movers,X2))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,((observational_period(esk3_0)&slow_change(esk3_0))&~(selection_favors(efficient_producers,first_movers,esk3_0))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(~selection_favors(efficient_producers,first_movers,esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(slow_change(esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(60,negated_conjecture,(observational_period(esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(61,plain,(greater_or_equal(X1,X1)),inference(er,[status(thm)],[49,theory(equality)])).
% cnf(62,plain,(environment(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1)|$false|~propagation_strategy(first_movers)),inference(rw,[status(thm)],[34,36,theory(equality)])).
% cnf(63,plain,(environment(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1)|$false|$false),inference(rw,[status(thm)],[62,35,theory(equality)])).
% cnf(64,plain,(environment(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1)),inference(cn,[status(thm)],[63,theory(equality)])).
% cnf(65,plain,(in_environment(X1,esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1)|$false|~propagation_strategy(first_movers)),inference(rw,[status(thm)],[33,36,theory(equality)])).
% cnf(66,plain,(in_environment(X1,esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1)|$false|$false),inference(rw,[status(thm)],[65,35,theory(equality)])).
% cnf(67,plain,(in_environment(X1,esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1)),inference(cn,[status(thm)],[66,theory(equality)])).
% cnf(68,plain,(selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1)|$false|~propagation_strategy(first_movers)|~selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))),inference(rw,[status(thm)],[32,36,theory(equality)])).
% cnf(69,plain,(selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1)|$false|$false|~selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))),inference(rw,[status(thm)],[68,35,theory(equality)])).
% cnf(70,plain,(selection_favors(efficient_producers,first_movers,X1)|~observational_period(X1)|~selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))),inference(cn,[status(thm)],[69,theory(equality)])).
% cnf(72,plain,(critical_point(X1)=start_time(X1)|greater(critical_point(X1),start_time(X1))|~environment(X1)),inference(spm,[status(thm)],[51,39,theory(equality)])).
% cnf(73,plain,(end_time(X1)=X2|greater(end_time(X1),X2)|~in_environment(X1,X2)|~environment(X1)),inference(spm,[status(thm)],[51,42,theory(equality)])).
% cnf(74,plain,(in_environment(X1,end_time(X2))|~greater_or_equal(end_time(X1),end_time(X2))|~environment(X1)|~in_environment(X2,start_time(X1))|~environment(X2)),inference(spm,[status(thm)],[54,42,theory(equality)])).
% cnf(75,plain,(in_environment(X1,critical_point(X1))|~greater_or_equal(end_time(X1),critical_point(X1))|~environment(X1)),inference(spm,[status(thm)],[54,39,theory(equality)])).
% cnf(76,plain,(in_environment(X1,X2)|~greater_or_equal(end_time(X1),X2)|~environment(X1)|~greater(X2,start_time(X1))),inference(spm,[status(thm)],[54,50,theory(equality)])).
% cnf(80,plain,(greater(X1,critical_point(X2))|~greater(X1,esk1_2(X3,X2))|~in_environment(X3,X2)|~environment(X2)|~slow_change(X3)|~observational_period(X3)),inference(spm,[status(thm)],[24,20,theory(equality)])).
% cnf(81,plain,(selection_favors(efficient_producers,first_movers,esk1_2(X1,X2))|~in_environment(X2,esk1_2(X1,X2))|~environment(X2)|~in_environment(X1,X2)|~slow_change(X1)|~observational_period(X1)),inference(spm,[status(thm)],[27,20,theory(equality)])).
% cnf(82,plain,(greater(X1,start_time(X2))|start_time(X2)=critical_point(X2)|~greater(X1,critical_point(X2))|~environment(X2)),inference(spm,[status(thm)],[24,72,theory(equality)])).
% cnf(85,plain,(in_environment(X1,critical_point(X1))|~environment(X1)|~greater(end_time(X1),critical_point(X1))),inference(spm,[status(thm)],[75,50,theory(equality)])).
% cnf(93,plain,(in_environment(X1,end_time(X1))|~in_environment(X1,start_time(X1))|~environment(X1)),inference(spm,[status(thm)],[74,61,theory(equality)])).
% cnf(98,plain,(in_environment(X1,end_time(X1))|~greater(end_time(X1),start_time(X1))|~environment(X1)),inference(spm,[status(thm)],[76,61,theory(equality)])).
% cnf(107,plain,(in_environment(X1,end_time(X1))|start_time(X1)=critical_point(X1)|~environment(X1)|~greater(end_time(X1),critical_point(X1))),inference(spm,[status(thm)],[98,82,theory(equality)])).
% cnf(117,plain,(greater(end_time(X1),critical_point(X2))|end_time(X1)=esk1_2(X3,X2)|~in_environment(X3,X2)|~environment(X2)|~slow_change(X3)|~observational_period(X3)|~in_environment(X1,esk1_2(X3,X2))|~environment(X1)),inference(spm,[status(thm)],[80,73,theory(equality)])).
% cnf(128,plain,(selection_favors(efficient_producers,first_movers,esk1_2(X1,X2))|~in_environment(X1,X2)|~environment(X2)|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[81,21])).
% cnf(186,plain,(end_time(X1)=esk1_2(X2,X1)|greater(end_time(X1),critical_point(X1))|~in_environment(X2,X1)|~environment(X1)|~slow_change(X2)|~observational_period(X2)),inference(spm,[status(thm)],[117,21,theory(equality)])).
% cnf(187,plain,(esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|greater(end_time(esk2_1(X1)),critical_point(esk2_1(X1)))|selection_favors(efficient_producers,first_movers,X1)|~environment(esk2_1(X1))|~slow_change(X1)|~observational_period(X1)),inference(spm,[status(thm)],[186,67,theory(equality)])).
% cnf(190,plain,(esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|greater(end_time(esk2_1(X1)),critical_point(esk2_1(X1)))|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[187,64])).
% cnf(192,plain,(selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))|esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~in_environment(esk2_1(X1),end_time(esk2_1(X1)))|~environment(esk2_1(X1))|~slow_change(X1)|~observational_period(X1)),inference(spm,[status(thm)],[27,190,theory(equality)])).
% cnf(199,plain,(in_environment(esk2_1(X1),critical_point(esk2_1(X1)))|esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~environment(esk2_1(X1))|~slow_change(X1)|~observational_period(X1)),inference(spm,[status(thm)],[85,190,theory(equality)])).
% cnf(201,plain,(start_time(esk2_1(X1))=critical_point(esk2_1(X1))|in_environment(esk2_1(X1),end_time(esk2_1(X1)))|esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~environment(esk2_1(X1))|~slow_change(X1)|~observational_period(X1)),inference(spm,[status(thm)],[107,190,theory(equality)])).
% cnf(202,plain,(esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|in_environment(esk2_1(X1),critical_point(esk2_1(X1)))|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[199,64])).
% cnf(217,plain,(esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))|selection_favors(efficient_producers,first_movers,X1)|~in_environment(esk2_1(X1),end_time(esk2_1(X1)))|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[192,64])).
% cnf(218,plain,(esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~in_environment(esk2_1(X1),end_time(esk2_1(X1)))|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[217,70])).
% cnf(237,plain,(esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|start_time(esk2_1(X1))=critical_point(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|in_environment(esk2_1(X1),end_time(esk2_1(X1)))|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[201,64])).
% cnf(238,plain,(esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|start_time(esk2_1(X1))=critical_point(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[237,218])).
% cnf(240,plain,(selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))|start_time(esk2_1(X1))=critical_point(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~in_environment(X1,esk2_1(X1))|~environment(esk2_1(X1))|~slow_change(X1)|~observational_period(X1)),inference(spm,[status(thm)],[128,238,theory(equality)])).
% cnf(253,plain,(start_time(esk2_1(X1))=critical_point(esk2_1(X1))|selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))|selection_favors(efficient_producers,first_movers,X1)|~in_environment(X1,esk2_1(X1))|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[240,64])).
% cnf(254,plain,(start_time(esk2_1(X1))=critical_point(esk2_1(X1))|selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))|selection_favors(efficient_producers,first_movers,X1)|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[253,67])).
% cnf(255,plain,(start_time(esk2_1(X1))=critical_point(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[254,70])).
% cnf(262,plain,(in_environment(esk2_1(X1),end_time(esk2_1(X1)))|selection_favors(efficient_producers,first_movers,X1)|~in_environment(esk2_1(X1),critical_point(esk2_1(X1)))|~environment(esk2_1(X1))|~slow_change(X1)|~observational_period(X1)),inference(spm,[status(thm)],[93,255,theory(equality)])).
% cnf(271,plain,(selection_favors(efficient_producers,first_movers,X1)|in_environment(esk2_1(X1),end_time(esk2_1(X1)))|~in_environment(esk2_1(X1),critical_point(esk2_1(X1)))|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[262,64])).
% cnf(272,plain,(selection_favors(efficient_producers,first_movers,X1)|in_environment(esk2_1(X1),end_time(esk2_1(X1)))|esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|~slow_change(X1)|~observational_period(X1)),inference(spm,[status(thm)],[271,202,theory(equality)])).
% cnf(273,plain,(esk1_2(X1,esk2_1(X1))=end_time(esk2_1(X1))|selection_favors(efficient_producers,first_movers,X1)|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[272,218])).
% cnf(275,plain,(selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))|selection_favors(efficient_producers,first_movers,X1)|~in_environment(X1,esk2_1(X1))|~environment(esk2_1(X1))|~slow_change(X1)|~observational_period(X1)),inference(spm,[status(thm)],[128,273,theory(equality)])).
% cnf(287,plain,(selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))|selection_favors(efficient_producers,first_movers,X1)|~in_environment(X1,esk2_1(X1))|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[275,64])).
% cnf(288,plain,(selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))|selection_favors(efficient_producers,first_movers,X1)|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[287,67])).
% cnf(289,plain,(selection_favors(efficient_producers,first_movers,X1)|~slow_change(X1)|~observational_period(X1)),inference(csr,[status(thm)],[288,70])).
% cnf(290,negated_conjecture,(selection_favors(efficient_producers,first_movers,esk3_0)|~observational_period(esk3_0)),inference(spm,[status(thm)],[289,59,theory(equality)])).
% cnf(291,negated_conjecture,(selection_favors(efficient_producers,first_movers,esk3_0)|$false),inference(rw,[status(thm)],[290,60,theory(equality)])).
% cnf(292,negated_conjecture,(selection_favors(efficient_producers,first_movers,esk3_0)),inference(cn,[status(thm)],[291,theory(equality)])).
% cnf(293,negated_conjecture,($false),inference(sr,[status(thm)],[292,58,theory(equality)])).
% cnf(294,negated_conjecture,($false),293,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 119
% # ...of these trivial : 0
% # ...subsumed : 14
% # ...remaining for further processing: 105
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 0
% # Generated clauses : 175
% # ...of the previous two non-trivial : 161
% # Contextual simplify-reflections : 45
% # Paramodulations : 174
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 75
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 69
% # Current number of unprocessed clauses: 31
% # ...number of literals in the above : 288
% # Clause-clause subsumption calls (NU) : 543
% # Rec. Clause-clause subsumption calls : 190
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 53 leaves, 1.89+/-1.176 terms/leaf
% # Paramod-from index: 21 leaves, 1.05+/-0.213 terms/leaf
% # Paramod-into index: 46 leaves, 1.41+/-0.796 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.003 s
% # Total time : 0.030 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP15103/MGT039+1.tptp
%
%------------------------------------------------------------------------------