TSTP Solution File: SWC075+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC075+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:27 EDT 2022
% Result : Theorem 7.49s 2.33s
% Output : CNFRefutation 7.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of clauses : 57 ( 25 unt; 2 nHn; 57 RR)
% Number of literals : 134 ( 59 equ; 81 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 : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_44) ).
cnf(i_0_192,negated_conjecture,
app(esk53_0,esk52_0) = esk50_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_192) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_197) ).
cnf(i_0_193,negated_conjecture,
app(esk52_0,esk53_0) = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_193) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_198) ).
cnf(i_0_196,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_196) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_41) ).
cnf(i_0_195,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_195) ).
cnf(i_0_194,negated_conjecture,
ssList(esk53_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_194) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_200) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_159) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_201) ).
cnf(i_0_156,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_156) ).
cnf(i_0_158,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_158) ).
cnf(i_0_157,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_157) ).
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5st3dnc/input.p',i_0_191) ).
cnf(c_0_220,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_221,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_222,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_223,negated_conjecture,
app(esk53_0,esk52_0) = esk50_0,
i_0_192 ).
cnf(c_0_224,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_225,negated_conjecture,
app(esk52_0,esk53_0) = esk51_0,
i_0_193 ).
cnf(c_0_226,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_227,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_196 ).
cnf(c_0_228,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_229,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_220,c_0_221]),c_0_222])]) ).
cnf(c_0_230,negated_conjecture,
app(esk53_0,esk52_0) = esk48_0,
inference(rw,[status(thm)],[c_0_223,c_0_224]) ).
cnf(c_0_231,negated_conjecture,
ssList(esk52_0),
i_0_195 ).
cnf(c_0_232,negated_conjecture,
ssList(esk53_0),
i_0_194 ).
cnf(c_0_233,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_234,negated_conjecture,
app(esk52_0,esk53_0) = esk49_0,
inference(rw,[status(thm)],[c_0_225,c_0_226]) ).
cnf(c_0_235,negated_conjecture,
( X1 = nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_222])]) ).
cnf(c_0_236,negated_conjecture,
( segmentP(X1,esk53_0)
| esk48_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231]),c_0_232])]) ).
cnf(c_0_237,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_233,c_0_224]) ).
cnf(c_0_238,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_220,c_0_234]),c_0_231]),c_0_232])]) ).
cnf(c_0_239,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_240,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_241,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
i_0_156 ).
cnf(c_0_242,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_158 ).
cnf(c_0_243,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_157 ).
cnf(c_0_244,negated_conjecture,
( segmentP(X1,esk52_0)
| app(esk48_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_220,c_0_230]),c_0_232]),c_0_231])]) ).
cnf(c_0_245,negated_conjecture,
( esk53_0 = nil
| ~ segmentP(esk49_0,esk53_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_232]),c_0_237])]) ).
cnf(c_0_246,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_238,c_0_239]),c_0_222]),c_0_240])]) ).
cnf(c_0_247,negated_conjecture,
( esk48_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_230,c_0_241]),c_0_231]),c_0_232])]) ).
cnf(c_0_248,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_242,c_0_234]),c_0_231]),c_0_232])]) ).
cnf(c_0_249,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_243,c_0_234]),c_0_232]),c_0_231])]) ).
cnf(c_0_250,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
i_0_191 ).
cnf(c_0_251,plain,
( segmentP(X1,esk52_0)
| esk48_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_239]),c_0_222]),c_0_237])]) ).
cnf(c_0_252,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_234,c_0_241]),c_0_232]),c_0_231])]) ).
cnf(c_0_253,plain,
esk53_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_246]),c_0_240])]) ).
cnf(c_0_254,negated_conjecture,
esk49_0 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_249]),c_0_250]) ).
cnf(c_0_255,negated_conjecture,
( esk52_0 = nil
| ~ segmentP(esk49_0,esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_251]),c_0_231]),c_0_237])]) ).
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_229,c_0_234]),c_0_232]),c_0_231])]) ).
cnf(c_0_257,negated_conjecture,
esk52_0 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_252,c_0_253])]),c_0_254]) ).
cnf(c_0_258,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_255,c_0_256]),c_0_240])]),c_0_257]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC075+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n020.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 : 600
% 0.12/0.34 % DateTime : Sat Jun 11 23:05:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.49/2.33 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.49/2.33 # Version: 2.1pre011
% 7.49/2.33 # Preprocessing time : 0.023 s
% 7.49/2.33
% 7.49/2.33 # Proof found!
% 7.49/2.33 # SZS status Theorem
% 7.49/2.33 # SZS output start CNFRefutation
% See solution above
% 7.49/2.33 # Proof object total steps : 57
% 7.49/2.33 # Proof object clause steps : 39
% 7.49/2.33 # Proof object formula steps : 18
% 7.49/2.33 # Proof object conjectures : 37
% 7.49/2.33 # Proof object clause conjectures : 27
% 7.49/2.33 # Proof object formula conjectures : 10
% 7.49/2.33 # Proof object initial clauses used : 18
% 7.49/2.33 # Proof object initial formulas used : 18
% 7.49/2.33 # Proof object generating inferences : 17
% 7.49/2.33 # Proof object simplifying inferences : 53
% 7.49/2.33 # Training examples: 0 positive, 0 negative
% 7.49/2.33 # Parsed axioms : 200
% 7.49/2.33 # Removed by relevancy pruning/SinE : 0
% 7.49/2.33 # Initial clauses : 200
% 7.49/2.33 # Removed in clause preprocessing : 0
% 7.49/2.33 # Initial clauses in saturation : 200
% 7.49/2.33 # Processed clauses : 501
% 7.49/2.33 # ...of these trivial : 4
% 7.49/2.33 # ...subsumed : 153
% 7.49/2.33 # ...remaining for further processing : 343
% 7.49/2.33 # Other redundant clauses eliminated : 126
% 7.49/2.33 # Clauses deleted for lack of memory : 0
% 7.49/2.33 # Backward-subsumed : 8
% 7.49/2.33 # Backward-rewritten : 33
% 7.49/2.33 # Generated clauses : 2156
% 7.49/2.33 # ...of the previous two non-trivial : 1912
% 7.49/2.33 # Contextual simplify-reflections : 141
% 7.49/2.33 # Paramodulations : 1991
% 7.49/2.33 # Factorizations : 0
% 7.49/2.33 # Equation resolutions : 162
% 7.49/2.33 # Propositional unsat checks : 0
% 7.49/2.33 # Propositional unsat check successes : 0
% 7.49/2.33 # Current number of processed clauses : 293
% 7.49/2.33 # Positive orientable unit clauses : 17
% 7.49/2.33 # Positive unorientable unit clauses: 0
% 7.49/2.33 # Negative unit clauses : 7
% 7.49/2.33 # Non-unit-clauses : 269
% 7.49/2.33 # Current number of unprocessed clauses: 1342
% 7.49/2.33 # ...number of literals in the above : 9613
% 7.49/2.33 # Current number of archived formulas : 0
% 7.49/2.33 # Current number of archived clauses : 44
% 7.49/2.33 # Clause-clause subsumption calls (NU) : 33019
% 7.49/2.33 # Rec. Clause-clause subsumption calls : 7467
% 7.49/2.33 # Non-unit clause-clause subsumptions : 213
% 7.49/2.33 # Unit Clause-clause subsumption calls : 741
% 7.49/2.33 # Rewrite failures with RHS unbound : 0
% 7.49/2.33 # BW rewrite match attempts : 1
% 7.49/2.33 # BW rewrite match successes : 1
% 7.49/2.33 # Condensation attempts : 0
% 7.49/2.33 # Condensation successes : 0
% 7.49/2.33 # Termbank termtop insertions : 44582
% 7.49/2.33
% 7.49/2.33 # -------------------------------------------------
% 7.49/2.33 # User time : 0.082 s
% 7.49/2.33 # System time : 0.005 s
% 7.49/2.33 # Total time : 0.087 s
% 7.49/2.33 # ...preprocessing : 0.023 s
% 7.49/2.33 # ...main loop : 0.064 s
% 7.49/2.33 # Maximum resident set size: 7132 pages
% 7.49/2.33
%------------------------------------------------------------------------------