TSTP Solution File: SWC022+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC022+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:07 EDT 2022
% Result : Theorem 7.75s 2.34s
% Output : CNFRefutation 7.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 21
% Syntax : Number of clauses : 71 ( 25 unt; 14 nHn; 71 RR)
% Number of literals : 188 ( 54 equ; 114 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_196,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_198) ).
cnf(i_0_193,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_197) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_201) ).
cnf(i_0_88,plain,
( frontsegP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ frontsegP(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_88) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_44) ).
cnf(i_0_93,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_93) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_200) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_41) ).
cnf(i_0_87,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_87) ).
cnf(i_0_191,negated_conjecture,
( esk50_0 = X1
| hd(esk51_0) != X2
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_191) ).
cnf(i_0_142,plain,
( nil = X1
| hd(X1) = esk34_1(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_142) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_43) ).
cnf(i_0_143,plain,
( nil = X1
| ssItem(esk34_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_143) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_53) ).
cnf(i_0_89,plain,
( frontsegP(cons(X1,X2),cons(X3,X4))
| X1 != X3
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_89) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_56) ).
cnf(i_0_92,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_92) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bhi6bo_o/input.p',i_0_147) ).
cnf(c_0_223,negated_conjecture,
neq(esk49_0,nil),
i_0_196 ).
cnf(c_0_224,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_225,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_226,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_227,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_223,c_0_224]) ).
cnf(c_0_228,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_229,plain,
( frontsegP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ frontsegP(X1,X3) ),
i_0_88 ).
cnf(c_0_230,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_231,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_232,negated_conjecture,
( ~ frontsegP(esk50_0,X1)
| ~ frontsegP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_226]),c_0_224]),c_0_227])]) ).
cnf(c_0_233,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_228,c_0_224]) ).
cnf(c_0_234,plain,
( frontsegP(X1,X2)
| ~ frontsegP(nil,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231])]) ).
cnf(c_0_235,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_93 ).
cnf(c_0_236,negated_conjecture,
( ~ frontsegP(esk50_0,esk51_0)
| ~ frontsegP(esk51_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_227]),c_0_233])]) ).
cnf(c_0_237,plain,
( frontsegP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_234,c_0_235]) ).
cnf(c_0_238,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_239,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_240,negated_conjecture,
( esk51_0 != nil
| ~ frontsegP(esk51_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_233]),c_0_238])]) ).
cnf(c_0_241,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
i_0_87 ).
cnf(c_0_242,negated_conjecture,
( esk50_0 = X1
| hd(esk51_0) != X2
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_243,negated_conjecture,
( X1 = esk51_0
| neq(X1,esk51_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_239,c_0_233]) ).
cnf(c_0_244,plain,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_233])]) ).
cnf(c_0_245,negated_conjecture,
( esk50_0 = X1
| cons(X2,nil) != X1
| hd(esk51_0) != X2
| ~ neq(nil,esk51_0)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_242,c_0_227])]) ).
cnf(c_0_246,plain,
neq(nil,esk51_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_231]),c_0_244]) ).
cnf(c_0_247,plain,
( nil = X1
| hd(X1) = esk34_1(X1)
| ~ ssList(X1) ),
i_0_142 ).
cnf(c_0_248,negated_conjecture,
( esk50_0 = X1
| cons(X2,nil) != X1
| hd(esk51_0) != X2
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_245,c_0_246])]) ).
cnf(c_0_249,negated_conjecture,
( esk34_1(esk51_0) = hd(esk51_0)
| esk51_0 = nil ),
inference(spm,[status(thm)],[c_0_247,c_0_233]) ).
cnf(c_0_250,negated_conjecture,
( cons(X1,nil) = esk50_0
| hd(esk51_0) != X1
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_248]) ).
cnf(c_0_251,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_252,plain,
( nil = X1
| ssItem(esk34_1(X1))
| ~ ssList(X1) ),
i_0_143 ).
cnf(c_0_253,negated_conjecture,
esk34_1(esk51_0) = hd(esk51_0),
inference(sr,[status(thm)],[c_0_249,c_0_244]) ).
cnf(c_0_254,plain,
( cons(X1,nil) = esk50_0
| hd(esk51_0) != X1
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_251]),c_0_231])]) ).
cnf(c_0_255,plain,
ssItem(hd(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_253]),c_0_233])]),c_0_244]) ).
cnf(c_0_256,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_257,plain,
cons(hd(esk51_0),nil) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_254]),c_0_255])]) ).
cnf(c_0_258,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_239,c_0_231]) ).
cnf(c_0_259,plain,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_256,c_0_257]),c_0_255]),c_0_231])]) ).
cnf(c_0_260,plain,
( frontsegP(cons(X1,X2),cons(X3,X4))
| X1 != X3
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X4) ),
i_0_89 ).
cnf(c_0_261,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_262,negated_conjecture,
neq(esk50_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_258,c_0_238]),c_0_259]) ).
cnf(c_0_263,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_260]) ).
cnf(c_0_264,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
i_0_92 ).
cnf(c_0_265,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_266,negated_conjecture,
( esk51_0 = nil
| ssList(tl(esk51_0)) ),
inference(spm,[status(thm)],[c_0_261,c_0_233]) ).
cnf(c_0_267,negated_conjecture,
( ~ frontsegP(esk50_0,esk50_0)
| ~ frontsegP(esk51_0,esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_262]),c_0_238])]) ).
cnf(c_0_268,plain,
( frontsegP(cons(hd(esk51_0),X1),esk50_0)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_257]),c_0_255]),c_0_231])]),c_0_264]) ).
cnf(c_0_269,negated_conjecture,
cons(hd(esk51_0),tl(esk51_0)) = esk51_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_265,c_0_233]),c_0_244]) ).
cnf(c_0_270,negated_conjecture,
ssList(tl(esk51_0)),
inference(sr,[status(thm)],[c_0_266,c_0_244]) ).
cnf(c_0_271,plain,
~ frontsegP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_267,c_0_241]),c_0_238])]) ).
cnf(c_0_272,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_268,c_0_269]),c_0_270])]),c_0_271]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC022+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 08:43:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.75/2.34 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.75/2.34 # Version: 2.1pre011
% 7.75/2.34 # Preprocessing time : 0.023 s
% 7.75/2.34
% 7.75/2.34 # Proof found!
% 7.75/2.34 # SZS status Theorem
% 7.75/2.34 # SZS output start CNFRefutation
% See solution above
% 7.75/2.34 # Proof object total steps : 71
% 7.75/2.34 # Proof object clause steps : 50
% 7.75/2.34 # Proof object formula steps : 21
% 7.75/2.34 # Proof object conjectures : 31
% 7.75/2.34 # Proof object clause conjectures : 24
% 7.75/2.34 # Proof object formula conjectures : 7
% 7.75/2.34 # Proof object initial clauses used : 21
% 7.75/2.34 # Proof object initial formulas used : 21
% 7.75/2.34 # Proof object generating inferences : 21
% 7.75/2.34 # Proof object simplifying inferences : 46
% 7.75/2.34 # Training examples: 0 positive, 0 negative
% 7.75/2.34 # Parsed axioms : 200
% 7.75/2.34 # Removed by relevancy pruning/SinE : 0
% 7.75/2.34 # Initial clauses : 200
% 7.75/2.34 # Removed in clause preprocessing : 0
% 7.75/2.34 # Initial clauses in saturation : 200
% 7.75/2.34 # Processed clauses : 441
% 7.75/2.34 # ...of these trivial : 21
% 7.75/2.34 # ...subsumed : 61
% 7.75/2.34 # ...remaining for further processing : 359
% 7.75/2.34 # Other redundant clauses eliminated : 28
% 7.75/2.34 # Clauses deleted for lack of memory : 0
% 7.75/2.34 # Backward-subsumed : 5
% 7.75/2.34 # Backward-rewritten : 11
% 7.75/2.34 # Generated clauses : 3041
% 7.75/2.34 # ...of the previous two non-trivial : 2857
% 7.75/2.34 # Contextual simplify-reflections : 87
% 7.75/2.34 # Paramodulations : 2939
% 7.75/2.34 # Factorizations : 30
% 7.75/2.34 # Equation resolutions : 58
% 7.75/2.34 # Propositional unsat checks : 0
% 7.75/2.34 # Propositional unsat check successes : 0
% 7.75/2.34 # Current number of processed clauses : 323
% 7.75/2.34 # Positive orientable unit clauses : 44
% 7.75/2.34 # Positive unorientable unit clauses: 0
% 7.75/2.34 # Negative unit clauses : 7
% 7.75/2.34 # Non-unit-clauses : 272
% 7.75/2.34 # Current number of unprocessed clauses: 2036
% 7.75/2.34 # ...number of literals in the above : 9407
% 7.75/2.34 # Current number of archived formulas : 0
% 7.75/2.34 # Current number of archived clauses : 30
% 7.75/2.34 # Clause-clause subsumption calls (NU) : 15444
% 7.75/2.34 # Rec. Clause-clause subsumption calls : 3911
% 7.75/2.34 # Non-unit clause-clause subsumptions : 132
% 7.75/2.34 # Unit Clause-clause subsumption calls : 2178
% 7.75/2.34 # Rewrite failures with RHS unbound : 0
% 7.75/2.34 # BW rewrite match attempts : 6
% 7.75/2.34 # BW rewrite match successes : 6
% 7.75/2.34 # Condensation attempts : 0
% 7.75/2.34 # Condensation successes : 0
% 7.75/2.34 # Termbank termtop insertions : 49950
% 7.75/2.34
% 7.75/2.34 # -------------------------------------------------
% 7.75/2.34 # User time : 0.072 s
% 7.75/2.34 # System time : 0.005 s
% 7.75/2.34 # Total time : 0.077 s
% 7.75/2.34 # ...preprocessing : 0.023 s
% 7.75/2.34 # ...main loop : 0.054 s
% 7.75/2.34 # Maximum resident set size: 7352 pages
% 7.75/2.34
%------------------------------------------------------------------------------