TSTP Solution File: MGT036+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT036+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:10:08 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 128 ( 56 ~; 46 |; 17 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 78 ( 12 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_t5,conjecture,
! [X1,X4] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X4) )
=> ~ outcompetes(first_movers,efficient_producers,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_t5) ).
fof(mp_symmetry_of_subpopulations,axiom,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> subpopulations(X3,X2,X1,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_symmetry_of_subpopulations) ).
fof(a13,hypothesis,
! [X1,X2,X3,X4] :
( ( environment(X1)
& in_environment(X1,X4)
& ~ greater(zero,growth_rate(X2,X4))
& greater(resilience(X3),resilience(X2)) )
=> ~ greater(zero,growth_rate(X3,X4)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a13) ).
fof(mp_growth_rate_relationships,axiom,
! [X1,X2,X3,X4] :
( ( ( environment(X1)
& subpopulations(X2,X3,X1,X4) )
=> greater_or_equal(growth_rate(X2,X4),zero) )
<=> ~ greater(zero,growth_rate(X2,X4)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_growth_rate_relationships) ).
fof(d2,hypothesis,
! [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('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2) ).
fof(mp_time_point_occur,axiom,
! [X1,X4] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X4) )
=> in_environment(X1,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_time_point_occur) ).
fof(a2,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X4] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X4) )
=> ~ outcompetes(first_movers,efficient_producers,X4) ),
inference(assume_negation,[status(cth)],[prove_t5]) ).
fof(c_0_8,plain,
! [X5,X6,X7,X8] :
( ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8)
| subpopulations(X7,X6,X5,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_symmetry_of_subpopulations])]) ).
fof(c_0_9,negated_conjecture,
( environment(esk1_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& outcompetes(first_movers,efficient_producers,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,hypothesis,
! [X5,X6,X7,X8] :
( ~ environment(X5)
| ~ in_environment(X5,X8)
| greater(zero,growth_rate(X6,X8))
| ~ greater(resilience(X7),resilience(X6))
| ~ greater(zero,growth_rate(X7,X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a13])])]) ).
fof(c_0_11,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( environment(X5)
| ~ greater(zero,growth_rate(X6,X8)) )
& ( subpopulations(X6,X7,X5,X8)
| ~ greater(zero,growth_rate(X6,X8)) )
& ( ~ greater_or_equal(growth_rate(X6,X8),zero)
| ~ greater(zero,growth_rate(X6,X8)) )
& ( greater(zero,growth_rate(X6,X8))
| ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8)
| greater_or_equal(growth_rate(X6,X8),zero) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mp_growth_rate_relationships])])])])])]) ).
fof(c_0_12,hypothesis,
! [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)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2])])]) ).
cnf(c_0_13,plain,
( subpopulations(X1,X2,X3,X4)
| ~ subpopulations(X2,X1,X3,X4)
| ~ environment(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
( greater(zero,growth_rate(X3,X2))
| ~ greater(zero,growth_rate(X1,X2))
| ~ greater(resilience(X1),resilience(X3))
| ~ in_environment(X4,X2)
| ~ environment(X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( environment(X3)
| ~ greater(zero,growth_rate(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,hypothesis,
( greater(zero,growth_rate(X1,X4))
| ~ subpopulations(X1,X2,X3,X4)
| ~ environment(X3)
| ~ outcompetes(X2,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
subpopulations(efficient_producers,first_movers,esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_20,negated_conjecture,
outcompetes(first_movers,efficient_producers,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,hypothesis,
( greater_or_equal(growth_rate(X2,X4),zero)
| ~ subpopulations(X1,X2,X3,X4)
| ~ environment(X3)
| ~ outcompetes(X2,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ greater(zero,growth_rate(X3,X2))
| ~ greater(resilience(X3),resilience(X1))
| ~ in_environment(X4,X2) ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,hypothesis,
greater(zero,growth_rate(efficient_producers,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_15])]) ).
cnf(c_0_24,plain,
( ~ greater(zero,growth_rate(X1,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,hypothesis,
greater_or_equal(growth_rate(first_movers,esk2_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_20]),c_0_15])]) ).
fof(c_0_26,plain,
! [X5,X6] :
( ~ environment(X5)
| ~ subpopulations(first_movers,efficient_producers,X5,X6)
| in_environment(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_occur])]) ).
cnf(c_0_27,hypothesis,
( greater(zero,growth_rate(X1,esk2_0))
| ~ greater(resilience(efficient_producers),resilience(X1))
| ~ in_environment(X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(split_conjunct,[status(thm)],[a2]) ).
cnf(c_0_29,hypothesis,
~ greater(zero,growth_rate(first_movers,esk2_0)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,hypothesis,
environment(X1),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_32,hypothesis,
~ in_environment(X1,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_34,hypothesis,
~ subpopulations(first_movers,efficient_producers,X1,esk2_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_14,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT036+2 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 12:10:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.015 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 36
% 0.24/1.42 # Proof object clause steps : 22
% 0.24/1.42 # Proof object formula steps : 14
% 0.24/1.42 # Proof object conjectures : 8
% 0.24/1.42 # Proof object clause conjectures : 5
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 11
% 0.24/1.42 # Proof object initial formulas used : 7
% 0.24/1.42 # Proof object generating inferences : 8
% 0.24/1.42 # Proof object simplifying inferences : 13
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 7
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 14
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 14
% 0.24/1.42 # Processed clauses : 33
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 3
% 0.24/1.42 # ...remaining for further processing : 30
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 7
% 0.24/1.42 # Generated clauses : 38
% 0.24/1.42 # ...of the previous two non-trivial : 30
% 0.24/1.42 # Contextual simplify-reflections : 5
% 0.24/1.42 # Paramodulations : 37
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 22
% 0.24/1.42 # Positive orientable unit clauses : 6
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 3
% 0.24/1.42 # Non-unit-clauses : 13
% 0.24/1.42 # Current number of unprocessed clauses: 4
% 0.24/1.42 # ...number of literals in the above : 10
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 8
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 63
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 38
% 0.24/1.42 # Non-unit clause-clause subsumptions : 8
% 0.24/1.42 # Unit Clause-clause subsumption calls : 28
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 4
% 0.24/1.42 # BW rewrite match successes : 4
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 1609
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.014 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.017 s
% 0.24/1.42 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------