TSTP Solution File: MGT020+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT020+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 : art05.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:44 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP5190/MGT020+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP5190/MGT020+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5190/MGT020+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 5286
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X4]:(environment(X4)=>greater(disbanding_rate(first_movers,initial_FM_EP(X4)),disbanding_rate(efficient_producers,initial_FM_EP(X4)))),file('/tmp/SRASS.s.p', a8)).
% fof(4, axiom,![X4]:![X7]:(environment(X4)=>((in_environment(X4,initial_FM_EP(X4))=>subpopulations(first_movers,efficient_producers,X4,initial_FM_EP(X4)))&(subpopulations(first_movers,efficient_producers,X4,X7)=>greater_or_equal(X7,initial_FM_EP(X4))))),file('/tmp/SRASS.s.p', mp_earliest_time_point)).
% fof(5, axiom,![X4]:![X7]:((environment(X4)&subpopulations(first_movers,efficient_producers,X4,X7))=>in_environment(X4,X7)),file('/tmp/SRASS.s.p', mp_time_point_occurs)).
% fof(6, axiom,![X4]:![X7]:![X5]:![X6]:(((((environment(X4)&greater_or_equal(X7,X5))&greater_or_equal(X6,X7))&subpopulations(first_movers,efficient_producers,X4,X6))&greater(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5)))=>(~(decreases(difference(disbanding_rate(first_movers,X7),disbanding_rate(efficient_producers,X7))))=>greater(disbanding_rate(first_movers,X6),disbanding_rate(efficient_producers,X6)))),file('/tmp/SRASS.s.p', mp_positive_function_difference)).
% fof(7, axiom,![X4]:(environment(X4)=>greater_or_equal(initial_FM_EP(X4),start_time(X4))),file('/tmp/SRASS.s.p', mp_initial_time)).
% fof(8, axiom,![X4]:![X7]:((environment(X4)&subpopulations(first_movers,efficient_producers,X4,X7))=>~(decreases(difference(disbanding_rate(first_movers,X7),disbanding_rate(efficient_producers,X7))))),file('/tmp/SRASS.s.p', l3)).
% fof(9, axiom,![X1]:![X2]:(greater_or_equal(X1,X2)=>(greater(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', mp_greater_or_equal)).
% fof(10, axiom,![X4]:![X5]:![X6]:((((environment(X4)&greater_or_equal(X5,start_time(X4)))&greater(X6,X5))&in_environment(X4,X6))=>in_environment(X4,X5)),file('/tmp/SRASS.s.p', mp_times_in_order)).
% fof(11, conjecture,![X4]:![X7]:((environment(X4)&subpopulations(first_movers,efficient_producers,X4,X7))=>greater(disbanding_rate(first_movers,X7),disbanding_rate(efficient_producers,X7))),file('/tmp/SRASS.s.p', prove_l2)).
% fof(12, negated_conjecture,~(![X4]:![X7]:((environment(X4)&subpopulations(first_movers,efficient_producers,X4,X7))=>greater(disbanding_rate(first_movers,X7),disbanding_rate(efficient_producers,X7)))),inference(assume_negation,[status(cth)],[11])).
% fof(13, plain,![X4]:![X7]:![X5]:![X6]:(((((environment(X4)&greater_or_equal(X7,X5))&greater_or_equal(X6,X7))&subpopulations(first_movers,efficient_producers,X4,X6))&greater(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5)))=>(~(decreases(difference(disbanding_rate(first_movers,X7),disbanding_rate(efficient_producers,X7))))=>greater(disbanding_rate(first_movers,X6),disbanding_rate(efficient_producers,X6)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(14, plain,![X4]:![X7]:((environment(X4)&subpopulations(first_movers,efficient_producers,X4,X7))=>~(decreases(difference(disbanding_rate(first_movers,X7),disbanding_rate(efficient_producers,X7))))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(18, plain,![X4]:(~(environment(X4))|greater(disbanding_rate(first_movers,initial_FM_EP(X4)),disbanding_rate(efficient_producers,initial_FM_EP(X4)))),inference(fof_nnf,[status(thm)],[2])).
% fof(19, plain,![X5]:(~(environment(X5))|greater(disbanding_rate(first_movers,initial_FM_EP(X5)),disbanding_rate(efficient_producers,initial_FM_EP(X5)))),inference(variable_rename,[status(thm)],[18])).
% cnf(20,plain,(greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))|~environment(X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(24, plain,![X4]:![X7]:(~(environment(X4))|((~(in_environment(X4,initial_FM_EP(X4)))|subpopulations(first_movers,efficient_producers,X4,initial_FM_EP(X4)))&(~(subpopulations(first_movers,efficient_producers,X4,X7))|greater_or_equal(X7,initial_FM_EP(X4))))),inference(fof_nnf,[status(thm)],[4])).
% fof(25, plain,![X8]:![X9]:(~(environment(X8))|((~(in_environment(X8,initial_FM_EP(X8)))|subpopulations(first_movers,efficient_producers,X8,initial_FM_EP(X8)))&(~(subpopulations(first_movers,efficient_producers,X8,X9))|greater_or_equal(X9,initial_FM_EP(X8))))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X8]:![X9]:(((~(in_environment(X8,initial_FM_EP(X8)))|subpopulations(first_movers,efficient_producers,X8,initial_FM_EP(X8)))|~(environment(X8)))&((~(subpopulations(first_movers,efficient_producers,X8,X9))|greater_or_equal(X9,initial_FM_EP(X8)))|~(environment(X8)))),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(greater_or_equal(X2,initial_FM_EP(X1))|~environment(X1)|~subpopulations(first_movers,efficient_producers,X1,X2)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))|~environment(X1)|~in_environment(X1,initial_FM_EP(X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(29, plain,![X4]:![X7]:((~(environment(X4))|~(subpopulations(first_movers,efficient_producers,X4,X7)))|in_environment(X4,X7)),inference(fof_nnf,[status(thm)],[5])).
% fof(30, plain,![X8]:![X9]:((~(environment(X8))|~(subpopulations(first_movers,efficient_producers,X8,X9)))|in_environment(X8,X9)),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X4]:![X7]:![X5]:![X6]:(((((~(environment(X4))|~(greater_or_equal(X7,X5)))|~(greater_or_equal(X6,X7)))|~(subpopulations(first_movers,efficient_producers,X4,X6)))|~(greater(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))))|(decreases(difference(disbanding_rate(first_movers,X7),disbanding_rate(efficient_producers,X7)))|greater(disbanding_rate(first_movers,X6),disbanding_rate(efficient_producers,X6)))),inference(fof_nnf,[status(thm)],[13])).
% fof(33, plain,![X8]:![X9]:![X10]:![X11]:(((((~(environment(X8))|~(greater_or_equal(X9,X10)))|~(greater_or_equal(X11,X9)))|~(subpopulations(first_movers,efficient_producers,X8,X11)))|~(greater(disbanding_rate(first_movers,X10),disbanding_rate(efficient_producers,X10))))|(decreases(difference(disbanding_rate(first_movers,X9),disbanding_rate(efficient_producers,X9)))|greater(disbanding_rate(first_movers,X11),disbanding_rate(efficient_producers,X11)))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))|decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))|~greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3))|~subpopulations(first_movers,efficient_producers,X4,X1)|~greater_or_equal(X1,X2)|~greater_or_equal(X2,X3)|~environment(X4)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X4]:(~(environment(X4))|greater_or_equal(initial_FM_EP(X4),start_time(X4))),inference(fof_nnf,[status(thm)],[7])).
% fof(36, plain,![X5]:(~(environment(X5))|greater_or_equal(initial_FM_EP(X5),start_time(X5))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(greater_or_equal(initial_FM_EP(X1),start_time(X1))|~environment(X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X4]:![X7]:((~(environment(X4))|~(subpopulations(first_movers,efficient_producers,X4,X7)))|~(decreases(difference(disbanding_rate(first_movers,X7),disbanding_rate(efficient_producers,X7))))),inference(fof_nnf,[status(thm)],[14])).
% fof(39, plain,![X8]:![X9]:((~(environment(X8))|~(subpopulations(first_movers,efficient_producers,X8,X9)))|~(decreases(difference(disbanding_rate(first_movers,X9),disbanding_rate(efficient_producers,X9))))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(~decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X1]:![X2]:(~(greater_or_equal(X1,X2))|(greater(X1,X2)|X1=X2)),inference(fof_nnf,[status(thm)],[9])).
% fof(42, plain,![X3]:![X4]:(~(greater_or_equal(X3,X4))|(greater(X3,X4)|X3=X4)),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X4]:![X5]:![X6]:((((~(environment(X4))|~(greater_or_equal(X5,start_time(X4))))|~(greater(X6,X5)))|~(in_environment(X4,X6)))|in_environment(X4,X5)),inference(fof_nnf,[status(thm)],[10])).
% fof(45, plain,![X7]:![X8]:![X9]:((((~(environment(X7))|~(greater_or_equal(X8,start_time(X7))))|~(greater(X9,X8)))|~(in_environment(X7,X9)))|in_environment(X7,X8)),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(in_environment(X1,X2)|~in_environment(X1,X3)|~greater(X3,X2)|~greater_or_equal(X2,start_time(X1))|~environment(X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, negated_conjecture,?[X4]:?[X7]:((environment(X4)&subpopulations(first_movers,efficient_producers,X4,X7))&~(greater(disbanding_rate(first_movers,X7),disbanding_rate(efficient_producers,X7)))),inference(fof_nnf,[status(thm)],[12])).
% fof(48, negated_conjecture,?[X8]:?[X9]:((environment(X8)&subpopulations(first_movers,efficient_producers,X8,X9))&~(greater(disbanding_rate(first_movers,X9),disbanding_rate(efficient_producers,X9)))),inference(variable_rename,[status(thm)],[47])).
% fof(49, negated_conjecture,((environment(esk1_0)&subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))&~(greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))),inference(skolemize,[status(esa)],[48])).
% cnf(50,negated_conjecture,(~greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,negated_conjecture,(subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,negated_conjecture,(environment(esk1_0)),inference(split_conjunct,[status(thm)],[49])).
% cnf(54,plain,(X1=initial_FM_EP(X2)|greater(X1,initial_FM_EP(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)),inference(spm,[status(thm)],[43,27,theory(equality)])).
% cnf(57,plain,(in_environment(X1,initial_FM_EP(X1))|~in_environment(X1,X2)|~environment(X1)|~greater(X2,initial_FM_EP(X1))),inference(spm,[status(thm)],[46,37,theory(equality)])).
% cnf(61,plain,(decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|greater(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))|~greater_or_equal(X1,initial_FM_EP(X3))|~greater_or_equal(X2,X1)|~subpopulations(first_movers,efficient_producers,X4,X2)|~environment(X4)|~environment(X3)),inference(spm,[status(thm)],[34,20,theory(equality)])).
% cnf(72,plain,(in_environment(X1,initial_FM_EP(X1))|X2=initial_FM_EP(X1)|~in_environment(X1,X2)|~environment(X1)|~subpopulations(first_movers,efficient_producers,X1,X2)),inference(spm,[status(thm)],[57,54,theory(equality)])).
% cnf(73,negated_conjecture,(decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))|~greater_or_equal(X1,initial_FM_EP(X2))|~greater_or_equal(esk2_0,X1)|~environment(esk1_0)|~environment(X2)),inference(spm,[status(thm)],[61,51,theory(equality)])).
% cnf(75,negated_conjecture,(decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))|~greater_or_equal(X1,initial_FM_EP(X2))|~greater_or_equal(esk2_0,X1)|$false|~environment(X2)),inference(rw,[status(thm)],[73,52,theory(equality)])).
% cnf(76,negated_conjecture,(decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))|~greater_or_equal(X1,initial_FM_EP(X2))|~greater_or_equal(esk2_0,X1)|~environment(X2)),inference(cn,[status(thm)],[75,theory(equality)])).
% cnf(77,negated_conjecture,(decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~greater_or_equal(X1,initial_FM_EP(X2))|~greater_or_equal(esk2_0,X1)|~environment(X2)),inference(sr,[status(thm)],[76,50,theory(equality)])).
% cnf(80,negated_conjecture,(decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~greater_or_equal(esk2_0,X1)|~environment(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)),inference(spm,[status(thm)],[77,27,theory(equality)])).
% cnf(81,negated_conjecture,(~greater_or_equal(esk2_0,X1)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)),inference(csr,[status(thm)],[80,40])).
% cnf(168,plain,(X2=initial_FM_EP(X1)|in_environment(X1,initial_FM_EP(X1))|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1)),inference(csr,[status(thm)],[72,31])).
% cnf(169,negated_conjecture,(esk2_0=initial_FM_EP(esk1_0)|in_environment(esk1_0,initial_FM_EP(esk1_0))|~environment(esk1_0)),inference(spm,[status(thm)],[168,51,theory(equality)])).
% cnf(170,negated_conjecture,(esk2_0=initial_FM_EP(esk1_0)|in_environment(esk1_0,initial_FM_EP(esk1_0))|$false),inference(rw,[status(thm)],[169,52,theory(equality)])).
% cnf(171,negated_conjecture,(esk2_0=initial_FM_EP(esk1_0)|in_environment(esk1_0,initial_FM_EP(esk1_0))),inference(cn,[status(thm)],[170,theory(equality)])).
% cnf(172,negated_conjecture,(subpopulations(first_movers,efficient_producers,esk1_0,initial_FM_EP(esk1_0))|initial_FM_EP(esk1_0)=esk2_0|~environment(esk1_0)),inference(spm,[status(thm)],[28,171,theory(equality)])).
% cnf(173,negated_conjecture,(subpopulations(first_movers,efficient_producers,esk1_0,initial_FM_EP(esk1_0))|initial_FM_EP(esk1_0)=esk2_0|$false),inference(rw,[status(thm)],[172,52,theory(equality)])).
% cnf(174,negated_conjecture,(subpopulations(first_movers,efficient_producers,esk1_0,initial_FM_EP(esk1_0))|initial_FM_EP(esk1_0)=esk2_0),inference(cn,[status(thm)],[173,theory(equality)])).
% cnf(175,negated_conjecture,(initial_FM_EP(esk1_0)=esk2_0|~greater_or_equal(esk2_0,initial_FM_EP(esk1_0))|~environment(esk1_0)),inference(spm,[status(thm)],[81,174,theory(equality)])).
% cnf(179,negated_conjecture,(initial_FM_EP(esk1_0)=esk2_0|~greater_or_equal(esk2_0,initial_FM_EP(esk1_0))|$false),inference(rw,[status(thm)],[175,52,theory(equality)])).
% cnf(180,negated_conjecture,(initial_FM_EP(esk1_0)=esk2_0|~greater_or_equal(esk2_0,initial_FM_EP(esk1_0))),inference(cn,[status(thm)],[179,theory(equality)])).
% cnf(188,negated_conjecture,(initial_FM_EP(esk1_0)=esk2_0|~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)|~environment(esk1_0)),inference(spm,[status(thm)],[180,27,theory(equality)])).
% cnf(189,negated_conjecture,(initial_FM_EP(esk1_0)=esk2_0|$false|~environment(esk1_0)),inference(rw,[status(thm)],[188,51,theory(equality)])).
% cnf(190,negated_conjecture,(initial_FM_EP(esk1_0)=esk2_0|$false|$false),inference(rw,[status(thm)],[189,52,theory(equality)])).
% cnf(191,negated_conjecture,(initial_FM_EP(esk1_0)=esk2_0),inference(cn,[status(thm)],[190,theory(equality)])).
% cnf(193,negated_conjecture,(greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))|~environment(esk1_0)),inference(spm,[status(thm)],[20,191,theory(equality)])).
% cnf(218,negated_conjecture,(greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))|$false),inference(rw,[status(thm)],[193,52,theory(equality)])).
% cnf(219,negated_conjecture,(greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),inference(cn,[status(thm)],[218,theory(equality)])).
% cnf(220,negated_conjecture,($false),inference(sr,[status(thm)],[219,50,theory(equality)])).
% cnf(221,negated_conjecture,($false),220,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 74
% # ...of these trivial : 0
% # ...subsumed : 13
% # ...remaining for further processing: 61
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 6
% # Generated clauses : 72
% # ...of the previous two non-trivial : 59
% # Contextual simplify-reflections : 5
% # Paramodulations : 72
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 34
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 28
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 5
% # Clause-clause subsumption calls (NU) : 123
% # Rec. Clause-clause subsumption calls : 62
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 41 leaves, 1.90+/-1.694 terms/leaf
% # Paramod-from index: 12 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 37 leaves, 1.32+/-0.902 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.003 s
% # Total time : 0.020 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/SystemOnTPTP5190/MGT020+1.tptp
%
%------------------------------------------------------------------------------