TSTP Solution File: MGT023+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT023+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:36:03 EDT 2023
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 106 ( 11 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 130 ( 47 ~; 49 |; 24 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn; 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1,hypothesis,
! [X1,X2] :
( ( environment(X1)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
& in_environment(X1,X2)
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater(X3,X2) )
=> greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) )
=> X2 = critical_point(X1) ),
file('/export/starexec/sandbox/tmp/tmp.bfstsJNcKA/E---3.1_27313.p',d1) ).
fof(l12,hypothesis,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( in_environment(X1,X2)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater(X3,X2) )
=> greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bfstsJNcKA/E---3.1_27313.p',l12) ).
fof(prove_l5,conjecture,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> in_environment(X1,critical_point(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.bfstsJNcKA/E---3.1_27313.p',prove_l5) ).
fof(c_0_3,hypothesis,
! [X1,X2] :
( ( environment(X1)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
& in_environment(X1,X2)
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater(X3,X2) )
=> greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) )
=> X2 = critical_point(X1) ),
inference(fof_simplification,[status(thm)],[d1]) ).
fof(c_0_4,hypothesis,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( in_environment(X1,X2)
& ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater(X3,X2) )
=> greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) ) ),
inference(fof_simplification,[status(thm)],[l12]) ).
fof(c_0_5,hypothesis,
! [X4,X5] :
( ( subpopulations(first_movers,efficient_producers,X4,esk1_2(X4,X5))
| ~ environment(X4)
| greater(growth_rate(efficient_producers,X5),growth_rate(first_movers,X5))
| ~ in_environment(X4,X5)
| X5 = critical_point(X4) )
& ( greater(esk1_2(X4,X5),X5)
| ~ environment(X4)
| greater(growth_rate(efficient_producers,X5),growth_rate(first_movers,X5))
| ~ in_environment(X4,X5)
| X5 = critical_point(X4) )
& ( ~ greater(growth_rate(efficient_producers,esk1_2(X4,X5)),growth_rate(first_movers,esk1_2(X4,X5)))
| ~ environment(X4)
| greater(growth_rate(efficient_producers,X5),growth_rate(first_movers,X5))
| ~ in_environment(X4,X5)
| X5 = critical_point(X4) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,hypothesis,
! [X7,X9] :
( ( in_environment(X7,esk2_1(X7))
| ~ environment(X7)
| ~ stable(X7) )
& ( ~ greater(growth_rate(efficient_producers,esk2_1(X7)),growth_rate(first_movers,esk2_1(X7)))
| ~ environment(X7)
| ~ stable(X7) )
& ( ~ subpopulations(first_movers,efficient_producers,X7,X9)
| ~ greater(X9,esk2_1(X7))
| greater(growth_rate(efficient_producers,X9),growth_rate(first_movers,X9))
| ~ environment(X7)
| ~ stable(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_4])])])])]) ).
cnf(c_0_7,hypothesis,
( subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,X2))
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| X2 = critical_point(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
( in_environment(X1,esk2_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
( ~ greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> in_environment(X1,critical_point(X1)) ),
inference(assume_negation,[status(cth)],[prove_l5]) ).
cnf(c_0_11,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater(X2,esk2_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,hypothesis,
( critical_point(X1) = esk2_1(X1)
| subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,esk2_1(X1)))
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
fof(c_0_13,negated_conjecture,
( environment(esk3_0)
& stable(esk3_0)
& ~ in_environment(esk3_0,critical_point(esk3_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_14,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| X2 = critical_point(X1)
| ~ greater(growth_rate(efficient_producers,esk1_2(X1,X2)),growth_rate(first_movers,esk1_2(X1,X2)))
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,hypothesis,
( critical_point(X1) = esk2_1(X1)
| greater(growth_rate(efficient_producers,esk1_2(X1,esk2_1(X1))),growth_rate(first_movers,esk1_2(X1,esk2_1(X1))))
| ~ stable(X1)
| ~ greater(esk1_2(X1,esk2_1(X1)),esk2_1(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
( greater(esk1_2(X1,X2),X2)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| X2 = critical_point(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
~ in_environment(esk3_0,critical_point(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
( critical_point(X1) = esk2_1(X1)
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_8]),c_0_9]) ).
cnf(c_0_19,negated_conjecture,
stable(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
environment(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
~ in_environment(esk3_0,esk2_1(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_22,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_8]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT023+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 00:43:29 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.bfstsJNcKA/E---3.1_27313.p
% 0.19/0.48 # Version: 3.1pre001
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_1 with pid 27393 completed with status 0
% 0.19/0.48 # Result found by new_bool_1
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # SAT001_MinMin_p005000_rr_RG with pid 27399 completed with status 0
% 0.19/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 3
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 9
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 9
% 0.19/0.48 # Processed clauses : 22
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 22
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 2
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 5
% 0.19/0.48 # ...of the previous two non-redundant : 4
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 4
% 0.19/0.48 # Paramodulations : 5
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Total rewrite steps : 4
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 11
% 0.19/0.48 # Positive orientable unit clauses : 2
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 2
% 0.19/0.48 # Non-unit-clauses : 7
% 0.19/0.48 # Current number of unprocessed clauses: 0
% 0.19/0.48 # ...number of literals in the above : 0
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 11
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 66
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 10
% 0.19/0.48 # Non-unit clause-clause subsumptions : 6
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 1039
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.007 s
% 0.19/0.48 # Maximum resident set size: 1752 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.003 s
% 0.19/0.48 # Total time : 0.010 s
% 0.19/0.48 # Maximum resident set size: 1676 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------