TSTP Solution File: MGT027+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT027+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:20 EDT 2022
% Result : Theorem 7.90s 2.40s
% Output : CNFRefutation 7.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 56 ( 7 unt; 12 nHn; 55 RR)
% Number of literals : 235 ( 10 equ; 167 neg)
% Maximal clause size : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_7) ).
cnf(i_0_13,hypothesis,
( greater(esk2_1(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_13) ).
cnf(i_0_10,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_10) ).
cnf(i_0_2,plain,
( contracts_from(X1,first_movers)
| greater_or_equal(esk1_2(X2,X1),X1)
| ~ environment(X2)
| ~ stable(X2)
| ~ in_environment(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_2) ).
cnf(i_0_12,hypothesis,
( greater(zero,growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ stable(X2)
| ~ greater_or_equal(X1,esk2_1(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_12) ).
cnf(i_0_1,plain,
( contracts_from(X1,first_movers)
| ~ environment(X2)
| ~ stable(X2)
| ~ in_environment(X2,X1)
| ~ greater(zero,growth_rate(first_movers,esk1_2(X2,X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_1) ).
cnf(i_0_11,hypothesis,
( greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ environment(X2)
| ~ in_environment(X2,X1)
| ~ greater_or_equal(X1,appear(efficient_producers,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_11) ).
cnf(i_0_9,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_9) ).
cnf(i_0_4,plain,
( subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(cardinality_at_time(first_movers,X2),zero)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_4) ).
cnf(i_0_3,plain,
( contracts_from(X1,first_movers)
| greater(cardinality_at_time(first_movers,esk1_2(X2,X1)),zero)
| ~ environment(X2)
| ~ stable(X2)
| ~ in_environment(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_3) ).
cnf(i_0_5,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X3)
| ~ greater(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_5) ).
cnf(i_0_8,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_8) ).
cnf(i_0_6,plain,
( in_environment(X1,appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_6) ).
cnf(i_0_14,negated_conjecture,
( ~ contracts_from(X1,first_movers)
| ~ greater(X1,appear(efficient_producers,esk3_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_14) ).
cnf(i_0_15,negated_conjecture,
stable(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_15) ).
cnf(i_0_16,negated_conjecture,
environment(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8q217oas/lgb.p',i_0_16) ).
cnf(c_0_33,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
i_0_7 ).
cnf(c_0_34,hypothesis,
( greater(esk2_1(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
i_0_13 ).
cnf(c_0_35,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
i_0_10 ).
cnf(c_0_36,plain,
( contracts_from(X1,first_movers)
| greater_or_equal(esk1_2(X2,X1),X1)
| ~ environment(X2)
| ~ stable(X2)
| ~ in_environment(X2,X1) ),
i_0_2 ).
cnf(c_0_37,hypothesis,
( greater(zero,growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ stable(X2)
| ~ greater_or_equal(X1,esk2_1(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
i_0_12 ).
cnf(c_0_38,plain,
( contracts_from(X1,first_movers)
| ~ environment(X2)
| ~ stable(X2)
| ~ in_environment(X2,X1)
| ~ greater(zero,growth_rate(first_movers,esk1_2(X2,X1))) ),
i_0_1 ).
cnf(c_0_39,hypothesis,
( greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ environment(X2)
| ~ in_environment(X2,X1)
| ~ greater_or_equal(X1,appear(efficient_producers,X2)) ),
i_0_11 ).
cnf(c_0_40,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
i_0_9 ).
cnf(c_0_41,hypothesis,
( greater(X1,appear(efficient_producers,X2))
| ~ greater(X1,esk2_1(X2))
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,plain,
( esk1_2(X1,X2) = X2
| greater(esk1_2(X1,X2),X2)
| contracts_from(X2,first_movers)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( contracts_from(esk2_1(X1),first_movers)
| ~ subpopulations(first_movers,efficient_producers,X1,esk1_2(X2,esk2_1(X1)))
| ~ in_environment(X2,esk2_1(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_38]) ).
cnf(c_0_44,plain,
( subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(cardinality_at_time(first_movers,X2),zero)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
i_0_4 ).
cnf(c_0_45,plain,
( contracts_from(X1,first_movers)
| greater(cardinality_at_time(first_movers,esk1_2(X2,X1)),zero)
| ~ environment(X2)
| ~ stable(X2)
| ~ in_environment(X2,X1) ),
i_0_3 ).
cnf(c_0_46,plain,
( greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ greater(X1,appear(efficient_producers,X2))
| ~ in_environment(X2,X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,hypothesis,
( esk1_2(X1,esk2_1(X2)) = esk2_1(X2)
| greater(esk1_2(X1,esk2_1(X2)),appear(efficient_producers,X2))
| contracts_from(esk2_1(X2),first_movers)
| ~ in_environment(X1,esk2_1(X2))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( contracts_from(esk2_1(X1),first_movers)
| ~ greater(cardinality_at_time(efficient_producers,esk1_2(X2,esk2_1(X1))),zero)
| ~ in_environment(X1,esk1_2(X2,esk2_1(X1)))
| ~ in_environment(X2,esk2_1(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_49,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X3)
| ~ greater(X2,X3) ),
i_0_5 ).
cnf(c_0_50,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
i_0_8 ).
cnf(c_0_51,plain,
( esk1_2(X1,esk2_1(X2)) = esk2_1(X2)
| contracts_from(esk2_1(X2),first_movers)
| ~ in_environment(X2,esk1_2(X1,esk2_1(X2)))
| ~ in_environment(X1,esk2_1(X2))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_52,plain,
( esk1_2(X1,X2) = X2
| in_environment(X3,esk1_2(X1,X2))
| contracts_from(X2,first_movers)
| ~ in_environment(X3,X2)
| ~ in_environment(X1,X2)
| ~ stable(X3)
| ~ stable(X1)
| ~ environment(X3)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_42]) ).
cnf(c_0_53,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_54,hypothesis,
( greater(cardinality_at_time(efficient_producers,esk2_1(X1)),zero)
| ~ in_environment(X1,esk2_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_34]) ).
cnf(c_0_55,hypothesis,
( in_environment(X1,esk2_1(X2))
| ~ in_environment(X1,appear(efficient_producers,X2))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_34]) ).
cnf(c_0_56,plain,
( in_environment(X1,appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
i_0_6 ).
cnf(c_0_57,plain,
( esk1_2(X1,esk2_1(X2)) = esk2_1(X2)
| contracts_from(esk2_1(X2),first_movers)
| ~ in_environment(X1,esk2_1(X2))
| ~ in_environment(X2,esk2_1(X2))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
( greater(zero,growth_rate(first_movers,esk2_1(X1)))
| ~ subpopulations(first_movers,efficient_producers,X1,esk2_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_53]) ).
cnf(c_0_59,hypothesis,
( greater(cardinality_at_time(efficient_producers,esk2_1(X1)),zero)
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_60,hypothesis,
( esk1_2(X1,esk2_1(X2)) = esk2_1(X2)
| contracts_from(esk2_1(X2),first_movers)
| ~ in_environment(X1,esk2_1(X2))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_55]),c_0_56]) ).
cnf(c_0_61,plain,
( greater(zero,growth_rate(first_movers,esk2_1(X1)))
| ~ greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)
| ~ in_environment(X1,esk2_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_44]),c_0_59]) ).
cnf(c_0_62,plain,
( contracts_from(esk2_1(X1),first_movers)
| ~ greater(zero,growth_rate(first_movers,esk2_1(X1)))
| ~ in_environment(X2,esk2_1(X1))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_60]) ).
cnf(c_0_63,hypothesis,
( greater(zero,growth_rate(first_movers,esk2_1(X1)))
| ~ greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_55]),c_0_56]) ).
cnf(c_0_64,hypothesis,
( contracts_from(esk2_1(X1),first_movers)
| ~ greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)
| ~ in_environment(X2,esk2_1(X1))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_65,plain,
( contracts_from(esk2_1(X1),first_movers)
| ~ in_environment(X2,esk2_1(X1))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_60]),c_0_64]) ).
cnf(c_0_66,negated_conjecture,
( ~ contracts_from(X1,first_movers)
| ~ greater(X1,appear(efficient_producers,esk3_0)) ),
i_0_14 ).
cnf(c_0_67,negated_conjecture,
stable(esk3_0),
i_0_15 ).
cnf(c_0_68,negated_conjecture,
environment(esk3_0),
i_0_16 ).
cnf(c_0_69,hypothesis,
( contracts_from(esk2_1(X1),first_movers)
| ~ in_environment(X2,appear(efficient_producers,X1))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_55]) ).
cnf(c_0_70,negated_conjecture,
~ contracts_from(esk2_1(esk3_0),first_movers),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_34]),c_0_67]),c_0_68])]) ).
cnf(c_0_71,plain,
( contracts_from(esk2_1(X1),first_movers)
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_56]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_67]),c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT027+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n027.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 11:58:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 7.90/2.40 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.90/2.40 # No SInE strategy applied
% 7.90/2.40 # Trying AutoSched0 for 150 seconds
% 7.90/2.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.90/2.40 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.90/2.40 #
% 7.90/2.40 # Preprocessing time : 0.023 s
% 7.90/2.40 # Presaturation interreduction done
% 7.90/2.40
% 7.90/2.40 # Proof found!
% 7.90/2.40 # SZS status Theorem
% 7.90/2.40 # SZS output start CNFRefutation
% See solution above
% 7.90/2.40 # Training examples: 0 positive, 0 negative
% 7.90/2.40
% 7.90/2.40 # -------------------------------------------------
% 7.90/2.40 # User time : 0.031 s
% 7.90/2.40 # System time : 0.007 s
% 7.90/2.40 # Total time : 0.038 s
% 7.90/2.40 # Maximum resident set size: 7124 pages
% 7.90/2.40
%------------------------------------------------------------------------------