%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEV542+1 : TPTP v9.1.0. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 Apr 1 02:00:56 AM UTC 2025
% Result : Theorem 11.24s 3.17s
% Output : CNFRefutation 11.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 17
% Syntax : Number of clauses : 72 ( 18 unt; 30 nHn; 44 RR)
% Number of literals : 146 ( 15 equ; 46 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 130 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_30,plain,
( atleast2p(X1)
| subq(X1,p(X2))
| ~ mem(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_30) ).
cnf(i_0_70,plain,
( mem(X1,p(X2))
| ~ subq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_70) ).
cnf(i_0_65,plain,
~ mem(X1,e),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_65) ).
cnf(i_0_76,plain,
( subq(X1,X2)
| mem(esk17_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_76) ).
cnf(i_0_75,plain,
( subq(X1,X2)
| ~ mem(esk17_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_75) ).
cnf(i_0_79,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_79) ).
cnf(i_0_77,plain,
( mem(X1,X2)
| ~ subq(X3,X2)
| ~ mem(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_77) ).
cnf(i_0_78,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_78) ).
cnf(i_0_68,plain,
( mem(X1,X2)
| ~ mem(X1,m(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_68) ).
cnf(i_0_72,plain,
( mem(X1,s(X2))
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_72) ).
cnf(i_0_34,plain,
( atleast3p(X1)
| subq(X1,X2)
| ~ atleast2p(X2)
| ~ subq(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_34) ).
cnf(i_0_66,plain,
( mem(X1,X2)
| mem(X1,m(X3,X2))
| ~ mem(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_66) ).
cnf(i_0_74,plain,
( X1 = X2
| ~ subq(X2,X1)
| ~ subq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_74) ).
cnf(i_0_33,negated_conjecture,
~ atleast3p(u(p(s(s(u(e,s(e))))),s(u(s(u(e,s(e))),s(s(u(e,s(e)))))))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_33) ).
cnf(i_0_71,plain,
( subq(X1,X2)
| ~ mem(X1,p(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_71) ).
cnf(i_0_73,plain,
( X1 = X2
| ~ mem(X1,s(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_73) ).
cnf(i_0_80,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ mem(X1,u(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p0mk03db/input.p',i_0_80) ).
cnf(c_0_98,plain,
( atleast2p(X1)
| subq(X1,p(X2))
| ~ mem(X2,X1) ),
i_0_30 ).
cnf(c_0_99,plain,
( mem(X1,p(X2))
| ~ subq(X1,X2) ),
i_0_70 ).
cnf(c_0_100,plain,
~ mem(X1,e),
i_0_65 ).
cnf(c_0_101,plain,
( subq(X1,X2)
| mem(esk17_2(X1,X2),X1) ),
i_0_76 ).
cnf(c_0_102,plain,
( subq(p(X1),p(X2))
| atleast2p(p(X1))
| ~ subq(X2,X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_103,plain,
subq(e,X1),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_104,plain,
( subq(X1,X2)
| ~ mem(esk17_2(X1,X2),X2) ),
i_0_75 ).
cnf(c_0_105,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X2) ),
i_0_79 ).
cnf(c_0_106,plain,
( mem(X1,X2)
| ~ subq(X3,X2)
| ~ mem(X1,X3) ),
i_0_77 ).
cnf(c_0_107,plain,
( subq(p(X1),p(e))
| atleast2p(p(X1)) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_108,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X3) ),
i_0_78 ).
cnf(c_0_109,plain,
( mem(X1,X2)
| ~ mem(X1,m(X2,X3)) ),
i_0_68 ).
cnf(c_0_110,plain,
( subq(X1,u(X2,X3))
| ~ mem(esk17_2(X1,u(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_111,plain,
( atleast2p(p(X1))
| mem(X2,p(e))
| ~ mem(X2,p(X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_112,plain,
( subq(X1,u(X2,X3))
| ~ mem(esk17_2(X1,u(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_104,c_0_108]) ).
cnf(c_0_113,plain,
( subq(m(X1,X2),X3)
| mem(esk17_2(m(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_109,c_0_101]) ).
cnf(c_0_114,plain,
( mem(X1,s(X2))
| X1 != X2 ),
i_0_72 ).
cnf(c_0_115,plain,
( atleast3p(X1)
| subq(X1,X2)
| ~ atleast2p(X2)
| ~ subq(X2,X1) ),
i_0_34 ).
cnf(c_0_116,plain,
subq(X1,u(X1,X2)),
inference(spm,[status(thm)],[c_0_110,c_0_101]) ).
cnf(c_0_117,plain,
( atleast2p(p(X1))
| mem(X2,p(e))
| ~ subq(X2,X1) ),
inference(spm,[status(thm)],[c_0_111,c_0_99]) ).
cnf(c_0_118,plain,
subq(X1,X1),
inference(spm,[status(thm)],[c_0_104,c_0_101]) ).
cnf(c_0_119,plain,
subq(m(X1,X2),u(X3,X1)),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_120,plain,
( mem(X1,X2)
| mem(X1,m(X3,X2))
| ~ mem(X1,X3) ),
i_0_66 ).
cnf(c_0_121,plain,
mem(X1,s(X1)),
inference(er,[status(thm)],[c_0_114]) ).
cnf(c_0_122,plain,
( subq(u(X1,X2),X1)
| atleast3p(u(X1,X2))
| ~ atleast2p(X1) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_123,plain,
( atleast2p(p(X1))
| mem(X1,p(e)) ),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_124,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,m(X3,X4)) ),
inference(spm,[status(thm)],[c_0_106,c_0_119]) ).
cnf(c_0_125,plain,
( mem(X1,m(s(X1),X2))
| mem(X1,X2) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_126,plain,
( X1 = X2
| ~ subq(X2,X1)
| ~ subq(X1,X2) ),
i_0_74 ).
cnf(c_0_127,plain,
( subq(u(p(X1),X2),p(X1))
| atleast3p(u(p(X1),X2))
| mem(X1,p(e)) ),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_128,plain,
( mem(X1,u(X2,s(X1)))
| mem(X1,X3) ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_129,negated_conjecture,
~ atleast3p(u(p(s(s(u(e,s(e))))),s(u(s(u(e,s(e))),s(s(u(e,s(e)))))))),
i_0_33 ).
cnf(c_0_130,plain,
( u(p(X1),X2) = p(X1)
| atleast3p(u(p(X1),X2))
| mem(X1,p(e)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_116])]) ).
cnf(c_0_131,plain,
subq(m(X1,X2),u(X1,X3)),
inference(spm,[status(thm)],[c_0_110,c_0_113]) ).
cnf(c_0_132,plain,
mem(X1,u(X2,s(X1))),
inference(ef,[status(thm)],[c_0_128]) ).
cnf(c_0_133,negated_conjecture,
( u(p(s(s(u(e,s(e))))),s(u(s(u(e,s(e))),s(s(u(e,s(e))))))) = p(s(s(u(e,s(e)))))
| mem(s(s(u(e,s(e)))),p(e)) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_134,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,m(X2,X4)) ),
inference(spm,[status(thm)],[c_0_106,c_0_131]) ).
cnf(c_0_135,plain,
( subq(X1,X2)
| ~ mem(X1,p(X2)) ),
i_0_71 ).
cnf(c_0_136,negated_conjecture,
( mem(u(s(u(e,s(e))),s(s(u(e,s(e))))),p(s(s(u(e,s(e))))))
| mem(s(s(u(e,s(e)))),p(e)) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_137,plain,
( mem(X1,u(s(X1),X2))
| mem(X1,X3) ),
inference(spm,[status(thm)],[c_0_134,c_0_125]) ).
cnf(c_0_138,plain,
( subq(u(s(u(e,s(e))),s(s(u(e,s(e))))),s(s(u(e,s(e)))))
| mem(s(s(u(e,s(e)))),p(e)) ),
inference(spm,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_139,plain,
subq(X1,u(X2,X1)),
inference(spm,[status(thm)],[c_0_112,c_0_101]) ).
cnf(c_0_140,plain,
mem(X1,u(s(X1),X2)),
inference(ef,[status(thm)],[c_0_137]) ).
cnf(c_0_141,plain,
( u(s(u(e,s(e))),s(s(u(e,s(e))))) = s(s(u(e,s(e))))
| mem(s(s(u(e,s(e)))),p(e)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_138]),c_0_139])]) ).
cnf(c_0_142,plain,
( X1 = X2
| ~ mem(X1,s(X2)) ),
i_0_73 ).
cnf(c_0_143,plain,
( mem(u(e,s(e)),s(s(u(e,s(e)))))
| mem(s(s(u(e,s(e)))),p(e)) ),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_144,plain,
( s(u(e,s(e))) = u(e,s(e))
| mem(s(s(u(e,s(e)))),p(e)) ),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_145,plain,
( s(u(e,s(e))) = u(e,s(e))
| subq(s(s(u(e,s(e)))),e) ),
inference(spm,[status(thm)],[c_0_135,c_0_144]) ).
cnf(c_0_146,plain,
( s(u(e,s(e))) = u(e,s(e))
| s(s(u(e,s(e)))) = e ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_145]),c_0_103])]) ).
cnf(c_0_147,plain,
s(u(e,s(e))) = u(e,s(e)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_146]),c_0_100]) ).
cnf(c_0_148,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ mem(X1,u(X3,X2)) ),
i_0_80 ).
cnf(c_0_149,plain,
mem(u(e,s(e)),u(e,s(e))),
inference(spm,[status(thm)],[c_0_121,c_0_147]) ).
cnf(c_0_150,plain,
mem(u(e,s(e)),s(e)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_100]) ).
cnf(c_0_151,plain,
u(e,s(e)) = e,
inference(spm,[status(thm)],[c_0_142,c_0_150]) ).
cnf(c_0_152,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_151]),c_0_151]),c_0_100]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV542+1 : TPTP v9.1.0. Released v9.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Mar 31 11:27:22 EDT 2025
% 0.12/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.24/3.17 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 11.24/3.17 # Version: 2.1pre011
% 11.24/3.17 # Preprocessing time : 0.038 s
% 11.24/3.17
% 11.24/3.17 # Proof found!
% 11.24/3.17 # SZS status Theorem
% 11.24/3.17 # SZS output start CNFRefutation
% See solution above
% 11.24/3.17 # Proof object total steps : 72
% 11.24/3.17 # Proof object clause steps : 55
% 11.24/3.17 # Proof object formula steps : 17
% 11.24/3.17 # Proof object conjectures : 4
% 11.24/3.17 # Proof object clause conjectures : 3
% 11.24/3.17 # Proof object formula conjectures : 1
% 11.24/3.17 # Proof object initial clauses used : 17
% 11.24/3.17 # Proof object initial formulas used : 17
% 11.24/3.17 # Proof object generating inferences : 36
% 11.24/3.17 # Proof object simplifying inferences : 12
% 11.24/3.17 # Training examples: 0 positive, 0 negative
% 11.24/3.17 # Parsed axioms : 78
% 11.24/3.17 # Removed by relevancy pruning/SinE : 0
% 11.24/3.17 # Initial clauses : 78
% 11.24/3.17 # Removed in clause preprocessing : 0
% 11.24/3.17 # Initial clauses in saturation : 78
% 11.24/3.17 # Processed clauses : 1857
% 11.24/3.17 # ...of these trivial : 0
% 11.24/3.17 # ...subsumed : 619
% 11.24/3.17 # ...remaining for further processing : 1238
% 11.24/3.17 # Other redundant clauses eliminated : 1
% 11.24/3.17 # Clauses deleted for lack of memory : 0
% 11.24/3.17 # Backward-subsumed : 53
% 11.24/3.17 # Backward-rewritten : 149
% 11.24/3.17 # Generated clauses : 12759
% 11.24/3.17 # ...of the previous two non-trivial : 11542
% 11.24/3.17 # Contextual simplify-reflections : 398
% 11.24/3.17 # Paramodulations : 12722
% 11.24/3.17 # Factorizations : 36
% 11.24/3.17 # Equation resolutions : 1
% 11.24/3.17 # Propositional unsat checks : 0
% 11.24/3.17 # Propositional unsat check successes : 0
% 11.24/3.17 # Current number of processed clauses : 1035
% 11.24/3.17 # Positive orientable unit clauses : 33
% 11.24/3.17 # Positive unorientable unit clauses: 0
% 11.24/3.17 # Negative unit clauses : 52
% 11.24/3.17 # Non-unit-clauses : 950
% 11.24/3.17 # Current number of unprocessed clauses: 7614
% 11.24/3.17 # ...number of literals in the above : 26626
% 11.24/3.17 # Current number of archived formulas : 0
% 11.24/3.17 # Current number of archived clauses : 202
% 11.24/3.17 # Clause-clause subsumption calls (NU) : 160858
% 11.24/3.17 # Rec. Clause-clause subsumption calls : 87329
% 11.24/3.17 # Non-unit clause-clause subsumptions : 770
% 11.24/3.17 # Unit Clause-clause subsumption calls : 5728
% 11.24/3.17 # Rewrite failures with RHS unbound : 0
% 11.24/3.17 # BW rewrite match attempts : 256
% 11.24/3.17 # BW rewrite match successes : 22
% 11.24/3.17 # Condensation attempts : 0
% 11.24/3.17 # Condensation successes : 0
% 11.24/3.17 # Termbank termtop insertions : 227371
% 11.24/3.17
% 11.24/3.17 # -------------------------------------------------
% 11.24/3.17 # User time : 0.296 s
% 11.24/3.17 # System time : 0.008 s
% 11.24/3.17 # Total time : 0.304 s
% 11.24/3.17 # ...preprocessing : 0.038 s
% 11.24/3.17 # ...main loop : 0.266 s
% 11.24/3.17 # Maximum resident set size: 16596 pages
% 11.24/3.17
%------------------------------------------------------------------------------