TSTP Solution File: SWC015+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC015+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:04 EDT 2022
% Result : Theorem 10.22s 2.72s
% Output : CNFRefutation 10.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of clauses : 52 ( 17 unt; 8 nHn; 52 RR)
% Number of literals : 155 ( 52 equ; 103 neg)
% Maximal clause size : 7 ( 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; 5 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_196,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_198) ).
cnf(i_0_193,negated_conjecture,
( esk51_0 = X1
| tl(esk51_0) != X2
| app(esk50_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_193) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_58) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_200) ).
cnf(i_0_191,negated_conjecture,
( cons(X1,nil) != esk48_0
| app(cons(X1,nil),X2) != esk49_0
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_191) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_197) ).
cnf(i_0_148,plain,
( X1 = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_148) ).
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-meduipww/input.p',i_0_154) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_201) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_147) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_43) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_44) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_56) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_54) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_41) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-meduipww/input.p',i_0_42) ).
cnf(c_0_219,negated_conjecture,
neq(esk49_0,nil),
i_0_196 ).
cnf(c_0_220,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_221,negated_conjecture,
( esk51_0 = X1
| tl(esk51_0) != X2
| app(esk50_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_222,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_219,c_0_220]) ).
cnf(c_0_223,negated_conjecture,
( esk51_0 = X1
| app(esk50_0,X2) != X1
| tl(esk51_0) != X2
| ~ neq(nil,esk51_0)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_222])]) ).
cnf(c_0_224,negated_conjecture,
( app(esk50_0,X1) = esk51_0
| tl(esk51_0) != X1
| ~ neq(nil,esk51_0)
| ~ ssList(app(esk50_0,X1))
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_223]) ).
cnf(c_0_225,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_226,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_227,plain,
( app(esk50_0,X1) = esk51_0
| tl(esk51_0) != X1
| ~ neq(nil,esk51_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_226])]) ).
cnf(c_0_228,negated_conjecture,
( cons(X1,nil) != esk48_0
| app(cons(X1,nil),X2) != esk49_0
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_229,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_230,plain,
( X1 = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
i_0_148 ).
cnf(c_0_231,plain,
( app(esk50_0,tl(esk51_0)) = esk51_0
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0)) ),
inference(er,[status(thm)],[c_0_227]) ).
cnf(c_0_232,negated_conjecture,
( app(cons(X1,nil),X2) != esk51_0
| cons(X1,nil) != esk50_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_229]),c_0_220]),c_0_222])]) ).
cnf(c_0_233,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_234,plain,
( X1 = esk50_0
| app(X1,tl(esk51_0)) != esk51_0
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_226])]) ).
cnf(c_0_235,negated_conjecture,
( cons(X1,nil) != esk50_0
| cons(X1,X2) != esk51_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_232,c_0_233]) ).
cnf(c_0_236,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_237,plain,
( cons(X1,tl(esk51_0)) != esk51_0
| ~ neq(nil,esk51_0)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(tl(esk51_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_233]),c_0_235]) ).
cnf(c_0_238,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_239,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_236,c_0_220]) ).
cnf(c_0_240,plain,
( esk51_0 = nil
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_239])]) ).
cnf(c_0_241,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_242,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_243,plain,
( esk51_0 = nil
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_0))
| ~ ssList(tl(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242])]) ).
cnf(c_0_244,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_245,plain,
( esk51_0 = nil
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_239])]) ).
cnf(c_0_246,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_247,plain,
( esk51_0 = nil
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_246]),c_0_239])]) ).
cnf(c_0_248,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_249,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_250,plain,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_239]),c_0_242])]) ).
cnf(c_0_251,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_249]) ).
cnf(c_0_252,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_222,c_0_250]) ).
cnf(c_0_253,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_242])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC015+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 : n013.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 21:13:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/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
% 10.22/2.72 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 10.22/2.72 # Version: 2.1pre011
% 10.22/2.72 # Preprocessing time : 0.023 s
% 10.22/2.72
% 10.22/2.72 # Proof found!
% 10.22/2.72 # SZS status Theorem
% 10.22/2.72 # SZS output start CNFRefutation
% See solution above
% 10.22/2.72 # Proof object total steps : 52
% 10.22/2.72 # Proof object clause steps : 35
% 10.22/2.72 # Proof object formula steps : 17
% 10.22/2.72 # Proof object conjectures : 21
% 10.22/2.72 # Proof object clause conjectures : 14
% 10.22/2.72 # Proof object formula conjectures : 7
% 10.22/2.72 # Proof object initial clauses used : 17
% 10.22/2.72 # Proof object initial formulas used : 17
% 10.22/2.72 # Proof object generating inferences : 12
% 10.22/2.72 # Proof object simplifying inferences : 28
% 10.22/2.72 # Training examples: 0 positive, 0 negative
% 10.22/2.72 # Parsed axioms : 200
% 10.22/2.72 # Removed by relevancy pruning/SinE : 0
% 10.22/2.72 # Initial clauses : 200
% 10.22/2.72 # Removed in clause preprocessing : 0
% 10.22/2.72 # Initial clauses in saturation : 200
% 10.22/2.72 # Processed clauses : 332
% 10.22/2.72 # ...of these trivial : 9
% 10.22/2.72 # ...subsumed : 39
% 10.22/2.72 # ...remaining for further processing : 284
% 10.22/2.72 # Other redundant clauses eliminated : 87
% 10.22/2.72 # Clauses deleted for lack of memory : 0
% 10.22/2.72 # Backward-subsumed : 37
% 10.22/2.72 # Backward-rewritten : 30
% 10.22/2.72 # Generated clauses : 1294
% 10.22/2.72 # ...of the previous two non-trivial : 1118
% 10.22/2.72 # Contextual simplify-reflections : 53
% 10.22/2.72 # Paramodulations : 1183
% 10.22/2.72 # Factorizations : 0
% 10.22/2.72 # Equation resolutions : 111
% 10.22/2.72 # Propositional unsat checks : 0
% 10.22/2.72 # Propositional unsat check successes : 0
% 10.22/2.72 # Current number of processed clauses : 211
% 10.22/2.72 # Positive orientable unit clauses : 14
% 10.22/2.72 # Positive unorientable unit clauses: 0
% 10.22/2.72 # Negative unit clauses : 2
% 10.22/2.72 # Non-unit-clauses : 195
% 10.22/2.72 # Current number of unprocessed clauses: 786
% 10.22/2.72 # ...number of literals in the above : 5918
% 10.22/2.72 # Current number of archived formulas : 0
% 10.22/2.72 # Current number of archived clauses : 67
% 10.22/2.72 # Clause-clause subsumption calls (NU) : 13014
% 10.22/2.72 # Rec. Clause-clause subsumption calls : 2766
% 10.22/2.72 # Non-unit clause-clause subsumptions : 128
% 10.22/2.72 # Unit Clause-clause subsumption calls : 56
% 10.22/2.72 # Rewrite failures with RHS unbound : 0
% 10.22/2.72 # BW rewrite match attempts : 2
% 10.22/2.72 # BW rewrite match successes : 2
% 10.22/2.72 # Condensation attempts : 0
% 10.22/2.72 # Condensation successes : 0
% 10.22/2.72 # Termbank termtop insertions : 30488
% 10.22/2.72
% 10.22/2.72 # -------------------------------------------------
% 10.22/2.72 # User time : 0.062 s
% 10.22/2.72 # System time : 0.004 s
% 10.22/2.72 # Total time : 0.066 s
% 10.22/2.72 # ...preprocessing : 0.023 s
% 10.22/2.72 # ...main loop : 0.044 s
% 10.22/2.72 # Maximum resident set size: 7124 pages
% 10.22/2.72
%------------------------------------------------------------------------------