TSTP Solution File: SWC060+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC060+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:21 EDT 2022
% Result : Theorem 8.33s 2.54s
% Output : CNFRefutation 8.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 50 ( 14 unt; 11 nHn; 50 RR)
% Number of literals : 120 ( 37 equ; 66 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_195) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_199) ).
cnf(i_0_194,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_194) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_200) ).
cnf(i_0_193,negated_conjecture,
( nil = esk51_0
| segmentP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_193) ).
cnf(i_0_196,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_196) ).
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/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_197) ).
cnf(i_0_202,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_202) ).
cnf(i_0_203,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_203) ).
cnf(i_0_192,negated_conjecture,
( esk50_0 = nil
| neq(esk50_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_192) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/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/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_105) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_110) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_44) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_109) ).
cnf(i_0_191,negated_conjecture,
( esk50_0 = nil
| segmentP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_191) ).
cnf(i_0_111,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66wi4vav/input.p',i_0_111) ).
cnf(c_0_221,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_195 ).
cnf(c_0_222,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_223,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
i_0_194 ).
cnf(c_0_224,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_225,negated_conjecture,
( nil = esk51_0
| segmentP(esk51_0,esk50_0) ),
i_0_193 ).
cnf(c_0_226,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_196 ).
cnf(c_0_227,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_197 ).
cnf(c_0_228,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_221,c_0_222]),c_0_222]) ).
cnf(c_0_229,negated_conjecture,
( esk49_0 = nil
| neq(esk50_0,nil) ),
inference(rw,[status(thm)],[c_0_223,c_0_224]) ).
cnf(c_0_230,negated_conjecture,
ssList(esk50_0),
i_0_202 ).
cnf(c_0_231,negated_conjecture,
( esk49_0 = nil
| segmentP(esk49_0,esk50_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_224]),c_0_224]) ).
cnf(c_0_232,negated_conjecture,
( neq(esk49_0,nil)
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_226,c_0_222]) ).
cnf(c_0_233,negated_conjecture,
ssList(esk49_0),
i_0_203 ).
cnf(c_0_234,negated_conjecture,
( esk49_0 = nil
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_227,c_0_222]) ).
cnf(c_0_235,negated_conjecture,
( esk50_0 = nil
| neq(esk50_0,nil) ),
i_0_192 ).
cnf(c_0_236,negated_conjecture,
( esk49_0 = nil
| esk50_0 != nil
| ~ segmentP(esk50_0,esk50_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_230])]),c_0_231]) ).
cnf(c_0_237,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_228,c_0_232]),c_0_233])]) ).
cnf(c_0_238,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_239,negated_conjecture,
( esk49_0 = nil
| ~ segmentP(esk50_0,esk50_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_230])]),c_0_231]),c_0_236]) ).
cnf(c_0_240,plain,
( esk50_0 != nil
| ~ segmentP(esk50_0,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_233])]) ).
cnf(c_0_241,plain,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_238]),c_0_230])]) ).
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,
ssList(nil),
i_0_44 ).
cnf(c_0_245,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_246,negated_conjecture,
( esk50_0 = nil
| segmentP(esk51_0,esk50_0) ),
i_0_191 ).
cnf(c_0_247,plain,
( esk50_0 != nil
| ~ segmentP(esk50_0,nil) ),
inference(rw,[status(thm)],[c_0_240,c_0_241]) ).
cnf(c_0_248,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_244])]),c_0_245]) ).
cnf(c_0_249,negated_conjecture,
( esk50_0 = nil
| segmentP(esk49_0,esk50_0) ),
inference(rw,[status(thm)],[c_0_246,c_0_224]) ).
cnf(c_0_250,plain,
esk50_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_244]),c_0_230])]) ).
cnf(c_0_251,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
i_0_111 ).
cnf(c_0_252,negated_conjecture,
segmentP(nil,esk50_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_249,c_0_241]),c_0_250]) ).
cnf(c_0_253,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_230])]),c_0_250]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC060+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n023.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 21:53:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/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.33/2.54 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.33/2.54 # Version: 2.1pre011
% 8.33/2.54 # Preprocessing time : 0.012 s
% 8.33/2.54
% 8.33/2.54 # Proof found!
% 8.33/2.54 # SZS status Theorem
% 8.33/2.54 # SZS output start CNFRefutation
% See solution above
% 8.33/2.54 # Proof object total steps : 50
% 8.33/2.54 # Proof object clause steps : 33
% 8.33/2.54 # Proof object formula steps : 17
% 8.33/2.54 # Proof object conjectures : 32
% 8.33/2.54 # Proof object clause conjectures : 21
% 8.33/2.54 # Proof object formula conjectures : 11
% 8.33/2.54 # Proof object initial clauses used : 17
% 8.33/2.54 # Proof object initial formulas used : 17
% 8.33/2.54 # Proof object generating inferences : 8
% 8.33/2.54 # Proof object simplifying inferences : 33
% 8.33/2.54 # Training examples: 0 positive, 0 negative
% 8.33/2.54 # Parsed axioms : 202
% 8.33/2.54 # Removed by relevancy pruning/SinE : 0
% 8.33/2.54 # Initial clauses : 202
% 8.33/2.54 # Removed in clause preprocessing : 0
% 8.33/2.54 # Initial clauses in saturation : 202
% 8.33/2.54 # Processed clauses : 225
% 8.33/2.54 # ...of these trivial : 2
% 8.33/2.54 # ...subsumed : 7
% 8.33/2.54 # ...remaining for further processing : 216
% 8.33/2.54 # Other redundant clauses eliminated : 82
% 8.33/2.54 # Clauses deleted for lack of memory : 0
% 8.33/2.54 # Backward-subsumed : 3
% 8.33/2.54 # Backward-rewritten : 13
% 8.33/2.54 # Generated clauses : 829
% 8.33/2.54 # ...of the previous two non-trivial : 683
% 8.33/2.54 # Contextual simplify-reflections : 9
% 8.33/2.54 # Paramodulations : 730
% 8.33/2.54 # Factorizations : 0
% 8.33/2.54 # Equation resolutions : 98
% 8.33/2.54 # Propositional unsat checks : 0
% 8.33/2.54 # Propositional unsat check successes : 0
% 8.33/2.54 # Current number of processed clauses : 193
% 8.33/2.54 # Positive orientable unit clauses : 16
% 8.33/2.54 # Positive unorientable unit clauses: 0
% 8.33/2.54 # Negative unit clauses : 3
% 8.33/2.54 # Non-unit-clauses : 174
% 8.33/2.54 # Current number of unprocessed clauses: 648
% 8.33/2.54 # ...number of literals in the above : 4868
% 8.33/2.54 # Current number of archived formulas : 0
% 8.33/2.54 # Current number of archived clauses : 17
% 8.33/2.54 # Clause-clause subsumption calls (NU) : 6799
% 8.33/2.54 # Rec. Clause-clause subsumption calls : 1668
% 8.33/2.54 # Non-unit clause-clause subsumptions : 18
% 8.33/2.54 # Unit Clause-clause subsumption calls : 123
% 8.33/2.54 # Rewrite failures with RHS unbound : 0
% 8.33/2.54 # BW rewrite match attempts : 1
% 8.33/2.54 # BW rewrite match successes : 1
% 8.33/2.54 # Condensation attempts : 0
% 8.33/2.54 # Condensation successes : 0
% 8.33/2.54 # Termbank termtop insertions : 22028
% 8.33/2.55
% 8.33/2.55 # -------------------------------------------------
% 8.33/2.55 # User time : 0.028 s
% 8.33/2.55 # System time : 0.002 s
% 8.33/2.55 # Total time : 0.030 s
% 8.33/2.55 # ...preprocessing : 0.012 s
% 8.33/2.55 # ...main loop : 0.018 s
% 8.33/2.55 # Maximum resident set size: 7140 pages
% 8.33/2.55
%------------------------------------------------------------------------------