TSTP Solution File: SWC067+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC067+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:24 EDT 2022
% Result : Theorem 7.66s 2.35s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of clauses : 60 ( 22 unt; 2 nHn; 60 RR)
% Number of literals : 150 ( 47 equ; 95 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_199,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_199) ).
cnf(i_0_203,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_203) ).
cnf(i_0_157,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_157) ).
cnf(i_0_200,negated_conjecture,
ssList(esk53_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_200) ).
cnf(i_0_108,plain,
( segmentP(app(app(X1,X2),X3),X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ segmentP(X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_108) ).
cnf(i_0_205,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_205) ).
cnf(i_0_201,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_201) ).
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_191) ).
cnf(i_0_202,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_202) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_192) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_58) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_109) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_44) ).
cnf(i_0_206,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_206) ).
cnf(i_0_158,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_158) ).
cnf(i_0_106,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_106) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_107) ).
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_193) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_110) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_41) ).
cnf(i_0_195,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zi6ssi8q/input.p',i_0_195) ).
cnf(c_0_228,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk51_0,
i_0_199 ).
cnf(c_0_229,negated_conjecture,
esk49_0 = esk51_0,
i_0_203 ).
cnf(c_0_230,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_157 ).
cnf(c_0_231,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk49_0,
inference(rw,[status(thm)],[c_0_228,c_0_229]) ).
cnf(c_0_232,negated_conjecture,
ssList(esk53_0),
i_0_200 ).
cnf(c_0_233,plain,
( segmentP(app(app(X1,X2),X3),X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ segmentP(X2,X4) ),
i_0_108 ).
cnf(c_0_234,negated_conjecture,
ssList(esk50_0),
i_0_205 ).
cnf(c_0_235,negated_conjecture,
ssList(esk52_0),
i_0_201 ).
cnf(c_0_236,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_191 ).
cnf(c_0_237,negated_conjecture,
esk50_0 = esk48_0,
i_0_202 ).
cnf(c_0_238,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_239,negated_conjecture,
( app(esk52_0,esk50_0) = nil
| esk49_0 != nil
| ~ ssList(app(esk52_0,esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232])]) ).
cnf(c_0_240,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_241,negated_conjecture,
( segmentP(esk49_0,X1)
| ~ segmentP(esk50_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_231]),c_0_232]),c_0_234]),c_0_235])]) ).
cnf(c_0_242,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_243,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_244,negated_conjecture,
( esk50_0 != nil
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_237]),c_0_237]) ).
cnf(c_0_245,negated_conjecture,
( neq(esk49_0,nil)
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_238,c_0_237]) ).
cnf(c_0_246,negated_conjecture,
ssList(esk49_0),
i_0_206 ).
cnf(c_0_247,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_158 ).
cnf(c_0_248,plain,
( app(esk52_0,esk50_0) = nil
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_234]),c_0_235])]) ).
cnf(c_0_249,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
i_0_106 ).
cnf(c_0_250,plain,
segmentP(esk49_0,nil),
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_234])]) ).
cnf(c_0_251,negated_conjecture,
( esk50_0 != nil
| ~ segmentP(esk50_0,esk49_0)
| ~ segmentP(esk49_0,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_246])]) ).
cnf(c_0_252,plain,
( esk50_0 = nil
| esk49_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_235]),c_0_234])]) ).
cnf(c_0_253,plain,
( esk49_0 = nil
| ~ segmentP(nil,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_246]),c_0_243])]) ).
cnf(c_0_254,negated_conjecture,
( ~ segmentP(nil,esk49_0)
| ~ segmentP(esk49_0,esk49_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_253]) ).
cnf(c_0_255,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_256,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_193 ).
cnf(c_0_257,plain,
~ segmentP(nil,esk49_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_254,c_0_255]),c_0_246])]) ).
cnf(c_0_258,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_259,negated_conjecture,
( esk49_0 = nil
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_256,c_0_237]) ).
cnf(c_0_260,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_261,plain,
esk49_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_258]),c_0_246])]) ).
cnf(c_0_262,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
i_0_195 ).
cnf(c_0_263,negated_conjecture,
( X1 = nil
| ~ segmentP(esk50_0,X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_259,c_0_260]),c_0_243])]),c_0_261]),c_0_241]) ).
cnf(c_0_264,negated_conjecture,
( esk49_0 = nil
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_262,c_0_229]) ).
cnf(c_0_265,plain,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_255]),c_0_234])]) ).
cnf(c_0_266,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_264,c_0_265])]),c_0_261]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC067+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 10:41:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.66/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.66/2.35 # Version: 2.1pre011
% 7.66/2.35 # Preprocessing time : 0.014 s
% 7.66/2.35
% 7.66/2.35 # Proof found!
% 7.66/2.35 # SZS status Theorem
% 7.66/2.35 # SZS output start CNFRefutation
% See solution above
% 7.66/2.35 # Proof object total steps : 60
% 7.66/2.35 # Proof object clause steps : 39
% 7.66/2.35 # Proof object formula steps : 21
% 7.66/2.35 # Proof object conjectures : 33
% 7.66/2.35 # Proof object clause conjectures : 22
% 7.66/2.35 # Proof object formula conjectures : 11
% 7.66/2.35 # Proof object initial clauses used : 21
% 7.66/2.35 # Proof object initial formulas used : 21
% 7.66/2.35 # Proof object generating inferences : 12
% 7.66/2.35 # Proof object simplifying inferences : 40
% 7.66/2.35 # Training examples: 0 positive, 0 negative
% 7.66/2.35 # Parsed axioms : 205
% 7.66/2.35 # Removed by relevancy pruning/SinE : 0
% 7.66/2.35 # Initial clauses : 205
% 7.66/2.35 # Removed in clause preprocessing : 0
% 7.66/2.35 # Initial clauses in saturation : 205
% 7.66/2.35 # Processed clauses : 289
% 7.66/2.35 # ...of these trivial : 3
% 7.66/2.35 # ...subsumed : 34
% 7.66/2.35 # ...remaining for further processing : 252
% 7.66/2.35 # Other redundant clauses eliminated : 83
% 7.66/2.35 # Clauses deleted for lack of memory : 0
% 7.66/2.35 # Backward-subsumed : 9
% 7.66/2.35 # Backward-rewritten : 31
% 7.66/2.35 # Generated clauses : 1072
% 7.66/2.35 # ...of the previous two non-trivial : 920
% 7.66/2.35 # Contextual simplify-reflections : 40
% 7.66/2.35 # Paramodulations : 971
% 7.66/2.35 # Factorizations : 0
% 7.66/2.35 # Equation resolutions : 100
% 7.66/2.35 # Propositional unsat checks : 0
% 7.66/2.35 # Propositional unsat check successes : 0
% 7.66/2.35 # Current number of processed clauses : 205
% 7.66/2.35 # Positive orientable unit clauses : 17
% 7.66/2.35 # Positive unorientable unit clauses: 0
% 7.66/2.35 # Negative unit clauses : 4
% 7.66/2.35 # Non-unit-clauses : 184
% 7.66/2.35 # Current number of unprocessed clauses: 687
% 7.66/2.35 # ...number of literals in the above : 5210
% 7.66/2.35 # Current number of archived formulas : 0
% 7.66/2.35 # Current number of archived clauses : 41
% 7.66/2.35 # Clause-clause subsumption calls (NU) : 11199
% 7.66/2.35 # Rec. Clause-clause subsumption calls : 2654
% 7.66/2.35 # Non-unit clause-clause subsumptions : 69
% 7.66/2.35 # Unit Clause-clause subsumption calls : 163
% 7.66/2.35 # Rewrite failures with RHS unbound : 0
% 7.66/2.35 # BW rewrite match attempts : 2
% 7.66/2.35 # BW rewrite match successes : 2
% 7.66/2.35 # Condensation attempts : 0
% 7.66/2.35 # Condensation successes : 0
% 7.66/2.35 # Termbank termtop insertions : 26583
% 7.66/2.35
% 7.66/2.35 # -------------------------------------------------
% 7.66/2.35 # User time : 0.033 s
% 7.66/2.35 # System time : 0.005 s
% 7.66/2.35 # Total time : 0.038 s
% 7.66/2.35 # ...preprocessing : 0.014 s
% 7.66/2.35 # ...main loop : 0.024 s
% 7.66/2.35 # Maximum resident set size: 7128 pages
% 7.66/2.35
%------------------------------------------------------------------------------