TSTP Solution File: MGT036+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT036+3 : 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:02 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP14754/MGT036+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14754/MGT036+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14754/MGT036+3.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 14886
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:![X2]:![X3]:![X4]:((environment(X1)&subpopulations(X2,X3,X1,X4))=>((greater_or_equal(growth_rate(X3,X4),zero)&greater(zero,growth_rate(X2,X4)))<=>outcompetes(X3,X2,X4))),file('/tmp/SRASS.s.p', d2)).
% fof(2, axiom,?[X1]:?[X4]:(((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X4))&greater_or_equal(growth_rate(first_movers,X4),zero))&greater(zero,growth_rate(efficient_producers,X4))),file('/tmp/SRASS.s.p', a13_star)).
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:((environment(X1)&subpopulations(X2,X3,X1,X4))=>subpopulations(X3,X2,X1,X4)),file('/tmp/SRASS.s.p', mp_symmetry_of_subpopulations)).
% fof(4, conjecture,?[X1]:?[X4]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X4))&outcompetes(first_movers,efficient_producers,X4)),file('/tmp/SRASS.s.p', prove_t5_star)).
% fof(5, negated_conjecture,~(?[X1]:?[X4]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X4))&outcompetes(first_movers,efficient_producers,X4))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:![X3]:![X4]:((~(environment(X1))|~(subpopulations(X2,X3,X1,X4)))|(((~(greater_or_equal(growth_rate(X3,X4),zero))|~(greater(zero,growth_rate(X2,X4))))|outcompetes(X3,X2,X4))&(~(outcompetes(X3,X2,X4))|(greater_or_equal(growth_rate(X3,X4),zero)&greater(zero,growth_rate(X2,X4)))))),inference(fof_nnf,[status(thm)],[1])).
% fof(7, 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)],[6])).
% fof(8, 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)],[7])).
% cnf(11,plain,(outcompetes(X2,X1,X4)|~subpopulations(X1,X2,X3,X4)|~environment(X3)|~greater(zero,growth_rate(X1,X4))|~greater_or_equal(growth_rate(X2,X4),zero)),inference(split_conjunct,[status(thm)],[8])).
% fof(12, plain,?[X5]:?[X6]:(((environment(X5)&subpopulations(first_movers,efficient_producers,X5,X6))&greater_or_equal(growth_rate(first_movers,X6),zero))&greater(zero,growth_rate(efficient_producers,X6))),inference(variable_rename,[status(thm)],[2])).
% fof(13, plain,(((environment(esk1_0)&subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))&greater_or_equal(growth_rate(first_movers,esk2_0),zero))&greater(zero,growth_rate(efficient_producers,esk2_0))),inference(skolemize,[status(esa)],[12])).
% cnf(14,plain,(greater(zero,growth_rate(efficient_producers,esk2_0))),inference(split_conjunct,[status(thm)],[13])).
% cnf(15,plain,(greater_or_equal(growth_rate(first_movers,esk2_0),zero)),inference(split_conjunct,[status(thm)],[13])).
% cnf(16,plain,(subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[13])).
% cnf(17,plain,(environment(esk1_0)),inference(split_conjunct,[status(thm)],[13])).
% fof(18, plain,![X1]:![X2]:![X3]:![X4]:((~(environment(X1))|~(subpopulations(X2,X3,X1,X4)))|subpopulations(X3,X2,X1,X4)),inference(fof_nnf,[status(thm)],[3])).
% fof(19, plain,![X5]:![X6]:![X7]:![X8]:((~(environment(X5))|~(subpopulations(X6,X7,X5,X8)))|subpopulations(X7,X6,X5,X8)),inference(variable_rename,[status(thm)],[18])).
% cnf(20,plain,(subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, negated_conjecture,![X1]:![X4]:((~(environment(X1))|~(subpopulations(first_movers,efficient_producers,X1,X4)))|~(outcompetes(first_movers,efficient_producers,X4))),inference(fof_nnf,[status(thm)],[5])).
% fof(22, negated_conjecture,![X5]:![X6]:((~(environment(X5))|~(subpopulations(first_movers,efficient_producers,X5,X6)))|~(outcompetes(first_movers,efficient_producers,X6))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,negated_conjecture,(~outcompetes(first_movers,efficient_producers,X1)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)|~environment(esk1_0)),inference(spm,[status(thm)],[20,16,theory(equality)])).
% cnf(25,plain,(subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)|$false),inference(rw,[status(thm)],[24,17,theory(equality)])).
% cnf(26,plain,(subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)),inference(cn,[status(thm)],[25,theory(equality)])).
% cnf(33,negated_conjecture,(~outcompetes(first_movers,efficient_producers,esk2_0)|~environment(esk1_0)),inference(spm,[status(thm)],[23,16,theory(equality)])).
% cnf(34,negated_conjecture,(~outcompetes(first_movers,efficient_producers,esk2_0)|$false),inference(rw,[status(thm)],[33,17,theory(equality)])).
% cnf(35,negated_conjecture,(~outcompetes(first_movers,efficient_producers,esk2_0)),inference(cn,[status(thm)],[34,theory(equality)])).
% cnf(36,plain,(outcompetes(X1,efficient_producers,esk2_0)|~greater_or_equal(growth_rate(X1,esk2_0),zero)|~subpopulations(efficient_producers,X1,X2,esk2_0)|~environment(X2)),inference(spm,[status(thm)],[11,14,theory(equality)])).
% cnf(51,plain,(outcompetes(first_movers,efficient_producers,esk2_0)|~subpopulations(efficient_producers,first_movers,X1,esk2_0)|~environment(X1)),inference(spm,[status(thm)],[36,15,theory(equality)])).
% cnf(52,plain,(~subpopulations(efficient_producers,first_movers,X1,esk2_0)|~environment(X1)),inference(sr,[status(thm)],[51,35,theory(equality)])).
% cnf(55,plain,(~environment(esk1_0)),inference(spm,[status(thm)],[52,26,theory(equality)])).
% cnf(56,plain,($false),inference(rw,[status(thm)],[55,17,theory(equality)])).
% cnf(57,plain,($false),inference(cn,[status(thm)],[56,theory(equality)])).
% cnf(58,plain,($false),57,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 26
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 14
% # ...of the previous two non-trivial : 9
% # Contextual simplify-reflections : 0
% # Paramodulations : 14
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 17
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 4
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 1
% # 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: 31 leaves, 1.52+/-0.979 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 21 leaves, 1.19+/-0.499 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP14754/MGT036+3.tptp
%
%------------------------------------------------------------------------------