%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEV606+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 06:51:34 PM UTC 2026
% Result : Theorem 14.19s 5.73s
% Output : CNFRefutation 14.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 11 unt; 0 nHn; 13 RR)
% Number of literals : 21 ( 0 equ; 10 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1235,plain,
( p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,X1),X2))
| ~ cCoq_2eNumbers_2eBinNums_2eZ___24t(X2)
| ~ cCoq_2eNumbers_2eBinNums_2eZ___24t(X1)
| ~ p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,cCoq_2eNumbers_2eBinNums_2eZ0),X2))
| ~ p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,happ(happ(cCoq_2eZArith_2eBinIntDef_2eZ_2emul,X1),X1)),happ(happ(cCoq_2eZArith_2eBinIntDef_2eZ_2emul,X2),X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mgxg30zk/input.p',i_0_1235) ).
cnf(i_0_2482,negated_conjecture,
p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,happ(happ(cCoq_2eZArith_2eBinIntDef_2eZ_2emul,esk171_0),esk171_0)),happ(happ(cCoq_2eZArith_2eBinIntDef_2eZ_2emul,esk170_0),esk170_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mgxg30zk/input.p',i_0_2482) ).
cnf(i_0_2486,negated_conjecture,
cCoq_2eNumbers_2eBinNums_2eZ___24t(esk170_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mgxg30zk/input.p',i_0_2486) ).
cnf(i_0_2485,negated_conjecture,
cCoq_2eNumbers_2eBinNums_2eZ___24t(esk171_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mgxg30zk/input.p',i_0_2485) ).
cnf(i_0_2484,negated_conjecture,
p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,cCoq_2eNumbers_2eBinNums_2eZ0),esk170_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mgxg30zk/input.p',i_0_2484) ).
cnf(i_0_2481,negated_conjecture,
~ p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,esk171_0),esk170_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mgxg30zk/input.p',i_0_2481) ).
cnf(c_0_2493,plain,
( p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,X1),X2))
| ~ cCoq_2eNumbers_2eBinNums_2eZ___24t(X2)
| ~ cCoq_2eNumbers_2eBinNums_2eZ___24t(X1)
| ~ p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,cCoq_2eNumbers_2eBinNums_2eZ0),X2))
| ~ p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,happ(happ(cCoq_2eZArith_2eBinIntDef_2eZ_2emul,X1),X1)),happ(happ(cCoq_2eZArith_2eBinIntDef_2eZ_2emul,X2),X2))) ),
i_0_1235 ).
cnf(c_0_2494,negated_conjecture,
p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,happ(happ(cCoq_2eZArith_2eBinIntDef_2eZ_2emul,esk171_0),esk171_0)),happ(happ(cCoq_2eZArith_2eBinIntDef_2eZ_2emul,esk170_0),esk170_0))),
i_0_2482 ).
cnf(c_0_2495,negated_conjecture,
cCoq_2eNumbers_2eBinNums_2eZ___24t(esk170_0),
i_0_2486 ).
cnf(c_0_2496,negated_conjecture,
cCoq_2eNumbers_2eBinNums_2eZ___24t(esk171_0),
i_0_2485 ).
cnf(c_0_2497,negated_conjecture,
p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,cCoq_2eNumbers_2eBinNums_2eZ0),esk170_0)),
i_0_2484 ).
cnf(c_0_2498,negated_conjecture,
~ p(happ(happ(cCoq_2eZArith_2eBinInt_2eZ_2ele,esk171_0),esk170_0)),
i_0_2481 ).
cnf(c_0_2499,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2493,c_0_2494]),c_0_2495]),c_0_2496]),c_0_2497])]),c_0_2498]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV606+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.16/0.33 % Computer : n009.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 05:19:42 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.29/0.46 # ENIGMATIC: Selected SinE mode:
% 0.37/0.56 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.56 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.37/0.56 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.37/0.56 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 14.19/5.73 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 14.19/5.73 # Version: 2.1pre011
% 14.19/5.73 # Preprocessing time : 0.364 s
% 14.19/5.73
% 14.19/5.73 # Proof found!
% 14.19/5.73 # SZS status Theorem
% 14.19/5.73 # SZS output start CNFRefutation
% See solution above
% 14.19/5.73 # Proof object total steps : 13
% 14.19/5.73 # Proof object clause steps : 7
% 14.19/5.73 # Proof object formula steps : 6
% 14.19/5.73 # Proof object conjectures : 11
% 14.19/5.73 # Proof object clause conjectures : 6
% 14.19/5.73 # Proof object formula conjectures : 5
% 14.19/5.73 # Proof object initial clauses used : 6
% 14.19/5.73 # Proof object initial formulas used : 6
% 14.19/5.73 # Proof object generating inferences : 1
% 14.19/5.73 # Proof object simplifying inferences : 5
% 14.19/5.73 # Training examples: 0 positive, 0 negative
% 14.19/5.73 # Parsed axioms : 6417
% 14.19/5.73 # Removed by relevancy pruning/SinE : 0
% 14.19/5.73 # Initial clauses : 6417
% 14.19/5.73 # Removed in clause preprocessing : 0
% 14.19/5.73 # Initial clauses in saturation : 6417
% 14.19/5.73 # Processed clauses : 121
% 14.19/5.73 # ...of these trivial : 1
% 14.19/5.73 # ...subsumed : 5
% 14.19/5.73 # ...remaining for further processing : 115
% 14.19/5.73 # Other redundant clauses eliminated : 3
% 14.19/5.73 # Clauses deleted for lack of memory : 0
% 14.19/5.73 # Backward-subsumed : 1
% 14.19/5.73 # Backward-rewritten : 0
% 14.19/5.73 # Generated clauses : 55
% 14.19/5.73 # ...of the previous two non-trivial : 31
% 14.19/5.73 # Contextual simplify-reflections : 1
% 14.19/5.73 # Paramodulations : 42
% 14.19/5.73 # Factorizations : 10
% 14.19/5.73 # Equation resolutions : 3
% 14.19/5.73 # Propositional unsat checks : 0
% 14.19/5.73 # Propositional unsat check successes : 0
% 14.19/5.73 # Current number of processed clauses : 113
% 14.19/5.73 # Positive orientable unit clauses : 76
% 14.19/5.73 # Positive unorientable unit clauses: 0
% 14.19/5.73 # Negative unit clauses : 12
% 14.19/5.73 # Non-unit-clauses : 25
% 14.19/5.73 # Current number of unprocessed clauses: 6320
% 14.19/5.73 # ...number of literals in the above : 35598
% 14.19/5.73 # Current number of archived formulas : 0
% 14.19/5.73 # Current number of archived clauses : 1
% 14.19/5.73 # Clause-clause subsumption calls (NU) : 196
% 14.19/5.73 # Rec. Clause-clause subsumption calls : 92
% 14.19/5.73 # Non-unit clause-clause subsumptions : 6
% 14.19/5.73 # Unit Clause-clause subsumption calls : 133
% 14.19/5.73 # Rewrite failures with RHS unbound : 0
% 14.19/5.73 # BW rewrite match attempts : 2
% 14.19/5.73 # BW rewrite match successes : 1
% 14.19/5.73 # Condensation attempts : 0
% 14.19/5.73 # Condensation successes : 0
% 14.19/5.73 # Termbank termtop insertions : 335396
% 14.19/5.73
% 14.19/5.73 # -------------------------------------------------
% 14.19/5.73 # User time : 0.355 s
% 14.19/5.73 # System time : 0.015 s
% 14.19/5.73 # Total time : 0.370 s
% 14.19/5.73 # ...preprocessing : 0.364 s
% 14.19/5.73 # ...main loop : 0.006 s
% 14.19/5.73 # Maximum resident set size: 28548 pages
% 14.19/5.73
%------------------------------------------------------------------------------