TSTP Solution File: MGT009+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT009+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:14 EDT 2022
% Result : Theorem 6.88s 2.31s
% Output : CNFRefutation 6.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 43 ( 28 unt; 0 nHn; 43 RR)
% Number of literals : 119 ( 0 equ; 78 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_1) ).
cnf(i_0_16,negated_conjecture,
organization(esk2_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_16) ).
cnf(i_0_4,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X5,X6)
| ~ greater(X7,X8)
| ~ inertia(X3,X1,X4)
| ~ inertia(X5,X2,X6)
| ~ class(X3,X9,X4)
| ~ class(X5,X9,X6)
| ~ size(X3,X7,X4)
| ~ size(X5,X8,X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_4) ).
cnf(i_0_12,negated_conjecture,
class(esk2_0,esk4_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_12) ).
cnf(i_0_11,negated_conjecture,
class(esk3_0,esk4_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_11) ).
cnf(i_0_15,negated_conjecture,
organization(esk3_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_15) ).
cnf(i_0_2,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X5,X6)
| ~ greater(X7,X8)
| ~ inertia(X3,X7,X4)
| ~ inertia(X5,X8,X6)
| ~ reorganization_free(X3,X4,X4)
| ~ reorganization_free(X5,X6,X6)
| ~ reproducibility(X3,X1,X4)
| ~ reproducibility(X5,X2,X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_2) ).
cnf(i_0_14,negated_conjecture,
reorganization_free(esk2_0,esk9_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_14) ).
cnf(i_0_8,negated_conjecture,
size(esk2_0,esk7_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_8) ).
cnf(i_0_10,negated_conjecture,
reproducibility(esk2_0,esk5_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_10) ).
cnf(i_0_6,negated_conjecture,
greater(esk8_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_6) ).
cnf(i_0_7,negated_conjecture,
size(esk3_0,esk8_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_7) ).
cnf(i_0_13,negated_conjecture,
reorganization_free(esk3_0,esk10_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_13) ).
cnf(i_0_9,negated_conjecture,
reproducibility(esk3_0,esk6_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_9) ).
cnf(i_0_5,negated_conjecture,
~ greater(esk6_0,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1whqlvwp/lgb.p',i_0_5) ).
cnf(c_0_32,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
i_0_1 ).
cnf(c_0_33,negated_conjecture,
organization(esk2_0,esk9_0),
i_0_16 ).
cnf(c_0_34,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X5,X6)
| ~ greater(X7,X8)
| ~ inertia(X3,X1,X4)
| ~ inertia(X5,X2,X6)
| ~ class(X3,X9,X4)
| ~ class(X5,X9,X6)
| ~ size(X3,X7,X4)
| ~ size(X5,X8,X6) ),
i_0_4 ).
cnf(c_0_35,negated_conjecture,
inertia(esk2_0,esk1_2(esk2_0,esk9_0),esk9_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,hypothesis,
( greater(X1,esk1_2(esk2_0,esk9_0))
| ~ inertia(X2,X1,X3)
| ~ class(esk2_0,X4,esk9_0)
| ~ class(X2,X4,X3)
| ~ size(esk2_0,X5,esk9_0)
| ~ size(X2,X6,X3)
| ~ organization(X2,X3)
| ~ greater(X6,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
class(esk2_0,esk4_0,esk9_0),
i_0_12 ).
cnf(c_0_38,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk9_0))
| ~ inertia(X2,X1,X3)
| ~ class(X2,esk4_0,X3)
| ~ size(esk2_0,X4,esk9_0)
| ~ size(X2,X5,X3)
| ~ organization(X2,X3)
| ~ greater(X5,X4) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
class(esk3_0,esk4_0,esk10_0),
i_0_11 ).
cnf(c_0_40,negated_conjecture,
organization(esk3_0,esk10_0),
i_0_15 ).
cnf(c_0_41,negated_conjecture,
( greater(X1,esk1_2(esk2_0,esk9_0))
| ~ inertia(esk3_0,X1,esk10_0)
| ~ size(esk2_0,X2,esk9_0)
| ~ size(esk3_0,X3,esk10_0)
| ~ greater(X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
inertia(esk3_0,esk1_2(esk3_0,esk10_0),esk10_0),
inference(spm,[status(thm)],[c_0_32,c_0_40]) ).
cnf(c_0_43,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X5,X6)
| ~ greater(X7,X8)
| ~ inertia(X3,X7,X4)
| ~ inertia(X5,X8,X6)
| ~ reorganization_free(X3,X4,X4)
| ~ reorganization_free(X5,X6,X6)
| ~ reproducibility(X3,X1,X4)
| ~ reproducibility(X5,X2,X6) ),
i_0_2 ).
cnf(c_0_44,negated_conjecture,
reorganization_free(esk2_0,esk9_0,esk9_0),
i_0_14 ).
cnf(c_0_45,negated_conjecture,
( greater(esk1_2(esk3_0,esk10_0),esk1_2(esk2_0,esk9_0))
| ~ size(esk2_0,X1,esk9_0)
| ~ size(esk3_0,X2,esk10_0)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
size(esk2_0,esk7_0,esk9_0),
i_0_8 ).
cnf(c_0_47,hypothesis,
( greater(X1,X2)
| ~ inertia(X3,X4,X5)
| ~ reorganization_free(X3,X5,X5)
| ~ reproducibility(esk2_0,X2,esk9_0)
| ~ reproducibility(X3,X1,X5)
| ~ organization(X3,X5)
| ~ greater(X4,esk1_2(esk2_0,esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_35]),c_0_44]),c_0_33])]) ).
cnf(c_0_48,negated_conjecture,
reproducibility(esk2_0,esk5_0,esk9_0),
i_0_10 ).
cnf(c_0_49,negated_conjecture,
( greater(esk1_2(esk3_0,esk10_0),esk1_2(esk2_0,esk9_0))
| ~ size(esk3_0,X1,esk10_0)
| ~ greater(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
greater(esk8_0,esk7_0),
i_0_6 ).
cnf(c_0_51,negated_conjecture,
size(esk3_0,esk8_0,esk10_0),
i_0_7 ).
cnf(c_0_52,negated_conjecture,
( greater(X1,esk5_0)
| ~ inertia(X2,X3,X4)
| ~ reorganization_free(X2,X4,X4)
| ~ reproducibility(X2,X1,X4)
| ~ organization(X2,X4)
| ~ greater(X3,esk1_2(esk2_0,esk9_0)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
greater(esk1_2(esk3_0,esk10_0),esk1_2(esk2_0,esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_54,negated_conjecture,
( greater(X1,esk5_0)
| ~ inertia(X2,esk1_2(esk3_0,esk10_0),X3)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X2,X1,X3)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
reorganization_free(esk3_0,esk10_0,esk10_0),
i_0_13 ).
cnf(c_0_56,negated_conjecture,
( greater(X1,esk5_0)
| ~ reproducibility(esk3_0,X1,esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_42]),c_0_55]),c_0_40])]) ).
cnf(c_0_57,negated_conjecture,
reproducibility(esk3_0,esk6_0,esk10_0),
i_0_9 ).
cnf(c_0_58,negated_conjecture,
~ greater(esk6_0,esk5_0),
i_0_5 ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT009+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 09:39:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 6.88/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.88/2.31 # No SInE strategy applied
% 6.88/2.31 # Trying AutoSched0 for 150 seconds
% 6.88/2.31 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04EA
% 6.88/2.31 # and selection function PSelectNewComplex.
% 6.88/2.31 #
% 6.88/2.31 # Preprocessing time : 0.024 s
% 6.88/2.31 # Presaturation interreduction done
% 6.88/2.31
% 6.88/2.31 # Proof found!
% 6.88/2.31 # SZS status Theorem
% 6.88/2.31 # SZS output start CNFRefutation
% See solution above
% 6.88/2.31 # Training examples: 0 positive, 0 negative
% 6.88/2.31
% 6.88/2.31 # -------------------------------------------------
% 6.88/2.31 # User time : 0.028 s
% 6.88/2.31 # System time : 0.005 s
% 6.88/2.31 # Total time : 0.033 s
% 6.88/2.31 # Maximum resident set size: 7124 pages
% 6.88/2.31
%------------------------------------------------------------------------------