%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT073+1 : TPTP v9.3.0. Released v9.3.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:08:03 AM UTC 2026
% Result : Theorem 5.59s 2.87s
% Output : CNFRefutation 5.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 3 unt; 0 nHn; 10 RR)
% Number of literals : 17 ( 0 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_45,negated_conjecture,
( ~ in_closed(X1,n0,n10)
| ~ in_closed(X1,n5,n10) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cts7ihim/input.p',i_0_45) ).
cnf(i_0_3,plain,
( in_closed(esk1_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cts7ihim/input.p',i_0_3) ).
cnf(i_0_2,plain,
( in_closed(esk1_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cts7ihim/input.p',i_0_2) ).
cnf(i_0_16,hypothesis,
axis_compatible(n0,n10,n5,n10),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cts7ihim/input.p',i_0_16) ).
cnf(c_0_50,negated_conjecture,
( ~ in_closed(X1,n0,n10)
| ~ in_closed(X1,n5,n10) ),
i_0_45 ).
cnf(c_0_51,plain,
( in_closed(esk1_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
i_0_3 ).
cnf(c_0_52,negated_conjecture,
( ~ in_closed(esk1_4(n0,n10,X1,X2),n5,n10)
| ~ axis_compatible(n0,n10,X1,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
( in_closed(esk1_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
i_0_2 ).
cnf(c_0_54,hypothesis,
axis_compatible(n0,n10,n5,n10),
i_0_16 ).
cnf(c_0_55,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT073+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.36 % Computer : n008.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 7 13:57:39 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.46 # ENIGMATIC: Selected SinE mode:
% 0.22/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.59/2.87 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 5.59/2.87 # Version: 2.1pre011
% 5.59/2.87 # Preprocessing time : 0.009 s
% 5.59/2.87
% 5.59/2.87 # Proof found!
% 5.59/2.87 # SZS status Theorem
% 5.59/2.87 # SZS output start CNFRefutation
% See solution above
% 5.59/2.87 # Proof object total steps : 10
% 5.59/2.87 # Proof object clause steps : 6
% 5.59/2.87 # Proof object formula steps : 4
% 5.59/2.87 # Proof object conjectures : 3
% 5.59/2.87 # Proof object clause conjectures : 2
% 5.59/2.87 # Proof object formula conjectures : 1
% 5.59/2.87 # Proof object initial clauses used : 4
% 5.59/2.87 # Proof object initial formulas used : 4
% 5.59/2.87 # Proof object generating inferences : 2
% 5.59/2.87 # Proof object simplifying inferences : 2
% 5.59/2.87 # Training examples: 0 positive, 0 negative
% 5.59/2.87 # Parsed axioms : 63
% 5.59/2.87 # Removed by relevancy pruning/SinE : 0
% 5.59/2.87 # Initial clauses : 63
% 5.59/2.87 # Removed in clause preprocessing : 0
% 5.59/2.87 # Initial clauses in saturation : 63
% 5.59/2.87 # Processed clauses : 68
% 5.59/2.87 # ...of these trivial : 0
% 5.59/2.87 # ...subsumed : 13
% 5.59/2.87 # ...remaining for further processing : 55
% 5.59/2.87 # Other redundant clauses eliminated : 2
% 5.59/2.87 # Clauses deleted for lack of memory : 0
% 5.59/2.87 # Backward-subsumed : 0
% 5.59/2.87 # Backward-rewritten : 0
% 5.59/2.87 # Generated clauses : 64
% 5.59/2.87 # ...of the previous two non-trivial : 42
% 5.59/2.87 # Contextual simplify-reflections : 0
% 5.59/2.87 # Paramodulations : 60
% 5.59/2.87 # Factorizations : 2
% 5.59/2.87 # Equation resolutions : 2
% 5.59/2.87 # Propositional unsat checks : 0
% 5.59/2.87 # Propositional unsat check successes : 0
% 5.59/2.87 # Current number of processed clauses : 53
% 5.59/2.87 # Positive orientable unit clauses : 5
% 5.59/2.87 # Positive unorientable unit clauses: 0
% 5.59/2.87 # Negative unit clauses : 2
% 5.59/2.87 # Non-unit-clauses : 46
% 5.59/2.87 # Current number of unprocessed clauses: 37
% 5.59/2.87 # ...number of literals in the above : 85
% 5.59/2.87 # Current number of archived formulas : 0
% 5.59/2.87 # Current number of archived clauses : 0
% 5.59/2.87 # Clause-clause subsumption calls (NU) : 303
% 5.59/2.87 # Rec. Clause-clause subsumption calls : 239
% 5.59/2.87 # Non-unit clause-clause subsumptions : 13
% 5.59/2.87 # Unit Clause-clause subsumption calls : 19
% 5.59/2.87 # Rewrite failures with RHS unbound : 0
% 5.59/2.87 # BW rewrite match attempts : 23
% 5.59/2.87 # BW rewrite match successes : 0
% 5.59/2.87 # Condensation attempts : 0
% 5.59/2.87 # Condensation successes : 0
% 5.59/2.87 # Termbank termtop insertions : 1538
% 5.59/2.87
% 5.59/2.87 # -------------------------------------------------
% 5.59/2.87 # User time : 0.009 s
% 5.59/2.87 # System time : 0.001 s
% 5.59/2.87 # Total time : 0.010 s
% 5.59/2.87 # ...preprocessing : 0.009 s
% 5.59/2.87 # ...main loop : 0.001 s
% 5.59/2.87 # Maximum resident set size: 6400 pages
% 5.59/2.87
%------------------------------------------------------------------------------