TSTP Solution File: MGT032+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT032+2 : 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:00 EDT 2023
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 101 ( 42 ~; 36 |; 16 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn; 17 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_t1,conjecture,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( in_environment(X1,X5)
& ! [X4] :
( ( subpopulations(first_movers,efficient_producers,X1,X4)
& greater_or_equal(X4,X5) )
=> selection_favors(efficient_producers,first_movers,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Qb5YsSkubw/E---3.1_32389.p',prove_t1) ).
fof(l1,hypothesis,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( in_environment(X1,X5)
& ! [X4] :
( ( subpopulations(first_movers,efficient_producers,X1,X4)
& greater_or_equal(X4,X5) )
=> greater(growth_rate(efficient_producers,X4),growth_rate(first_movers,X4)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Qb5YsSkubw/E---3.1_32389.p',l1) ).
fof(mp1_high_growth_rates,axiom,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4)
& greater(growth_rate(X3,X4),growth_rate(X2,X4)) )
=> selection_favors(X3,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.Qb5YsSkubw/E---3.1_32389.p',mp1_high_growth_rates) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( in_environment(X1,X5)
& ! [X4] :
( ( subpopulations(first_movers,efficient_producers,X1,X4)
& greater_or_equal(X4,X5) )
=> selection_favors(efficient_producers,first_movers,X4) ) ) ),
inference(assume_negation,[status(cth)],[prove_t1]) ).
fof(c_0_4,hypothesis,
! [X13,X15] :
( ( in_environment(X13,esk3_1(X13))
| ~ environment(X13)
| ~ stable(X13) )
& ( ~ subpopulations(first_movers,efficient_producers,X13,X15)
| ~ greater_or_equal(X15,esk3_1(X13))
| greater(growth_rate(efficient_producers,X15),growth_rate(first_movers,X15))
| ~ environment(X13)
| ~ stable(X13) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l1])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X7] :
( environment(esk1_0)
& stable(esk1_0)
& ( subpopulations(first_movers,efficient_producers,esk1_0,esk2_1(X7))
| ~ in_environment(esk1_0,X7) )
& ( greater_or_equal(esk2_1(X7),X7)
| ~ in_environment(esk1_0,X7) )
& ( ~ selection_favors(efficient_producers,first_movers,esk2_1(X7))
| ~ in_environment(esk1_0,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12] :
( ~ environment(X9)
| ~ subpopulations(X10,X11,X9,X12)
| ~ greater(growth_rate(X11,X12),growth_rate(X10,X12))
| selection_favors(X11,X10,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp1_high_growth_rates])]) ).
cnf(c_0_7,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,esk3_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( greater_or_equal(esk2_1(X1),X1)
| ~ in_environment(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( selection_favors(X3,X2,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ greater(growth_rate(X3,X4),growth_rate(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( greater(growth_rate(efficient_producers,esk2_1(esk3_1(X1))),growth_rate(first_movers,esk2_1(esk3_1(X1))))
| ~ in_environment(esk1_0,esk3_1(X1))
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,esk2_1(esk3_1(X1)))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( ~ selection_favors(efficient_producers,first_movers,esk2_1(X1))
| ~ in_environment(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ in_environment(esk1_0,esk3_1(X1))
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X2,esk2_1(esk3_1(X1)))
| ~ subpopulations(first_movers,efficient_producers,X1,esk2_1(esk3_1(X1)))
| ~ environment(X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( subpopulations(first_movers,efficient_producers,esk1_0,esk2_1(X1))
| ~ in_environment(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( ~ in_environment(esk1_0,esk3_1(X1))
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,esk2_1(esk3_1(X1)))
| ~ environment(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_16,negated_conjecture,
stable(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
~ in_environment(esk1_0,esk3_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_16]),c_0_14])]) ).
cnf(c_0_18,hypothesis,
( in_environment(X1,esk3_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : MGT032+2 : TPTP v8.1.2. Released v2.0.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 00:44:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.Qb5YsSkubw/E---3.1_32389.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # sh5l with pid 32496 completed with status 0
% 0.20/0.49 # Result found by sh5l
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FHHNF-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 32497 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FHHNF-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 3
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 8
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 8
% 0.20/0.49 # Processed clauses : 20
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 20
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 2
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 5
% 0.20/0.49 # ...of the previous two non-redundant : 4
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 1
% 0.20/0.49 # Paramodulations : 5
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 5
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 10
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 7
% 0.20/0.49 # Current number of unprocessed clauses: 0
% 0.20/0.49 # ...number of literals in the above : 0
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 10
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 49
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 7
% 0.20/0.49 # Non-unit clause-clause subsumptions : 3
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 859
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1760 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.008 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1672 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------