TSTP Solution File: MGT012+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT012+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 12.47s 3.22s
% Output : CNFRefutation 12.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 44 ( 23 unt; 0 nHn; 44 RR)
% Number of literals : 122 ( 5 equ; 81 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( class(X1,esk2_2(X1,X2),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_4) ).
cnf(i_0_13,negated_conjecture,
organization(esk3_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_13) ).
cnf(i_0_5,plain,
( X1 = X2
| ~ organization(X3,X4)
| ~ organization(X3,X5)
| ~ class(X3,X2,X4)
| ~ class(X3,X1,X5)
| ~ reorganization_free(X3,X5,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_5) ).
cnf(i_0_14,negated_conjecture,
organization(esk3_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_14) ).
cnf(i_0_12,negated_conjecture,
reorganization_free(esk3_0,esk6_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_12) ).
cnf(i_0_6,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)
| ~ complexity(X3,X7,X4)
| ~ complexity(X5,X8,X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_6) ).
cnf(i_0_1,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_1) ).
cnf(i_0_7,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X5)
| ~ greater(X4,X5)
| ~ inertia(X3,X1,X4)
| ~ inertia(X3,X2,X5)
| ~ reorganization_free(X3,X5,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_7) ).
cnf(i_0_10,negated_conjecture,
complexity(esk3_0,esk5_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_10) ).
cnf(i_0_9,negated_conjecture,
greater(esk7_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_9) ).
cnf(i_0_8,negated_conjecture,
greater(esk4_0,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_8) ).
cnf(i_0_11,negated_conjecture,
complexity(esk3_0,esk4_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_11) ).
cnf(i_0_3,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tyk5hnqx/lgb.p',i_0_3) ).
cnf(c_0_28,plain,
( class(X1,esk2_2(X1,X2),X2)
| ~ organization(X1,X2) ),
i_0_4 ).
cnf(c_0_29,negated_conjecture,
organization(esk3_0,esk7_0),
i_0_13 ).
cnf(c_0_30,plain,
( X1 = X2
| ~ organization(X3,X4)
| ~ organization(X3,X5)
| ~ class(X3,X2,X4)
| ~ class(X3,X1,X5)
| ~ reorganization_free(X3,X5,X4) ),
i_0_5 ).
cnf(c_0_31,negated_conjecture,
class(esk3_0,esk2_2(esk3_0,esk7_0),esk7_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( X1 = esk2_2(esk3_0,esk7_0)
| ~ class(esk3_0,X1,X2)
| ~ organization(esk3_0,X2)
| ~ reorganization_free(esk3_0,X2,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
organization(esk3_0,esk6_0),
i_0_14 ).
cnf(c_0_34,negated_conjecture,
reorganization_free(esk3_0,esk6_0,esk7_0),
i_0_12 ).
cnf(c_0_35,negated_conjecture,
( X1 = esk2_2(esk3_0,esk7_0)
| ~ class(esk3_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_36,negated_conjecture,
class(esk3_0,esk2_2(esk3_0,esk6_0),esk6_0),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
esk2_2(esk3_0,esk7_0) = esk2_2(esk3_0,esk6_0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,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)
| ~ complexity(X3,X7,X4)
| ~ complexity(X5,X8,X6) ),
i_0_6 ).
cnf(c_0_39,negated_conjecture,
class(esk3_0,esk2_2(esk3_0,esk6_0),esk7_0),
inference(rw,[status(thm)],[c_0_31,c_0_37]) ).
cnf(c_0_40,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
i_0_1 ).
cnf(c_0_41,hypothesis,
( greater(X1,X2)
| ~ class(X3,esk2_2(esk3_0,esk6_0),X4)
| ~ inertia(esk3_0,X2,esk7_0)
| ~ inertia(X3,X1,X4)
| ~ organization(X3,X4)
| ~ greater(X5,X6)
| ~ complexity(esk3_0,X6,esk7_0)
| ~ complexity(X3,X5,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_29])]) ).
cnf(c_0_42,negated_conjecture,
inertia(esk3_0,esk1_2(esk3_0,esk7_0),esk7_0),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_43,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X5)
| ~ greater(X4,X5)
| ~ inertia(X3,X1,X4)
| ~ inertia(X3,X2,X5)
| ~ reorganization_free(X3,X5,X4) ),
i_0_7 ).
cnf(c_0_44,negated_conjecture,
inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0),
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
cnf(c_0_45,negated_conjecture,
( greater(X1,esk1_2(esk3_0,esk7_0))
| ~ class(X2,esk2_2(esk3_0,esk6_0),X3)
| ~ inertia(X2,X1,X3)
| ~ organization(X2,X3)
| ~ greater(X4,X5)
| ~ complexity(esk3_0,X5,esk7_0)
| ~ complexity(X2,X4,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
complexity(esk3_0,esk5_0,esk7_0),
i_0_10 ).
cnf(c_0_47,hypothesis,
( greater(X1,esk1_2(esk3_0,esk6_0))
| ~ inertia(esk3_0,X1,X2)
| ~ organization(esk3_0,X2)
| ~ greater(X2,esk6_0)
| ~ reorganization_free(esk3_0,esk6_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_33])]) ).
cnf(c_0_48,negated_conjecture,
greater(esk7_0,esk6_0),
i_0_9 ).
cnf(c_0_49,negated_conjecture,
( greater(X1,esk1_2(esk3_0,esk7_0))
| ~ class(X2,esk2_2(esk3_0,esk6_0),X3)
| ~ inertia(X2,X1,X3)
| ~ organization(X2,X3)
| ~ greater(X4,esk5_0)
| ~ complexity(X2,X4,X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
greater(esk4_0,esk5_0),
i_0_8 ).
cnf(c_0_51,negated_conjecture,
( greater(X1,esk1_2(esk3_0,esk6_0))
| ~ inertia(esk3_0,X1,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_29]),c_0_48]),c_0_34])]) ).
cnf(c_0_52,negated_conjecture,
( greater(X1,esk1_2(esk3_0,esk7_0))
| ~ class(X2,esk2_2(esk3_0,esk6_0),X3)
| ~ inertia(X2,X1,X3)
| ~ organization(X2,X3)
| ~ complexity(X2,esk4_0,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
complexity(esk3_0,esk4_0,esk6_0),
i_0_11 ).
cnf(c_0_54,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
i_0_3 ).
cnf(c_0_55,negated_conjecture,
greater(esk1_2(esk3_0,esk7_0),esk1_2(esk3_0,esk6_0)),
inference(spm,[status(thm)],[c_0_51,c_0_42]) ).
cnf(c_0_56,negated_conjecture,
( greater(X1,esk1_2(esk3_0,esk7_0))
| ~ inertia(esk3_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_36]),c_0_33])]) ).
cnf(c_0_57,plain,
~ greater(esk1_2(esk3_0,esk6_0),esk1_2(esk3_0,esk7_0)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_44]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : MGT012+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.29 % Computer : n022.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Thu Jun 9 10:47:06 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.14/0.39 # ENIGMATIC: Selected complete mode:
% 12.47/3.22 # ENIGMATIC: Solved by autoschedule-lgb:
% 12.47/3.22 # No SInE strategy applied
% 12.47/3.22 # Trying AutoSched0 for 150 seconds
% 12.47/3.22 # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 12.47/3.22 # and selection function SelectNewComplexAHP.
% 12.47/3.22 #
% 12.47/3.22 # Preprocessing time : 0.024 s
% 12.47/3.22
% 12.47/3.22 # Proof found!
% 12.47/3.22 # SZS status Theorem
% 12.47/3.22 # SZS output start CNFRefutation
% See solution above
% 12.47/3.22 # Training examples: 0 positive, 0 negative
% 12.47/3.22
% 12.47/3.22 # -------------------------------------------------
% 12.47/3.22 # User time : 0.028 s
% 12.47/3.22 # System time : 0.005 s
% 12.47/3.22 # Total time : 0.032 s
% 12.47/3.22 # Maximum resident set size: 7124 pages
% 12.47/3.22
%------------------------------------------------------------------------------