%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n002.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:08:05 AM UTC 2026
% Result : Theorem 12.20s 3.76s
% Output : CNFRefutation 12.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 2 nHn; 5 RR)
% Number of literals : 9 ( 4 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-6 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_71,plain,
~ axis_subsumes(v0,v800,v0,v600),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ath3s_0n/input.p',i_0_71) ).
cnf(i_0_107,plain,
( subs_verdict(X1,X2,present,X3,X4,present) = conflict
| axis_subsumes(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ath3s_0n/input.p',i_0_107) ).
cnf(i_0_72,negated_conjecture,
subs_verdict(v0,v800,present,v0,v600,present) != conflict,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ath3s_0n/input.p',i_0_72) ).
cnf(c_0_111,plain,
~ axis_subsumes(v0,v800,v0,v600),
i_0_71 ).
cnf(c_0_112,plain,
( subs_verdict(X1,X2,present,X3,X4,present) = conflict
| axis_subsumes(X1,X2,X3,X4) ),
i_0_107 ).
cnf(c_0_113,negated_conjecture,
subs_verdict(v0,v800,present,v0,v600,present) != conflict,
i_0_72 ).
cnf(c_0_114,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 14:27:24 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.12/0.40 # ENIGMATIC: Selected SinE mode:
% 0.12/0.40 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.40 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.40 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.20/3.76 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 12.20/3.76 # Version: 2.1pre011
% 12.20/3.76 # Preprocessing time : 0.017 s
% 12.20/3.76
% 12.20/3.76 # Proof found!
% 12.20/3.76 # SZS status Theorem
% 12.20/3.76 # SZS output start CNFRefutation
% See solution above
% 12.20/3.76 # Proof object total steps : 7
% 12.20/3.76 # Proof object clause steps : 4
% 12.20/3.76 # Proof object formula steps : 3
% 12.20/3.76 # Proof object conjectures : 2
% 12.20/3.76 # Proof object clause conjectures : 1
% 12.20/3.76 # Proof object formula conjectures : 1
% 12.20/3.76 # Proof object initial clauses used : 3
% 12.20/3.76 # Proof object initial formulas used : 3
% 12.20/3.76 # Proof object generating inferences : 1
% 12.20/3.76 # Proof object simplifying inferences : 1
% 12.20/3.76 # Training examples: 0 positive, 0 negative
% 12.20/3.76 # Parsed axioms : 124
% 12.20/3.76 # Removed by relevancy pruning/SinE : 0
% 12.20/3.76 # Initial clauses : 124
% 12.20/3.76 # Removed in clause preprocessing : 0
% 12.20/3.76 # Initial clauses in saturation : 124
% 12.20/3.76 # Processed clauses : 105
% 12.20/3.76 # ...of these trivial : 0
% 12.20/3.76 # ...subsumed : 1
% 12.20/3.76 # ...remaining for further processing : 104
% 12.20/3.76 # Other redundant clauses eliminated : 1
% 12.20/3.76 # Clauses deleted for lack of memory : 0
% 12.20/3.76 # Backward-subsumed : 0
% 12.20/3.76 # Backward-rewritten : 0
% 12.20/3.76 # Generated clauses : 18
% 12.20/3.76 # ...of the previous two non-trivial : 5
% 12.20/3.76 # Contextual simplify-reflections : 0
% 12.20/3.76 # Paramodulations : 15
% 12.20/3.76 # Factorizations : 2
% 12.20/3.76 # Equation resolutions : 1
% 12.20/3.76 # Propositional unsat checks : 0
% 12.20/3.76 # Propositional unsat check successes : 0
% 12.20/3.76 # Current number of processed clauses : 103
% 12.20/3.76 # Positive orientable unit clauses : 43
% 12.20/3.76 # Positive unorientable unit clauses: 0
% 12.20/3.76 # Negative unit clauses : 35
% 12.20/3.76 # Non-unit-clauses : 25
% 12.20/3.76 # Current number of unprocessed clauses: 24
% 12.20/3.76 # ...number of literals in the above : 84
% 12.20/3.76 # Current number of archived formulas : 0
% 12.20/3.76 # Current number of archived clauses : 0
% 12.20/3.76 # Clause-clause subsumption calls (NU) : 35
% 12.20/3.76 # Rec. Clause-clause subsumption calls : 26
% 12.20/3.76 # Non-unit clause-clause subsumptions : 1
% 12.20/3.76 # Unit Clause-clause subsumption calls : 532
% 12.20/3.76 # Rewrite failures with RHS unbound : 0
% 12.20/3.76 # BW rewrite match attempts : 4
% 12.20/3.76 # BW rewrite match successes : 0
% 12.20/3.76 # Condensation attempts : 0
% 12.20/3.76 # Condensation successes : 0
% 12.20/3.76 # Termbank termtop insertions : 1721
% 12.20/3.76
% 12.20/3.76 # -------------------------------------------------
% 12.20/3.76 # User time : 0.018 s
% 12.20/3.76 # System time : 0.002 s
% 12.20/3.76 # Total time : 0.020 s
% 12.20/3.76 # ...preprocessing : 0.017 s
% 12.20/3.76 # ...main loop : 0.003 s
% 12.20/3.76 # Maximum resident set size: 6656 pages
% 12.20/3.76
%------------------------------------------------------------------------------