TSTP Solution File: MGT022+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT022+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:09:39 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP11842/MGT022+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11842/MGT022+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11842/MGT022+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 11974
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:![X3]:![X4]:(((environment(X1)&subpopulations(X2,X3,X1,X4))&greater(resilience(X3),resilience(X2)))=>((decreases(resources(X1,X4))=>increases(difference(disbanding_rate(X2,X4),disbanding_rate(X3,X4))))&(constant(resources(X1,X4))=>constant(difference(disbanding_rate(X2,X4),disbanding_rate(X3,X4)))))),file('/tmp/SRASS.s.p', a5)).
% fof(2, axiom,greater(resilience(efficient_producers),resilience(first_movers)),file('/tmp/SRASS.s.p', a2)).
% fof(3, axiom,![X5]:(constant(X5)=>~(decreases(X5))),file('/tmp/SRASS.s.p', mp_constant_not_decrease)).
% fof(4, conjecture,![X1]:![X4]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X4))=>((decreases(resources(X1,X4))=>increases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))))&(constant(resources(X1,X4))=>~(decreases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))))))),file('/tmp/SRASS.s.p', prove_l4)).
% fof(5, negated_conjecture,~(![X1]:![X4]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X4))=>((decreases(resources(X1,X4))=>increases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))))&(constant(resources(X1,X4))=>~(decreases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)))))))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X5]:(constant(X5)=>~(decreases(X5))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(7, negated_conjecture,~(![X1]:![X4]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X4))=>((decreases(resources(X1,X4))=>increases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))))&(constant(resources(X1,X4))=>~(decreases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)))))))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(8, plain,![X1]:![X2]:![X3]:![X4]:(((~(environment(X1))|~(subpopulations(X2,X3,X1,X4)))|~(greater(resilience(X3),resilience(X2))))|((~(decreases(resources(X1,X4)))|increases(difference(disbanding_rate(X2,X4),disbanding_rate(X3,X4))))&(~(constant(resources(X1,X4)))|constant(difference(disbanding_rate(X2,X4),disbanding_rate(X3,X4)))))),inference(fof_nnf,[status(thm)],[1])).
% fof(9, plain,![X5]:![X6]:![X7]:![X8]:(((~(environment(X5))|~(subpopulations(X6,X7,X5,X8)))|~(greater(resilience(X7),resilience(X6))))|((~(decreases(resources(X5,X8)))|increases(difference(disbanding_rate(X6,X8),disbanding_rate(X7,X8))))&(~(constant(resources(X5,X8)))|constant(difference(disbanding_rate(X6,X8),disbanding_rate(X7,X8)))))),inference(variable_rename,[status(thm)],[8])).
% fof(10, plain,![X5]:![X6]:![X7]:![X8]:(((~(decreases(resources(X5,X8)))|increases(difference(disbanding_rate(X6,X8),disbanding_rate(X7,X8))))|((~(environment(X5))|~(subpopulations(X6,X7,X5,X8)))|~(greater(resilience(X7),resilience(X6)))))&((~(constant(resources(X5,X8)))|constant(difference(disbanding_rate(X6,X8),disbanding_rate(X7,X8))))|((~(environment(X5))|~(subpopulations(X6,X7,X5,X8)))|~(greater(resilience(X7),resilience(X6)))))),inference(distribute,[status(thm)],[9])).
% cnf(11,plain,(constant(difference(disbanding_rate(X2,X4),disbanding_rate(X1,X4)))|~greater(resilience(X1),resilience(X2))|~subpopulations(X2,X1,X3,X4)|~environment(X3)|~constant(resources(X3,X4))),inference(split_conjunct,[status(thm)],[10])).
% cnf(12,plain,(increases(difference(disbanding_rate(X2,X4),disbanding_rate(X1,X4)))|~greater(resilience(X1),resilience(X2))|~subpopulations(X2,X1,X3,X4)|~environment(X3)|~decreases(resources(X3,X4))),inference(split_conjunct,[status(thm)],[10])).
% cnf(13,plain,(greater(resilience(efficient_producers),resilience(first_movers))),inference(split_conjunct,[status(thm)],[2])).
% fof(14, plain,![X5]:(~(constant(X5))|~(decreases(X5))),inference(fof_nnf,[status(thm)],[6])).
% fof(15, plain,![X6]:(~(constant(X6))|~(decreases(X6))),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(~decreases(X1)|~constant(X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, negated_conjecture,?[X1]:?[X4]:((environment(X1)&subpopulations(first_movers,efficient_producers,X1,X4))&((decreases(resources(X1,X4))&~(increases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)))))|(constant(resources(X1,X4))&decreases(difference(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)))))),inference(fof_nnf,[status(thm)],[7])).
% fof(18, negated_conjecture,?[X5]:?[X6]:((environment(X5)&subpopulations(first_movers,efficient_producers,X5,X6))&((decreases(resources(X5,X6))&~(increases(difference(disbanding_rate(first_movers,X6),disbanding_rate(efficient_producers,X6)))))|(constant(resources(X5,X6))&decreases(difference(disbanding_rate(first_movers,X6),disbanding_rate(efficient_producers,X6)))))),inference(variable_rename,[status(thm)],[17])).
% fof(19, negated_conjecture,((environment(esk1_0)&subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))&((decreases(resources(esk1_0,esk2_0))&~(increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))))|(constant(resources(esk1_0,esk2_0))&decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))))),inference(skolemize,[status(esa)],[18])).
% fof(20, negated_conjecture,((environment(esk1_0)&subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))&(((constant(resources(esk1_0,esk2_0))|decreases(resources(esk1_0,esk2_0)))&(decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))|decreases(resources(esk1_0,esk2_0))))&((constant(resources(esk1_0,esk2_0))|~(increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))))&(decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))|~(increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))))))),inference(distribute,[status(thm)],[19])).
% cnf(22,negated_conjecture,(constant(resources(esk1_0,esk2_0))|~increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,negated_conjecture,(decreases(resources(esk1_0,esk2_0))|decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))),inference(split_conjunct,[status(thm)],[20])).
% cnf(24,negated_conjecture,(decreases(resources(esk1_0,esk2_0))|constant(resources(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[20])).
% cnf(25,negated_conjecture,(subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(26,negated_conjecture,(environment(esk1_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(28,negated_conjecture,(constant(difference(disbanding_rate(X1,esk2_0),disbanding_rate(X2,esk2_0)))|decreases(resources(esk1_0,esk2_0))|~greater(resilience(X2),resilience(X1))|~subpopulations(X1,X2,esk1_0,esk2_0)|~environment(esk1_0)),inference(spm,[status(thm)],[11,24,theory(equality)])).
% cnf(29,negated_conjecture,(constant(difference(disbanding_rate(X1,esk2_0),disbanding_rate(X2,esk2_0)))|decreases(resources(esk1_0,esk2_0))|~greater(resilience(X2),resilience(X1))|~subpopulations(X1,X2,esk1_0,esk2_0)|$false),inference(rw,[status(thm)],[28,26,theory(equality)])).
% cnf(30,negated_conjecture,(constant(difference(disbanding_rate(X1,esk2_0),disbanding_rate(X2,esk2_0)))|decreases(resources(esk1_0,esk2_0))|~greater(resilience(X2),resilience(X1))|~subpopulations(X1,X2,esk1_0,esk2_0)),inference(cn,[status(thm)],[29,theory(equality)])).
% cnf(31,negated_conjecture,(constant(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))|decreases(resources(esk1_0,esk2_0))|~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)),inference(spm,[status(thm)],[30,13,theory(equality)])).
% cnf(32,negated_conjecture,(constant(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))|decreases(resources(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[31,25,theory(equality)])).
% cnf(33,negated_conjecture,(constant(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))|decreases(resources(esk1_0,esk2_0))),inference(cn,[status(thm)],[32,theory(equality)])).
% cnf(34,negated_conjecture,(decreases(resources(esk1_0,esk2_0))|~decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))),inference(spm,[status(thm)],[16,33,theory(equality)])).
% cnf(35,negated_conjecture,(decreases(resources(esk1_0,esk2_0))),inference(csr,[status(thm)],[34,23])).
% cnf(36,negated_conjecture,(increases(difference(disbanding_rate(X1,esk2_0),disbanding_rate(X2,esk2_0)))|~greater(resilience(X2),resilience(X1))|~subpopulations(X1,X2,esk1_0,esk2_0)|~environment(esk1_0)),inference(spm,[status(thm)],[12,35,theory(equality)])).
% cnf(41,negated_conjecture,(increases(difference(disbanding_rate(X1,esk2_0),disbanding_rate(X2,esk2_0)))|~greater(resilience(X2),resilience(X1))|~subpopulations(X1,X2,esk1_0,esk2_0)|$false),inference(rw,[status(thm)],[36,26,theory(equality)])).
% cnf(42,negated_conjecture,(increases(difference(disbanding_rate(X1,esk2_0),disbanding_rate(X2,esk2_0)))|~greater(resilience(X2),resilience(X1))|~subpopulations(X1,X2,esk1_0,esk2_0)),inference(cn,[status(thm)],[41,theory(equality)])).
% cnf(43,negated_conjecture,(increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))|~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)),inference(spm,[status(thm)],[42,13,theory(equality)])).
% cnf(44,negated_conjecture,(increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))|$false),inference(rw,[status(thm)],[43,25,theory(equality)])).
% cnf(45,negated_conjecture,(increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))),inference(cn,[status(thm)],[44,theory(equality)])).
% cnf(48,negated_conjecture,(constant(resources(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[22,45,theory(equality)])).
% cnf(49,negated_conjecture,(constant(resources(esk1_0,esk2_0))),inference(cn,[status(thm)],[48,theory(equality)])).
% cnf(50,negated_conjecture,(~decreases(resources(esk1_0,esk2_0))),inference(spm,[status(thm)],[16,49,theory(equality)])).
% cnf(52,negated_conjecture,($false),inference(rw,[status(thm)],[50,35,theory(equality)])).
% cnf(53,negated_conjecture,($false),inference(cn,[status(thm)],[52,theory(equality)])).
% cnf(54,negated_conjecture,($false),53,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 16
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 8
% # ...of the previous two non-trivial : 7
% # Contextual simplify-reflections : 1
% # Paramodulations : 8
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 10
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 31 leaves, 1.26+/-0.566 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 22 leaves, 1.05+/-0.208 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.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP11842/MGT022+1.tptp
%
%------------------------------------------------------------------------------