TSTP Solution File: MGT036+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT036+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:35:43 EDT 2023
% Result : Theorem 0.11s 0.36s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 11 unt; 0 def)
% Number of atoms : 131 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 159 ( 70 ~; 56 |; 21 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 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 : 91 ( 11 sgn; 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2,hypothesis,
! [X1,X3,X4,X2] :
( ( environment(X1)
& subpopulations(X3,X4,X1,X2) )
=> ( ( greater_or_equal(growth_rate(X4,X2),zero)
& greater(zero,growth_rate(X3,X2)) )
<=> outcompetes(X4,X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.KD7NtAGrBG/E---3.1_29517.p',d2) ).
fof(mp_symmetry_of_FM_and_EP,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> subpopulations(efficient_producers,first_movers,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.KD7NtAGrBG/E---3.1_29517.p',mp_symmetry_of_FM_and_EP) ).
fof(prove_t5,conjecture,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ outcompetes(first_movers,efficient_producers,X2) ),
file('/export/starexec/sandbox/tmp/tmp.KD7NtAGrBG/E---3.1_29517.p',prove_t5) ).
fof(mp_growth_rate_relationships,axiom,
! [X1,X3,X4,X2] :
( ( ( environment(X1)
& subpopulations(X3,X4,X1,X2) )
=> greater_or_equal(growth_rate(X3,X2),zero) )
<=> ~ greater(zero,growth_rate(X3,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.KD7NtAGrBG/E---3.1_29517.p',mp_growth_rate_relationships) ).
fof(a12,hypothesis,
! [X1,X3,X4,X2] :
( ( environment(X1)
& in_environment(X1,X2)
& ~ greater(zero,growth_rate(X3,X2))
& greater(resilience(X4),resilience(X3)) )
=> ~ greater(zero,growth_rate(X4,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.KD7NtAGrBG/E---3.1_29517.p',a12) ).
fof(mp_time_point_occur,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.KD7NtAGrBG/E---3.1_29517.p',mp_time_point_occur) ).
fof(a2,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox/tmp/tmp.KD7NtAGrBG/E---3.1_29517.p',a2) ).
fof(c_0_7,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])])]) ).
fof(c_0_8,plain,
! [X19,X20] :
( ~ environment(X19)
| ~ subpopulations(first_movers,efficient_producers,X19,X20)
| subpopulations(efficient_producers,first_movers,X19,X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_symmetry_of_FM_and_EP])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ outcompetes(first_movers,efficient_producers,X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_t5])]) ).
fof(c_0_10,plain,
! [X1,X3,X4,X2] :
( ( ( environment(X1)
& subpopulations(X3,X4,X1,X2) )
=> greater_or_equal(growth_rate(X3,X2),zero) )
<=> ~ greater(zero,growth_rate(X3,X2)) ),
inference(fof_simplification,[status(thm)],[mp_growth_rate_relationships]) ).
cnf(c_0_11,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ outcompetes(X3,X1,X2)
| ~ environment(X4)
| ~ subpopulations(X1,X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( subpopulations(efficient_producers,first_movers,X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,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)],[c_0_9])])]) ).
fof(c_0_14,plain,
! [X15,X16,X17,X18] :
( ( environment(X15)
| ~ greater(zero,growth_rate(X16,X18)) )
& ( subpopulations(X16,X17,X15,X18)
| ~ greater(zero,growth_rate(X16,X18)) )
& ( ~ greater_or_equal(growth_rate(X16,X18),zero)
| ~ greater(zero,growth_rate(X16,X18)) )
& ( greater(zero,growth_rate(X16,X18))
| ~ environment(X15)
| ~ subpopulations(X16,X17,X15,X18)
| greater_or_equal(growth_rate(X16,X18),zero) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_15,hypothesis,
( greater(zero,growth_rate(efficient_producers,X1))
| ~ outcompetes(first_movers,efficient_producers,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
outcompetes(first_movers,efficient_producers,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( environment(X1)
| ~ greater(zero,growth_rate(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
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_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_21,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ environment(X4)
| ~ subpopulations(X3,X1,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
environment(X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_23,hypothesis,
! [X1,X3,X4,X2] :
( ( environment(X1)
& in_environment(X1,X2)
& ~ greater(zero,growth_rate(X3,X2))
& greater(resilience(X4),resilience(X3)) )
=> ~ greater(zero,growth_rate(X4,X2)) ),
inference(fof_simplification,[status(thm)],[a12]) ).
cnf(c_0_24,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ subpopulations(X3,X1,X4,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_25,plain,
( subpopulations(X1,X2,X3,X4)
| ~ greater(zero,growth_rate(X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_26,hypothesis,
! [X9,X10,X11,X12] :
( ~ environment(X9)
| ~ in_environment(X9,X12)
| greater(zero,growth_rate(X10,X12))
| ~ greater(resilience(X11),resilience(X10))
| ~ greater(zero,growth_rate(X11,X12)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])]) ).
cnf(c_0_27,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ greater(zero,growth_rate(X3,X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,hypothesis,
( greater(zero,growth_rate(X3,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(resilience(X4),resilience(X3))
| ~ greater(zero,growth_rate(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,plain,
( ~ greater_or_equal(growth_rate(X1,X2),zero)
| ~ greater(zero,growth_rate(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( greater_or_equal(growth_rate(X1,esk2_0),zero)
| ~ outcompetes(X1,efficient_producers,esk2_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
cnf(c_0_31,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_28,c_0_19]) ).
cnf(c_0_32,negated_conjecture,
( ~ outcompetes(X1,efficient_producers,esk2_0)
| ~ greater(zero,growth_rate(X1,esk2_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_33,plain,
! [X21,X22] :
( ~ environment(X21)
| ~ subpopulations(first_movers,efficient_producers,X21,X22)
| in_environment(X21,X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_occur])]) ).
cnf(c_0_34,negated_conjecture,
( greater(zero,growth_rate(X1,esk2_0))
| ~ greater(resilience(efficient_producers),resilience(X1))
| ~ in_environment(X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_35,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(split_conjunct,[status(thm)],[a2]) ).
cnf(c_0_36,negated_conjecture,
~ greater(zero,growth_rate(first_movers,esk2_0)),
inference(spm,[status(thm)],[c_0_32,c_0_17]) ).
cnf(c_0_37,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,hypothesis,
~ in_environment(X1,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_22])]) ).
cnf(c_0_40,hypothesis,
~ subpopulations(first_movers,efficient_producers,X1,esk2_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_16,c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : MGT036+1 : TPTP v8.1.2. Released v2.0.0.
% 0.04/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n026.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 2400
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Tue Oct 3 00:43:59 EDT 2023
% 0.07/0.27 % CPUTime :
% 0.11/0.35 Running first-order theorem proving
% 0.11/0.35 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.KD7NtAGrBG/E---3.1_29517.p
% 0.11/0.36 # Version: 3.1pre001
% 0.11/0.36 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.36 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.36 # Starting sh5l with 300s (1) cores
% 0.11/0.36 # new_bool_3 with pid 29611 completed with status 0
% 0.11/0.36 # Result found by new_bool_3
% 0.11/0.36 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.36 # Search class: FGHNF-FFSS21-SFFFFFNN
% 0.11/0.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.36 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.11/0.36 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 29616 completed with status 0
% 0.11/0.36 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.36 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.36 # Search class: FGHNF-FFSS21-SFFFFFNN
% 0.11/0.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.36 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.11/0.36 # Preprocessing time : 0.001 s
% 0.11/0.36 # Presaturation interreduction done
% 0.11/0.36
% 0.11/0.36 # Proof found!
% 0.11/0.36 # SZS status Theorem
% 0.11/0.36 # SZS output start CNFRefutation
% See solution above
% 0.11/0.36 # Parsed axioms : 7
% 0.11/0.36 # Removed by relevancy pruning/SinE : 0
% 0.11/0.36 # Initial clauses : 14
% 0.11/0.36 # Removed in clause preprocessing : 0
% 0.11/0.36 # Initial clauses in saturation : 14
% 0.11/0.36 # Processed clauses : 55
% 0.11/0.36 # ...of these trivial : 0
% 0.11/0.36 # ...subsumed : 4
% 0.11/0.36 # ...remaining for further processing : 51
% 0.11/0.36 # Other redundant clauses eliminated : 0
% 0.11/0.36 # Clauses deleted for lack of memory : 0
% 0.11/0.36 # Backward-subsumed : 4
% 0.11/0.36 # Backward-rewritten : 7
% 0.11/0.36 # Generated clauses : 37
% 0.11/0.36 # ...of the previous two non-redundant : 32
% 0.11/0.36 # ...aggressively subsumed : 0
% 0.11/0.36 # Contextual simplify-reflections : 4
% 0.11/0.36 # Paramodulations : 36
% 0.11/0.36 # Factorizations : 0
% 0.11/0.36 # NegExts : 0
% 0.11/0.36 # Equation resolutions : 0
% 0.11/0.36 # Total rewrite steps : 19
% 0.11/0.36 # Propositional unsat checks : 0
% 0.11/0.36 # Propositional check models : 0
% 0.11/0.36 # Propositional check unsatisfiable : 0
% 0.11/0.36 # Propositional clauses : 0
% 0.11/0.36 # Propositional clauses after purity: 0
% 0.11/0.36 # Propositional unsat core size : 0
% 0.11/0.36 # Propositional preprocessing time : 0.000
% 0.11/0.36 # Propositional encoding time : 0.000
% 0.11/0.36 # Propositional solver time : 0.000
% 0.11/0.36 # Success case prop preproc time : 0.000
% 0.11/0.36 # Success case prop encoding time : 0.000
% 0.11/0.36 # Success case prop solver time : 0.000
% 0.11/0.36 # Current number of processed clauses : 25
% 0.11/0.36 # Positive orientable unit clauses : 5
% 0.11/0.36 # Positive unorientable unit clauses: 0
% 0.11/0.36 # Negative unit clauses : 4
% 0.11/0.36 # Non-unit-clauses : 16
% 0.11/0.36 # Current number of unprocessed clauses: 3
% 0.11/0.36 # ...number of literals in the above : 11
% 0.11/0.36 # Current number of archived formulas : 0
% 0.11/0.36 # Current number of archived clauses : 26
% 0.11/0.36 # Clause-clause subsumption calls (NU) : 119
% 0.11/0.36 # Rec. Clause-clause subsumption calls : 89
% 0.11/0.36 # Non-unit clause-clause subsumptions : 7
% 0.11/0.36 # Unit Clause-clause subsumption calls : 43
% 0.11/0.36 # Rewrite failures with RHS unbound : 0
% 0.11/0.36 # BW rewrite match attempts : 4
% 0.11/0.36 # BW rewrite match successes : 4
% 0.11/0.36 # Condensation attempts : 0
% 0.11/0.36 # Condensation successes : 0
% 0.11/0.36 # Termbank termtop insertions : 1811
% 0.11/0.36
% 0.11/0.36 # -------------------------------------------------
% 0.11/0.36 # User time : 0.003 s
% 0.11/0.36 # System time : 0.002 s
% 0.11/0.36 # Total time : 0.005 s
% 0.11/0.36 # Maximum resident set size: 1764 pages
% 0.11/0.36
% 0.11/0.36 # -------------------------------------------------
% 0.11/0.36 # User time : 0.003 s
% 0.11/0.36 # System time : 0.004 s
% 0.11/0.36 # Total time : 0.008 s
% 0.11/0.36 # Maximum resident set size: 1680 pages
% 0.11/0.36 % E---3.1 exiting
% 0.11/0.36 % E---3.1 exiting
%------------------------------------------------------------------------------