TSTP Solution File: MGT014+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:15 EDT 2022
% Result : Theorem 6.78s 2.17s
% Output : CNFRefutation 6.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 50 ( 28 unt; 5 nHn; 50 RR)
% Number of literals : 118 ( 15 equ; 71 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 60 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( time(X1)
| ~ organization(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_3) ).
cnf(i_0_16,negated_conjecture,
organization(esk1_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_16) ).
cnf(i_0_4,plain,
( X1 = X2
| greater(X2,X1)
| greater(X1,X2)
| ~ time(X2)
| ~ time(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_4) ).
cnf(i_0_17,negated_conjecture,
organization(esk1_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_17) ).
cnf(i_0_8,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ organization(X5,X3)
| ~ organization(X5,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ complexity(X5,X2,X3)
| ~ complexity(X5,X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_8) ).
cnf(i_0_13,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_13) ).
cnf(i_0_7,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ organization(X5,X3)
| ~ organization(X5,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ size(X5,X2,X3)
| ~ size(X5,X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_7) ).
cnf(i_0_12,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_12) ).
cnf(i_0_5,plain,
( reorganization_free(X1,X2,X3)
| ~ reorganization_free(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_5) ).
cnf(i_0_15,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_15) ).
cnf(i_0_14,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_14) ).
cnf(i_0_9,negated_conjecture,
greater(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_9) ).
cnf(i_0_11,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_11) ).
cnf(i_0_10,negated_conjecture,
greater(esk5_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_10) ).
cnf(i_0_6,plain,
( X1 = X2
| X3 != X4
| ~ organization(X5,X4)
| ~ organization(X5,X3)
| ~ size(X5,X2,X4)
| ~ size(X5,X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_6) ).
cnf(i_0_1,plain,
( X1 != X2
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e0vlov2x/lgb.p',i_0_1) ).
cnf(c_0_34,plain,
( time(X1)
| ~ organization(X2,X1) ),
i_0_3 ).
cnf(c_0_35,negated_conjecture,
organization(esk1_0,esk7_0),
i_0_16 ).
cnf(c_0_36,plain,
( X1 = X2
| greater(X2,X1)
| greater(X1,X2)
| ~ time(X2)
| ~ time(X1) ),
i_0_4 ).
cnf(c_0_37,negated_conjecture,
time(esk7_0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
organization(esk1_0,esk6_0),
i_0_17 ).
cnf(c_0_39,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ organization(X5,X3)
| ~ organization(X5,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ complexity(X5,X2,X3)
| ~ complexity(X5,X1,X4) ),
i_0_8 ).
cnf(c_0_40,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
i_0_13 ).
cnf(c_0_41,hypothesis,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ organization(X5,X3)
| ~ organization(X5,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ size(X5,X2,X3)
| ~ size(X5,X1,X4) ),
i_0_7 ).
cnf(c_0_42,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
i_0_12 ).
cnf(c_0_43,plain,
( reorganization_free(X1,X2,X3)
| ~ reorganization_free(X1,X3,X2) ),
i_0_5 ).
cnf(c_0_44,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
i_0_15 ).
cnf(c_0_45,negated_conjecture,
( esk7_0 = X1
| greater(X1,esk7_0)
| greater(esk7_0,X1)
| ~ time(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_46,negated_conjecture,
time(esk6_0),
inference(spm,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_47,negated_conjecture,
( ~ organization(esk1_0,X1)
| ~ greater(esk7_0,X1)
| ~ greater(X2,esk3_0)
| ~ complexity(esk1_0,X2,X1)
| ~ reorganization_free(esk1_0,X1,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_35])]) ).
cnf(c_0_48,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
i_0_14 ).
cnf(c_0_49,negated_conjecture,
greater(esk2_0,esk3_0),
i_0_9 ).
cnf(c_0_50,negated_conjecture,
( ~ organization(esk1_0,X1)
| ~ greater(esk6_0,X1)
| ~ greater(X2,esk4_0)
| ~ size(esk1_0,X2,X1)
| ~ reorganization_free(esk1_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_38])]) ).
cnf(c_0_51,negated_conjecture,
reorganization_free(esk1_0,esk7_0,esk6_0),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
( esk7_0 = esk6_0
| greater(esk7_0,esk6_0)
| greater(esk6_0,esk7_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
~ greater(esk7_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_38]),c_0_49]),c_0_44])]) ).
cnf(c_0_54,negated_conjecture,
( ~ greater(esk6_0,esk7_0)
| ~ greater(X1,esk4_0)
| ~ size(esk1_0,X1,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_35])]) ).
cnf(c_0_55,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
i_0_11 ).
cnf(c_0_56,negated_conjecture,
greater(esk5_0,esk4_0),
i_0_10 ).
cnf(c_0_57,plain,
( X1 = X2
| X3 != X4
| ~ organization(X5,X4)
| ~ organization(X5,X3)
| ~ size(X5,X2,X4)
| ~ size(X5,X1,X3) ),
i_0_6 ).
cnf(c_0_58,negated_conjecture,
( esk7_0 = esk6_0
| greater(esk6_0,esk7_0) ),
inference(sr,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
~ greater(esk6_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_60,plain,
( X1 = X2
| ~ organization(X3,X4)
| ~ size(X3,X2,X4)
| ~ size(X3,X1,X4) ),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_61,negated_conjecture,
esk7_0 = esk6_0,
inference(sr,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
( X1 = esk4_0
| ~ size(esk1_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_42]),c_0_38])]) ).
cnf(c_0_63,negated_conjecture,
size(esk1_0,esk5_0,esk6_0),
inference(rw,[status(thm)],[c_0_55,c_0_61]) ).
cnf(c_0_64,plain,
( X1 != X2
| ~ greater(X1,X2) ),
i_0_1 ).
cnf(c_0_65,negated_conjecture,
esk4_0 = esk5_0,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_65]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 10:42:21 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 6.78/2.17 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.78/2.17 # No SInE strategy applied
% 6.78/2.17 # Trying AutoSched0 for 150 seconds
% 6.78/2.17 # AutoSched0-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y
% 6.78/2.17 # and selection function SelectMaxLComplexAPPNTNp.
% 6.78/2.17 #
% 6.78/2.17 # Preprocessing time : 0.016 s
% 6.78/2.17
% 6.78/2.17 # Proof found!
% 6.78/2.17 # SZS status Theorem
% 6.78/2.17 # SZS output start CNFRefutation
% See solution above
% 6.78/2.17 # Training examples: 0 positive, 0 negative
% 6.78/2.17
% 6.78/2.17 # -------------------------------------------------
% 6.78/2.17 # User time : 0.014 s
% 6.78/2.17 # System time : 0.008 s
% 6.78/2.17 # Total time : 0.022 s
% 6.78/2.17 # Maximum resident set size: 7124 pages
% 6.78/2.17
%------------------------------------------------------------------------------