TSTP Solution File: SWC420+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC420+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:35 EDT 2022
% Result : Theorem 8.02s 2.51s
% Output : CNFRefutation 8.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 46 ( 17 unt; 6 nHn; 46 RR)
% Number of literals : 118 ( 44 equ; 77 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 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 : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk48_0
| app(app(X3,cons(X2,nil)),X1) != esk49_0
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_193) ).
cnf(i_0_196,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_196) ).
cnf(i_0_195,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_195) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_44) ).
cnf(i_0_192,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_192) ).
cnf(i_0_154,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_154) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_159) ).
cnf(i_0_198,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_198) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_43) ).
cnf(i_0_50,plain,
( nil = X1
| cons(esk26_1(X1),esk25_1(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_50) ).
cnf(i_0_52,plain,
( nil = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_52) ).
cnf(i_0_51,plain,
( nil = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_51) ).
cnf(i_0_199,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_199) ).
cnf(i_0_194,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_194) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkt_bczm/input.p',i_0_42) ).
cnf(c_0_216,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk48_0
| app(app(X3,cons(X2,nil)),X1) != esk49_0
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
i_0_193 ).
cnf(c_0_217,negated_conjecture,
esk49_0 = esk51_0,
i_0_196 ).
cnf(c_0_218,negated_conjecture,
esk50_0 = esk48_0,
i_0_195 ).
cnf(c_0_219,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk51_0
| app(app(X3,cons(X2,nil)),X1) != esk50_0
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_216,c_0_217]),c_0_218]) ).
cnf(c_0_220,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_221,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_222,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_192 ).
cnf(c_0_223,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_224,plain,
( app(app(X1,cons(X2,nil)),nil) != esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssItem(X2)
| ~ ssList(cons(X2,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221])]) ).
cnf(c_0_225,plain,
( app(X1,cons(X2,nil)) = esk50_0
| cons(X2,X1) != esk51_0
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_226,plain,
( app(cons(X1,nil),X2) != esk51_0
| app(esk50_0,nil) != esk50_0
| cons(X1,X2) != esk51_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_224,c_0_225]) ).
cnf(c_0_227,plain,
( app(esk50_0,nil) != esk50_0
| cons(X1,X2) != esk51_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_226,c_0_223]) ).
cnf(c_0_228,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_229,negated_conjecture,
ssList(esk50_0),
i_0_198 ).
cnf(c_0_230,plain,
( cons(X1,X2) != esk51_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229])]) ).
cnf(c_0_231,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_232,plain,
( cons(X1,X2) != esk51_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_221])]) ).
cnf(c_0_233,plain,
( nil = X1
| cons(esk26_1(X1),esk25_1(X1)) = X1
| ~ ssList(X1) ),
i_0_50 ).
cnf(c_0_234,plain,
( nil = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
i_0_52 ).
cnf(c_0_235,plain,
( nil = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
i_0_51 ).
cnf(c_0_236,negated_conjecture,
ssList(esk49_0),
i_0_199 ).
cnf(c_0_237,negated_conjecture,
neq(esk49_0,nil),
i_0_194 ).
cnf(c_0_238,plain,
( nil = X1
| X1 != esk51_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_234]),c_0_235]) ).
cnf(c_0_239,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_236,c_0_217]) ).
cnf(c_0_240,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_241,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_237,c_0_217]) ).
cnf(c_0_242,negated_conjecture,
esk51_0 = nil,
inference(spm,[status(thm)],[c_0_238,c_0_239]) ).
cnf(c_0_243,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_240]) ).
cnf(c_0_244,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_241,c_0_242]) ).
cnf(c_0_245,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_221])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC420+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 02:38:23 EDT 2022
% 0.12/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
% 8.02/2.51 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.02/2.51 # Version: 2.1pre011
% 8.02/2.51 # Preprocessing time : 0.012 s
% 8.02/2.51
% 8.02/2.51 # Proof found!
% 8.02/2.51 # SZS status Theorem
% 8.02/2.51 # SZS output start CNFRefutation
% See solution above
% 8.02/2.51 # Proof object total steps : 46
% 8.02/2.51 # Proof object clause steps : 30
% 8.02/2.51 # Proof object formula steps : 16
% 8.02/2.51 # Proof object conjectures : 19
% 8.02/2.51 # Proof object clause conjectures : 12
% 8.02/2.51 # Proof object formula conjectures : 7
% 8.02/2.51 # Proof object initial clauses used : 16
% 8.02/2.51 # Proof object initial formulas used : 16
% 8.02/2.51 # Proof object generating inferences : 9
% 8.02/2.51 # Proof object simplifying inferences : 16
% 8.02/2.51 # Training examples: 0 positive, 0 negative
% 8.02/2.51 # Parsed axioms : 198
% 8.02/2.51 # Removed by relevancy pruning/SinE : 0
% 8.02/2.51 # Initial clauses : 198
% 8.02/2.51 # Removed in clause preprocessing : 0
% 8.02/2.51 # Initial clauses in saturation : 198
% 8.02/2.51 # Processed clauses : 488
% 8.02/2.51 # ...of these trivial : 6
% 8.02/2.51 # ...subsumed : 168
% 8.02/2.51 # ...remaining for further processing : 314
% 8.02/2.51 # Other redundant clauses eliminated : 99
% 8.02/2.51 # Clauses deleted for lack of memory : 0
% 8.02/2.51 # Backward-subsumed : 20
% 8.02/2.51 # Backward-rewritten : 41
% 8.02/2.51 # Generated clauses : 2267
% 8.02/2.51 # ...of the previous two non-trivial : 2058
% 8.02/2.51 # Contextual simplify-reflections : 236
% 8.02/2.51 # Paramodulations : 2139
% 8.02/2.51 # Factorizations : 0
% 8.02/2.51 # Equation resolutions : 128
% 8.02/2.51 # Propositional unsat checks : 0
% 8.02/2.51 # Propositional unsat check successes : 0
% 8.02/2.51 # Current number of processed clauses : 247
% 8.02/2.51 # Positive orientable unit clauses : 17
% 8.02/2.51 # Positive unorientable unit clauses: 0
% 8.02/2.51 # Negative unit clauses : 2
% 8.02/2.51 # Non-unit-clauses : 228
% 8.02/2.51 # Current number of unprocessed clauses: 1255
% 8.02/2.51 # ...number of literals in the above : 9328
% 8.02/2.51 # Current number of archived formulas : 0
% 8.02/2.51 # Current number of archived clauses : 61
% 8.02/2.51 # Clause-clause subsumption calls (NU) : 23844
% 8.02/2.51 # Rec. Clause-clause subsumption calls : 3996
% 8.02/2.51 # Non-unit clause-clause subsumptions : 399
% 8.02/2.51 # Unit Clause-clause subsumption calls : 69
% 8.02/2.51 # Rewrite failures with RHS unbound : 0
% 8.02/2.51 # BW rewrite match attempts : 2
% 8.02/2.51 # BW rewrite match successes : 2
% 8.02/2.51 # Condensation attempts : 0
% 8.02/2.51 # Condensation successes : 0
% 8.02/2.51 # Termbank termtop insertions : 49959
% 8.02/2.51
% 8.02/2.51 # -------------------------------------------------
% 8.02/2.51 # User time : 0.058 s
% 8.02/2.51 # System time : 0.006 s
% 8.02/2.51 # Total time : 0.064 s
% 8.02/2.51 # ...preprocessing : 0.012 s
% 8.02/2.51 # ...main loop : 0.052 s
% 8.02/2.51 # Maximum resident set size: 7128 pages
% 8.02/2.51
%------------------------------------------------------------------------------