%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT048+1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:07:59 AM UTC 2026
% Result : Theorem 12.28s 3.73s
% Output : CNFRefutation 12.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 11 unt; 0 nHn; 17 RR)
% Number of literals : 44 ( 5 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vhxz9hcu/input.p',i_0_1) ).
cnf(i_0_14,negated_conjecture,
organization(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vhxz9hcu/input.p',i_0_14) ).
cnf(i_0_19,plain,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ epred1_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/sandbox/tmp/enigma-theBenchmark.p-vhxz9hcu/input.p',i_0_19) ).
cnf(i_0_9,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vhxz9hcu/input.p',i_0_9) ).
cnf(i_0_2,plain,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vhxz9hcu/input.p',i_0_2) ).
cnf(i_0_13,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vhxz9hcu/input.p',i_0_13) ).
cnf(i_0_12,negated_conjecture,
~ smaller(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vhxz9hcu/input.p',i_0_12) ).
cnf(i_0_3,plain,
( epred1_3(X1,X2,X3)
| ~ organization(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vhxz9hcu/input.p',i_0_3) ).
cnf(c_0_28,plain,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
i_0_1 ).
cnf(c_0_29,negated_conjecture,
organization(esk1_0),
i_0_14 ).
cnf(c_0_30,plain,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ epred1_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_19 ).
cnf(c_0_31,negated_conjecture,
stock_of_knowledge(esk1_0,X1) = stock_of_knowledge(esk1_0,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
i_0_9 ).
cnf(c_0_33,plain,
( smaller(capability(esk1_0,X1),capability(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| ~ smaller_or_equal(stock_of_knowledge(esk1_0,X3),stock_of_knowledge(esk1_0,X2))
| ~ greater(internal_friction(esk1_0,X1),internal_friction(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_35,plain,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
i_0_2 ).
cnf(c_0_36,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
i_0_13 ).
cnf(c_0_37,negated_conjecture,
~ smaller(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
i_0_12 ).
cnf(c_0_38,plain,
( smaller(capability(esk1_0,X1),capability(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| ~ greater(internal_friction(esk1_0,X1),internal_friction(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29])]) ).
cnf(c_0_40,negated_conjecture,
~ epred1_3(esk2_0,esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_41,plain,
( epred1_3(X1,X2,X3)
| ~ organization(X3) ),
i_0_3 ).
cnf(c_0_42,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT048+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 7 13:14:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.46 # ENIGMATIC: Selected SinE mode:
% 0.22/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.28/3.73 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 12.28/3.73 # Version: 2.1pre011
% 12.28/3.73 # Preprocessing time : 0.014 s
% 12.28/3.73
% 12.28/3.73 # Proof found!
% 12.28/3.73 # SZS status Theorem
% 12.28/3.73 # SZS output start CNFRefutation
% See solution above
% 12.28/3.73 # Proof object total steps : 23
% 12.28/3.73 # Proof object clause steps : 15
% 12.28/3.73 # Proof object formula steps : 8
% 12.28/3.73 # Proof object conjectures : 9
% 12.28/3.73 # Proof object clause conjectures : 6
% 12.28/3.73 # Proof object formula conjectures : 3
% 12.28/3.73 # Proof object initial clauses used : 8
% 12.28/3.73 # Proof object initial formulas used : 8
% 12.28/3.73 # Proof object generating inferences : 6
% 12.28/3.73 # Proof object simplifying inferences : 7
% 12.28/3.73 # Training examples: 0 positive, 0 negative
% 12.28/3.73 # Parsed axioms : 20
% 12.28/3.73 # Removed by relevancy pruning/SinE : 0
% 12.28/3.73 # Initial clauses : 20
% 12.28/3.73 # Removed in clause preprocessing : 0
% 12.28/3.73 # Initial clauses in saturation : 20
% 12.28/3.73 # Processed clauses : 147
% 12.28/3.73 # ...of these trivial : 0
% 12.28/3.73 # ...subsumed : 55
% 12.28/3.73 # ...remaining for further processing : 92
% 12.28/3.73 # Other redundant clauses eliminated : 2
% 12.28/3.73 # Clauses deleted for lack of memory : 0
% 12.28/3.73 # Backward-subsumed : 10
% 12.28/3.73 # Backward-rewritten : 0
% 12.28/3.73 # Generated clauses : 360
% 12.28/3.73 # ...of the previous two non-trivial : 324
% 12.28/3.73 # Contextual simplify-reflections : 14
% 12.28/3.73 # Paramodulations : 355
% 12.28/3.73 # Factorizations : 2
% 12.28/3.73 # Equation resolutions : 3
% 12.28/3.73 # Propositional unsat checks : 0
% 12.28/3.73 # Propositional unsat check successes : 0
% 12.28/3.73 # Current number of processed clauses : 80
% 12.28/3.73 # Positive orientable unit clauses : 5
% 12.28/3.73 # Positive unorientable unit clauses: 1
% 12.28/3.73 # Negative unit clauses : 5
% 12.28/3.73 # Non-unit-clauses : 69
% 12.28/3.73 # Current number of unprocessed clauses: 159
% 12.28/3.73 # ...number of literals in the above : 748
% 12.28/3.73 # Current number of archived formulas : 0
% 12.28/3.73 # Current number of archived clauses : 10
% 12.28/3.73 # Clause-clause subsumption calls (NU) : 2100
% 12.28/3.73 # Rec. Clause-clause subsumption calls : 1443
% 12.28/3.73 # Non-unit clause-clause subsumptions : 66
% 12.28/3.73 # Unit Clause-clause subsumption calls : 54
% 12.28/3.73 # Rewrite failures with RHS unbound : 10
% 12.28/3.73 # BW rewrite match attempts : 4
% 12.28/3.73 # BW rewrite match successes : 0
% 12.28/3.73 # Condensation attempts : 0
% 12.28/3.73 # Condensation successes : 0
% 12.28/3.73 # Termbank termtop insertions : 7341
% 12.28/3.73
% 12.28/3.73 # -------------------------------------------------
% 12.28/3.73 # User time : 0.026 s
% 12.28/3.73 # System time : 0.003 s
% 12.28/3.73 # Total time : 0.029 s
% 12.28/3.73 # ...preprocessing : 0.014 s
% 12.28/3.73 # ...main loop : 0.014 s
% 12.28/3.73 # Maximum resident set size: 6656 pages
% 12.28/3.73
%------------------------------------------------------------------------------