TSTP Solution File: MGT031+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT031+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:31 EDT 2022
% Result : CounterSatisfiable 4.40s 2.21s
% Output : Saturation 4.40s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,hypothesis,
( X1 = efficient_producers
| X1 = first_movers
| ~ environment(X2)
| ~ subpopulation(X1,X2,X3)
| ~ greater(cardinality_at_time(X1,X3),zero) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_11) ).
cnf(i_0_3,plain,
( subpopulation(esk1_2(X1,X2),X1,X2)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_3) ).
cnf(i_0_2,plain,
( greater(cardinality_at_time(esk1_2(X1,X2),X2),zero)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_2) ).
cnf(i_0_1,plain,
( greater(number_of_organizations(e,appear(an_organisation,X1)),zero)
| ~ environment(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_1) ).
cnf(i_0_4,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(appear(efficient_producers,X1),X2)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_4) ).
cnf(i_0_14,negated_conjecture,
in_environment(esk2_0,appear(an_organisation,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_14) ).
cnf(i_0_15,negated_conjecture,
environment(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_15) ).
cnf(i_0_10,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_10) ).
cnf(i_0_6,plain,
( greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_6) ).
cnf(i_0_5,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(appear(first_movers,X1),X2)
| ~ greater(cardinality_at_time(first_movers,X2),zero) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_5) ).
cnf(i_0_7,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_7) ).
cnf(i_0_13,negated_conjecture,
appear(first_movers,esk2_0) != appear(an_organisation,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_13) ).
cnf(i_0_12,hypothesis,
( greater(appear(efficient_producers,e),appear(first_movers,X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_12) ).
cnf(i_0_8,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_8) ).
cnf(i_0_9,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5bfbd86/input.p',i_0_9) ).
cnf(c_0_31,hypothesis,
( X1 = efficient_producers
| X1 = first_movers
| ~ environment(X2)
| ~ subpopulation(X1,X2,X3)
| ~ greater(cardinality_at_time(X1,X3),zero) ),
i_0_11,
[final] ).
cnf(c_0_32,plain,
( subpopulation(esk1_2(X1,X2),X1,X2)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero) ),
i_0_3,
[final] ).
cnf(c_0_33,plain,
( greater(cardinality_at_time(esk1_2(X1,X2),X2),zero)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero) ),
i_0_2,
[final] ).
cnf(c_0_34,hypothesis,
( esk1_2(X1,X2) = first_movers
| esk1_2(X1,X2) = efficient_producers
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[final] ).
cnf(c_0_35,plain,
( greater(number_of_organizations(e,appear(an_organisation,X1)),zero)
| ~ environment(X1) ),
i_0_1,
[final] ).
cnf(c_0_36,plain,
( esk1_2(e,appear(an_organisation,X1)) = efficient_producers
| esk1_2(e,appear(an_organisation,X1)) = first_movers
| ~ environment(e)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]),
[final] ).
cnf(c_0_37,plain,
( esk1_2(e,appear(an_organisation,X1)) = first_movers
| greater(cardinality_at_time(efficient_producers,appear(an_organisation,X1)),zero)
| ~ environment(e)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_36]),c_0_35]),
[final] ).
cnf(c_0_38,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(appear(efficient_producers,X1),X2)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
i_0_4,
[final] ).
cnf(c_0_39,plain,
( greater(cardinality_at_time(efficient_producers,appear(an_organisation,X1)),zero)
| greater(cardinality_at_time(first_movers,appear(an_organisation,X1)),zero)
| ~ environment(e)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_37]),c_0_35]),
[final] ).
cnf(c_0_40,plain,
( greater(cardinality_at_time(first_movers,appear(an_organisation,X1)),zero)
| ~ greater(appear(efficient_producers,X2),appear(an_organisation,X1))
| ~ in_environment(X2,appear(an_organisation,X1))
| ~ environment(e)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]),
[final] ).
cnf(c_0_41,negated_conjecture,
in_environment(esk2_0,appear(an_organisation,esk2_0)),
i_0_14,
[final] ).
cnf(c_0_42,negated_conjecture,
environment(esk2_0),
i_0_15,
[final] ).
cnf(c_0_43,plain,
( esk1_2(e,appear(an_organisation,X1)) = first_movers
| efficient_producers != first_movers
| ~ environment(e)
| ~ environment(X1) ),
inference(ef,[status(thm)],[c_0_36]) ).
cnf(c_0_44,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
i_0_10,
[final] ).
cnf(c_0_45,plain,
( greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))
| ~ environment(X1) ),
i_0_6,
[final] ).
cnf(c_0_46,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(appear(first_movers,X1),X2)
| ~ greater(cardinality_at_time(first_movers,X2),zero) ),
i_0_5,
[final] ).
cnf(c_0_47,negated_conjecture,
( greater(cardinality_at_time(first_movers,appear(an_organisation,esk2_0)),zero)
| ~ greater(appear(efficient_producers,esk2_0),appear(an_organisation,esk2_0))
| ~ environment(e) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),
[final] ).
cnf(c_0_48,plain,
( greater(cardinality_at_time(first_movers,appear(an_organisation,X1)),zero)
| efficient_producers != first_movers
| ~ environment(e)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_43]),c_0_35]) ).
cnf(c_0_49,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
i_0_7,
[final] ).
cnf(c_0_50,plain,
( appear(an_organisation,X1) = appear(first_movers,X1)
| greater(appear(first_movers,X1),appear(an_organisation,X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]),
[final] ).
cnf(c_0_51,plain,
( ~ greater(appear(efficient_producers,esk2_0),appear(an_organisation,esk2_0))
| ~ greater(appear(first_movers,X1),appear(an_organisation,esk2_0))
| ~ in_environment(X1,appear(an_organisation,esk2_0))
| ~ environment(e)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]),
[final] ).
cnf(c_0_52,plain,
( efficient_producers != first_movers
| ~ greater(appear(first_movers,X1),appear(an_organisation,X2))
| ~ in_environment(X1,appear(an_organisation,X2))
| ~ environment(e)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_48]) ).
cnf(c_0_53,plain,
( appear(an_organisation,X1) = appear(first_movers,X1)
| greater(X2,appear(an_organisation,X1))
| ~ greater(X2,appear(first_movers,X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]),
[final] ).
cnf(c_0_54,negated_conjecture,
( ~ greater(appear(efficient_producers,esk2_0),appear(an_organisation,esk2_0))
| ~ greater(appear(first_movers,esk2_0),appear(an_organisation,esk2_0))
| ~ environment(e) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_41]),c_0_42])]),
[final] ).
cnf(c_0_55,negated_conjecture,
appear(first_movers,esk2_0) != appear(an_organisation,esk2_0),
i_0_13,
[final] ).
cnf(c_0_56,plain,
( greater(X1,zero)
| ~ greater(X1,cardinality_at_time(esk1_2(X2,X3),X3))
| ~ greater(number_of_organizations(X2,X3),zero)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_33]),
[final] ).
cnf(c_0_57,negated_conjecture,
( efficient_producers != first_movers
| ~ greater(appear(first_movers,esk2_0),appear(an_organisation,esk2_0))
| ~ environment(e) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_41]),c_0_42])]) ).
cnf(c_0_58,plain,
( appear(an_organisation,X1) = appear(first_movers,X1)
| greater(X2,appear(an_organisation,X1))
| ~ greater(X3,appear(first_movers,X1))
| ~ greater(X2,X3)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_53]),
[final] ).
cnf(c_0_59,hypothesis,
( greater(appear(efficient_producers,e),appear(first_movers,X1))
| ~ environment(X1) ),
i_0_12,
[final] ).
cnf(c_0_60,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
i_0_8 ).
cnf(c_0_61,plain,
( greater(cardinality_at_time(first_movers,appear(an_organisation,X1)),zero)
| greater(X2,zero)
| ~ greater(X2,cardinality_at_time(efficient_producers,appear(an_organisation,X1)))
| ~ environment(e)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_39]),
[final] ).
cnf(c_0_62,plain,
( ~ greater(appear(first_movers,esk2_0),appear(an_organisation,esk2_0))
| ~ greater(appear(efficient_producers,esk2_0),appear(first_movers,esk2_0))
| ~ environment(e) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_53]),c_0_42])]),c_0_55]),
[final] ).
cnf(c_0_63,plain,
( greater(X1,zero)
| ~ greater(appear(efficient_producers,esk2_0),appear(an_organisation,esk2_0))
| ~ greater(X1,cardinality_at_time(first_movers,appear(an_organisation,esk2_0)))
| ~ environment(e) ),
inference(spm,[status(thm)],[c_0_49,c_0_47]),
[final] ).
cnf(c_0_64,plain,
( subpopulation(first_movers,e,appear(an_organisation,X1))
| greater(cardinality_at_time(efficient_producers,appear(an_organisation,X1)),zero)
| ~ environment(e)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_37]),c_0_35]),
[final] ).
cnf(c_0_65,plain,
( greater(cardinality_at_time(efficient_producers,appear(an_organisation,X1)),zero)
| greater(X2,zero)
| ~ greater(X2,cardinality_at_time(first_movers,appear(an_organisation,X1)))
| ~ environment(e)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_37]),c_0_35]),
[final] ).
cnf(c_0_66,plain,
( esk1_2(e,appear(an_organisation,X1)) = first_movers
| greater(X2,zero)
| ~ greater(X2,cardinality_at_time(efficient_producers,appear(an_organisation,X1)))
| ~ environment(e)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_36]),c_0_35]),
[final] ).
cnf(c_0_67,plain,
( efficient_producers != first_movers
| ~ environment(e) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_50]),c_0_42])]),c_0_55]),
[final] ).
cnf(c_0_68,plain,
( esk1_2(e,appear(an_organisation,X1)) = first_movers
| subpopulation(efficient_producers,e,appear(an_organisation,X1))
| ~ environment(e)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_36]),c_0_35]),
[final] ).
cnf(c_0_69,hypothesis,
( appear(an_organisation,X1) = appear(first_movers,X1)
| greater(X2,appear(an_organisation,X1))
| ~ greater(X2,appear(efficient_producers,e))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]),
[final] ).
cnf(c_0_70,plain,
( greater(X1,zero)
| ~ greater(X1,number_of_organizations(e,appear(an_organisation,X2)))
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_35]),
[final] ).
cnf(c_0_71,hypothesis,
( greater(X1,appear(first_movers,X2))
| ~ greater(X1,appear(efficient_producers,e))
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_59]),
[final] ).
cnf(c_0_72,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
i_0_9,
[final] ).
cnf(c_0_73,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_60]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT031+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 9 11:22:40 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 4.40/2.21 # ENIGMATIC: Solved by autoschedule:
% 4.40/2.21 # No SInE strategy applied
% 4.40/2.21 # Trying AutoSched0 for 150 seconds
% 4.40/2.21 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 4.40/2.21 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.40/2.21 #
% 4.40/2.21 # Preprocessing time : 0.023 s
% 4.40/2.21
% 4.40/2.21 # No proof found!
% 4.40/2.21 # SZS status Satisfiable
% 4.40/2.21 # SZS output start Saturation
% See solution above
% 4.40/2.21
% 4.40/2.21 # -------------------------------------------------
% 4.40/2.21 # User time : 0.028 s
% 4.40/2.21 # System time : 0.003 s
% 4.40/2.21 # Total time : 0.031 s
% 4.40/2.21 # Maximum resident set size: 7120 pages
% 4.40/2.21
%------------------------------------------------------------------------------