TSTP Solution File: SWC120+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC120+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:45 EDT 2022
% Result : Theorem 7.96s 2.43s
% Output : CNFRefutation 7.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 17
% Syntax : Number of clauses : 57 ( 18 unt; 14 nHn; 57 RR)
% Number of literals : 161 ( 55 equ; 98 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_196,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/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/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_197) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_200) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_58) ).
cnf(i_0_149,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_44) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_201) ).
cnf(i_0_191,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_191) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_56) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_41) ).
cnf(i_0_45,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_45) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_147) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/input.p',i_0_54) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8emmv4ws/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,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_223,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_219,c_0_220]) ).
cnf(c_0_224,negated_conjecture,
( esk51_0 = X1
| app(esk48_0,X2) != X1
| tl(esk51_0) != X2
| ~ neq(nil,esk51_0)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_222]),c_0_223])]) ).
cnf(c_0_225,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_226,negated_conjecture,
( app(esk48_0,X1) = esk51_0
| tl(esk51_0) != X1
| ~ neq(nil,esk51_0)
| ~ ssList(app(esk48_0,X1))
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_224]) ).
cnf(c_0_227,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_228,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_225,c_0_222]) ).
cnf(c_0_229,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
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,plain,
( app(esk48_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_226,c_0_227]),c_0_228])]) ).
cnf(c_0_233,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ 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_234,plain,
( app(esk48_0,tl(esk51_0)) = esk51_0
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0)) ),
inference(er,[status(thm)],[c_0_232]) ).
cnf(c_0_235,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_236,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_237,plain,
( segmentP(X1,esk48_0)
| esk51_0 != X1
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_228])]) ).
cnf(c_0_238,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_239,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_235,c_0_220]) ).
cnf(c_0_240,negated_conjecture,
( ~ segmentP(esk51_0,esk48_0)
| ~ neq(esk48_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_220]),c_0_223])]) ).
cnf(c_0_241,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_242,plain,
( esk51_0 = nil
| segmentP(X1,esk48_0)
| esk51_0 != X1
| ~ neq(nil,esk51_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_239])]) ).
cnf(c_0_243,plain,
( esk48_0 = nil
| ~ segmentP(esk51_0,esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_231]),c_0_228])]) ).
cnf(c_0_244,plain,
( esk51_0 = nil
| segmentP(X1,esk48_0)
| esk51_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_241]),c_0_239]),c_0_231])]) ).
cnf(c_0_245,plain,
( esk51_0 = nil
| esk48_0 = nil ),
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,
( app(nil,tl(esk51_0)) = esk51_0
| esk51_0 = nil
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0)) ),
inference(spm,[status(thm)],[c_0_234,c_0_245]) ).
cnf(c_0_247,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_45 ).
cnf(c_0_248,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_249,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_250,plain,
( tl(esk51_0) = esk51_0
| esk51_0 = nil
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0)) ),
inference(spm,[status(thm)],[c_0_230,c_0_246]) ).
cnf(c_0_251,plain,
( nil = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_238]),c_0_249]) ).
cnf(c_0_252,plain,
( tl(esk51_0) = esk51_0
| esk51_0 = nil
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_238]),c_0_239])]) ).
cnf(c_0_253,plain,
( esk51_0 = nil
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_239])]) ).
cnf(c_0_254,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_255,plain,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_241]),c_0_239]),c_0_231])]) ).
cnf(c_0_256,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_254]) ).
cnf(c_0_257,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_223,c_0_255]) ).
cnf(c_0_258,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_256,c_0_257]),c_0_231])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC120+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 22:25:15 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
% 7.96/2.43 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.96/2.43 # Version: 2.1pre011
% 7.96/2.43 # Preprocessing time : 0.023 s
% 7.96/2.43
% 7.96/2.43 # Proof found!
% 7.96/2.43 # SZS status Theorem
% 7.96/2.43 # SZS output start CNFRefutation
% See solution above
% 7.96/2.43 # Proof object total steps : 57
% 7.96/2.43 # Proof object clause steps : 40
% 7.96/2.43 # Proof object formula steps : 17
% 7.96/2.43 # Proof object conjectures : 21
% 7.96/2.43 # Proof object clause conjectures : 14
% 7.96/2.43 # Proof object formula conjectures : 7
% 7.96/2.43 # Proof object initial clauses used : 17
% 7.96/2.43 # Proof object initial formulas used : 17
% 7.96/2.43 # Proof object generating inferences : 16
% 7.96/2.43 # Proof object simplifying inferences : 38
% 7.96/2.43 # Training examples: 0 positive, 0 negative
% 7.96/2.43 # Parsed axioms : 200
% 7.96/2.43 # Removed by relevancy pruning/SinE : 0
% 7.96/2.43 # Initial clauses : 200
% 7.96/2.43 # Removed in clause preprocessing : 0
% 7.96/2.43 # Initial clauses in saturation : 200
% 7.96/2.43 # Processed clauses : 454
% 7.96/2.43 # ...of these trivial : 10
% 7.96/2.43 # ...subsumed : 108
% 7.96/2.43 # ...remaining for further processing : 336
% 7.96/2.43 # Other redundant clauses eliminated : 124
% 7.96/2.43 # Clauses deleted for lack of memory : 0
% 7.96/2.43 # Backward-subsumed : 35
% 7.96/2.43 # Backward-rewritten : 36
% 7.96/2.43 # Generated clauses : 2051
% 7.96/2.43 # ...of the previous two non-trivial : 1755
% 7.96/2.43 # Contextual simplify-reflections : 157
% 7.96/2.43 # Paramodulations : 1892
% 7.96/2.43 # Factorizations : 0
% 7.96/2.43 # Equation resolutions : 159
% 7.96/2.43 # Propositional unsat checks : 0
% 7.96/2.43 # Propositional unsat check successes : 0
% 7.96/2.43 # Current number of processed clauses : 259
% 7.96/2.43 # Positive orientable unit clauses : 18
% 7.96/2.43 # Positive unorientable unit clauses: 0
% 7.96/2.43 # Negative unit clauses : 2
% 7.96/2.43 # Non-unit-clauses : 239
% 7.96/2.43 # Current number of unprocessed clauses: 1299
% 7.96/2.43 # ...number of literals in the above : 9558
% 7.96/2.43 # Current number of archived formulas : 0
% 7.96/2.43 # Current number of archived clauses : 71
% 7.96/2.43 # Clause-clause subsumption calls (NU) : 21212
% 7.96/2.43 # Rec. Clause-clause subsumption calls : 4839
% 7.96/2.43 # Non-unit clause-clause subsumptions : 300
% 7.96/2.43 # Unit Clause-clause subsumption calls : 158
% 7.96/2.43 # Rewrite failures with RHS unbound : 0
% 7.96/2.43 # BW rewrite match attempts : 3
% 7.96/2.43 # BW rewrite match successes : 3
% 7.96/2.43 # Condensation attempts : 0
% 7.96/2.43 # Condensation successes : 0
% 7.96/2.43 # Termbank termtop insertions : 43833
% 7.96/2.43
% 7.96/2.43 # -------------------------------------------------
% 7.96/2.43 # User time : 0.077 s
% 7.96/2.43 # System time : 0.005 s
% 7.96/2.43 # Total time : 0.082 s
% 7.96/2.43 # ...preprocessing : 0.023 s
% 7.96/2.43 # ...main loop : 0.060 s
% 7.96/2.43 # Maximum resident set size: 7128 pages
% 7.96/2.43
%------------------------------------------------------------------------------