TSTP Solution File: SWC320+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC320+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:14:58 EDT 2022
% Result : Theorem 6.96s 2.25s
% Output : CNFRefutation 6.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 44 ( 11 unt; 7 nHn; 44 RR)
% Number of literals : 97 ( 57 equ; 50 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_194,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_194) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_201) ).
cnf(i_0_196,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_196) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_200) ).
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| app(X1,cons(X2,nil)) != esk49_0
| app(cons(X2,nil),X1) != esk48_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_193) ).
cnf(i_0_195,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_195) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_198) ).
cnf(i_0_199,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_199) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_192) ).
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| app(X1,cons(X2,nil)) != esk49_0
| app(cons(X2,nil),X1) != esk48_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xexkns3_/input.p',i_0_191) ).
cnf(c_0_213,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
i_0_194 ).
cnf(c_0_214,negated_conjecture,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_215,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_196 ).
cnf(c_0_216,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_217,negated_conjecture,
( nil = esk49_0
| app(X1,cons(X2,nil)) != esk49_0
| app(cons(X2,nil),X1) != esk48_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_193 ).
cnf(c_0_218,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_219,negated_conjecture,
( esk51_0 = nil
| neq(esk51_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_214]),c_0_214]) ).
cnf(c_0_220,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_221,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_198 ).
cnf(c_0_222,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk48_0
| ~ neq(esk51_0,nil) ),
inference(rw,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_223,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_199 ).
cnf(c_0_224,negated_conjecture,
( esk51_0 = nil
| app(X1,cons(X2,nil)) != esk51_0
| app(cons(X2,nil),X1) != esk48_0
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_214]),c_0_214]) ).
cnf(c_0_225,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| esk51_0 = nil ),
inference(spm,[status(thm)],[c_0_218,c_0_219]) ).
cnf(c_0_226,negated_conjecture,
( esk51_0 = nil
| ssList(esk53_0) ),
inference(spm,[status(thm)],[c_0_220,c_0_219]) ).
cnf(c_0_227,negated_conjecture,
( esk51_0 = nil
| ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_221,c_0_219]) ).
cnf(c_0_228,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk48_0
| esk51_0 = nil ),
inference(spm,[status(thm)],[c_0_222,c_0_219]) ).
cnf(c_0_229,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_230,negated_conjecture,
( nil != esk48_0
| app(X1,cons(X2,nil)) != esk49_0
| app(cons(X2,nil),X1) != esk48_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_191 ).
cnf(c_0_231,negated_conjecture,
( esk48_0 = nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[c_0_223,c_0_216]) ).
cnf(c_0_232,negated_conjecture,
esk51_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_226]),c_0_227]),c_0_228]) ).
cnf(c_0_233,negated_conjecture,
( neq(esk51_0,nil)
| esk48_0 != nil ),
inference(rw,[status(thm)],[c_0_229,c_0_214]) ).
cnf(c_0_234,negated_conjecture,
( app(X1,cons(X2,nil)) != esk51_0
| app(cons(X2,nil),X1) != esk48_0
| esk48_0 != nil
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_230,c_0_214]) ).
cnf(c_0_235,negated_conjecture,
esk48_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_232])]) ).
cnf(c_0_236,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| esk48_0 != nil ),
inference(spm,[status(thm)],[c_0_218,c_0_233]) ).
cnf(c_0_237,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk48_0
| esk48_0 != nil ),
inference(spm,[status(thm)],[c_0_222,c_0_233]) ).
cnf(c_0_238,negated_conjecture,
( ssItem(esk52_0)
| esk48_0 != nil ),
inference(spm,[status(thm)],[c_0_221,c_0_233]) ).
cnf(c_0_239,negated_conjecture,
( ssList(esk53_0)
| esk48_0 != nil ),
inference(spm,[status(thm)],[c_0_220,c_0_233]) ).
cnf(c_0_240,negated_conjecture,
( app(X1,cons(X2,nil)) != nil
| app(cons(X2,nil),X1) != nil
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_232]),c_0_235]),c_0_235])]) ).
cnf(c_0_241,negated_conjecture,
app(esk53_0,cons(esk52_0,nil)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_232]),c_0_235])]) ).
cnf(c_0_242,negated_conjecture,
app(cons(esk52_0,nil),esk53_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_235]),c_0_235])]) ).
cnf(c_0_243,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_235])]) ).
cnf(c_0_244,negated_conjecture,
ssList(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_235])]) ).
cnf(c_0_245,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242]),c_0_243]),c_0_244])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC320+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n024.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 : Sat Jun 11 23:44:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/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
% 6.96/2.25 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 6.96/2.25 # Version: 2.1pre011
% 6.96/2.25 # Preprocessing time : 0.016 s
% 6.96/2.25
% 6.96/2.25 # Proof found!
% 6.96/2.25 # SZS status Theorem
% 6.96/2.25 # SZS output start CNFRefutation
% See solution above
% 6.96/2.25 # Proof object total steps : 44
% 6.96/2.25 # Proof object clause steps : 33
% 6.96/2.25 # Proof object formula steps : 11
% 6.96/2.25 # Proof object conjectures : 44
% 6.96/2.25 # Proof object clause conjectures : 33
% 6.96/2.25 # Proof object formula conjectures : 11
% 6.96/2.25 # Proof object initial clauses used : 11
% 6.96/2.25 # Proof object initial formulas used : 11
% 6.96/2.25 # Proof object generating inferences : 10
% 6.96/2.25 # Proof object simplifying inferences : 31
% 6.96/2.25 # Training examples: 0 positive, 0 negative
% 6.96/2.25 # Parsed axioms : 203
% 6.96/2.25 # Removed by relevancy pruning/SinE : 0
% 6.96/2.25 # Initial clauses : 203
% 6.96/2.25 # Removed in clause preprocessing : 0
% 6.96/2.25 # Initial clauses in saturation : 203
% 6.96/2.25 # Processed clauses : 253
% 6.96/2.25 # ...of these trivial : 6
% 6.96/2.25 # ...subsumed : 8
% 6.96/2.25 # ...remaining for further processing : 239
% 6.96/2.25 # Other redundant clauses eliminated : 24
% 6.96/2.25 # Clauses deleted for lack of memory : 0
% 6.96/2.25 # Backward-subsumed : 2
% 6.96/2.25 # Backward-rewritten : 29
% 6.96/2.25 # Generated clauses : 1646
% 6.96/2.25 # ...of the previous two non-trivial : 1506
% 6.96/2.25 # Contextual simplify-reflections : 17
% 6.96/2.25 # Paramodulations : 1574
% 6.96/2.25 # Factorizations : 30
% 6.96/2.25 # Equation resolutions : 42
% 6.96/2.25 # Propositional unsat checks : 0
% 6.96/2.25 # Propositional unsat check successes : 0
% 6.96/2.25 # Current number of processed clauses : 202
% 6.96/2.25 # Positive orientable unit clauses : 18
% 6.96/2.25 # Positive unorientable unit clauses: 0
% 6.96/2.25 # Negative unit clauses : 2
% 6.96/2.25 # Non-unit-clauses : 182
% 6.96/2.25 # Current number of unprocessed clauses: 922
% 6.96/2.25 # ...number of literals in the above : 5199
% 6.96/2.25 # Current number of archived formulas : 0
% 6.96/2.25 # Current number of archived clauses : 31
% 6.96/2.25 # Clause-clause subsumption calls (NU) : 6632
% 6.96/2.25 # Rec. Clause-clause subsumption calls : 1650
% 6.96/2.25 # Non-unit clause-clause subsumptions : 27
% 6.96/2.25 # Unit Clause-clause subsumption calls : 205
% 6.96/2.25 # Rewrite failures with RHS unbound : 0
% 6.96/2.25 # BW rewrite match attempts : 2
% 6.96/2.25 # BW rewrite match successes : 2
% 6.96/2.25 # Condensation attempts : 0
% 6.96/2.25 # Condensation successes : 0
% 6.96/2.25 # Termbank termtop insertions : 29620
% 6.96/2.25
% 6.96/2.25 # -------------------------------------------------
% 6.96/2.25 # User time : 0.035 s
% 6.96/2.25 # System time : 0.006 s
% 6.96/2.25 # Total time : 0.041 s
% 6.96/2.25 # ...preprocessing : 0.016 s
% 6.96/2.25 # ...main loop : 0.025 s
% 6.96/2.25 # Maximum resident set size: 7140 pages
% 6.96/2.25
%------------------------------------------------------------------------------