TSTP Solution File: MGT003+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT003+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:12 EDT 2022
% Result : Theorem 4.38s 2.16s
% Output : CNFRefutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 15 unt; 0 nHn; 31 RR)
% Number of literals : 103 ( 0 equ; 74 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 70 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X5)
| ~ greater(X4,X5)
| ~ reorganization_free(X3,X5,X4)
| ~ inertia(X3,X1,X4)
| ~ inertia(X3,X2,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_5) ).
cnf(i_0_3,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_3) ).
cnf(i_0_4,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X5,X6)
| ~ greater(X7,X8)
| ~ reorganization_free(X3,X4,X4)
| ~ reorganization_free(X5,X6,X6)
| ~ inertia(X3,X7,X4)
| ~ inertia(X5,X8,X6)
| ~ survival_chance(X3,X1,X4)
| ~ survival_chance(X5,X2,X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_4) ).
cnf(i_0_2,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_2) ).
cnf(i_0_1,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_1) ).
cnf(i_0_9,negated_conjecture,
survival_chance(esk2_0,esk3_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_9) ).
cnf(i_0_12,negated_conjecture,
organization(esk2_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_12) ).
cnf(i_0_8,negated_conjecture,
survival_chance(esk2_0,esk4_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_8) ).
cnf(i_0_10,negated_conjecture,
reorganization_free(esk2_0,esk5_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_10) ).
cnf(i_0_7,negated_conjecture,
greater(esk6_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_7) ).
cnf(i_0_11,negated_conjecture,
organization(esk2_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_11) ).
cnf(i_0_6,negated_conjecture,
~ greater(esk4_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3r7548_q/input.p',i_0_6) ).
cnf(c_0_25,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X5)
| ~ greater(X4,X5)
| ~ reorganization_free(X3,X5,X4)
| ~ inertia(X3,X1,X4)
| ~ inertia(X3,X2,X5) ),
i_0_5 ).
cnf(c_0_26,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
i_0_3 ).
cnf(c_0_27,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X5,X6)
| ~ greater(X7,X8)
| ~ reorganization_free(X3,X4,X4)
| ~ reorganization_free(X5,X6,X6)
| ~ inertia(X3,X7,X4)
| ~ inertia(X5,X8,X6)
| ~ survival_chance(X3,X1,X4)
| ~ survival_chance(X5,X2,X6) ),
i_0_4 ).
cnf(c_0_28,plain,
( greater(X1,esk1_2(X2,X3))
| ~ inertia(X2,X1,X4)
| ~ reorganization_free(X2,X3,X4)
| ~ greater(X4,X3)
| ~ organization(X2,X3)
| ~ organization(X2,X4) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( greater(X1,X2)
| ~ inertia(X3,X4,X5)
| ~ survival_chance(X6,X2,X7)
| ~ survival_chance(X3,X1,X5)
| ~ reorganization_free(X6,X7,X7)
| ~ reorganization_free(X3,X5,X5)
| ~ greater(X4,esk1_2(X6,X7))
| ~ organization(X6,X7)
| ~ organization(X3,X5) ),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_30,plain,
( greater(esk1_2(X1,X2),esk1_2(X1,X3))
| ~ reorganization_free(X1,X3,X2)
| ~ greater(X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_31,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
i_0_2 ).
cnf(c_0_32,plain,
( greater(X1,X2)
| ~ inertia(X3,esk1_2(X4,X5),X6)
| ~ survival_chance(X4,X2,X7)
| ~ survival_chance(X3,X1,X6)
| ~ reorganization_free(X3,X6,X6)
| ~ reorganization_free(X4,X7,X5)
| ~ greater(X5,X7)
| ~ organization(X4,X7)
| ~ organization(X3,X6)
| ~ organization(X4,X5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_33,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X3,X2) ),
i_0_1 ).
cnf(c_0_34,plain,
( greater(X1,X2)
| ~ survival_chance(X3,X2,X4)
| ~ survival_chance(X3,X1,X5)
| ~ reorganization_free(X3,X4,X5)
| ~ greater(X5,X4)
| ~ organization(X3,X4)
| ~ organization(X3,X5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_26]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
survival_chance(esk2_0,esk3_0,esk5_0),
i_0_9 ).
cnf(c_0_36,negated_conjecture,
organization(esk2_0,esk5_0),
i_0_12 ).
cnf(c_0_37,negated_conjecture,
( greater(X1,esk3_0)
| ~ survival_chance(esk2_0,X1,X2)
| ~ reorganization_free(esk2_0,esk5_0,X2)
| ~ greater(X2,esk5_0)
| ~ organization(esk2_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_38,negated_conjecture,
survival_chance(esk2_0,esk4_0,esk6_0),
i_0_8 ).
cnf(c_0_39,negated_conjecture,
reorganization_free(esk2_0,esk5_0,esk6_0),
i_0_10 ).
cnf(c_0_40,negated_conjecture,
greater(esk6_0,esk5_0),
i_0_7 ).
cnf(c_0_41,negated_conjecture,
organization(esk2_0,esk6_0),
i_0_11 ).
cnf(c_0_42,negated_conjecture,
~ greater(esk4_0,esk3_0),
i_0_6 ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]),c_0_41])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n026.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 09:43:04 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.38/2.16 # ENIGMATIC: Solved by autoschedule:
% 4.38/2.16 # No SInE strategy applied
% 4.38/2.16 # Trying AutoSched0 for 150 seconds
% 4.38/2.16 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 4.38/2.16 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.38/2.16 #
% 4.38/2.16 # Preprocessing time : 0.023 s
% 4.38/2.16
% 4.38/2.16 # Proof found!
% 4.38/2.16 # SZS status Theorem
% 4.38/2.16 # SZS output start CNFRefutation
% See solution above
% 4.38/2.16 # Training examples: 0 positive, 0 negative
% 4.38/2.16
% 4.38/2.16 # -------------------------------------------------
% 4.38/2.16 # User time : 0.024 s
% 4.38/2.16 # System time : 0.004 s
% 4.38/2.16 # Total time : 0.028 s
% 4.38/2.16 # Maximum resident set size: 7124 pages
% 4.38/2.16
%------------------------------------------------------------------------------