TSTP Solution File: SWC397+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC397+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:15:26 EDT 2022
% Result : Theorem 12.20s 2.95s
% Output : CNFRefutation 12.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of clauses : 58 ( 27 unt; 7 nHn; 58 RR)
% Number of literals : 127 ( 30 equ; 68 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 : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_197,negated_conjecture,
memberP(esk48_0,esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_197) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_199) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_195) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_44) ).
cnf(i_0_203,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_203) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_200) ).
cnf(i_0_79,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_79) ).
cnf(i_0_198,negated_conjecture,
ssItem(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_198) ).
cnf(i_0_192,negated_conjecture,
( app(cons(esk53_0,nil),esk54_0) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_192) ).
cnf(i_0_194,negated_conjecture,
( ssItem(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_194) ).
cnf(i_0_193,negated_conjecture,
( ssList(esk54_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_193) ).
cnf(i_0_154,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_154) ).
cnf(i_0_191,negated_conjecture,
( app(esk54_0,cons(esk53_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_191) ).
cnf(i_0_78,plain,
( X1 = X2
| memberP(X3,X2)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(cons(X1,X3),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_78) ).
cnf(i_0_74,plain,
( memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ memberP(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_74) ).
cnf(i_0_196,negated_conjecture,
~ memberP(esk49_0,esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_196) ).
cnf(i_0_81,plain,
( memberP(X1,X2)
| app(X3,cons(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_81) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_1j26be4/input.p',i_0_43) ).
cnf(c_0_223,negated_conjecture,
memberP(esk48_0,esk52_0),
i_0_197 ).
cnf(c_0_224,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_225,negated_conjecture,
memberP(esk50_0,esk52_0),
inference(rw,[status(thm)],[c_0_223,c_0_224]) ).
cnf(c_0_226,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_195 ).
cnf(c_0_227,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_228,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_229,negated_conjecture,
ssList(esk49_0),
i_0_203 ).
cnf(c_0_230,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_231,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
i_0_79 ).
cnf(c_0_232,negated_conjecture,
( memberP(nil,esk52_0)
| esk51_0 != nil ),
inference(spm,[status(thm)],[c_0_225,c_0_226]) ).
cnf(c_0_233,negated_conjecture,
ssItem(esk52_0),
i_0_198 ).
cnf(c_0_234,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_227,c_0_228]) ).
cnf(c_0_235,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_229,c_0_230]) ).
cnf(c_0_236,plain,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_233])]) ).
cnf(c_0_237,negated_conjecture,
( app(cons(esk53_0,nil),esk54_0) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_238,negated_conjecture,
neq(esk51_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_236]) ).
cnf(c_0_239,negated_conjecture,
( ssItem(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_194 ).
cnf(c_0_240,negated_conjecture,
( ssList(esk54_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_241,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_242,negated_conjecture,
app(cons(esk53_0,nil),esk54_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_238])]) ).
cnf(c_0_243,negated_conjecture,
ssItem(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_238])]) ).
cnf(c_0_244,negated_conjecture,
ssList(esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_240,c_0_238])]) ).
cnf(c_0_245,negated_conjecture,
( app(esk54_0,cons(esk53_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_246,plain,
( X1 = X2
| memberP(X3,X2)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(cons(X1,X3),X2) ),
i_0_78 ).
cnf(c_0_247,plain,
cons(esk53_0,esk54_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_243]),c_0_244])]) ).
cnf(c_0_248,plain,
( memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ memberP(X1,X3) ),
i_0_74 ).
cnf(c_0_249,negated_conjecture,
app(esk54_0,cons(esk53_0,nil)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_245,c_0_238])]) ).
cnf(c_0_250,plain,
( esk53_0 = X1
| memberP(esk54_0,X1)
| ~ memberP(esk50_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_247]),c_0_243]),c_0_244])]) ).
cnf(c_0_251,negated_conjecture,
~ memberP(esk49_0,esk52_0),
i_0_196 ).
cnf(c_0_252,plain,
( memberP(X1,X2)
| app(X3,cons(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2) ),
i_0_81 ).
cnf(c_0_253,plain,
( memberP(esk51_0,X1)
| ~ memberP(esk54_0,X1)
| ~ ssItem(X1)
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_244])]) ).
cnf(c_0_254,negated_conjecture,
( esk53_0 = esk52_0
| memberP(esk54_0,esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_225]),c_0_233])]) ).
cnf(c_0_255,negated_conjecture,
~ memberP(esk51_0,esk52_0),
inference(rw,[status(thm)],[c_0_251,c_0_230]) ).
cnf(c_0_256,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_252]) ).
cnf(c_0_257,plain,
( esk53_0 = esk52_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_254]),c_0_233])]),c_0_255]) ).
cnf(c_0_258,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_259,negated_conjecture,
memberP(esk51_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_256,c_0_249]),c_0_243]),c_0_235]),c_0_228]),c_0_244])]) ).
cnf(c_0_260,plain,
esk53_0 = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_258]),c_0_243]),c_0_228])]) ).
cnf(c_0_261,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_259,c_0_260]),c_0_255]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC397+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n028.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 : Sun Jun 12 07:46:07 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.20/2.95 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 12.20/2.95 # Version: 2.1pre011
% 12.20/2.95 # Preprocessing time : 0.023 s
% 12.20/2.95
% 12.20/2.95 # Proof found!
% 12.20/2.95 # SZS status Theorem
% 12.20/2.95 # SZS output start CNFRefutation
% See solution above
% 12.20/2.95 # Proof object total steps : 58
% 12.20/2.95 # Proof object clause steps : 39
% 12.20/2.95 # Proof object formula steps : 19
% 12.20/2.95 # Proof object conjectures : 34
% 12.20/2.95 # Proof object clause conjectures : 23
% 12.20/2.95 # Proof object formula conjectures : 11
% 12.20/2.95 # Proof object initial clauses used : 19
% 12.20/2.95 # Proof object initial formulas used : 19
% 12.20/2.95 # Proof object generating inferences : 12
% 12.20/2.95 # Proof object simplifying inferences : 37
% 12.20/2.95 # Training examples: 0 positive, 0 negative
% 12.20/2.95 # Parsed axioms : 202
% 12.20/2.95 # Removed by relevancy pruning/SinE : 0
% 12.20/2.95 # Initial clauses : 202
% 12.20/2.95 # Removed in clause preprocessing : 0
% 12.20/2.95 # Initial clauses in saturation : 202
% 12.20/2.95 # Processed clauses : 2722
% 12.20/2.95 # ...of these trivial : 63
% 12.20/2.95 # ...subsumed : 1307
% 12.20/2.95 # ...remaining for further processing : 1352
% 12.20/2.95 # Other redundant clauses eliminated : 49
% 12.20/2.95 # Clauses deleted for lack of memory : 0
% 12.20/2.95 # Backward-subsumed : 77
% 12.20/2.95 # Backward-rewritten : 222
% 12.20/2.95 # Generated clauses : 32454
% 12.20/2.95 # ...of the previous two non-trivial : 31068
% 12.20/2.95 # Contextual simplify-reflections : 655
% 12.20/2.95 # Paramodulations : 32250
% 12.20/2.95 # Factorizations : 76
% 12.20/2.95 # Equation resolutions : 107
% 12.20/2.95 # Propositional unsat checks : 0
% 12.20/2.95 # Propositional unsat check successes : 0
% 12.20/2.95 # Current number of processed clauses : 1026
% 12.20/2.95 # Positive orientable unit clauses : 64
% 12.20/2.95 # Positive unorientable unit clauses: 0
% 12.20/2.95 # Negative unit clauses : 19
% 12.20/2.95 # Non-unit-clauses : 943
% 12.20/2.95 # Current number of unprocessed clauses: 22345
% 12.20/2.95 # ...number of literals in the above : 93602
% 12.20/2.95 # Current number of archived formulas : 0
% 12.20/2.95 # Current number of archived clauses : 320
% 12.20/2.95 # Clause-clause subsumption calls (NU) : 221364
% 12.20/2.95 # Rec. Clause-clause subsumption calls : 68244
% 12.20/2.95 # Non-unit clause-clause subsumptions : 1286
% 12.20/2.95 # Unit Clause-clause subsumption calls : 8666
% 12.20/2.95 # Rewrite failures with RHS unbound : 0
% 12.20/2.95 # BW rewrite match attempts : 25
% 12.20/2.95 # BW rewrite match successes : 25
% 12.20/2.95 # Condensation attempts : 0
% 12.20/2.95 # Condensation successes : 0
% 12.20/2.95 # Termbank termtop insertions : 537932
% 12.20/2.95
% 12.20/2.95 # -------------------------------------------------
% 12.20/2.95 # User time : 0.505 s
% 12.20/2.95 # System time : 0.027 s
% 12.20/2.95 # Total time : 0.532 s
% 12.20/2.95 # ...preprocessing : 0.023 s
% 12.20/2.95 # ...main loop : 0.509 s
% 12.20/2.95 # Maximum resident set size: 35600 pages
% 12.20/2.95
%------------------------------------------------------------------------------