%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT077+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 10.93s 3.60s
% Output : CNFRefutation 10.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 11 unt; 0 nHn; 18 RR)
% Number of literals : 39 ( 0 equ; 26 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,negated_conjecture,
( ~ less(v100,X1)
| ~ less(v200,X2)
| ~ in_open(X1,v0,v500)
| ~ in_open(X2,v0,v800) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ef_gio_h/input.p',i_0_43) ).
cnf(i_0_28,plain,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ef_gio_h/input.p',i_0_28) ).
cnf(i_0_48,plain,
less(v100,v200),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ef_gio_h/input.p',i_0_48) ).
cnf(i_0_45,plain,
less(v0,v200),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ef_gio_h/input.p',i_0_45) ).
cnf(i_0_51,plain,
less(v200,v500),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ef_gio_h/input.p',i_0_51) ).
cnf(i_0_46,plain,
less(v0,v500),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ef_gio_h/input.p',i_0_46) ).
cnf(i_0_53,plain,
less(v500,v800),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ef_gio_h/input.p',i_0_53) ).
cnf(c_0_61,negated_conjecture,
( ~ less(v100,X1)
| ~ less(v200,X2)
| ~ in_open(X1,v0,v500)
| ~ in_open(X2,v0,v800) ),
i_0_43 ).
cnf(c_0_62,plain,
( in_open(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
i_0_28 ).
cnf(c_0_63,negated_conjecture,
( ~ in_open(X1,v0,v500)
| ~ less(v100,X1)
| ~ less(v200,X2)
| ~ less(v0,X2)
| ~ less(X2,v800) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_64,plain,
( ~ less(v100,X1)
| ~ less(v200,X2)
| ~ less(v0,X2)
| ~ less(X2,v800)
| ~ less(v0,X1)
| ~ less(X1,v500) ),
inference(spm,[status(thm)],[c_0_63,c_0_62]) ).
cnf(c_0_65,plain,
less(v100,v200),
i_0_48 ).
cnf(c_0_66,plain,
less(v0,v200),
i_0_45 ).
cnf(c_0_67,plain,
less(v200,v500),
i_0_51 ).
cnf(c_0_68,plain,
( ~ less(v200,X1)
| ~ less(v0,X1)
| ~ less(X1,v800) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67])]) ).
cnf(c_0_69,plain,
less(v0,v500),
i_0_46 ).
cnf(c_0_70,plain,
less(v500,v800),
i_0_53 ).
cnf(c_0_71,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_67]),c_0_69]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT077+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.35 % Computer : n017.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 7 14:07:43 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.45 # 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
% 10.93/3.60 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 10.93/3.60 # Version: 2.1pre011
% 10.93/3.60 # Preprocessing time : 0.015 s
% 10.93/3.60
% 10.93/3.60 # Proof found!
% 10.93/3.60 # SZS status Theorem
% 10.93/3.60 # SZS output start CNFRefutation
% See solution above
% 10.93/3.60 # Proof object total steps : 18
% 10.93/3.60 # Proof object clause steps : 11
% 10.93/3.60 # Proof object formula steps : 7
% 10.93/3.60 # Proof object conjectures : 3
% 10.93/3.60 # Proof object clause conjectures : 2
% 10.93/3.60 # Proof object formula conjectures : 1
% 10.93/3.60 # Proof object initial clauses used : 7
% 10.93/3.60 # Proof object initial formulas used : 7
% 10.93/3.60 # Proof object generating inferences : 4
% 10.93/3.60 # Proof object simplifying inferences : 6
% 10.93/3.60 # Training examples: 0 positive, 0 negative
% 10.93/3.60 # Parsed axioms : 60
% 10.93/3.60 # Removed by relevancy pruning/SinE : 0
% 10.93/3.60 # Initial clauses : 60
% 10.93/3.60 # Removed in clause preprocessing : 0
% 10.93/3.60 # Initial clauses in saturation : 60
% 10.93/3.60 # Processed clauses : 70
% 10.93/3.60 # ...of these trivial : 0
% 10.93/3.60 # ...subsumed : 3
% 10.93/3.60 # ...remaining for further processing : 67
% 10.93/3.60 # Other redundant clauses eliminated : 1
% 10.93/3.60 # Clauses deleted for lack of memory : 0
% 10.93/3.60 # Backward-subsumed : 2
% 10.93/3.60 # Backward-rewritten : 0
% 10.93/3.60 # Generated clauses : 76
% 10.93/3.60 # ...of the previous two non-trivial : 57
% 10.93/3.60 # Contextual simplify-reflections : 0
% 10.93/3.60 # Paramodulations : 73
% 10.93/3.60 # Factorizations : 2
% 10.93/3.60 # Equation resolutions : 1
% 10.93/3.60 # Propositional unsat checks : 0
% 10.93/3.60 # Propositional unsat check successes : 0
% 10.93/3.60 # Current number of processed clauses : 64
% 10.93/3.60 # Positive orientable unit clauses : 16
% 10.93/3.60 # Positive unorientable unit clauses: 0
% 10.93/3.60 # Negative unit clauses : 13
% 10.93/3.60 # Non-unit-clauses : 35
% 10.93/3.60 # Current number of unprocessed clauses: 34
% 10.93/3.60 # ...number of literals in the above : 85
% 10.93/3.60 # Current number of archived formulas : 0
% 10.93/3.60 # Current number of archived clauses : 2
% 10.93/3.60 # Clause-clause subsumption calls (NU) : 211
% 10.93/3.60 # Rec. Clause-clause subsumption calls : 143
% 10.93/3.60 # Non-unit clause-clause subsumptions : 5
% 10.93/3.60 # Unit Clause-clause subsumption calls : 74
% 10.93/3.60 # Rewrite failures with RHS unbound : 0
% 10.93/3.60 # BW rewrite match attempts : 4
% 10.93/3.60 # BW rewrite match successes : 0
% 10.93/3.60 # Condensation attempts : 0
% 10.93/3.60 # Condensation successes : 0
% 10.93/3.60 # Termbank termtop insertions : 1585
% 10.93/3.60
% 10.93/3.60 # -------------------------------------------------
% 10.93/3.60 # User time : 0.016 s
% 10.93/3.60 # System time : 0.002 s
% 10.93/3.60 # Total time : 0.018 s
% 10.93/3.60 # ...preprocessing : 0.015 s
% 10.93/3.60 # ...main loop : 0.003 s
% 10.93/3.60 # Maximum resident set size: 6400 pages
% 10.93/3.60
%------------------------------------------------------------------------------