TSTP Solution File: MGT036+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT036+3 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:06:44 EDT 2022
% Result : Theorem 7.25s 2.30s
% Output : CNFRefutation 7.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 10 unt; 0 nHn; 19 RR)
% Number of literals : 41 ( 0 equ; 26 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,hypothesis,
( outcompetes(X1,X2,X3)
| ~ environment(X4)
| ~ subpopulations(X2,X1,X4,X3)
| ~ greater(zero,growth_rate(X2,X3))
| ~ greater_or_equal(growth_rate(X1,X3),zero) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6l19_u49/lgb.p',i_0_4) ).
cnf(i_0_6,hypothesis,
greater_or_equal(growth_rate(first_movers,esk2_0),zero),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6l19_u49/lgb.p',i_0_6) ).
cnf(i_0_9,negated_conjecture,
( ~ environment(X1)
| ~ outcompetes(first_movers,efficient_producers,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6l19_u49/lgb.p',i_0_9) ).
cnf(i_0_1,plain,
( subpopulations(X1,X2,X3,X4)
| ~ environment(X3)
| ~ subpopulations(X2,X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6l19_u49/lgb.p',i_0_1) ).
cnf(i_0_5,hypothesis,
greater(zero,growth_rate(efficient_producers,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6l19_u49/lgb.p',i_0_5) ).
cnf(i_0_7,hypothesis,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6l19_u49/lgb.p',i_0_7) ).
cnf(i_0_8,hypothesis,
environment(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6l19_u49/lgb.p',i_0_8) ).
cnf(c_0_17,hypothesis,
( outcompetes(X1,X2,X3)
| ~ environment(X4)
| ~ subpopulations(X2,X1,X4,X3)
| ~ greater(zero,growth_rate(X2,X3))
| ~ greater_or_equal(growth_rate(X1,X3),zero) ),
i_0_4 ).
cnf(c_0_18,hypothesis,
greater_or_equal(growth_rate(first_movers,esk2_0),zero),
i_0_6 ).
cnf(c_0_19,negated_conjecture,
( ~ environment(X1)
| ~ outcompetes(first_movers,efficient_producers,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
i_0_9 ).
cnf(c_0_20,plain,
( subpopulations(X1,X2,X3,X4)
| ~ environment(X3)
| ~ subpopulations(X2,X1,X3,X4) ),
i_0_1 ).
cnf(c_0_21,hypothesis,
( outcompetes(first_movers,X1,esk2_0)
| ~ greater(zero,growth_rate(X1,esk2_0))
| ~ environment(X2)
| ~ subpopulations(X1,first_movers,X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,hypothesis,
greater(zero,growth_rate(efficient_producers,esk2_0)),
i_0_5 ).
cnf(c_0_23,negated_conjecture,
( ~ outcompetes(first_movers,efficient_producers,X1)
| ~ environment(X2)
| ~ subpopulations(efficient_producers,first_movers,X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,hypothesis,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
i_0_7 ).
cnf(c_0_25,hypothesis,
environment(esk1_0),
i_0_8 ).
cnf(c_0_26,hypothesis,
( ~ environment(X1)
| ~ subpopulations(efficient_producers,first_movers,X1,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_27,hypothesis,
subpopulations(efficient_producers,first_movers,esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_24]),c_0_25])]) ).
cnf(c_0_28,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT036+3 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jun 9 07:44:19 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 7.25/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.25/2.30 # No SInE strategy applied
% 7.25/2.30 # Trying AutoSched0 for 150 seconds
% 7.25/2.30 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02FN
% 7.25/2.30 # and selection function PSelectNonAntiRROptimalLit.
% 7.25/2.30 #
% 7.25/2.30 # Preprocessing time : 0.023 s
% 7.25/2.30 # Presaturation interreduction done
% 7.25/2.30
% 7.25/2.30 # Proof found!
% 7.25/2.30 # SZS status Theorem
% 7.25/2.30 # SZS output start CNFRefutation
% See solution above
% 7.25/2.30 # Training examples: 0 positive, 0 negative
% 7.25/2.30
% 7.25/2.30 # -------------------------------------------------
% 7.25/2.30 # User time : 0.026 s
% 7.25/2.30 # System time : 0.004 s
% 7.25/2.30 # Total time : 0.029 s
% 7.25/2.30 # Maximum resident set size: 7124 pages
% 7.25/2.30
%------------------------------------------------------------------------------