TSTP Solution File: SWC058+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC058+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:20 EDT 2022
% Result : Theorem 8.11s 2.37s
% Output : CNFRefutation 8.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of clauses : 67 ( 16 unt; 11 nHn; 67 RR)
% Number of literals : 187 ( 44 equ; 117 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( esk50_0 = nil
| rearsegP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_191) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_200) ).
cnf(i_0_195,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_195) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_199) ).
cnf(i_0_196,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_196) ).
cnf(i_0_95,plain,
( rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ rearsegP(X3,X2)
| ~ rearsegP(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_95) ).
cnf(i_0_203,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_203) ).
cnf(i_0_202,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_202) ).
cnf(i_0_103,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_103) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_44) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_107) ).
cnf(i_0_105,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_105) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_110) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_109) ).
cnf(i_0_104,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_104) ).
cnf(i_0_194,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_194) ).
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-cg58k4si/input.p',i_0_149) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_159) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_58) ).
cnf(i_0_193,negated_conjecture,
( nil = esk51_0
| rearsegP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_197) ).
cnf(i_0_131,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_131) ).
cnf(i_0_132,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cg58k4si/input.p',i_0_132) ).
cnf(c_0_227,negated_conjecture,
( esk50_0 = nil
| rearsegP(esk51_0,esk50_0) ),
i_0_191 ).
cnf(c_0_228,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_229,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_195 ).
cnf(c_0_230,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_231,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_196 ).
cnf(c_0_232,plain,
( rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ rearsegP(X3,X2)
| ~ rearsegP(X1,X3) ),
i_0_95 ).
cnf(c_0_233,negated_conjecture,
( esk50_0 = nil
| rearsegP(esk49_0,esk50_0) ),
inference(rw,[status(thm)],[c_0_227,c_0_228]) ).
cnf(c_0_234,negated_conjecture,
ssList(esk49_0),
i_0_203 ).
cnf(c_0_235,negated_conjecture,
ssList(esk50_0),
i_0_202 ).
cnf(c_0_236,negated_conjecture,
( esk50_0 != nil
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_230]),c_0_230]) ).
cnf(c_0_237,negated_conjecture,
( neq(esk49_0,nil)
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_231,c_0_230]) ).
cnf(c_0_238,negated_conjecture,
( esk50_0 = nil
| rearsegP(X1,esk50_0)
| ~ rearsegP(X1,esk49_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_234]),c_0_235])]) ).
cnf(c_0_239,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_103 ).
cnf(c_0_240,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_241,negated_conjecture,
( esk50_0 != nil
| ~ segmentP(esk50_0,esk49_0)
| ~ segmentP(esk49_0,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_234])]) ).
cnf(c_0_242,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_243,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
i_0_105 ).
cnf(c_0_244,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_245,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_246,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
i_0_104 ).
cnf(c_0_247,plain,
( esk50_0 = nil
| rearsegP(nil,esk50_0)
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_240]),c_0_234])]) ).
cnf(c_0_248,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
i_0_194 ).
cnf(c_0_249,plain,
( esk50_0 != nil
| ~ segmentP(esk50_0,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_234])]) ).
cnf(c_0_250,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_240])]),c_0_245]) ).
cnf(c_0_251,plain,
( esk50_0 = nil
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_247]),c_0_235])]) ).
cnf(c_0_252,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_253,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_254,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_255,negated_conjecture,
( nil = esk51_0
| rearsegP(esk51_0,esk50_0) ),
i_0_193 ).
cnf(c_0_256,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_197 ).
cnf(c_0_257,negated_conjecture,
( esk49_0 = nil
| neq(esk50_0,nil) ),
inference(rw,[status(thm)],[c_0_248,c_0_228]) ).
cnf(c_0_258,plain,
esk49_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_234]),c_0_235])]),c_0_251]) ).
cnf(c_0_259,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_253]),c_0_240])]),c_0_254]) ).
cnf(c_0_260,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_131 ).
cnf(c_0_261,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_132 ).
cnf(c_0_262,negated_conjecture,
( esk49_0 = nil
| rearsegP(esk49_0,esk50_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_255,c_0_228]),c_0_228]) ).
cnf(c_0_263,negated_conjecture,
( esk49_0 = nil
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_256,c_0_230]) ).
cnf(c_0_264,negated_conjecture,
neq(esk50_0,nil),
inference(sr,[status(thm)],[c_0_257,c_0_258]) ).
cnf(c_0_265,plain,
( segmentP(X1,X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_259,c_0_260])]),c_0_261]) ).
cnf(c_0_266,negated_conjecture,
rearsegP(esk49_0,esk50_0),
inference(sr,[status(thm)],[c_0_262,c_0_258]) ).
cnf(c_0_267,negated_conjecture,
( ~ segmentP(esk50_0,esk50_0)
| ~ segmentP(esk49_0,esk50_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_264]),c_0_235])]),c_0_258]) ).
cnf(c_0_268,negated_conjecture,
segmentP(esk49_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_265,c_0_266]),c_0_235]),c_0_234])]) ).
cnf(c_0_269,negated_conjecture,
~ segmentP(esk50_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_267,c_0_268])]) ).
cnf(c_0_270,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_269,c_0_242]),c_0_235])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWC058+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n007.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jun 12 19:22:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.11/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.11/2.37 # Version: 2.1pre011
% 8.11/2.37 # Preprocessing time : 0.023 s
% 8.11/2.37
% 8.11/2.37 # Proof found!
% 8.11/2.37 # SZS status Theorem
% 8.11/2.37 # SZS output start CNFRefutation
% See solution above
% 8.11/2.37 # Proof object total steps : 67
% 8.11/2.37 # Proof object clause steps : 44
% 8.11/2.37 # Proof object formula steps : 23
% 8.11/2.37 # Proof object conjectures : 33
% 8.11/2.37 # Proof object clause conjectures : 23
% 8.11/2.37 # Proof object formula conjectures : 10
% 8.11/2.37 # Proof object initial clauses used : 23
% 8.11/2.37 # Proof object initial formulas used : 23
% 8.11/2.37 # Proof object generating inferences : 12
% 8.11/2.37 # Proof object simplifying inferences : 44
% 8.11/2.37 # Training examples: 0 positive, 0 negative
% 8.11/2.37 # Parsed axioms : 202
% 8.11/2.37 # Removed by relevancy pruning/SinE : 0
% 8.11/2.37 # Initial clauses : 202
% 8.11/2.37 # Removed in clause preprocessing : 0
% 8.11/2.37 # Initial clauses in saturation : 202
% 8.11/2.37 # Processed clauses : 364
% 8.11/2.37 # ...of these trivial : 3
% 8.11/2.37 # ...subsumed : 82
% 8.11/2.37 # ...remaining for further processing : 279
% 8.11/2.37 # Other redundant clauses eliminated : 122
% 8.11/2.37 # Clauses deleted for lack of memory : 0
% 8.11/2.37 # Backward-subsumed : 11
% 8.11/2.37 # Backward-rewritten : 1
% 8.11/2.37 # Generated clauses : 1339
% 8.11/2.37 # ...of the previous two non-trivial : 1117
% 8.11/2.37 # Contextual simplify-reflections : 102
% 8.11/2.37 # Paramodulations : 1184
% 8.11/2.37 # Factorizations : 0
% 8.11/2.37 # Equation resolutions : 151
% 8.11/2.37 # Propositional unsat checks : 0
% 8.11/2.37 # Propositional unsat check successes : 0
% 8.11/2.37 # Current number of processed clauses : 257
% 8.11/2.37 # Positive orientable unit clauses : 18
% 8.11/2.37 # Positive unorientable unit clauses: 0
% 8.11/2.37 # Negative unit clauses : 6
% 8.11/2.37 # Non-unit-clauses : 233
% 8.11/2.37 # Current number of unprocessed clauses: 951
% 8.11/2.37 # ...number of literals in the above : 7063
% 8.11/2.38 # Current number of archived formulas : 0
% 8.11/2.38 # Current number of archived clauses : 16
% 8.11/2.38 # Clause-clause subsumption calls (NU) : 14877
% 8.11/2.38 # Rec. Clause-clause subsumption calls : 3743
% 8.11/2.38 # Non-unit clause-clause subsumptions : 176
% 8.11/2.38 # Unit Clause-clause subsumption calls : 549
% 8.11/2.38 # Rewrite failures with RHS unbound : 0
% 8.11/2.38 # BW rewrite match attempts : 3
% 8.11/2.38 # BW rewrite match successes : 3
% 8.11/2.38 # Condensation attempts : 0
% 8.11/2.38 # Condensation successes : 0
% 8.11/2.38 # Termbank termtop insertions : 31433
% 8.11/2.38
% 8.11/2.38 # -------------------------------------------------
% 8.11/2.38 # User time : 0.072 s
% 8.11/2.38 # System time : 0.006 s
% 8.11/2.38 # Total time : 0.078 s
% 8.11/2.38 # ...preprocessing : 0.023 s
% 8.11/2.38 # ...main loop : 0.054 s
% 8.11/2.38 # Maximum resident set size: 7136 pages
% 8.11/2.38
%------------------------------------------------------------------------------