TSTP Solution File: MGT038+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT038+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:45 EDT 2022
% Result : CounterSatisfiable 4.59s 2.39s
% Output : Saturation 4.59s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,hypothesis,
( greater(appear(efficient_producers,e),appear(first_movers,X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_9) ).
cnf(i_0_12,negated_conjecture,
environment(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_12) ).
cnf(i_0_6,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_6) ).
cnf(i_0_8,hypothesis,
( greater(esk2_1(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_8) ).
cnf(i_0_4,plain,
( greater(esk1_2(X1,X2),X2)
| ~ finite_set(X1)
| ~ contracts_from(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_4) ).
cnf(i_0_7,hypothesis,
( contracts_from(esk2_1(X1),first_movers)
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_7) ).
cnf(i_0_1,plain,
finite_set(first_movers),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_1) ).
cnf(i_0_5,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X3)
| ~ greater(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_5) ).
cnf(i_0_2,plain,
( in_environment(X1,appear(first_movers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_2) ).
cnf(i_0_11,negated_conjecture,
stable(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_11) ).
cnf(i_0_3,plain,
( cardinality_at_time(s,t2) = zero
| ~ finite_set(X1)
| ~ contracts_from(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_3) ).
cnf(i_0_10,negated_conjecture,
( cardinality_at_time(first_movers,to) != zero
| ~ in_environment(esk3_0,X1)
| ~ greater(X1,appear(first_movers,esk3_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jkneetni/input.p',i_0_10) ).
cnf(c_0_25,hypothesis,
( greater(appear(efficient_producers,e),appear(first_movers,X1))
| ~ environment(X1) ),
i_0_9,
[final] ).
cnf(c_0_26,negated_conjecture,
environment(esk3_0),
i_0_12,
[final] ).
cnf(c_0_27,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
i_0_6,
[final] ).
cnf(c_0_28,negated_conjecture,
greater(appear(efficient_producers,e),appear(first_movers,esk3_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]),
[final] ).
cnf(c_0_29,hypothesis,
( greater(esk2_1(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
i_0_8,
[final] ).
cnf(c_0_30,plain,
( greater(esk1_2(X1,X2),X2)
| ~ finite_set(X1)
| ~ contracts_from(X2,X1) ),
i_0_4,
[final] ).
cnf(c_0_31,hypothesis,
( contracts_from(esk2_1(X1),first_movers)
| ~ environment(X1)
| ~ stable(X1) ),
i_0_7,
[final] ).
cnf(c_0_32,plain,
finite_set(first_movers),
i_0_1,
[final] ).
cnf(c_0_33,plain,
( greater(X1,appear(first_movers,esk3_0))
| ~ greater(X1,appear(efficient_producers,e)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[final] ).
cnf(c_0_34,plain,
( greater(X1,appear(efficient_producers,X2))
| ~ greater(X1,esk2_1(X2))
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_29]),
[final] ).
cnf(c_0_35,hypothesis,
( greater(esk1_2(first_movers,esk2_1(X1)),esk2_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[final] ).
cnf(c_0_36,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X3)
| ~ greater(X2,X3) ),
i_0_5,
[final] ).
cnf(c_0_37,plain,
( in_environment(X1,appear(first_movers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
i_0_2,
[final] ).
cnf(c_0_38,negated_conjecture,
stable(esk3_0),
i_0_11,
[final] ).
cnf(c_0_39,plain,
( greater(X1,appear(first_movers,esk3_0))
| ~ greater(X2,appear(efficient_producers,e))
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_33]),
[final] ).
cnf(c_0_40,plain,
( greater(esk1_2(first_movers,esk2_1(X1)),appear(efficient_producers,X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]),
[final] ).
cnf(c_0_41,plain,
( in_environment(X1,appear(efficient_producers,e))
| ~ in_environment(X1,appear(first_movers,esk3_0))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_28]),
[final] ).
cnf(c_0_42,negated_conjecture,
in_environment(esk3_0,appear(first_movers,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_26])]),
[final] ).
cnf(c_0_43,hypothesis,
( greater(X1,appear(first_movers,esk3_0))
| ~ greater(X1,esk2_1(e))
| ~ stable(e)
| ~ environment(e) ),
inference(spm,[status(thm)],[c_0_39,c_0_29]),
[final] ).
cnf(c_0_44,plain,
( cardinality_at_time(s,t2) = zero
| ~ finite_set(X1)
| ~ contracts_from(X2,X1) ),
i_0_3 ).
cnf(c_0_45,plain,
( in_environment(X1,esk1_2(first_movers,esk2_1(X2)))
| ~ in_environment(X1,appear(efficient_producers,X2))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_40]),
[final] ).
cnf(c_0_46,negated_conjecture,
in_environment(esk3_0,appear(efficient_producers,e)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_38]),c_0_42]),c_0_26])]),
[final] ).
cnf(c_0_47,hypothesis,
( greater(esk1_2(first_movers,esk2_1(e)),appear(first_movers,esk3_0))
| ~ stable(e)
| ~ environment(e) ),
inference(spm,[status(thm)],[c_0_43,c_0_35]),
[final] ).
cnf(c_0_48,plain,
( in_environment(X1,X2)
| ~ greater(X2,appear(efficient_producers,e))
| ~ in_environment(X1,appear(first_movers,esk3_0))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_33]),
[final] ).
cnf(c_0_49,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_36,c_0_29]),
[final] ).
cnf(c_0_50,negated_conjecture,
( cardinality_at_time(first_movers,to) != zero
| ~ in_environment(esk3_0,X1)
| ~ greater(X1,appear(first_movers,esk3_0)) ),
i_0_10,
[final] ).
cnf(c_0_51,hypothesis,
( cardinality_at_time(s,t2) = zero
| ~ stable(X1)
| ~ environment(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_31]),c_0_32])]) ).
cnf(c_0_52,plain,
( in_environment(X1,esk1_2(first_movers,esk2_1(X2)))
| ~ in_environment(X1,esk2_1(X2))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]),
[final] ).
cnf(c_0_53,negated_conjecture,
( in_environment(esk3_0,esk1_2(first_movers,esk2_1(e)))
| ~ stable(e)
| ~ environment(e) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_38]),c_0_26])]),
[final] ).
cnf(c_0_54,plain,
( in_environment(X1,esk1_2(first_movers,esk2_1(e)))
| ~ in_environment(X1,appear(first_movers,esk3_0))
| ~ stable(e)
| ~ stable(X1)
| ~ environment(e)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_47]),
[final] ).
cnf(c_0_55,plain,
( greater(X1,appear(first_movers,esk3_0))
| ~ greater(X1,esk1_2(first_movers,esk2_1(e)))
| ~ stable(e)
| ~ environment(e) ),
inference(spm,[status(thm)],[c_0_27,c_0_47]),
[final] ).
cnf(c_0_56,plain,
( greater(X1,appear(efficient_producers,X2))
| ~ greater(X1,esk1_2(first_movers,esk2_1(X2)))
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_40]),
[final] ).
cnf(c_0_57,plain,
( greater(X1,esk2_1(X2))
| ~ greater(X1,esk1_2(first_movers,esk2_1(X2)))
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_35]),
[final] ).
cnf(c_0_58,hypothesis,
( in_environment(X1,esk2_1(e))
| ~ in_environment(X1,appear(first_movers,esk3_0))
| ~ stable(e)
| ~ stable(X1)
| ~ environment(e)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_29]),
[final] ).
cnf(c_0_59,negated_conjecture,
( in_environment(esk3_0,esk2_1(e))
| ~ stable(e)
| ~ environment(e) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_46]),c_0_38]),c_0_26])]),
[final] ).
cnf(c_0_60,negated_conjecture,
( cardinality_at_time(first_movers,to) != zero
| ~ greater(appear(first_movers,esk3_0),appear(first_movers,esk3_0)) ),
inference(spm,[status(thm)],[c_0_50,c_0_42]),
[final] ).
cnf(c_0_61,negated_conjecture,
cardinality_at_time(first_movers,to) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_46]),c_0_28])]),
[final] ).
cnf(c_0_62,negated_conjecture,
cardinality_at_time(s,t2) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_38]),c_0_26])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT038+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 08:32:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.59/2.39 # ENIGMATIC: Solved by autoschedule:
% 4.59/2.39 # No SInE strategy applied
% 4.59/2.39 # Trying AutoSched0 for 150 seconds
% 4.59/2.39 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S04CN
% 4.59/2.39 # and selection function MSelectComplexExceptUniqMaxHorn.
% 4.59/2.39 #
% 4.59/2.39 # Preprocessing time : 0.023 s
% 4.59/2.39 # Presaturation interreduction done
% 4.59/2.39
% 4.59/2.39 # No proof found!
% 4.59/2.39 # SZS status Satisfiable
% 4.59/2.39 # SZS output start Saturation
% See solution above
% 4.59/2.39
% 4.59/2.39 # -------------------------------------------------
% 4.59/2.39 # User time : 0.024 s
% 4.59/2.39 # System time : 0.009 s
% 4.59/2.39 # Total time : 0.032 s
% 4.59/2.39 # Maximum resident set size: 7124 pages
% 4.59/2.39
%------------------------------------------------------------------------------