%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT090+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:04 AM UTC 2026
% Result : Theorem 10.29s 3.78s
% Output : CNFRefutation 10.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 11 unt; 2 nHn; 16 RR)
% Number of literals : 25 ( 4 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_39,negated_conjecture,
~ wf(lt,v600,v0,v1200),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjwj6xvn/input.p',i_0_39) ).
cnf(i_0_73,plain,
( X1 = X2
| wf(lt,X2,X1,X3)
| ~ leq(X2,X3)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjwj6xvn/input.p',i_0_73) ).
cnf(i_0_12,plain,
v600 != v0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjwj6xvn/input.p',i_0_12) ).
cnf(i_0_28,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjwj6xvn/input.p',i_0_28) ).
cnf(i_0_57,plain,
less(v600,v1200),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjwj6xvn/input.p',i_0_57) ).
cnf(i_0_56,plain,
less(v0,v600),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjwj6xvn/input.p',i_0_56) ).
cnf(c_0_80,negated_conjecture,
~ wf(lt,v600,v0,v1200),
i_0_39 ).
cnf(c_0_81,plain,
( X1 = X2
| wf(lt,X2,X1,X3)
| ~ leq(X2,X3)
| ~ leq(X1,X2) ),
i_0_73 ).
cnf(c_0_82,plain,
v600 != v0,
i_0_12 ).
cnf(c_0_83,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
i_0_28 ).
cnf(c_0_84,plain,
less(v600,v1200),
i_0_57 ).
cnf(c_0_85,plain,
less(v0,v600),
i_0_56 ).
cnf(c_0_86,negated_conjecture,
( ~ leq(v600,v1200)
| ~ leq(v0,v600) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_87,plain,
leq(v600,v1200),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_88,plain,
leq(v0,v600),
inference(spm,[status(thm)],[c_0_83,c_0_85]) ).
cnf(c_0_89,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]),c_0_88])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT090+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 7 14:24:09 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected SinE mode:
% 0.22/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.29/3.78 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 10.29/3.78 # Version: 2.1pre011
% 10.29/3.78 # Preprocessing time : 0.009 s
% 10.29/3.78
% 10.29/3.78 # Proof found!
% 10.29/3.78 # SZS status Theorem
% 10.29/3.78 # SZS output start CNFRefutation
% See solution above
% 10.29/3.78 # Proof object total steps : 16
% 10.29/3.78 # Proof object clause steps : 10
% 10.29/3.78 # Proof object formula steps : 6
% 10.29/3.78 # Proof object conjectures : 4
% 10.29/3.78 # Proof object clause conjectures : 3
% 10.29/3.79 # Proof object formula conjectures : 1
% 10.29/3.79 # Proof object initial clauses used : 6
% 10.29/3.79 # Proof object initial formulas used : 6
% 10.29/3.79 # Proof object generating inferences : 3
% 10.29/3.79 # Proof object simplifying inferences : 5
% 10.29/3.79 # Training examples: 0 positive, 0 negative
% 10.29/3.79 # Parsed axioms : 79
% 10.29/3.79 # Removed by relevancy pruning/SinE : 0
% 10.29/3.79 # Initial clauses : 79
% 10.29/3.79 # Removed in clause preprocessing : 0
% 10.29/3.79 # Initial clauses in saturation : 79
% 10.29/3.79 # Processed clauses : 85
% 10.29/3.79 # ...of these trivial : 0
% 10.29/3.79 # ...subsumed : 1
% 10.29/3.79 # ...remaining for further processing : 83
% 10.29/3.79 # Other redundant clauses eliminated : 3
% 10.29/3.79 # Clauses deleted for lack of memory : 0
% 10.29/3.79 # Backward-subsumed : 0
% 10.29/3.79 # Backward-rewritten : 1
% 10.29/3.79 # Generated clauses : 63
% 10.29/3.79 # ...of the previous two non-trivial : 40
% 10.29/3.79 # Contextual simplify-reflections : 0
% 10.29/3.79 # Paramodulations : 58
% 10.29/3.79 # Factorizations : 2
% 10.29/3.79 # Equation resolutions : 3
% 10.29/3.79 # Propositional unsat checks : 0
% 10.29/3.79 # Propositional unsat check successes : 0
% 10.29/3.79 # Current number of processed clauses : 79
% 10.29/3.79 # Positive orientable unit clauses : 13
% 10.29/3.79 # Positive unorientable unit clauses: 0
% 10.29/3.79 # Negative unit clauses : 16
% 10.29/3.79 # Non-unit-clauses : 50
% 10.29/3.79 # Current number of unprocessed clauses: 34
% 10.29/3.79 # ...number of literals in the above : 80
% 10.29/3.79 # Current number of archived formulas : 0
% 10.29/3.79 # Current number of archived clauses : 1
% 10.29/3.79 # Clause-clause subsumption calls (NU) : 165
% 10.29/3.79 # Rec. Clause-clause subsumption calls : 140
% 10.29/3.79 # Non-unit clause-clause subsumptions : 1
% 10.29/3.79 # Unit Clause-clause subsumption calls : 55
% 10.29/3.79 # Rewrite failures with RHS unbound : 0
% 10.29/3.79 # BW rewrite match attempts : 9
% 10.29/3.79 # BW rewrite match successes : 1
% 10.29/3.79 # Condensation attempts : 0
% 10.29/3.79 # Condensation successes : 0
% 10.29/3.79 # Termbank termtop insertions : 1730
% 10.29/3.79
% 10.29/3.79 # -------------------------------------------------
% 10.29/3.79 # User time : 0.009 s
% 10.29/3.79 # System time : 0.002 s
% 10.29/3.79 # Total time : 0.011 s
% 10.29/3.79 # ...preprocessing : 0.009 s
% 10.29/3.79 # ...main loop : 0.002 s
% 10.29/3.79 # Maximum resident set size: 6400 pages
% 10.29/3.79
%------------------------------------------------------------------------------