TSTP Solution File: SWC057+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC057+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:20 EDT 2022
% Result : Theorem 7.39s 2.38s
% Output : CNFRefutation 7.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of clauses : 64 ( 15 unt; 11 nHn; 64 RR)
% Number of literals : 180 ( 44 equ; 113 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( esk50_0 = nil
| frontsegP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_191) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_200) ).
cnf(i_0_195,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-k2zgvxxm/input.p',i_0_195) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_199) ).
cnf(i_0_196,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_196) ).
cnf(i_0_85,plain,
( frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ frontsegP(X3,X2)
| ~ frontsegP(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_85) ).
cnf(i_0_203,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_203) ).
cnf(i_0_202,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_202) ).
cnf(i_0_93,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_93) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_44) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_107) ).
cnf(i_0_105,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_105) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_110) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_109) ).
cnf(i_0_94,plain,
( nil = X1
| ~ ssList(X1)
| ~ frontsegP(nil,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_94) ).
cnf(i_0_194,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_194) ).
cnf(i_0_197,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-k2zgvxxm/input.p',i_0_197) ).
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-k2zgvxxm/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_60) ).
cnf(i_0_193,negated_conjecture,
( nil = esk51_0
| frontsegP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_193) ).
cnf(i_0_114,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_114) ).
cnf(i_0_115,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2zgvxxm/input.p',i_0_115) ).
cnf(c_0_226,negated_conjecture,
( esk50_0 = nil
| frontsegP(esk51_0,esk50_0) ),
i_0_191 ).
cnf(c_0_227,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_228,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_195 ).
cnf(c_0_229,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_230,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_196 ).
cnf(c_0_231,plain,
( frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ frontsegP(X3,X2)
| ~ frontsegP(X1,X3) ),
i_0_85 ).
cnf(c_0_232,negated_conjecture,
( esk50_0 = nil
| frontsegP(esk49_0,esk50_0) ),
inference(rw,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_233,negated_conjecture,
ssList(esk49_0),
i_0_203 ).
cnf(c_0_234,negated_conjecture,
ssList(esk50_0),
i_0_202 ).
cnf(c_0_235,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_228,c_0_229]),c_0_229]) ).
cnf(c_0_236,negated_conjecture,
( neq(esk49_0,nil)
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_230,c_0_229]) ).
cnf(c_0_237,negated_conjecture,
( esk50_0 = nil
| frontsegP(X1,esk50_0)
| ~ frontsegP(X1,esk49_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_233]),c_0_234])]) ).
cnf(c_0_238,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_93 ).
cnf(c_0_239,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_240,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_235,c_0_236]),c_0_233])]) ).
cnf(c_0_241,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_242,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
i_0_105 ).
cnf(c_0_243,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_244,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_245,plain,
( nil = X1
| ~ ssList(X1)
| ~ frontsegP(nil,X1) ),
i_0_94 ).
cnf(c_0_246,plain,
( esk50_0 = nil
| frontsegP(nil,esk50_0)
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_239]),c_0_233])]) ).
cnf(c_0_247,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
i_0_194 ).
cnf(c_0_248,plain,
( esk50_0 != nil
| ~ segmentP(esk50_0,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_233])]) ).
cnf(c_0_249,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_243]),c_0_239])]),c_0_244]) ).
cnf(c_0_250,plain,
( esk50_0 = nil
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_246]),c_0_234])]) ).
cnf(c_0_251,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_197 ).
cnf(c_0_252,negated_conjecture,
( esk49_0 = nil
| neq(esk50_0,nil) ),
inference(rw,[status(thm)],[c_0_247,c_0_227]) ).
cnf(c_0_253,plain,
esk49_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_233]),c_0_234])]),c_0_250]) ).
cnf(c_0_254,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_255,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_256,negated_conjecture,
( nil = esk51_0
| frontsegP(esk51_0,esk50_0) ),
i_0_193 ).
cnf(c_0_257,negated_conjecture,
( esk49_0 = nil
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_251,c_0_229]) ).
cnf(c_0_258,negated_conjecture,
neq(esk50_0,nil),
inference(sr,[status(thm)],[c_0_252,c_0_253]) ).
cnf(c_0_259,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_254,c_0_255]),c_0_239])]) ).
cnf(c_0_260,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
i_0_114 ).
cnf(c_0_261,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
i_0_115 ).
cnf(c_0_262,negated_conjecture,
( esk49_0 = nil
| frontsegP(esk49_0,esk50_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_256,c_0_227]),c_0_227]) ).
cnf(c_0_263,negated_conjecture,
( ~ segmentP(esk50_0,esk50_0)
| ~ segmentP(esk49_0,esk50_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_258]),c_0_234])]),c_0_253]) ).
cnf(c_0_264,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_259,c_0_260])]),c_0_261]) ).
cnf(c_0_265,negated_conjecture,
frontsegP(esk49_0,esk50_0),
inference(sr,[status(thm)],[c_0_262,c_0_253]) ).
cnf(c_0_266,negated_conjecture,
~ segmentP(esk50_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_264]),c_0_265]),c_0_234]),c_0_233])]) ).
cnf(c_0_267,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_266,c_0_241]),c_0_234])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC057+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 13:16:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # 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.39/2.38 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.39/2.38 # Version: 2.1pre011
% 7.39/2.38 # Preprocessing time : 0.023 s
% 7.39/2.38
% 7.39/2.38 # Proof found!
% 7.39/2.38 # SZS status Theorem
% 7.39/2.38 # SZS output start CNFRefutation
% See solution above
% 7.39/2.38 # Proof object total steps : 64
% 7.39/2.38 # Proof object clause steps : 42
% 7.39/2.38 # Proof object formula steps : 22
% 7.39/2.38 # Proof object conjectures : 32
% 7.39/2.38 # Proof object clause conjectures : 22
% 7.39/2.38 # Proof object formula conjectures : 10
% 7.39/2.38 # Proof object initial clauses used : 22
% 7.39/2.38 # Proof object initial formulas used : 22
% 7.39/2.38 # Proof object generating inferences : 12
% 7.39/2.38 # Proof object simplifying inferences : 42
% 7.39/2.38 # Training examples: 0 positive, 0 negative
% 7.39/2.38 # Parsed axioms : 202
% 7.39/2.38 # Removed by relevancy pruning/SinE : 0
% 7.39/2.38 # Initial clauses : 202
% 7.39/2.38 # Removed in clause preprocessing : 0
% 7.39/2.38 # Initial clauses in saturation : 202
% 7.39/2.38 # Processed clauses : 351
% 7.39/2.38 # ...of these trivial : 4
% 7.39/2.38 # ...subsumed : 73
% 7.39/2.38 # ...remaining for further processing : 274
% 7.39/2.38 # Other redundant clauses eliminated : 112
% 7.39/2.38 # Clauses deleted for lack of memory : 0
% 7.39/2.38 # Backward-subsumed : 12
% 7.39/2.38 # Backward-rewritten : 0
% 7.39/2.38 # Generated clauses : 1300
% 7.39/2.38 # ...of the previous two non-trivial : 1087
% 7.39/2.38 # Contextual simplify-reflections : 95
% 7.39/2.38 # Paramodulations : 1156
% 7.39/2.38 # Factorizations : 0
% 7.39/2.38 # Equation resolutions : 139
% 7.39/2.38 # Propositional unsat checks : 0
% 7.39/2.38 # Propositional unsat check successes : 0
% 7.39/2.38 # Current number of processed clauses : 251
% 7.39/2.38 # Positive orientable unit clauses : 17
% 7.39/2.38 # Positive unorientable unit clauses: 0
% 7.39/2.38 # Negative unit clauses : 6
% 7.39/2.38 # Non-unit-clauses : 228
% 7.39/2.38 # Current number of unprocessed clauses: 932
% 7.39/2.38 # ...number of literals in the above : 7019
% 7.39/2.38 # Current number of archived formulas : 0
% 7.39/2.38 # Current number of archived clauses : 17
% 7.39/2.38 # Clause-clause subsumption calls (NU) : 14953
% 7.39/2.38 # Rec. Clause-clause subsumption calls : 3506
% 7.39/2.38 # Non-unit clause-clause subsumptions : 161
% 7.39/2.38 # Unit Clause-clause subsumption calls : 524
% 7.39/2.38 # Rewrite failures with RHS unbound : 0
% 7.39/2.38 # BW rewrite match attempts : 1
% 7.39/2.38 # BW rewrite match successes : 1
% 7.39/2.38 # Condensation attempts : 0
% 7.39/2.38 # Condensation successes : 0
% 7.39/2.38 # Termbank termtop insertions : 30748
% 7.39/2.38
% 7.39/2.38 # -------------------------------------------------
% 7.39/2.38 # User time : 0.071 s
% 7.39/2.38 # System time : 0.005 s
% 7.39/2.38 # Total time : 0.076 s
% 7.39/2.38 # ...preprocessing : 0.023 s
% 7.39/2.38 # ...main loop : 0.053 s
% 7.39/2.38 # Maximum resident set size: 7124 pages
% 7.39/2.38
%------------------------------------------------------------------------------