%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC090+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:13:33 EDT 2022
% Result : Theorem 9.45s 2.77s
% Output : CNFRefutation 9.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 20
% Syntax : Number of clauses : 69 ( 27 unt; 5 nHn; 69 RR)
% Number of literals : 161 ( 62 equ; 97 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_192,negated_conjecture,
app(esk52_0,esk53_0) = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_192) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_198) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_44) ).
cnf(i_0_195,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_195) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_197) ).
cnf(i_0_191,negated_conjecture,
app(esk53_0,esk52_0) = esk50_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_191) ).
cnf(i_0_156,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_156) ).
cnf(i_0_194,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_194) ).
cnf(i_0_193,negated_conjecture,
ssList(esk53_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_193) ).
cnf(i_0_158,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_158) ).
cnf(i_0_157,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_157) ).
cnf(i_0_149,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_149) ).
cnf(i_0_196,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_196) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_201) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_159) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_200) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_60) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_107) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5uvaovii/input.p',i_0_110) ).
cnf(c_0_222,negated_conjecture,
app(esk52_0,esk53_0) = esk51_0,
i_0_192 ).
cnf(c_0_223,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
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(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_195 ).
cnf(c_0_227,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_228,negated_conjecture,
app(esk53_0,esk52_0) = esk50_0,
i_0_191 ).
cnf(c_0_229,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
i_0_156 ).
cnf(c_0_230,negated_conjecture,
ssList(esk52_0),
i_0_194 ).
cnf(c_0_231,negated_conjecture,
ssList(esk53_0),
i_0_193 ).
cnf(c_0_232,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_158 ).
cnf(c_0_233,negated_conjecture,
app(esk52_0,esk53_0) = esk49_0,
inference(rw,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_234,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_157 ).
cnf(c_0_235,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_224,c_0_225]) ).
cnf(c_0_236,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_237,negated_conjecture,
( ~ segmentP(esk50_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_238,negated_conjecture,
neq(esk49_0,nil),
i_0_196 ).
cnf(c_0_239,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_240,negated_conjecture,
( esk50_0 = nil
| esk52_0 != nil
| esk53_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_230]),c_0_231])]) ).
cnf(c_0_241,negated_conjecture,
( esk53_0 = nil
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_230]),c_0_231])]) ).
cnf(c_0_242,negated_conjecture,
( esk52_0 = nil
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_233]),c_0_231]),c_0_230])]) ).
cnf(c_0_243,negated_conjecture,
( esk52_0 = nil
| neq(esk52_0,nil) ),
inference(spm,[status(thm)],[c_0_235,c_0_230]) ).
cnf(c_0_244,negated_conjecture,
( segmentP(X1,esk52_0)
| app(esk50_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_228]),c_0_231]),c_0_230])]) ).
cnf(c_0_245,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_246,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_247,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_248,negated_conjecture,
( ~ segmentP(esk50_0,esk49_0)
| ~ segmentP(esk49_0,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_239])]) ).
cnf(c_0_249,negated_conjecture,
( esk50_0 = nil
| esk49_0 != nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242]) ).
cnf(c_0_250,negated_conjecture,
( esk52_0 = nil
| ~ segmentP(esk50_0,esk52_0)
| ~ segmentP(esk49_0,esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_243]),c_0_230])]) ).
cnf(c_0_251,plain,
( segmentP(X1,esk52_0)
| esk50_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_225]),c_0_246])]) ).
cnf(c_0_252,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_247]),c_0_225])]) ).
cnf(c_0_253,negated_conjecture,
( esk49_0 != nil
| ~ segmentP(nil,esk49_0)
| ~ segmentP(esk49_0,esk49_0) ),
inference(spm,[status(thm)],[c_0_248,c_0_249]) ).
cnf(c_0_254,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_255,negated_conjecture,
( esk52_0 = nil
| ~ segmentP(esk49_0,esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_251]),c_0_246])]) ).
cnf(c_0_256,negated_conjecture,
( segmentP(X1,esk52_0)
| esk49_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_233]),c_0_231]),c_0_230])]) ).
cnf(c_0_257,plain,
( esk49_0 != nil
| ~ segmentP(nil,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_254]),c_0_239])]) ).
cnf(c_0_258,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_259,negated_conjecture,
( esk49_0 = nil
| esk53_0 != nil
| esk52_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_229]),c_0_231]),c_0_230])]) ).
cnf(c_0_260,negated_conjecture,
esk52_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_255,c_0_256]),c_0_239])]) ).
cnf(c_0_261,plain,
esk49_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_258]),c_0_239])]) ).
cnf(c_0_262,negated_conjecture,
( esk53_0 = nil
| neq(esk53_0,nil) ),
inference(spm,[status(thm)],[c_0_235,c_0_231]) ).
cnf(c_0_263,negated_conjecture,
esk53_0 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_259,c_0_260])]),c_0_261]) ).
cnf(c_0_264,negated_conjecture,
neq(esk53_0,nil),
inference(sr,[status(thm)],[c_0_262,c_0_263]) ).
cnf(c_0_265,negated_conjecture,
( ~ segmentP(esk50_0,esk53_0)
| ~ segmentP(esk49_0,esk53_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_264]),c_0_231])]) ).
cnf(c_0_266,negated_conjecture,
( segmentP(X1,esk53_0)
| esk50_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_228]),c_0_230]),c_0_231])]) ).
cnf(c_0_267,negated_conjecture,
( segmentP(X1,esk53_0)
| app(esk49_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_233]),c_0_230]),c_0_231])]) ).
cnf(c_0_268,negated_conjecture,
~ segmentP(esk49_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_265,c_0_266]),c_0_246])]) ).
cnf(c_0_269,plain,
( segmentP(X1,esk53_0)
| esk49_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_267,c_0_245]),c_0_225]),c_0_239])]) ).
cnf(c_0_270,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_268,c_0_269]),c_0_239])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC090+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 11 22:26:55 EDT 2022
% 0.14/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
% 9.45/2.77 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 9.45/2.77 # Version: 2.1pre011
% 9.45/2.77 # Preprocessing time : 0.023 s
% 9.45/2.77
% 9.45/2.77 # Proof found!
% 9.45/2.77 # SZS status Theorem
% 9.45/2.77 # SZS output start CNFRefutation
% See solution above
% 9.45/2.77 # Proof object total steps : 69
% 9.45/2.77 # Proof object clause steps : 49
% 9.45/2.77 # Proof object formula steps : 20
% 9.45/2.77 # Proof object conjectures : 42
% 9.45/2.77 # Proof object clause conjectures : 32
% 9.45/2.77 # Proof object formula conjectures : 10
% 9.45/2.77 # Proof object initial clauses used : 20
% 9.45/2.77 # Proof object initial formulas used : 20
% 9.45/2.77 # Proof object generating inferences : 25
% 9.45/2.77 # Proof object simplifying inferences : 57
% 9.45/2.77 # Training examples: 0 positive, 0 negative
% 9.45/2.77 # Parsed axioms : 200
% 9.45/2.77 # Removed by relevancy pruning/SinE : 0
% 9.45/2.77 # Initial clauses : 200
% 9.45/2.77 # Removed in clause preprocessing : 0
% 9.45/2.77 # Initial clauses in saturation : 200
% 9.45/2.77 # Processed clauses : 1112
% 9.45/2.77 # ...of these trivial : 17
% 9.45/2.77 # ...subsumed : 432
% 9.45/2.77 # ...remaining for further processing : 663
% 9.45/2.77 # Other redundant clauses eliminated : 46
% 9.45/2.77 # Clauses deleted for lack of memory : 0
% 9.45/2.77 # Backward-subsumed : 14
% 9.45/2.77 # Backward-rewritten : 124
% 9.45/2.77 # Generated clauses : 12908
% 9.45/2.77 # ...of the previous two non-trivial : 12410
% 9.45/2.77 # Contextual simplify-reflections : 289
% 9.45/2.77 # Paramodulations : 12753
% 9.45/2.77 # Factorizations : 56
% 9.45/2.77 # Equation resolutions : 83
% 9.45/2.77 # Propositional unsat checks : 0
% 9.45/2.77 # Propositional unsat check successes : 0
% 9.45/2.77 # Current number of processed clauses : 503
% 9.45/2.77 # Positive orientable unit clauses : 39
% 9.45/2.77 # Positive unorientable unit clauses: 0
% 9.45/2.77 # Negative unit clauses : 8
% 9.45/2.77 # Non-unit-clauses : 456
% 9.45/2.77 # Current number of unprocessed clauses: 8896
% 9.45/2.77 # ...number of literals in the above : 36591
% 9.45/2.77 # Current number of archived formulas : 0
% 9.45/2.77 # Current number of archived clauses : 154
% 9.45/2.77 # Clause-clause subsumption calls (NU) : 68041
% 9.45/2.77 # Rec. Clause-clause subsumption calls : 16050
% 9.45/2.77 # Non-unit clause-clause subsumptions : 459
% 9.45/2.77 # Unit Clause-clause subsumption calls : 1888
% 9.45/2.77 # Rewrite failures with RHS unbound : 0
% 9.45/2.77 # BW rewrite match attempts : 1
% 9.45/2.77 # BW rewrite match successes : 1
% 9.45/2.77 # Condensation attempts : 0
% 9.45/2.77 # Condensation successes : 0
% 9.45/2.77 # Termbank termtop insertions : 203318
% 9.45/2.77
% 9.45/2.77 # -------------------------------------------------
% 9.45/2.77 # User time : 0.197 s
% 9.45/2.77 # System time : 0.013 s
% 9.45/2.77 # Total time : 0.210 s
% 9.45/2.77 # ...preprocessing : 0.023 s
% 9.45/2.77 # ...main loop : 0.188 s
% 9.45/2.77 # Maximum resident set size: 17648 pages
% 9.45/2.77
%------------------------------------------------------------------------------