TSTP Solution File: MGT006+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT006+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:13 EDT 2022
% Result : Theorem 4.37s 2.13s
% Output : CNFRefutation 4.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 44 ( 20 unt; 0 nHn; 44 RR)
% Number of literals : 153 ( 0 equ; 112 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 111 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X5)
| ~ greater(X4,X5)
| ~ reproducibility(X3,X1,X4)
| ~ reproducibility(X3,X2,X5)
| ~ reorganization_free(X3,X5,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_5) ).
cnf(i_0_1,plain,
( reproducibility(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_1) ).
cnf(i_0_3,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X5,X6)
| ~ greater(X7,X8)
| ~ reproducibility(X3,X7,X4)
| ~ reproducibility(X5,X8,X6)
| ~ reliability(X3,X9,X4)
| ~ reliability(X5,X10,X6)
| ~ accountability(X3,X1,X4)
| ~ accountability(X5,X2,X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_3) ).
cnf(i_0_12,negated_conjecture,
reorganization_free(esk2_0,esk7_0,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_12) ).
cnf(i_0_7,negated_conjecture,
greater(esk8_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_7) ).
cnf(i_0_14,negated_conjecture,
organization(esk2_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_14) ).
cnf(i_0_13,negated_conjecture,
organization(esk2_0,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_13) ).
cnf(i_0_4,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X5,X6)
| ~ greater(X7,X8)
| ~ reproducibility(X3,X7,X4)
| ~ reproducibility(X5,X8,X6)
| ~ reliability(X3,X1,X4)
| ~ reliability(X5,X2,X6)
| ~ accountability(X3,X9,X4)
| ~ accountability(X5,X10,X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_4) ).
cnf(i_0_9,negated_conjecture,
accountability(esk2_0,esk5_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_9) ).
cnf(i_0_8,negated_conjecture,
accountability(esk2_0,esk6_0,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_8) ).
cnf(i_0_11,negated_conjecture,
reliability(esk2_0,esk3_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_11) ).
cnf(i_0_10,negated_conjecture,
reliability(esk2_0,esk4_0,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_10) ).
cnf(i_0_6,negated_conjecture,
( ~ greater(esk4_0,esk3_0)
| ~ greater(esk6_0,esk5_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a6q4lwwk/input.p',i_0_6) ).
cnf(c_0_28,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X5)
| ~ greater(X4,X5)
| ~ reproducibility(X3,X1,X4)
| ~ reproducibility(X3,X2,X5)
| ~ reorganization_free(X3,X5,X4) ),
i_0_5 ).
cnf(c_0_29,plain,
( reproducibility(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
i_0_1 ).
cnf(c_0_30,plain,
( greater(X1,esk1_2(X2,X3))
| ~ reproducibility(X2,X1,X4)
| ~ reorganization_free(X2,X3,X4)
| ~ greater(X4,X3)
| ~ organization(X2,X3)
| ~ organization(X2,X4) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X5,X6)
| ~ greater(X7,X8)
| ~ reproducibility(X3,X7,X4)
| ~ reproducibility(X5,X8,X6)
| ~ reliability(X3,X9,X4)
| ~ reliability(X5,X10,X6)
| ~ accountability(X3,X1,X4)
| ~ accountability(X5,X2,X6) ),
i_0_3 ).
cnf(c_0_32,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_30,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
reorganization_free(esk2_0,esk7_0,esk8_0),
i_0_12 ).
cnf(c_0_34,negated_conjecture,
greater(esk8_0,esk7_0),
i_0_7 ).
cnf(c_0_35,negated_conjecture,
organization(esk2_0,esk7_0),
i_0_14 ).
cnf(c_0_36,negated_conjecture,
organization(esk2_0,esk8_0),
i_0_13 ).
cnf(c_0_37,plain,
( greater(X1,X2)
| ~ reproducibility(X3,X4,X5)
| ~ accountability(X6,X2,X7)
| ~ accountability(X3,X1,X5)
| ~ reliability(X6,X8,X7)
| ~ reliability(X3,X9,X5)
| ~ greater(X4,esk1_2(X6,X7))
| ~ organization(X6,X7)
| ~ organization(X3,X5) ),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
greater(esk1_2(esk2_0,esk8_0),esk1_2(esk2_0,esk7_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_39,hypothesis,
( greater(X1,X2)
| ~ organization(X3,X4)
| ~ organization(X5,X6)
| ~ greater(X7,X8)
| ~ reproducibility(X3,X7,X4)
| ~ reproducibility(X5,X8,X6)
| ~ reliability(X3,X1,X4)
| ~ reliability(X5,X2,X6)
| ~ accountability(X3,X9,X4)
| ~ accountability(X5,X10,X6) ),
i_0_4 ).
cnf(c_0_40,negated_conjecture,
( greater(X1,X2)
| ~ reproducibility(X3,esk1_2(esk2_0,esk8_0),X4)
| ~ accountability(esk2_0,X2,esk7_0)
| ~ accountability(X3,X1,X4)
| ~ reliability(esk2_0,X5,esk7_0)
| ~ reliability(X3,X6,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35])]) ).
cnf(c_0_41,plain,
( greater(X1,X2)
| ~ reproducibility(X3,X4,X5)
| ~ accountability(X6,X7,X8)
| ~ accountability(X3,X9,X5)
| ~ reliability(X6,X2,X8)
| ~ reliability(X3,X1,X5)
| ~ greater(X4,esk1_2(X6,X8))
| ~ organization(X6,X8)
| ~ organization(X3,X5) ),
inference(spm,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_42,plain,
( greater(X1,X2)
| ~ accountability(esk2_0,X2,esk7_0)
| ~ accountability(esk2_0,X1,esk8_0)
| ~ reliability(esk2_0,X3,esk7_0)
| ~ reliability(esk2_0,X4,esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_29]),c_0_36])]) ).
cnf(c_0_43,negated_conjecture,
accountability(esk2_0,esk5_0,esk7_0),
i_0_9 ).
cnf(c_0_44,negated_conjecture,
( greater(X1,X2)
| ~ reproducibility(X3,esk1_2(esk2_0,esk8_0),X4)
| ~ accountability(esk2_0,X5,esk7_0)
| ~ accountability(X3,X6,X4)
| ~ reliability(esk2_0,X2,esk7_0)
| ~ reliability(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_38]),c_0_35])]) ).
cnf(c_0_45,negated_conjecture,
( greater(X1,esk5_0)
| ~ accountability(esk2_0,X1,esk8_0)
| ~ reliability(esk2_0,X2,esk7_0)
| ~ reliability(esk2_0,X3,esk8_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
accountability(esk2_0,esk6_0,esk8_0),
i_0_8 ).
cnf(c_0_47,plain,
( greater(X1,X2)
| ~ accountability(esk2_0,X3,esk7_0)
| ~ accountability(esk2_0,X4,esk8_0)
| ~ reliability(esk2_0,X2,esk7_0)
| ~ reliability(esk2_0,X1,esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_29]),c_0_36])]) ).
cnf(c_0_48,negated_conjecture,
( greater(esk6_0,esk5_0)
| ~ reliability(esk2_0,X1,esk7_0)
| ~ reliability(esk2_0,X2,esk8_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
reliability(esk2_0,esk3_0,esk7_0),
i_0_11 ).
cnf(c_0_50,negated_conjecture,
( greater(X1,X2)
| ~ accountability(esk2_0,X3,esk8_0)
| ~ reliability(esk2_0,X2,esk7_0)
| ~ reliability(esk2_0,X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( greater(esk6_0,esk5_0)
| ~ reliability(esk2_0,X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
reliability(esk2_0,esk4_0,esk8_0),
i_0_10 ).
cnf(c_0_53,negated_conjecture,
( greater(X1,X2)
| ~ reliability(esk2_0,X2,esk7_0)
| ~ reliability(esk2_0,X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_46]) ).
cnf(c_0_54,negated_conjecture,
( ~ greater(esk4_0,esk3_0)
| ~ greater(esk6_0,esk5_0) ),
i_0_6 ).
cnf(c_0_55,negated_conjecture,
greater(esk6_0,esk5_0),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( greater(esk4_0,X1)
| ~ reliability(esk2_0,X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
~ greater(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[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_49]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT006+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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:17:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.37/2.13 # ENIGMATIC: Solved by autoschedule:
% 4.37/2.13 # No SInE strategy applied
% 4.37/2.13 # Trying AutoSched0 for 150 seconds
% 4.37/2.13 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02BA
% 4.37/2.13 # and selection function PSelectNonStrongRROptimalLit.
% 4.37/2.13 #
% 4.37/2.13 # Preprocessing time : 0.023 s
% 4.37/2.13 # Presaturation interreduction done
% 4.37/2.13
% 4.37/2.13 # Proof found!
% 4.37/2.13 # SZS status Theorem
% 4.37/2.13 # SZS output start CNFRefutation
% See solution above
% 4.37/2.13 # Training examples: 0 positive, 0 negative
% 4.37/2.13
% 4.37/2.13 # -------------------------------------------------
% 4.37/2.13 # User time : 0.024 s
% 4.37/2.13 # System time : 0.008 s
% 4.37/2.13 # Total time : 0.032 s
% 4.37/2.13 # Maximum resident set size: 7124 pages
% 4.37/2.13
%------------------------------------------------------------------------------