TSTP Solution File: MGT021+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT021+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 : art01.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:04:50 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP27385/MGT021+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27385/MGT021+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27385/MGT021+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 27481
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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)&subpopulations(first_movers,efficient_producers,X1,X2))=>in_environment(X1,X2)),file('/tmp/SRASS.s.p', mp_time_point_in_environment)).
% fof(2, axiom,![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>greater(number_of_organizations(X1,X2),zero)),file('/tmp/SRASS.s.p', mp_environment_not_empty)).
% fof(3, axiom,![X3]:(increases(X3)=>~(decreases(X3))),file('/tmp/SRASS.s.p', mp_increase_not_decrease)).
% fof(4, axiom,![X1]:![X2]:(((environment(X1)&in_environment(X1,X2))&greater(number_of_organizations(X1,X2),zero))=>((greater(equilibrium(X1),X2)=>decreases(resources(X1,X2)))&(~(greater(equilibrium(X1),X2))=>constant(resources(X1,X2))))),file('/tmp/SRASS.s.p', a3)).
% fof(5, axiom,![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>((decreases(resources(X1,X2))=>increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))))&(constant(resources(X1,X2))=>~(decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))))))),file('/tmp/SRASS.s.p', l4)).
% fof(7, conjecture,![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>~(decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))))),file('/tmp/SRASS.s.p', prove_l3)).
% fof(8, negated_conjecture,~(![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>~(decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X3]:(increases(X3)=>~(decreases(X3))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(10, plain,![X1]:![X2]:(((environment(X1)&in_environment(X1,X2))&greater(number_of_organizations(X1,X2),zero))=>((greater(equilibrium(X1),X2)=>decreases(resources(X1,X2)))&(~(greater(equilibrium(X1),X2))=>constant(resources(X1,X2))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(11, plain,![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>((decreases(resources(X1,X2))=>increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))))&(constant(resources(X1,X2))=>~(decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))))))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(12, negated_conjecture,~(![X1]:![X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))=>~(decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(13, plain,![X1]:![X2]:((~(environment(X1))|~(subpopulations(first_movers,efficient_producers,X1,X2)))|in_environment(X1,X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(14, plain,![X3]:![X4]:((~(environment(X3))|~(subpopulations(first_movers,efficient_producers,X3,X4)))|in_environment(X3,X4)),inference(variable_rename,[status(thm)],[13])).
% cnf(15,plain,(in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1)),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X1]:![X2]:((~(environment(X1))|~(subpopulations(first_movers,efficient_producers,X1,X2)))|greater(number_of_organizations(X1,X2),zero)),inference(fof_nnf,[status(thm)],[2])).
% fof(17, plain,![X3]:![X4]:((~(environment(X3))|~(subpopulations(first_movers,efficient_producers,X3,X4)))|greater(number_of_organizations(X3,X4),zero)),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(greater(number_of_organizations(X1,X2),zero)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X3]:(~(increases(X3))|~(decreases(X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(20, plain,![X4]:(~(increases(X4))|~(decreases(X4))),inference(variable_rename,[status(thm)],[19])).
% cnf(21,plain,(~decreases(X1)|~increases(X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X1]:![X2]:(((~(environment(X1))|~(in_environment(X1,X2)))|~(greater(number_of_organizations(X1,X2),zero)))|((~(greater(equilibrium(X1),X2))|decreases(resources(X1,X2)))&(greater(equilibrium(X1),X2)|constant(resources(X1,X2))))),inference(fof_nnf,[status(thm)],[10])).
% fof(23, plain,![X3]:![X4]:(((~(environment(X3))|~(in_environment(X3,X4)))|~(greater(number_of_organizations(X3,X4),zero)))|((~(greater(equilibrium(X3),X4))|decreases(resources(X3,X4)))&(greater(equilibrium(X3),X4)|constant(resources(X3,X4))))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X3]:![X4]:(((~(greater(equilibrium(X3),X4))|decreases(resources(X3,X4)))|((~(environment(X3))|~(in_environment(X3,X4)))|~(greater(number_of_organizations(X3,X4),zero))))&((greater(equilibrium(X3),X4)|constant(resources(X3,X4)))|((~(environment(X3))|~(in_environment(X3,X4)))|~(greater(number_of_organizations(X3,X4),zero))))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(constant(resources(X1,X2))|greater(equilibrium(X1),X2)|~greater(number_of_organizations(X1,X2),zero)|~in_environment(X1,X2)|~environment(X1)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(decreases(resources(X1,X2))|~greater(number_of_organizations(X1,X2),zero)|~in_environment(X1,X2)|~environment(X1)|~greater(equilibrium(X1),X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(27, plain,![X1]:![X2]:((~(environment(X1))|~(subpopulations(first_movers,efficient_producers,X1,X2)))|((~(decreases(resources(X1,X2)))|increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))))&(~(constant(resources(X1,X2)))|~(decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))))))),inference(fof_nnf,[status(thm)],[11])).
% fof(28, plain,![X3]:![X4]:((~(environment(X3))|~(subpopulations(first_movers,efficient_producers,X3,X4)))|((~(decreases(resources(X3,X4)))|increases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))))&(~(constant(resources(X3,X4)))|~(decreases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))))))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X3]:![X4]:(((~(decreases(resources(X3,X4)))|increases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))))|(~(environment(X3))|~(subpopulations(first_movers,efficient_producers,X3,X4))))&((~(constant(resources(X3,X4)))|~(decreases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)))))|(~(environment(X3))|~(subpopulations(first_movers,efficient_producers,X3,X4))))),inference(distribute,[status(thm)],[28])).
% cnf(30,plain,(~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1)|~decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))|~constant(resources(X1,X2))),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,plain,(increases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1)|~decreases(resources(X1,X2))),inference(split_conjunct,[status(thm)],[29])).
% fof(35, negated_conjecture,?[X1]:?[X2]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X2))&decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))),inference(fof_nnf,[status(thm)],[12])).
% fof(36, negated_conjecture,?[X3]:?[X4]:((environment(X3)&subpopulations(first_movers,efficient_producers,X3,X4))&decreases(difference(disbanding_rate(first_movers,X4),disbanding_rate(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))&decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))),inference(skolemize,[status(esa)],[36])).
% cnf(38,negated_conjecture,(decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(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,(~constant(resources(X1,esk2_0))|~subpopulations(first_movers,efficient_producers,X1,esk2_0)|~environment(X1)),inference(spm,[status(thm)],[30,38,theory(equality)])).
% cnf(42,plain,(decreases(resources(X1,X2))|~greater(equilibrium(X1),X2)|~in_environment(X1,X2)|~environment(X1)|~subpopulations(first_movers,efficient_producers,X1,X2)),inference(spm,[status(thm)],[26,18,theory(equality)])).
% cnf(43,plain,(decreases(resources(X1,X2))|~greater(equilibrium(X1),X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1)),inference(csr,[status(thm)],[42,15])).
% cnf(44,negated_conjecture,(greater(equilibrium(X1),esk2_0)|~subpopulations(first_movers,efficient_producers,X1,esk2_0)|~environment(X1)|~greater(number_of_organizations(X1,esk2_0),zero)|~in_environment(X1,esk2_0)),inference(spm,[status(thm)],[41,25,theory(equality)])).
% cnf(45,negated_conjecture,(greater(equilibrium(X1),esk2_0)|~greater(number_of_organizations(X1,esk2_0),zero)|~subpopulations(first_movers,efficient_producers,X1,esk2_0)|~environment(X1)),inference(csr,[status(thm)],[44,15])).
% cnf(46,negated_conjecture,(greater(equilibrium(X1),esk2_0)|~subpopulations(first_movers,efficient_producers,X1,esk2_0)|~environment(X1)),inference(csr,[status(thm)],[45,18])).
% cnf(47,negated_conjecture,(decreases(resources(X1,esk2_0))|~subpopulations(first_movers,efficient_producers,X1,esk2_0)|~environment(X1)),inference(spm,[status(thm)],[43,46,theory(equality)])).
% cnf(48,negated_conjecture,(increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))|~subpopulations(first_movers,efficient_producers,X1,esk2_0)|~environment(X1)),inference(spm,[status(thm)],[31,47,theory(equality)])).
% cnf(49,negated_conjecture,(increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))|~environment(esk1_0)),inference(spm,[status(thm)],[48,39,theory(equality)])).
% cnf(50,negated_conjecture,(increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))|$false),inference(rw,[status(thm)],[49,40,theory(equality)])).
% cnf(51,negated_conjecture,(increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))),inference(cn,[status(thm)],[50,theory(equality)])).
% cnf(52,negated_conjecture,(~decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))),inference(spm,[status(thm)],[21,51,theory(equality)])).
% cnf(54,negated_conjecture,($false),inference(rw,[status(thm)],[52,38,theory(equality)])).
% cnf(55,negated_conjecture,($false),inference(cn,[status(thm)],[54,theory(equality)])).
% cnf(56,negated_conjecture,($false),55,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 28
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 28
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 7
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 3
% # Paramodulations : 7
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 16
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 5
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 33 leaves, 1.33+/-0.636 terms/leaf
% # Paramod-from index: 9 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 29 leaves, 1.07+/-0.253 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.004 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.21 WC
% FINAL PrfWatch: 0.11 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP27385/MGT021+1.tptp
%
%------------------------------------------------------------------------------