TSTP Solution File: MGT020+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT020+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:17 EDT 2022
% Result : Theorem 7.62s 2.33s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 8 unt; 9 nHn; 35 RR)
% Number of literals : 102 ( 8 equ; 63 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ in_environment(X1,X3)
| ~ greater(X3,X2)
| ~ greater_or_equal(X2,start_time(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_7) ).
cnf(i_0_6,plain,
( greater_or_equal(initial_FM_EP(X1),start_time(X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_6) ).
cnf(i_0_9,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_9) ).
cnf(i_0_2,plain,
( greater_or_equal(X1,initial_FM_EP(X2))
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_2) ).
cnf(i_0_4,plain,
( greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ environment(X3)
| ~ greater_or_equal(X1,X2)
| ~ greater_or_equal(X2,X4)
| ~ subpopulations(first_movers,efficient_producers,X3,X1)
| ~ greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_4) ).
cnf(i_0_10,hypothesis,
( greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))
| ~ environment(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_10) ).
cnf(i_0_5,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_5) ).
cnf(i_0_13,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_13) ).
cnf(i_0_14,negated_conjecture,
environment(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_14) ).
cnf(i_0_12,negated_conjecture,
~ greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_12) ).
cnf(i_0_1,plain,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_1) ).
cnf(i_0_3,plain,
( subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))
| ~ environment(X1)
| ~ in_environment(X1,initial_FM_EP(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jpdx375h/input.p',i_0_3) ).
cnf(c_0_27,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ in_environment(X1,X3)
| ~ greater(X3,X2)
| ~ greater_or_equal(X2,start_time(X1)) ),
i_0_7 ).
cnf(c_0_28,plain,
( greater_or_equal(initial_FM_EP(X1),start_time(X1))
| ~ environment(X1) ),
i_0_6 ).
cnf(c_0_29,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
i_0_9 ).
cnf(c_0_30,plain,
( greater_or_equal(X1,initial_FM_EP(X2))
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
i_0_2 ).
cnf(c_0_31,plain,
( greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ environment(X3)
| ~ greater_or_equal(X1,X2)
| ~ greater_or_equal(X2,X4)
| ~ subpopulations(first_movers,efficient_producers,X3,X1)
| ~ greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)) ),
i_0_4 ).
cnf(c_0_32,hypothesis,
( greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))
| ~ environment(X1) ),
i_0_10 ).
cnf(c_0_33,plain,
( in_environment(X1,initial_FM_EP(X1))
| ~ in_environment(X1,X2)
| ~ greater(X2,initial_FM_EP(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( X1 = initial_FM_EP(X2)
| greater(X1,initial_FM_EP(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
i_0_5 ).
cnf(c_0_36,hypothesis,
( decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
| greater(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))
| ~ greater_or_equal(X1,initial_FM_EP(X3))
| ~ greater_or_equal(X2,X1)
| ~ subpopulations(first_movers,efficient_producers,X4,X2)
| ~ environment(X4)
| ~ environment(X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
i_0_13 ).
cnf(c_0_38,negated_conjecture,
environment(esk1_0),
i_0_14 ).
cnf(c_0_39,negated_conjecture,
~ greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)),
i_0_12 ).
cnf(c_0_40,plain,
( X1 = initial_FM_EP(X2)
| in_environment(X2,initial_FM_EP(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
| ~ greater_or_equal(X1,initial_FM_EP(X2))
| ~ greater_or_equal(esk2_0,X1)
| ~ environment(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),c_0_39]) ).
cnf(c_0_42,plain,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
i_0_1 ).
cnf(c_0_43,plain,
( subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))
| ~ environment(X1)
| ~ in_environment(X1,initial_FM_EP(X1)) ),
i_0_3 ).
cnf(c_0_44,negated_conjecture,
( initial_FM_EP(esk1_0) = esk2_0
| in_environment(esk1_0,initial_FM_EP(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_38])]) ).
cnf(c_0_45,plain,
( ~ greater_or_equal(esk2_0,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_30]),c_0_42]) ).
cnf(c_0_46,plain,
( initial_FM_EP(esk1_0) = esk2_0
| subpopulations(first_movers,efficient_producers,esk1_0,initial_FM_EP(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_38])]) ).
cnf(c_0_47,plain,
( initial_FM_EP(esk1_0) = esk2_0
| ~ greater_or_equal(esk2_0,initial_FM_EP(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_38])]) ).
cnf(c_0_48,plain,
initial_FM_EP(esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_30]),c_0_37]),c_0_38])]) ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_48]),c_0_38])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : MGT020+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 12:51:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.62/2.33 # ENIGMATIC: Solved by autoschedule:
% 7.62/2.33 # No SInE strategy applied
% 7.62/2.33 # Trying AutoSched0 for 150 seconds
% 7.62/2.33 # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.62/2.33 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.62/2.33 #
% 7.62/2.33 # Preprocessing time : 0.012 s
% 7.62/2.33
% 7.62/2.33 # Proof found!
% 7.62/2.33 # SZS status Theorem
% 7.62/2.33 # SZS output start CNFRefutation
% See solution above
% 7.62/2.33 # Training examples: 0 positive, 0 negative
% 7.62/2.33
% 7.62/2.33 # -------------------------------------------------
% 7.62/2.33 # User time : 0.014 s
% 7.62/2.33 # System time : 0.006 s
% 7.62/2.33 # Total time : 0.021 s
% 7.62/2.33 # Maximum resident set size: 7124 pages
% 7.62/2.33
%------------------------------------------------------------------------------