TSTP Solution File: MGT039+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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 : Theorem 6.80s 2.20s
% Output : CNFRefutation 6.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of clauses : 57 ( 12 unt; 22 nHn; 56 RR)
% Number of literals : 186 ( 11 equ; 105 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
( in_environment(X1,esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_2) ).
cnf(i_0_6,plain,
propagation_strategy(first_movers),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_6) ).
cnf(i_0_7,plain,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_7) ).
cnf(i_0_3,plain,
( environment(esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_3) ).
cnf(i_0_5,plain,
( in_environment(X1,esk2_2(X2,X1))
| ~ observational_period(X2)
| ~ environment(X1)
| ~ slow_change(X2)
| ~ in_environment(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_5) ).
cnf(i_0_4,plain,
( greater(esk2_2(X1,X2),critical_point(X2))
| ~ observational_period(X1)
| ~ environment(X2)
| ~ slow_change(X1)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_4) ).
cnf(i_0_9,plain,
( greater_or_equal(end_time(X1),X2)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_9) ).
cnf(i_0_11,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_11) ).
cnf(i_0_14,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_14) ).
cnf(i_0_10,plain,
( greater_or_equal(critical_point(X1),start_time(X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_10) ).
cnf(i_0_1,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_1) ).
cnf(i_0_13,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_13) ).
cnf(i_0_12,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_12) ).
cnf(i_0_16,hypothesis,
( selection_favors(efficient_producers,first_movers,X1)
| ~ environment(X2)
| ~ in_environment(X2,X1)
| ~ greater(X1,critical_point(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_16) ).
cnf(i_0_8,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ greater_or_equal(X2,start_time(X1))
| ~ greater_or_equal(end_time(X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_8) ).
cnf(i_0_18,negated_conjecture,
slow_change(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_18) ).
cnf(i_0_19,negated_conjecture,
observational_period(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_19) ).
cnf(i_0_17,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fq0mp_d0/input.p',i_0_17) ).
cnf(c_0_38,plain,
( in_environment(X1,esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
i_0_2 ).
cnf(c_0_39,plain,
propagation_strategy(first_movers),
i_0_6 ).
cnf(c_0_40,plain,
propagation_strategy(efficient_producers),
i_0_7 ).
cnf(c_0_41,plain,
( environment(esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
i_0_3 ).
cnf(c_0_42,plain,
( in_environment(X1,esk2_2(X2,X1))
| ~ observational_period(X2)
| ~ environment(X1)
| ~ slow_change(X2)
| ~ in_environment(X2,X1) ),
i_0_5 ).
cnf(c_0_43,plain,
( in_environment(X1,esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_44,plain,
( environment(esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_39]),c_0_40])]) ).
cnf(c_0_45,plain,
( greater(esk2_2(X1,X2),critical_point(X2))
| ~ observational_period(X1)
| ~ environment(X2)
| ~ slow_change(X1)
| ~ in_environment(X1,X2) ),
i_0_4 ).
cnf(c_0_46,plain,
( greater_or_equal(end_time(X1),X2)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
i_0_9 ).
cnf(c_0_47,plain,
( in_environment(esk1_1(X1),esk2_2(X1,esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_48,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
i_0_11 ).
cnf(c_0_49,plain,
( greater(esk2_2(X1,esk1_1(X1)),critical_point(esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_43]),c_0_44]) ).
cnf(c_0_50,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
i_0_14 ).
cnf(c_0_51,plain,
( greater_or_equal(end_time(esk1_1(X1)),esk2_2(X1,esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_44]) ).
cnf(c_0_52,plain,
( greater_or_equal(critical_point(X1),start_time(X1))
| ~ environment(X1) ),
i_0_10 ).
cnf(c_0_53,plain,
( greater(X1,critical_point(esk1_1(X2)))
| selection_favors(efficient_producers,first_movers,X2)
| ~ greater(X1,esk2_2(X2,esk1_1(X2)))
| ~ slow_change(X2)
| ~ observational_period(X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
( esk2_2(X1,esk1_1(X1)) = end_time(esk1_1(X1))
| greater(end_time(esk1_1(X1)),esk2_2(X1,esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
( start_time(X1) = critical_point(X1)
| greater(critical_point(X1),start_time(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_52]) ).
cnf(c_0_56,plain,
( esk2_2(X1,esk1_1(X1)) = end_time(esk1_1(X1))
| greater(end_time(esk1_1(X1)),critical_point(esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
( start_time(X1) = critical_point(X1)
| greater(X2,start_time(X1))
| ~ greater(X2,critical_point(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_55]) ).
cnf(c_0_58,plain,
( greater(end_time(esk1_1(X1)),critical_point(esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_56]) ).
cnf(c_0_59,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1))) ),
i_0_1 ).
cnf(c_0_60,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
i_0_13 ).
cnf(c_0_61,plain,
( start_time(esk1_1(X1)) = critical_point(esk1_1(X1))
| greater(end_time(esk1_1(X1)),start_time(esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_44]) ).
cnf(c_0_62,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
i_0_12 ).
cnf(c_0_63,hypothesis,
( selection_favors(efficient_producers,first_movers,X1)
| ~ environment(X2)
| ~ in_environment(X2,X1)
| ~ greater(X1,critical_point(X2)) ),
i_0_16 ).
cnf(c_0_64,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_39]),c_0_40])]) ).
cnf(c_0_65,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ greater_or_equal(X2,start_time(X1))
| ~ greater_or_equal(end_time(X1),X2) ),
i_0_8 ).
cnf(c_0_66,plain,
( start_time(esk1_1(X1)) = critical_point(esk1_1(X1))
| greater_or_equal(end_time(esk1_1(X1)),start_time(esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_67,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_68,hypothesis,
( selection_favors(efficient_producers,first_movers,X1)
| ~ in_environment(esk1_1(X1),end_time(esk1_1(X1)))
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_58]),c_0_44]),c_0_64]) ).
cnf(c_0_69,plain,
( start_time(esk1_1(X1)) = critical_point(esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]),c_0_44]),c_0_68]) ).
cnf(c_0_70,plain,
( in_environment(esk1_1(X1),X2)
| selection_favors(efficient_producers,first_movers,X1)
| ~ greater_or_equal(X2,critical_point(esk1_1(X1)))
| ~ greater_or_equal(end_time(esk1_1(X1)),X2)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_69]),c_0_44]) ).
cnf(c_0_71,plain,
( greater_or_equal(end_time(esk1_1(X1)),critical_point(esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_58]) ).
cnf(c_0_72,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_67])]),c_0_68]) ).
cnf(c_0_73,negated_conjecture,
slow_change(esk3_0),
i_0_18 ).
cnf(c_0_74,negated_conjecture,
observational_period(esk3_0),
i_0_19 ).
cnf(c_0_75,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,esk3_0),
i_0_17 ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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:08:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 6.80/2.20 # ENIGMATIC: Solved by autoschedule:
% 6.80/2.20 # No SInE strategy applied
% 6.80/2.20 # Trying AutoSched0 for 150 seconds
% 6.80/2.20 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 6.80/2.20 # and selection function SelectNewComplexAHP.
% 6.80/2.20 #
% 6.80/2.20 # Preprocessing time : 0.012 s
% 6.80/2.20
% 6.80/2.20 # Proof found!
% 6.80/2.20 # SZS status Theorem
% 6.80/2.20 # SZS output start CNFRefutation
% See solution above
% 6.80/2.20 # Training examples: 0 positive, 0 negative
% 6.80/2.20
% 6.80/2.20 # -------------------------------------------------
% 6.80/2.20 # User time : 0.013 s
% 6.80/2.20 # System time : 0.006 s
% 6.80/2.20 # Total time : 0.019 s
% 6.80/2.20 # Maximum resident set size: 7120 pages
% 6.80/2.20
%------------------------------------------------------------------------------