%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC218+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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 : 600s
% DateTime : Tue Jul 19 20:14:21 EDT 2022
% Result : Theorem 7.99s 2.54s
% Output : CNFRefutation 7.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 19
% Syntax : Number of clauses : 56 ( 33 unt; 2 nHn; 56 RR)
% Number of literals : 97 ( 39 equ; 44 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
~ neq(esk48_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_191) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_197) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_44) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_200) ).
cnf(i_0_192,negated_conjecture,
app(app(esk52_0,cons(esk54_0,nil)),esk53_0) = esk50_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_192) ).
cnf(i_0_158,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_158) ).
cnf(i_0_195,negated_conjecture,
ssList(esk53_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_195) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_58) ).
cnf(i_0_196,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_196) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_43) ).
cnf(i_0_193,negated_conjecture,
ssItem(esk54_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_193) ).
cnf(i_0_194,negated_conjecture,
app(esk52_0,esk53_0) = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_194) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_159) ).
cnf(i_0_157,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_157) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_201) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_198) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_60) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34jxv3up/input.p',i_0_53) ).
cnf(c_0_221,negated_conjecture,
~ neq(esk48_0,nil),
i_0_191 ).
cnf(c_0_222,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_223,negated_conjecture,
~ neq(esk50_0,nil),
inference(rw,[status(thm)],[c_0_221,c_0_222]) ).
cnf(c_0_224,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_225,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_226,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_227,negated_conjecture,
app(app(esk52_0,cons(esk54_0,nil)),esk53_0) = esk50_0,
i_0_192 ).
cnf(c_0_228,plain,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_225]),c_0_226])]) ).
cnf(c_0_229,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_158 ).
cnf(c_0_230,negated_conjecture,
app(app(esk52_0,cons(esk54_0,nil)),esk53_0) = nil,
inference(rw,[status(thm)],[c_0_227,c_0_228]) ).
cnf(c_0_231,negated_conjecture,
ssList(esk53_0),
i_0_195 ).
cnf(c_0_232,plain,
( esk53_0 = nil
| ~ ssList(app(esk52_0,cons(esk54_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231])]) ).
cnf(c_0_233,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_234,negated_conjecture,
ssList(esk52_0),
i_0_196 ).
cnf(c_0_235,plain,
( esk53_0 = nil
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_234])]) ).
cnf(c_0_236,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_237,negated_conjecture,
ssItem(esk54_0),
i_0_193 ).
cnf(c_0_238,negated_conjecture,
app(esk52_0,esk53_0) = esk51_0,
i_0_194 ).
cnf(c_0_239,plain,
esk53_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_237]),c_0_225])]) ).
cnf(c_0_240,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_241,negated_conjecture,
app(esk52_0,nil) = esk51_0,
inference(rw,[status(thm)],[c_0_238,c_0_239]) ).
cnf(c_0_242,plain,
esk52_0 = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_234])]) ).
cnf(c_0_243,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_157 ).
cnf(c_0_244,negated_conjecture,
app(app(esk51_0,cons(esk54_0,nil)),nil) = nil,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_239]),c_0_242]) ).
cnf(c_0_245,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_246,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_247,plain,
( app(esk51_0,cons(esk54_0,nil)) = nil
| ~ ssList(app(esk51_0,cons(esk54_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_225])]) ).
cnf(c_0_248,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_245,c_0_246]) ).
cnf(c_0_249,plain,
( app(esk51_0,cons(esk54_0,nil)) = nil
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_233]),c_0_248])]) ).
cnf(c_0_250,plain,
( esk51_0 = nil
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_249]),c_0_248])]) ).
cnf(c_0_251,plain,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_236]),c_0_237]),c_0_225])]) ).
cnf(c_0_252,plain,
( app(nil,cons(esk54_0,nil)) = nil
| ~ ssList(app(nil,cons(esk54_0,nil))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_247,c_0_251]),c_0_251]) ).
cnf(c_0_253,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_254,plain,
( cons(esk54_0,nil) = nil
| ~ ssList(cons(esk54_0,nil)) ),
inference(spm,[status(thm)],[c_0_252,c_0_253]) ).
cnf(c_0_255,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_256,plain,
cons(esk54_0,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_254,c_0_236]),c_0_237]),c_0_225])]) ).
cnf(c_0_257,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_255,c_0_256]),c_0_237]),c_0_225])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC218+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jun 12 20:34:22 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.99/2.54 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.99/2.54 # Version: 2.1pre011
% 7.99/2.54 # Preprocessing time : 0.014 s
% 7.99/2.54
% 7.99/2.54 # Proof found!
% 7.99/2.54 # SZS status Theorem
% 7.99/2.54 # SZS output start CNFRefutation
% See solution above
% 7.99/2.54 # Proof object total steps : 56
% 7.99/2.54 # Proof object clause steps : 37
% 7.99/2.54 # Proof object formula steps : 19
% 7.99/2.54 # Proof object conjectures : 25
% 7.99/2.54 # Proof object clause conjectures : 15
% 7.99/2.54 # Proof object formula conjectures : 10
% 7.99/2.54 # Proof object initial clauses used : 19
% 7.99/2.54 # Proof object initial formulas used : 19
% 7.99/2.54 # Proof object generating inferences : 12
% 7.99/2.54 # Proof object simplifying inferences : 35
% 7.99/2.54 # Training examples: 0 positive, 0 negative
% 7.99/2.54 # Parsed axioms : 200
% 7.99/2.54 # Removed by relevancy pruning/SinE : 0
% 7.99/2.54 # Initial clauses : 200
% 7.99/2.54 # Removed in clause preprocessing : 0
% 7.99/2.54 # Initial clauses in saturation : 200
% 7.99/2.54 # Processed clauses : 296
% 7.99/2.54 # ...of these trivial : 7
% 7.99/2.54 # ...subsumed : 28
% 7.99/2.54 # ...remaining for further processing : 261
% 7.99/2.54 # Other redundant clauses eliminated : 86
% 7.99/2.54 # Clauses deleted for lack of memory : 0
% 7.99/2.54 # Backward-subsumed : 5
% 7.99/2.54 # Backward-rewritten : 38
% 7.99/2.54 # Generated clauses : 1385
% 7.99/2.54 # ...of the previous two non-trivial : 1104
% 7.99/2.54 # Contextual simplify-reflections : 21
% 7.99/2.54 # Paramodulations : 1280
% 7.99/2.54 # Factorizations : 0
% 7.99/2.54 # Equation resolutions : 105
% 7.99/2.54 # Propositional unsat checks : 0
% 7.99/2.54 # Propositional unsat check successes : 0
% 7.99/2.54 # Current number of processed clauses : 212
% 7.99/2.54 # Positive orientable unit clauses : 19
% 7.99/2.54 # Positive unorientable unit clauses: 0
% 7.99/2.54 # Negative unit clauses : 3
% 7.99/2.54 # Non-unit-clauses : 190
% 7.99/2.54 # Current number of unprocessed clauses: 738
% 7.99/2.54 # ...number of literals in the above : 5543
% 7.99/2.54 # Current number of archived formulas : 0
% 7.99/2.54 # Current number of archived clauses : 43
% 7.99/2.54 # Clause-clause subsumption calls (NU) : 6928
% 7.99/2.54 # Rec. Clause-clause subsumption calls : 1907
% 7.99/2.54 # Non-unit clause-clause subsumptions : 50
% 7.99/2.54 # Unit Clause-clause subsumption calls : 354
% 7.99/2.54 # Rewrite failures with RHS unbound : 0
% 7.99/2.54 # BW rewrite match attempts : 7
% 7.99/2.54 # BW rewrite match successes : 7
% 7.99/2.54 # Condensation attempts : 0
% 7.99/2.54 # Condensation successes : 0
% 7.99/2.54 # Termbank termtop insertions : 30724
% 7.99/2.54
% 7.99/2.54 # -------------------------------------------------
% 7.99/2.54 # User time : 0.035 s
% 7.99/2.54 # System time : 0.005 s
% 7.99/2.54 # Total time : 0.040 s
% 7.99/2.54 # ...preprocessing : 0.014 s
% 7.99/2.54 # ...main loop : 0.026 s
% 7.99/2.54 # Maximum resident set size: 7124 pages
% 7.99/2.54
%------------------------------------------------------------------------------