TSTP Solution File: MGT023+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT023+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:18 EDT 2022
% Result : Theorem 7.21s 2.22s
% Output : CNFRefutation 7.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 8 unt; 8 nHn; 24 RR)
% Number of literals : 76 ( 10 equ; 45 neg)
% Maximal clause size : 5 ( 3 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 : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,hypothesis,
( X1 = critical_point(X2)
| subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X1))
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ in_environment(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gqoj4l8a/input.p',i_0_3) ).
cnf(i_0_6,hypothesis,
( in_environment(X1,esk2_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gqoj4l8a/input.p',i_0_6) ).
cnf(i_0_5,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gqoj4l8a/input.p',i_0_5) ).
cnf(i_0_4,hypothesis,
( greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ stable(X2)
| ~ greater(X1,esk2_1(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gqoj4l8a/input.p',i_0_4) ).
cnf(i_0_1,hypothesis,
( X1 = critical_point(X2)
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ in_environment(X2,X1)
| ~ greater(growth_rate(efficient_producers,esk1_2(X2,X1)),growth_rate(first_movers,esk1_2(X2,X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gqoj4l8a/input.p',i_0_1) ).
cnf(i_0_2,hypothesis,
( X1 = critical_point(X2)
| greater(esk1_2(X2,X1),X1)
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ in_environment(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gqoj4l8a/input.p',i_0_2) ).
cnf(i_0_7,negated_conjecture,
~ in_environment(esk3_0,critical_point(esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gqoj4l8a/input.p',i_0_7) ).
cnf(i_0_8,negated_conjecture,
stable(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gqoj4l8a/input.p',i_0_8) ).
cnf(i_0_9,negated_conjecture,
environment(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gqoj4l8a/input.p',i_0_9) ).
cnf(c_0_19,hypothesis,
( X1 = critical_point(X2)
| subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X1))
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ in_environment(X2,X1) ),
i_0_3 ).
cnf(c_0_20,hypothesis,
( in_environment(X1,esk2_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
i_0_6 ).
cnf(c_0_21,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1))) ),
i_0_5 ).
cnf(c_0_22,hypothesis,
( greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ stable(X2)
| ~ greater(X1,esk2_1(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
i_0_4 ).
cnf(c_0_23,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_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,hypothesis,
( X1 = critical_point(X2)
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ in_environment(X2,X1)
| ~ greater(growth_rate(efficient_producers,esk1_2(X2,X1)),growth_rate(first_movers,esk1_2(X2,X1))) ),
i_0_1 ).
cnf(c_0_25,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))))
| ~ greater(esk1_2(X1,esk2_1(X1)),esk2_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,hypothesis,
( critical_point(X1) = esk2_1(X1)
| ~ greater(esk1_2(X1,esk2_1(X1)),esk2_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20]),c_0_21]) ).
cnf(c_0_27,hypothesis,
( X1 = critical_point(X2)
| greater(esk1_2(X2,X1),X1)
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ in_environment(X2,X1) ),
i_0_2 ).
cnf(c_0_28,negated_conjecture,
~ in_environment(esk3_0,critical_point(esk3_0)),
i_0_7 ).
cnf(c_0_29,hypothesis,
( critical_point(X1) = esk2_1(X1)
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20]),c_0_21]) ).
cnf(c_0_30,negated_conjecture,
stable(esk3_0),
i_0_8 ).
cnf(c_0_31,negated_conjecture,
environment(esk3_0),
i_0_9 ).
cnf(c_0_32,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_28,c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_33,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : MGT023+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n024.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 : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 09:38:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.21/2.22 # ENIGMATIC: Solved by autoschedule:
% 7.21/2.22 # No SInE strategy applied
% 7.21/2.22 # Trying AutoSched0 for 150 seconds
% 7.21/2.22 # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.21/2.22 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.21/2.22 #
% 7.21/2.22 # Preprocessing time : 0.013 s
% 7.21/2.22
% 7.21/2.22 # Proof found!
% 7.21/2.22 # SZS status Theorem
% 7.21/2.22 # SZS output start CNFRefutation
% See solution above
% 7.21/2.22 # Training examples: 0 positive, 0 negative
% 7.21/2.22
% 7.21/2.22 # -------------------------------------------------
% 7.21/2.22 # User time : 0.014 s
% 7.21/2.22 # System time : 0.003 s
% 7.21/2.22 # Total time : 0.017 s
% 7.21/2.22 # Maximum resident set size: 7120 pages
% 7.21/2.22
%------------------------------------------------------------------------------