TSTP Solution File: MGT043+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT043+1 : TPTP v8.1.0. Released v2.4.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:47 EDT 2022
% Result : Theorem 7.86s 2.52s
% Output : CNFRefutation 7.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 43 ( 20 unt; 2 nHn; 37 RR)
% Number of literals : 84 ( 17 equ; 44 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( position(X1,X2) = position(X1,X3)
| external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_3) ).
cnf(i_0_19,negated_conjecture,
organization(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_19) ).
cnf(i_0_27,plain,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ epred2_3(X3,X2,X1)
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_27) ).
cnf(i_0_16,negated_conjecture,
stock_of_knowledge(esk1_0,esk2_0) = stock_of_knowledge(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_16) ).
cnf(i_0_10,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_10) ).
cnf(i_0_14,negated_conjecture,
external_ties(esk1_0,esk2_0) = external_ties(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_14) ).
cnf(i_0_15,negated_conjecture,
greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_15) ).
cnf(i_0_9,plain,
( greater(X1,X2)
| ~ smaller(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_9) ).
cnf(i_0_25,plain,
( smaller(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))
| ~ epred1_3(X3,X2,X1)
| ~ greater(capability(X1,X2),capability(X1,X3))
| ~ greater_or_equal(position(X1,X2),position(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_25) ).
cnf(i_0_5,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_5) ).
cnf(i_0_2,plain,
( epred2_3(X1,X2,X3)
| ~ organization(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_2) ).
cnf(i_0_13,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_13) ).
cnf(i_0_1,plain,
( has_immunity(X1,X2)
| has_immunity(X1,X3)
| epred1_3(X3,X2,X1)
| ~ organization(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_1) ).
cnf(i_0_18,negated_conjecture,
~ has_immunity(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_18) ).
cnf(i_0_17,negated_conjecture,
~ has_immunity(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-amdc4bkg/input.p',i_0_17) ).
cnf(c_0_43,plain,
( position(X1,X2) = position(X1,X3)
| external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1) ),
i_0_3 ).
cnf(c_0_44,negated_conjecture,
organization(esk1_0),
i_0_19 ).
cnf(c_0_45,plain,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ epred2_3(X3,X2,X1)
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
i_0_27 ).
cnf(c_0_46,negated_conjecture,
stock_of_knowledge(esk1_0,esk2_0) = stock_of_knowledge(esk1_0,esk3_0),
i_0_16 ).
cnf(c_0_47,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
i_0_10 ).
cnf(c_0_48,negated_conjecture,
( position(esk1_0,X1) = position(esk1_0,X2)
| external_ties(esk1_0,X1) != external_ties(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
external_ties(esk1_0,esk2_0) = external_ties(esk1_0,esk3_0),
i_0_14 ).
cnf(c_0_50,negated_conjecture,
( smaller(capability(esk1_0,X1),capability(esk1_0,esk2_0))
| ~ epred2_3(esk2_0,X1,esk1_0)
| ~ smaller_or_equal(stock_of_knowledge(esk1_0,X1),stock_of_knowledge(esk1_0,esk3_0))
| ~ greater(internal_friction(esk1_0,X1),internal_friction(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0)),
i_0_15 ).
cnf(c_0_53,negated_conjecture,
( position(esk1_0,X1) = position(esk1_0,esk2_0)
| external_ties(esk1_0,X1) != external_ties(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
( greater(X1,X2)
| ~ smaller(X2,X1) ),
i_0_9 ).
cnf(c_0_55,plain,
( smaller(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))
| ~ epred2_3(esk2_0,esk3_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_56,plain,
( smaller(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))
| ~ epred1_3(X3,X2,X1)
| ~ greater(capability(X1,X2),capability(X1,X3))
| ~ greater_or_equal(position(X1,X2),position(X1,X3)) ),
i_0_25 ).
cnf(c_0_57,negated_conjecture,
position(esk1_0,esk2_0) = position(esk1_0,esk3_0),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_58,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
i_0_5 ).
cnf(c_0_59,plain,
( greater(capability(esk1_0,esk2_0),capability(esk1_0,esk3_0))
| ~ epred2_3(esk2_0,esk3_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
( epred2_3(X1,X2,X3)
| ~ organization(X3) ),
i_0_2 ).
cnf(c_0_61,plain,
( smaller(hazard_of_mortality(esk1_0,esk2_0),hazard_of_mortality(esk1_0,X1))
| ~ epred1_3(X1,esk2_0,esk1_0)
| ~ greater_or_equal(position(esk1_0,esk3_0),position(esk1_0,X1))
| ~ greater(capability(esk1_0,esk2_0),capability(esk1_0,X1)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_63,plain,
greater(capability(esk1_0,esk2_0),capability(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_44])]) ).
cnf(c_0_64,plain,
( smaller(hazard_of_mortality(esk1_0,esk2_0),hazard_of_mortality(esk1_0,esk3_0))
| ~ epred1_3(esk3_0,esk2_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
cnf(c_0_65,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)),
i_0_13 ).
cnf(c_0_66,plain,
~ epred1_3(esk3_0,esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_64]),c_0_65]) ).
cnf(c_0_67,plain,
( has_immunity(X1,X2)
| has_immunity(X1,X3)
| epred1_3(X3,X2,X1)
| ~ organization(X1) ),
i_0_1 ).
cnf(c_0_68,negated_conjecture,
~ has_immunity(esk1_0,esk2_0),
i_0_18 ).
cnf(c_0_69,negated_conjecture,
~ has_immunity(esk1_0,esk3_0),
i_0_17 ).
cnf(c_0_70,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_44])]),c_0_68]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : MGT043+1 : TPTP v8.1.0. Released v2.4.0.
% 0.14/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 9 11:42:51 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.86/2.52 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.86/2.52 # Version: 2.1pre011
% 7.86/2.52 # Preprocessing time : 0.013 s
% 7.86/2.52
% 7.86/2.52 # Proof found!
% 7.86/2.52 # SZS status Theorem
% 7.86/2.52 # SZS output start CNFRefutation
% See solution above
% 7.86/2.52 # Proof object total steps : 43
% 7.86/2.52 # Proof object clause steps : 28
% 7.86/2.52 # Proof object formula steps : 15
% 7.86/2.52 # Proof object conjectures : 18
% 7.86/2.52 # Proof object clause conjectures : 11
% 7.86/2.52 # Proof object formula conjectures : 7
% 7.86/2.52 # Proof object initial clauses used : 15
% 7.86/2.52 # Proof object initial formulas used : 15
% 7.86/2.52 # Proof object generating inferences : 11
% 7.86/2.52 # Proof object simplifying inferences : 13
% 7.86/2.52 # Training examples: 0 positive, 0 negative
% 7.86/2.52 # Parsed axioms : 28
% 7.86/2.52 # Removed by relevancy pruning/SinE : 0
% 7.86/2.52 # Initial clauses : 28
% 7.86/2.52 # Removed in clause preprocessing : 0
% 7.86/2.52 # Initial clauses in saturation : 28
% 7.86/2.52 # Processed clauses : 147
% 7.86/2.52 # ...of these trivial : 0
% 7.86/2.52 # ...subsumed : 41
% 7.86/2.52 # ...remaining for further processing : 106
% 7.86/2.52 # Other redundant clauses eliminated : 4
% 7.86/2.52 # Clauses deleted for lack of memory : 0
% 7.86/2.52 # Backward-subsumed : 9
% 7.86/2.52 # Backward-rewritten : 2
% 7.86/2.52 # Generated clauses : 438
% 7.86/2.52 # ...of the previous two non-trivial : 360
% 7.86/2.52 # Contextual simplify-reflections : 29
% 7.86/2.52 # Paramodulations : 410
% 7.86/2.52 # Factorizations : 20
% 7.86/2.52 # Equation resolutions : 8
% 7.86/2.52 # Propositional unsat checks : 0
% 7.86/2.52 # Propositional unsat check successes : 0
% 7.86/2.52 # Current number of processed clauses : 93
% 7.86/2.52 # Positive orientable unit clauses : 8
% 7.86/2.52 # Positive unorientable unit clauses: 0
% 7.86/2.52 # Negative unit clauses : 6
% 7.86/2.52 # Non-unit-clauses : 79
% 7.86/2.52 # Current number of unprocessed clauses: 231
% 7.86/2.52 # ...number of literals in the above : 1712
% 7.86/2.52 # Current number of archived formulas : 0
% 7.86/2.52 # Current number of archived clauses : 11
% 7.86/2.52 # Clause-clause subsumption calls (NU) : 3847
% 7.86/2.52 # Rec. Clause-clause subsumption calls : 2135
% 7.86/2.52 # Non-unit clause-clause subsumptions : 75
% 7.86/2.52 # Unit Clause-clause subsumption calls : 71
% 7.86/2.52 # Rewrite failures with RHS unbound : 0
% 7.86/2.52 # BW rewrite match attempts : 8
% 7.86/2.52 # BW rewrite match successes : 2
% 7.86/2.52 # Condensation attempts : 0
% 7.86/2.52 # Condensation successes : 0
% 7.86/2.52 # Termbank termtop insertions : 11131
% 7.86/2.52
% 7.86/2.52 # -------------------------------------------------
% 7.86/2.52 # User time : 0.021 s
% 7.86/2.52 # System time : 0.004 s
% 7.86/2.52 # Total time : 0.025 s
% 7.86/2.52 # ...preprocessing : 0.013 s
% 7.86/2.52 # ...main loop : 0.012 s
% 7.86/2.52 # Maximum resident set size: 7124 pages
% 7.86/2.52
%------------------------------------------------------------------------------