%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEV570+1 : TPTP v9.1.0. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:58 AM UTC 2025
% Result : Theorem 10.01s 2.52s
% Output : CNFRefutation 10.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 10
% Syntax : Number of clauses : 55 ( 15 unt; 22 nHn; 39 RR)
% Number of literals : 112 ( 21 equ; 28 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 82 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_75,plain,
( subq(X1,X2)
| ~ mem(esk17_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-egtl14u4/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-egtl14u4/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-egtl14u4/input.p',i_0_77) ).
cnf(i_0_76,plain,
( subq(X1,X2)
| mem(esk17_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-egtl14u4/input.p',i_0_76) ).
cnf(i_0_72,plain,
( mem(X1,s(X2))
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-egtl14u4/input.p',i_0_72) ).
cnf(i_0_69,negated_conjecture,
subq(u(u(s(u(s(u(e,s(e))),s(s(u(e,s(e)))))),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e)))))))),u(s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e))))))))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-egtl14u4/input.p',i_0_69) ).
cnf(i_0_78,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-egtl14u4/input.p',i_0_78) ).
cnf(i_0_80,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ mem(X1,u(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-egtl14u4/input.p',i_0_80) ).
cnf(i_0_73,plain,
( X1 = X2
| ~ mem(X1,s(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-egtl14u4/input.p',i_0_73) ).
cnf(i_0_64,plain,
~ mem(X1,e),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-egtl14u4/input.p',i_0_64) ).
cnf(c_0_91,plain,
( subq(X1,X2)
| ~ mem(esk17_2(X1,X2),X2) ),
i_0_75 ).
cnf(c_0_92,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X2) ),
i_0_79 ).
cnf(c_0_93,plain,
( mem(X1,X2)
| ~ subq(X3,X2)
| ~ mem(X1,X3) ),
i_0_77 ).
cnf(c_0_94,plain,
( subq(X1,X2)
| mem(esk17_2(X1,X2),X1) ),
i_0_76 ).
cnf(c_0_95,plain,
( subq(X1,u(X2,X3))
| ~ mem(esk17_2(X1,u(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_96,plain,
( mem(X1,s(X2))
| X1 != X2 ),
i_0_72 ).
cnf(c_0_97,plain,
( mem(esk17_2(X1,X2),X3)
| subq(X1,X2)
| ~ subq(X1,X3) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_98,plain,
subq(X1,u(X1,X2)),
inference(spm,[status(thm)],[c_0_95,c_0_94]) ).
cnf(c_0_99,plain,
mem(X1,s(X1)),
inference(er,[status(thm)],[c_0_96]) ).
cnf(c_0_100,plain,
( mem(esk17_2(X1,X2),u(X1,X3))
| subq(X1,X2) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_101,plain,
( mem(X1,X2)
| ~ subq(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_93,c_0_99]) ).
cnf(c_0_102,plain,
( mem(esk17_2(X1,X2),X3)
| subq(X1,X2)
| ~ subq(u(X1,X4),X3) ),
inference(spm,[status(thm)],[c_0_93,c_0_100]) ).
cnf(c_0_103,negated_conjecture,
subq(u(u(s(u(s(u(e,s(e))),s(s(u(e,s(e)))))),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e)))))))),u(s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e))))))))),
i_0_69 ).
cnf(c_0_104,plain,
( mem(X1,X2)
| ~ subq(s(X1),X3)
| ~ subq(X3,X2) ),
inference(spm,[status(thm)],[c_0_93,c_0_101]) ).
cnf(c_0_105,negated_conjecture,
( mem(esk17_2(u(s(u(s(u(e,s(e))),s(s(u(e,s(e)))))),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))))),X1),u(s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e)))))))))
| subq(u(s(u(s(u(e,s(e))),s(s(u(e,s(e)))))),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))))),X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X3) ),
i_0_78 ).
cnf(c_0_107,plain,
( mem(X1,X2)
| ~ subq(u(s(X1),X3),X2) ),
inference(spm,[status(thm)],[c_0_104,c_0_98]) ).
cnf(c_0_108,plain,
subq(u(s(u(s(u(e,s(e))),s(s(u(e,s(e)))))),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))))),u(s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e))))))))),
inference(spm,[status(thm)],[c_0_91,c_0_105]) ).
cnf(c_0_109,plain,
( subq(X1,u(X2,X3))
| ~ mem(esk17_2(X1,u(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_91,c_0_106]) ).
cnf(c_0_110,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ mem(X1,u(X3,X2)) ),
i_0_80 ).
cnf(c_0_111,plain,
mem(u(s(u(e,s(e))),s(s(u(e,s(e))))),u(s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e))))))))),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_112,plain,
subq(X1,u(X2,X1)),
inference(spm,[status(thm)],[c_0_109,c_0_94]) ).
cnf(c_0_113,plain,
( X1 = X2
| ~ mem(X1,s(X2)) ),
i_0_73 ).
cnf(c_0_114,plain,
( mem(u(s(u(e,s(e))),s(s(u(e,s(e))))),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))))
| mem(u(s(u(e,s(e))),s(s(u(e,s(e))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e)))))))) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_115,plain,
( mem(X1,X2)
| ~ subq(u(X3,s(X1)),X2) ),
inference(spm,[status(thm)],[c_0_104,c_0_112]) ).
cnf(c_0_116,plain,
subq(X1,X1),
inference(spm,[status(thm)],[c_0_91,c_0_94]) ).
cnf(c_0_117,plain,
( u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e)))))) = u(s(u(e,s(e))),s(s(u(e,s(e)))))
| mem(u(s(u(e,s(e))),s(s(u(e,s(e))))),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))))) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_118,plain,
mem(X1,u(X2,s(X1))),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_119,plain,
( u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e)))))) = u(s(u(e,s(e))),s(s(u(e,s(e)))))
| u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))) = u(s(u(e,s(e))),s(s(u(e,s(e))))) ),
inference(spm,[status(thm)],[c_0_113,c_0_117]) ).
cnf(c_0_120,plain,
( u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))) = u(s(u(e,s(e))),s(s(u(e,s(e)))))
| mem(u(u(e,s(e)),s(u(e,s(e)))),u(s(u(e,s(e))),s(s(u(e,s(e)))))) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_121,plain,
( u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))) = u(s(u(e,s(e))),s(s(u(e,s(e)))))
| mem(u(u(e,s(e)),s(u(e,s(e)))),s(s(u(e,s(e)))))
| mem(u(u(e,s(e)),s(u(e,s(e)))),s(u(e,s(e)))) ),
inference(spm,[status(thm)],[c_0_110,c_0_120]) ).
cnf(c_0_122,plain,
mem(X1,u(u(X2,s(X1)),X3)),
inference(spm,[status(thm)],[c_0_115,c_0_98]) ).
cnf(c_0_123,plain,
( u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))) = u(s(u(e,s(e))),s(s(u(e,s(e)))))
| u(u(e,s(e)),s(u(e,s(e)))) = s(u(e,s(e)))
| mem(u(u(e,s(e)),s(u(e,s(e)))),s(u(e,s(e)))) ),
inference(spm,[status(thm)],[c_0_113,c_0_121]) ).
cnf(c_0_124,plain,
( u(u(e,s(e)),s(u(e,s(e)))) = s(u(e,s(e)))
| mem(u(u(e,s(e)),s(u(e,s(e)))),s(u(e,s(e))))
| mem(e,u(s(u(e,s(e))),s(s(u(e,s(e)))))) ),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_125,plain,
( u(u(e,s(e)),s(u(e,s(e)))) = s(u(e,s(e)))
| u(u(e,s(e)),s(u(e,s(e)))) = u(e,s(e))
| mem(e,u(s(u(e,s(e))),s(s(u(e,s(e)))))) ),
inference(spm,[status(thm)],[c_0_113,c_0_124]) ).
cnf(c_0_126,plain,
( u(u(e,s(e)),s(u(e,s(e)))) = s(u(e,s(e)))
| u(u(e,s(e)),s(u(e,s(e)))) = u(e,s(e))
| mem(e,s(s(u(e,s(e)))))
| mem(e,s(u(e,s(e)))) ),
inference(spm,[status(thm)],[c_0_110,c_0_125]) ).
cnf(c_0_127,plain,
( u(u(e,s(e)),s(u(e,s(e)))) = u(e,s(e))
| mem(e,s(s(u(e,s(e)))))
| mem(e,s(u(e,s(e)))) ),
inference(spm,[status(thm)],[c_0_122,c_0_126]) ).
cnf(c_0_128,plain,
( mem(u(e,s(e)),u(e,s(e)))
| mem(e,s(s(u(e,s(e)))))
| mem(e,s(u(e,s(e)))) ),
inference(spm,[status(thm)],[c_0_118,c_0_127]) ).
cnf(c_0_129,plain,
~ mem(X1,e),
i_0_64 ).
cnf(c_0_130,plain,
( mem(e,s(s(u(e,s(e)))))
| mem(e,s(u(e,s(e))))
| mem(u(e,s(e)),s(e)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_128]),c_0_129]) ).
cnf(c_0_131,plain,
( s(u(e,s(e))) = e
| mem(u(e,s(e)),s(e))
| mem(e,s(u(e,s(e)))) ),
inference(spm,[status(thm)],[c_0_113,c_0_130]) ).
cnf(c_0_132,plain,
( s(u(e,s(e))) = e
| u(e,s(e)) = e ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_131]),c_0_113]) ).
cnf(c_0_133,plain,
u(e,s(e)) = e,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_132]),c_0_129]) ).
cnf(c_0_134,plain,
~ subq(s(X1),e),
inference(spm,[status(thm)],[c_0_129,c_0_101]) ).
cnf(c_0_135,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_133]),c_0_134]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV570+1 : TPTP v9.1.0. Released v9.1.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 12:43:34 EDT 2025
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.01/2.52 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 10.01/2.52 # Version: 2.1pre011
% 10.01/2.52 # Preprocessing time : 0.101 s
% 10.01/2.52
% 10.01/2.52 # Proof found!
% 10.01/2.52 # SZS status Theorem
% 10.01/2.52 # SZS output start CNFRefutation
% See solution above
% 10.01/2.52 # Proof object total steps : 55
% 10.01/2.52 # Proof object clause steps : 45
% 10.01/2.52 # Proof object formula steps : 10
% 10.01/2.52 # Proof object conjectures : 3
% 10.01/2.52 # Proof object clause conjectures : 2
% 10.01/2.52 # Proof object formula conjectures : 1
% 10.01/2.52 # Proof object initial clauses used : 10
% 10.01/2.52 # Proof object initial formulas used : 10
% 10.01/2.52 # Proof object generating inferences : 34
% 10.01/2.52 # Proof object simplifying inferences : 5
% 10.01/2.52 # Training examples: 0 positive, 0 negative
% 10.01/2.52 # Parsed axioms : 78
% 10.01/2.52 # Removed by relevancy pruning/SinE : 0
% 10.01/2.52 # Initial clauses : 78
% 10.01/2.52 # Removed in clause preprocessing : 0
% 10.01/2.52 # Initial clauses in saturation : 78
% 10.01/2.52 # Processed clauses : 1837
% 10.01/2.52 # ...of these trivial : 6
% 10.01/2.52 # ...subsumed : 587
% 10.01/2.52 # ...remaining for further processing : 1244
% 10.01/2.52 # Other redundant clauses eliminated : 1
% 10.01/2.52 # Clauses deleted for lack of memory : 0
% 10.01/2.52 # Backward-subsumed : 23
% 10.01/2.52 # Backward-rewritten : 122
% 10.01/2.52 # Generated clauses : 11861
% 10.01/2.52 # ...of the previous two non-trivial : 11163
% 10.01/2.52 # Contextual simplify-reflections : 300
% 10.01/2.52 # Paramodulations : 11841
% 10.01/2.52 # Factorizations : 17
% 10.01/2.52 # Equation resolutions : 1
% 10.01/2.52 # Propositional unsat checks : 0
% 10.01/2.52 # Propositional unsat check successes : 0
% 10.01/2.52 # Current number of processed clauses : 1096
% 10.01/2.52 # Positive orientable unit clauses : 69
% 10.01/2.52 # Positive unorientable unit clauses: 0
% 10.01/2.52 # Negative unit clauses : 34
% 10.01/2.52 # Non-unit-clauses : 993
% 10.01/2.52 # Current number of unprocessed clauses: 6297
% 10.01/2.52 # ...number of literals in the above : 16974
% 10.01/2.52 # Current number of archived formulas : 0
% 10.01/2.52 # Current number of archived clauses : 147
% 10.01/2.52 # Clause-clause subsumption calls (NU) : 89873
% 10.01/2.52 # Rec. Clause-clause subsumption calls : 54293
% 10.01/2.52 # Non-unit clause-clause subsumptions : 598
% 10.01/2.52 # Unit Clause-clause subsumption calls : 7763
% 10.01/2.52 # Rewrite failures with RHS unbound : 0
% 10.01/2.52 # BW rewrite match attempts : 471
% 10.01/2.52 # BW rewrite match successes : 10
% 10.01/2.52 # Condensation attempts : 0
% 10.01/2.52 # Condensation successes : 0
% 10.01/2.52 # Termbank termtop insertions : 282338
% 10.01/2.52
% 10.01/2.52 # -------------------------------------------------
% 10.01/2.52 # User time : 0.307 s
% 10.01/2.52 # System time : 0.015 s
% 10.01/2.52 # Total time : 0.322 s
% 10.01/2.52 # ...preprocessing : 0.101 s
% 10.01/2.52 # ...main loop : 0.221 s
% 10.01/2.52 # Maximum resident set size: 17736 pages
% 10.01/2.52
%------------------------------------------------------------------------------