TSTP Solution File: MGT032+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT032+2 : 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:06:21 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/SystemOnTPTP19448/MGT032+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19448/MGT032+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19448/MGT032+2.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 19544
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:((environment(X1)&stable(X1))=>?[X2]:(in_environment(X1,X2)&![X3]:((subpopulations(first_movers,efficient_producers,X1,X3)&greater_or_equal(X3,X2))=>greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3))))),file('/tmp/SRASS.s.p', l1)).
% fof(2, axiom,![X1]:![X4]:![X5]:![X3]:(((environment(X1)&subpopulations(X4,X5,X1,X3))&greater(growth_rate(X5,X3),growth_rate(X4,X3)))=>selection_favors(X5,X4,X3)),file('/tmp/SRASS.s.p', mp1_high_growth_rates)).
% fof(3, conjecture,![X1]:((environment(X1)&stable(X1))=>?[X2]:(in_environment(X1,X2)&![X3]:((subpopulations(first_movers,efficient_producers,X1,X3)&greater_or_equal(X3,X2))=>selection_favors(efficient_producers,first_movers,X3)))),file('/tmp/SRASS.s.p', prove_t1)).
% fof(4, negated_conjecture,~(![X1]:((environment(X1)&stable(X1))=>?[X2]:(in_environment(X1,X2)&![X3]:((subpopulations(first_movers,efficient_producers,X1,X3)&greater_or_equal(X3,X2))=>selection_favors(efficient_producers,first_movers,X3))))),inference(assume_negation,[status(cth)],[3])).
% fof(5, plain,![X1]:((~(environment(X1))|~(stable(X1)))|?[X2]:(in_environment(X1,X2)&![X3]:((~(subpopulations(first_movers,efficient_producers,X1,X3))|~(greater_or_equal(X3,X2)))|greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3))))),inference(fof_nnf,[status(thm)],[1])).
% fof(6, plain,![X4]:((~(environment(X4))|~(stable(X4)))|?[X5]:(in_environment(X4,X5)&![X6]:((~(subpopulations(first_movers,efficient_producers,X4,X6))|~(greater_or_equal(X6,X5)))|greater(growth_rate(efficient_producers,X6),growth_rate(first_movers,X6))))),inference(variable_rename,[status(thm)],[5])).
% fof(7, plain,![X4]:((~(environment(X4))|~(stable(X4)))|(in_environment(X4,esk1_1(X4))&![X6]:((~(subpopulations(first_movers,efficient_producers,X4,X6))|~(greater_or_equal(X6,esk1_1(X4))))|greater(growth_rate(efficient_producers,X6),growth_rate(first_movers,X6))))),inference(skolemize,[status(esa)],[6])).
% fof(8, plain,![X4]:![X6]:((((~(subpopulations(first_movers,efficient_producers,X4,X6))|~(greater_or_equal(X6,esk1_1(X4))))|greater(growth_rate(efficient_producers,X6),growth_rate(first_movers,X6)))&in_environment(X4,esk1_1(X4)))|(~(environment(X4))|~(stable(X4)))),inference(shift_quantors,[status(thm)],[7])).
% fof(9, plain,![X4]:![X6]:((((~(subpopulations(first_movers,efficient_producers,X4,X6))|~(greater_or_equal(X6,esk1_1(X4))))|greater(growth_rate(efficient_producers,X6),growth_rate(first_movers,X6)))|(~(environment(X4))|~(stable(X4))))&(in_environment(X4,esk1_1(X4))|(~(environment(X4))|~(stable(X4))))),inference(distribute,[status(thm)],[8])).
% cnf(10,plain,(in_environment(X1,esk1_1(X1))|~stable(X1)|~environment(X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(11,plain,(greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))|~stable(X1)|~environment(X1)|~greater_or_equal(X2,esk1_1(X1))|~subpopulations(first_movers,efficient_producers,X1,X2)),inference(split_conjunct,[status(thm)],[9])).
% fof(12, plain,![X1]:![X4]:![X5]:![X3]:(((~(environment(X1))|~(subpopulations(X4,X5,X1,X3)))|~(greater(growth_rate(X5,X3),growth_rate(X4,X3))))|selection_favors(X5,X4,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X6]:![X7]:![X8]:![X9]:(((~(environment(X6))|~(subpopulations(X7,X8,X6,X9)))|~(greater(growth_rate(X8,X9),growth_rate(X7,X9))))|selection_favors(X8,X7,X9)),inference(variable_rename,[status(thm)],[12])).
% cnf(14,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)],[13])).
% fof(15, negated_conjecture,?[X1]:((environment(X1)&stable(X1))&![X2]:(~(in_environment(X1,X2))|?[X3]:((subpopulations(first_movers,efficient_producers,X1,X3)&greater_or_equal(X3,X2))&~(selection_favors(efficient_producers,first_movers,X3))))),inference(fof_nnf,[status(thm)],[4])).
% fof(16, negated_conjecture,?[X4]:((environment(X4)&stable(X4))&![X5]:(~(in_environment(X4,X5))|?[X6]:((subpopulations(first_movers,efficient_producers,X4,X6)&greater_or_equal(X6,X5))&~(selection_favors(efficient_producers,first_movers,X6))))),inference(variable_rename,[status(thm)],[15])).
% fof(17, negated_conjecture,((environment(esk2_0)&stable(esk2_0))&![X5]:(~(in_environment(esk2_0,X5))|((subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X5))&greater_or_equal(esk3_1(X5),X5))&~(selection_favors(efficient_producers,first_movers,esk3_1(X5)))))),inference(skolemize,[status(esa)],[16])).
% fof(18, negated_conjecture,![X5]:((~(in_environment(esk2_0,X5))|((subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X5))&greater_or_equal(esk3_1(X5),X5))&~(selection_favors(efficient_producers,first_movers,esk3_1(X5)))))&(environment(esk2_0)&stable(esk2_0))),inference(shift_quantors,[status(thm)],[17])).
% fof(19, negated_conjecture,![X5]:((((subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X5))|~(in_environment(esk2_0,X5)))&(greater_or_equal(esk3_1(X5),X5)|~(in_environment(esk2_0,X5))))&(~(selection_favors(efficient_producers,first_movers,esk3_1(X5)))|~(in_environment(esk2_0,X5))))&(environment(esk2_0)&stable(esk2_0))),inference(distribute,[status(thm)],[18])).
% cnf(20,negated_conjecture,(stable(esk2_0)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,negated_conjecture,(environment(esk2_0)),inference(split_conjunct,[status(thm)],[19])).
% cnf(22,negated_conjecture,(~in_environment(esk2_0,X1)|~selection_favors(efficient_producers,first_movers,esk3_1(X1))),inference(split_conjunct,[status(thm)],[19])).
% cnf(23,negated_conjecture,(greater_or_equal(esk3_1(X1),X1)|~in_environment(esk2_0,X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(24,negated_conjecture,(subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X1))|~in_environment(esk2_0,X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(25,negated_conjecture,(greater(growth_rate(efficient_producers,esk3_1(esk1_1(X1))),growth_rate(first_movers,esk3_1(esk1_1(X1))))|~subpopulations(first_movers,efficient_producers,X1,esk3_1(esk1_1(X1)))|~stable(X1)|~environment(X1)|~in_environment(esk2_0,esk1_1(X1))),inference(spm,[status(thm)],[11,23,theory(equality)])).
% cnf(26,negated_conjecture,(selection_favors(efficient_producers,first_movers,esk3_1(esk1_1(X1)))|~subpopulations(first_movers,efficient_producers,X2,esk3_1(esk1_1(X1)))|~environment(X2)|~subpopulations(first_movers,efficient_producers,X1,esk3_1(esk1_1(X1)))|~in_environment(esk2_0,esk1_1(X1))|~stable(X1)|~environment(X1)),inference(spm,[status(thm)],[14,25,theory(equality)])).
% cnf(27,negated_conjecture,(~subpopulations(first_movers,efficient_producers,X2,esk3_1(esk1_1(X1)))|~subpopulations(first_movers,efficient_producers,X1,esk3_1(esk1_1(X1)))|~in_environment(esk2_0,esk1_1(X1))|~stable(X1)|~environment(X2)|~environment(X1)),inference(csr,[status(thm)],[26,22])).
% cnf(28,negated_conjecture,(~subpopulations(first_movers,efficient_producers,X1,esk3_1(esk1_1(X1)))|~in_environment(esk2_0,esk1_1(X1))|~stable(X1)|~environment(esk2_0)|~environment(X1)),inference(spm,[status(thm)],[27,24,theory(equality)])).
% cnf(29,negated_conjecture,(~subpopulations(first_movers,efficient_producers,X1,esk3_1(esk1_1(X1)))|~in_environment(esk2_0,esk1_1(X1))|~stable(X1)|$false|~environment(X1)),inference(rw,[status(thm)],[28,21,theory(equality)])).
% cnf(30,negated_conjecture,(~subpopulations(first_movers,efficient_producers,X1,esk3_1(esk1_1(X1)))|~in_environment(esk2_0,esk1_1(X1))|~stable(X1)|~environment(X1)),inference(cn,[status(thm)],[29,theory(equality)])).
% cnf(31,negated_conjecture,(~in_environment(esk2_0,esk1_1(esk2_0))|~stable(esk2_0)|~environment(esk2_0)),inference(spm,[status(thm)],[30,24,theory(equality)])).
% cnf(32,negated_conjecture,(~in_environment(esk2_0,esk1_1(esk2_0))|$false|~environment(esk2_0)),inference(rw,[status(thm)],[31,20,theory(equality)])).
% cnf(33,negated_conjecture,(~in_environment(esk2_0,esk1_1(esk2_0))|$false|$false),inference(rw,[status(thm)],[32,21,theory(equality)])).
% cnf(34,negated_conjecture,(~in_environment(esk2_0,esk1_1(esk2_0))),inference(cn,[status(thm)],[33,theory(equality)])).
% cnf(35,negated_conjecture,(~stable(esk2_0)|~environment(esk2_0)),inference(spm,[status(thm)],[34,10,theory(equality)])).
% cnf(36,negated_conjecture,($false|~environment(esk2_0)),inference(rw,[status(thm)],[35,20,theory(equality)])).
% cnf(37,negated_conjecture,($false|$false),inference(rw,[status(thm)],[36,21,theory(equality)])).
% cnf(38,negated_conjecture,($false),inference(cn,[status(thm)],[37,theory(equality)])).
% cnf(39,negated_conjecture,($false),38,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 20
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 20
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 5
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections : 1
% # Paramodulations : 5
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 10
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 7
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 27 leaves, 1.26+/-0.583 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 17 leaves, 1.18+/-0.381 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.004 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.17 WC
% FINAL PrfWatch: 0.08 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP19448/MGT032+2.tptp
%
%------------------------------------------------------------------------------