TSTP Solution File: MGT036+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT036+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 : art02.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:07:09 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP3986/MGT036+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP3986/MGT036+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3986/MGT036+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 4082
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>subpopulations(efficient_producers,first_movers,X1,X2)),file('/tmp/SRASS.s.p', mp_symmetry_of_FM_and_EP)).
% fof(2, axiom,![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>in_environment(X1,X2)),file('/tmp/SRASS.s.p', mp_time_point_occur)).
% fof(3, axiom,![X1]:![X3]:![X4]:![X2]:(((environment(X1)&subpopulations(X3,X4,X1,X2))=>greater_or_equal(growth_rate(X3,X2),zero))<=>~(greater(zero,growth_rate(X3,X2)))),file('/tmp/SRASS.s.p', mp_growth_rate_relationships)).
% fof(4, axiom,![X1]:![X3]:![X4]:![X2]:((environment(X1)&subpopulations(X3,X4,X1,X2))=>((greater_or_equal(growth_rate(X4,X2),zero)&greater(zero,growth_rate(X3,X2)))<=>outcompetes(X4,X3,X2))),file('/tmp/SRASS.s.p', d2)).
% fof(5, axiom,![X1]:![X3]:![X4]:![X2]:((((environment(X1)&in_environment(X1,X2))&~(greater(zero,growth_rate(X3,X2))))&greater(resilience(X4),resilience(X3)))=>~(greater(zero,growth_rate(X4,X2)))),file('/tmp/SRASS.s.p', a12)).
% fof(6, axiom,greater(resilience(efficient_producers),resilience(first_movers)),file('/tmp/SRASS.s.p', a2)).
% fof(7, conjecture,![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>~(outcompetes(first_movers,efficient_producers,X2))),file('/tmp/SRASS.s.p', prove_t5)).
% fof(8, negated_conjecture,~(![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>~(outcompetes(first_movers,efficient_producers,X2)))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:![X3]:![X4]:![X2]:(((environment(X1)&subpopulations(X3,X4,X1,X2))=>greater_or_equal(growth_rate(X3,X2),zero))<=>~(greater(zero,growth_rate(X3,X2)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(10, plain,![X1]:![X3]:![X4]:![X2]:((((environment(X1)&in_environment(X1,X2))&~(greater(zero,growth_rate(X3,X2))))&greater(resilience(X4),resilience(X3)))=>~(greater(zero,growth_rate(X4,X2)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(11, negated_conjecture,~(![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>~(outcompetes(first_movers,efficient_producers,X2)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(12, plain,![X1]:![X2]:((~(environment(X1))|~(subpopulations(first_movers,efficient_producers,X1,X2)))|subpopulations(efficient_producers,first_movers,X1,X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(13, plain,![X3]:![X4]:((~(environment(X3))|~(subpopulations(first_movers,efficient_producers,X3,X4)))|subpopulations(efficient_producers,first_movers,X3,X4)),inference(variable_rename,[status(thm)],[12])).
% cnf(14,plain,(subpopulations(efficient_producers,first_movers,X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1)),inference(split_conjunct,[status(thm)],[13])).
% fof(15, plain,![X1]:![X2]:((~(environment(X1))|~(subpopulations(first_movers,efficient_producers,X1,X2)))|in_environment(X1,X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(16, plain,![X3]:![X4]:((~(environment(X3))|~(subpopulations(first_movers,efficient_producers,X3,X4)))|in_environment(X3,X4)),inference(variable_rename,[status(thm)],[15])).
% cnf(17,plain,(in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X1]:![X3]:![X4]:![X2]:((((environment(X1)&subpopulations(X3,X4,X1,X2))&~(greater_or_equal(growth_rate(X3,X2),zero)))|~(greater(zero,growth_rate(X3,X2))))&(greater(zero,growth_rate(X3,X2))|((~(environment(X1))|~(subpopulations(X3,X4,X1,X2)))|greater_or_equal(growth_rate(X3,X2),zero)))),inference(fof_nnf,[status(thm)],[9])).
% fof(19, plain,![X5]:![X6]:![X7]:![X8]:((((environment(X5)&subpopulations(X6,X7,X5,X8))&~(greater_or_equal(growth_rate(X6,X8),zero)))|~(greater(zero,growth_rate(X6,X8))))&(greater(zero,growth_rate(X6,X8))|((~(environment(X5))|~(subpopulations(X6,X7,X5,X8)))|greater_or_equal(growth_rate(X6,X8),zero)))),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X5]:![X6]:![X7]:![X8]:((((environment(X5)|~(greater(zero,growth_rate(X6,X8))))&(subpopulations(X6,X7,X5,X8)|~(greater(zero,growth_rate(X6,X8)))))&(~(greater_or_equal(growth_rate(X6,X8),zero))|~(greater(zero,growth_rate(X6,X8)))))&(greater(zero,growth_rate(X6,X8))|((~(environment(X5))|~(subpopulations(X6,X7,X5,X8)))|greater_or_equal(growth_rate(X6,X8),zero)))),inference(distribute,[status(thm)],[19])).
% cnf(22,plain,(~greater(zero,growth_rate(X1,X2))|~greater_or_equal(growth_rate(X1,X2),zero)),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,plain,(subpopulations(X1,X3,X4,X2)|~greater(zero,growth_rate(X1,X2))),inference(split_conjunct,[status(thm)],[20])).
% cnf(24,plain,(environment(X3)|~greater(zero,growth_rate(X1,X2))),inference(split_conjunct,[status(thm)],[20])).
% fof(25, plain,![X1]:![X3]:![X4]:![X2]:((~(environment(X1))|~(subpopulations(X3,X4,X1,X2)))|(((~(greater_or_equal(growth_rate(X4,X2),zero))|~(greater(zero,growth_rate(X3,X2))))|outcompetes(X4,X3,X2))&(~(outcompetes(X4,X3,X2))|(greater_or_equal(growth_rate(X4,X2),zero)&greater(zero,growth_rate(X3,X2)))))),inference(fof_nnf,[status(thm)],[4])).
% fof(26, plain,![X5]:![X6]:![X7]:![X8]:((~(environment(X5))|~(subpopulations(X6,X7,X5,X8)))|(((~(greater_or_equal(growth_rate(X7,X8),zero))|~(greater(zero,growth_rate(X6,X8))))|outcompetes(X7,X6,X8))&(~(outcompetes(X7,X6,X8))|(greater_or_equal(growth_rate(X7,X8),zero)&greater(zero,growth_rate(X6,X8)))))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:![X8]:((((~(greater_or_equal(growth_rate(X7,X8),zero))|~(greater(zero,growth_rate(X6,X8))))|outcompetes(X7,X6,X8))|(~(environment(X5))|~(subpopulations(X6,X7,X5,X8))))&(((greater_or_equal(growth_rate(X7,X8),zero)|~(outcompetes(X7,X6,X8)))|(~(environment(X5))|~(subpopulations(X6,X7,X5,X8))))&((greater(zero,growth_rate(X6,X8))|~(outcompetes(X7,X6,X8)))|(~(environment(X5))|~(subpopulations(X6,X7,X5,X8)))))),inference(distribute,[status(thm)],[26])).
% cnf(28,plain,(greater(zero,growth_rate(X1,X4))|~subpopulations(X1,X2,X3,X4)|~environment(X3)|~outcompetes(X2,X1,X4)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(greater_or_equal(growth_rate(X2,X4),zero)|~subpopulations(X1,X2,X3,X4)|~environment(X3)|~outcompetes(X2,X1,X4)),inference(split_conjunct,[status(thm)],[27])).
% fof(31, plain,![X1]:![X3]:![X4]:![X2]:((((~(environment(X1))|~(in_environment(X1,X2)))|greater(zero,growth_rate(X3,X2)))|~(greater(resilience(X4),resilience(X3))))|~(greater(zero,growth_rate(X4,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(32, plain,![X5]:![X6]:![X7]:![X8]:((((~(environment(X5))|~(in_environment(X5,X8)))|greater(zero,growth_rate(X6,X8)))|~(greater(resilience(X7),resilience(X6))))|~(greater(zero,growth_rate(X7,X8)))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(greater(zero,growth_rate(X3,X2))|~greater(zero,growth_rate(X1,X2))|~greater(resilience(X1),resilience(X3))|~in_environment(X4,X2)|~environment(X4)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(greater(resilience(efficient_producers),resilience(first_movers))),inference(split_conjunct,[status(thm)],[6])).
% fof(35, negated_conjecture,?[X1]:?[X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))&outcompetes(first_movers,efficient_producers,X2)),inference(fof_nnf,[status(thm)],[11])).
% fof(36, negated_conjecture,?[X3]:?[X4]:((environment(X3)&subpopulations(first_movers,efficient_producers,X3,X4))&outcompetes(first_movers,efficient_producers,X4)),inference(variable_rename,[status(thm)],[35])).
% fof(37, negated_conjecture,((environment(esk1_0)&subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))&outcompetes(first_movers,efficient_producers,esk2_0)),inference(skolemize,[status(esa)],[36])).
% cnf(38,negated_conjecture,(outcompetes(first_movers,efficient_producers,esk2_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,negated_conjecture,(subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,negated_conjecture,(environment(esk1_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(41,negated_conjecture,(in_environment(esk1_0,esk2_0)|~environment(esk1_0)),inference(spm,[status(thm)],[17,39,theory(equality)])).
% cnf(42,negated_conjecture,(in_environment(esk1_0,esk2_0)|$false),inference(rw,[status(thm)],[41,40,theory(equality)])).
% cnf(43,negated_conjecture,(in_environment(esk1_0,esk2_0)),inference(cn,[status(thm)],[42,theory(equality)])).
% cnf(44,plain,(greater(zero,growth_rate(X3,X2))|~greater(zero,growth_rate(X1,X2))|~greater(resilience(X1),resilience(X3))|~in_environment(X4,X2)),inference(csr,[status(thm)],[33,24])).
% cnf(45,negated_conjecture,(subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)|~environment(esk1_0)),inference(spm,[status(thm)],[14,39,theory(equality)])).
% cnf(46,negated_conjecture,(subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)|$false),inference(rw,[status(thm)],[45,40,theory(equality)])).
% cnf(47,negated_conjecture,(subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)),inference(cn,[status(thm)],[46,theory(equality)])).
% cnf(54,negated_conjecture,(greater(zero,growth_rate(efficient_producers,esk2_0))|~outcompetes(first_movers,efficient_producers,esk2_0)|~environment(esk1_0)),inference(spm,[status(thm)],[28,47,theory(equality)])).
% cnf(56,negated_conjecture,(greater(zero,growth_rate(efficient_producers,esk2_0))|$false|~environment(esk1_0)),inference(rw,[status(thm)],[54,38,theory(equality)])).
% cnf(57,negated_conjecture,(greater(zero,growth_rate(efficient_producers,esk2_0))|$false|$false),inference(rw,[status(thm)],[56,40,theory(equality)])).
% cnf(58,negated_conjecture,(greater(zero,growth_rate(efficient_producers,esk2_0))),inference(cn,[status(thm)],[57,theory(equality)])).
% cnf(63,negated_conjecture,(greater(zero,growth_rate(X1,esk2_0))|~greater(resilience(efficient_producers),resilience(X1))|~in_environment(X2,esk2_0)),inference(spm,[status(thm)],[44,58,theory(equality)])).
% cnf(64,negated_conjecture,(subpopulations(efficient_producers,X1,X2,esk2_0)),inference(spm,[status(thm)],[23,58,theory(equality)])).
% cnf(65,negated_conjecture,(environment(X1)),inference(spm,[status(thm)],[24,58,theory(equality)])).
% cnf(71,plain,(greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|$false),inference(rw,[status(thm)],[29,65,theory(equality)])).
% cnf(72,plain,(greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)),inference(cn,[status(thm)],[71,theory(equality)])).
% cnf(94,negated_conjecture,(greater(zero,growth_rate(X1,esk2_0))|~greater(resilience(efficient_producers),resilience(X1))),inference(spm,[status(thm)],[63,43,theory(equality)])).
% cnf(95,negated_conjecture,(greater_or_equal(growth_rate(X1,esk2_0),zero)|~outcompetes(X1,efficient_producers,esk2_0)),inference(spm,[status(thm)],[72,64,theory(equality)])).
% cnf(101,negated_conjecture,(greater_or_equal(growth_rate(first_movers,esk2_0),zero)),inference(spm,[status(thm)],[95,38,theory(equality)])).
% cnf(104,negated_conjecture,(greater(zero,growth_rate(first_movers,esk2_0))),inference(spm,[status(thm)],[94,34,theory(equality)])).
% cnf(105,negated_conjecture,(~greater_or_equal(growth_rate(first_movers,esk2_0),zero)),inference(spm,[status(thm)],[22,104,theory(equality)])).
% cnf(109,negated_conjecture,($false),inference(rw,[status(thm)],[105,101,theory(equality)])).
% cnf(110,negated_conjecture,($false),inference(cn,[status(thm)],[109,theory(equality)])).
% cnf(111,negated_conjecture,($false),110,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 33
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 32
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 7
% # Generated clauses : 29
% # ...of the previous two non-trivial : 22
% # Contextual simplify-reflections : 2
% # Paramodulations : 29
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 23
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 5
% # Rec. Clause-clause subsumption calls : 5
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 35 leaves, 1.43+/-0.935 terms/leaf
% # Paramod-from index: 9 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 28 leaves, 1.29+/-0.795 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.002 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP3986/MGT036+1.tptp
%
%------------------------------------------------------------------------------