TSTP Solution File: SWC081+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC081+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:29 EDT 2022
% Result : Theorem 8.62s 2.51s
% Output : CNFRefutation 8.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of clauses : 54 ( 22 unt; 8 nHn; 54 RR)
% Number of literals : 125 ( 23 equ; 71 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_199,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_199) ).
cnf(i_0_201,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_201) ).
cnf(i_0_202,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_202) ).
cnf(i_0_200,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_200) ).
cnf(i_0_205,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_205) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/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-mjd1l06r/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-mjd1l06r/input.p',i_0_110) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_44) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_109) ).
cnf(i_0_204,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_204) ).
cnf(i_0_196,negated_conjecture,
( nil = esk51_0
| neq(esk52_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
( nil = esk51_0
| ssList(esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_198) ).
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/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_60) ).
cnf(i_0_114,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/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/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_115) ).
cnf(i_0_194,negated_conjecture,
( nil = esk51_0
| frontsegP(esk51_0,esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_194) ).
cnf(i_0_192,negated_conjecture,
( nil = esk51_0
| frontsegP(esk50_0,esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjd1l06r/input.p',i_0_192) ).
cnf(c_0_225,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_199 ).
cnf(c_0_226,negated_conjecture,
esk50_0 = esk48_0,
i_0_201 ).
cnf(c_0_227,negated_conjecture,
esk49_0 = esk51_0,
i_0_202 ).
cnf(c_0_228,negated_conjecture,
neq(esk49_0,nil),
i_0_200 ).
cnf(c_0_229,negated_conjecture,
ssList(esk49_0),
i_0_205 ).
cnf(c_0_230,negated_conjecture,
( ~ segmentP(esk50_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_226]),c_0_227]) ).
cnf(c_0_231,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_228,c_0_227]) ).
cnf(c_0_232,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_229,c_0_227]) ).
cnf(c_0_233,negated_conjecture,
( ~ segmentP(esk50_0,esk51_0)
| ~ segmentP(esk51_0,esk51_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_234,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_235,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
i_0_105 ).
cnf(c_0_236,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_237,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_238,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_239,plain,
~ segmentP(esk50_0,esk51_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_232])]) ).
cnf(c_0_240,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_235,c_0_236]),c_0_237])]),c_0_238]) ).
cnf(c_0_241,negated_conjecture,
ssList(esk50_0),
i_0_204 ).
cnf(c_0_242,negated_conjecture,
( nil = esk51_0
| neq(esk52_0,nil) ),
i_0_196 ).
cnf(c_0_243,plain,
esk51_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_232]),c_0_241])]) ).
cnf(c_0_244,negated_conjecture,
( nil = esk51_0
| ssList(esk52_0) ),
i_0_198 ).
cnf(c_0_245,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_246,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_247,negated_conjecture,
neq(esk52_0,nil),
inference(sr,[status(thm)],[c_0_242,c_0_243]) ).
cnf(c_0_248,negated_conjecture,
ssList(esk52_0),
inference(sr,[status(thm)],[c_0_244,c_0_243]) ).
cnf(c_0_249,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_245,c_0_246]),c_0_237])]) ).
cnf(c_0_250,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
i_0_114 ).
cnf(c_0_251,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
i_0_115 ).
cnf(c_0_252,negated_conjecture,
( nil = esk51_0
| frontsegP(esk51_0,esk52_0) ),
i_0_194 ).
cnf(c_0_253,negated_conjecture,
( ~ segmentP(esk50_0,esk52_0)
| ~ segmentP(esk51_0,esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_247]),c_0_248])]) ).
cnf(c_0_254,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_249,c_0_250])]),c_0_251]) ).
cnf(c_0_255,negated_conjecture,
frontsegP(esk51_0,esk52_0),
inference(sr,[status(thm)],[c_0_252,c_0_243]) ).
cnf(c_0_256,negated_conjecture,
( nil = esk51_0
| frontsegP(esk50_0,esk52_0) ),
i_0_192 ).
cnf(c_0_257,negated_conjecture,
~ segmentP(esk50_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_254]),c_0_255]),c_0_248]),c_0_232])]) ).
cnf(c_0_258,negated_conjecture,
frontsegP(esk50_0,esk52_0),
inference(sr,[status(thm)],[c_0_256,c_0_243]) ).
cnf(c_0_259,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_254]),c_0_258]),c_0_248]),c_0_241])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC081+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 : n006.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 01:21:29 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.62/2.51 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.62/2.51 # Version: 2.1pre011
% 8.62/2.51 # Preprocessing time : 0.015 s
% 8.62/2.51
% 8.62/2.51 # Proof found!
% 8.62/2.51 # SZS status Theorem
% 8.62/2.51 # SZS output start CNFRefutation
% See solution above
% 8.62/2.51 # Proof object total steps : 54
% 8.62/2.51 # Proof object clause steps : 35
% 8.62/2.51 # Proof object formula steps : 19
% 8.62/2.51 # Proof object conjectures : 30
% 8.62/2.51 # Proof object clause conjectures : 20
% 8.62/2.51 # Proof object formula conjectures : 10
% 8.62/2.51 # Proof object initial clauses used : 19
% 8.62/2.51 # Proof object initial formulas used : 19
% 8.62/2.51 # Proof object generating inferences : 9
% 8.62/2.51 # Proof object simplifying inferences : 32
% 8.62/2.51 # Training examples: 0 positive, 0 negative
% 8.62/2.51 # Parsed axioms : 204
% 8.62/2.51 # Removed by relevancy pruning/SinE : 0
% 8.62/2.51 # Initial clauses : 204
% 8.62/2.51 # Removed in clause preprocessing : 0
% 8.62/2.51 # Initial clauses in saturation : 204
% 8.62/2.51 # Processed clauses : 379
% 8.62/2.51 # ...of these trivial : 4
% 8.62/2.51 # ...subsumed : 81
% 8.62/2.51 # ...remaining for further processing : 294
% 8.62/2.51 # Other redundant clauses eliminated : 122
% 8.62/2.51 # Clauses deleted for lack of memory : 0
% 8.62/2.51 # Backward-subsumed : 19
% 8.62/2.51 # Backward-rewritten : 0
% 8.62/2.51 # Generated clauses : 1419
% 8.62/2.51 # ...of the previous two non-trivial : 1163
% 8.62/2.51 # Contextual simplify-reflections : 102
% 8.62/2.51 # Paramodulations : 1257
% 8.62/2.51 # Factorizations : 0
% 8.62/2.51 # Equation resolutions : 156
% 8.62/2.51 # Propositional unsat checks : 0
% 8.62/2.51 # Propositional unsat check successes : 0
% 8.62/2.51 # Current number of processed clauses : 263
% 8.62/2.51 # Positive orientable unit clauses : 19
% 8.62/2.51 # Positive unorientable unit clauses: 0
% 8.62/2.51 # Negative unit clauses : 8
% 8.62/2.51 # Non-unit-clauses : 236
% 8.62/2.51 # Current number of unprocessed clauses: 967
% 8.62/2.51 # ...number of literals in the above : 7298
% 8.62/2.51 # Current number of archived formulas : 0
% 8.62/2.51 # Current number of archived clauses : 25
% 8.62/2.51 # Clause-clause subsumption calls (NU) : 16622
% 8.62/2.51 # Rec. Clause-clause subsumption calls : 3154
% 8.62/2.51 # Non-unit clause-clause subsumptions : 161
% 8.62/2.51 # Unit Clause-clause subsumption calls : 824
% 8.62/2.51 # Rewrite failures with RHS unbound : 0
% 8.62/2.51 # BW rewrite match attempts : 2
% 8.62/2.51 # BW rewrite match successes : 2
% 8.62/2.51 # Condensation attempts : 0
% 8.62/2.51 # Condensation successes : 0
% 8.62/2.51 # Termbank termtop insertions : 32110
% 8.62/2.51
% 8.62/2.51 # -------------------------------------------------
% 8.62/2.51 # User time : 0.047 s
% 8.62/2.51 # System time : 0.004 s
% 8.62/2.51 # Total time : 0.052 s
% 8.62/2.51 # ...preprocessing : 0.015 s
% 8.62/2.51 # ...main loop : 0.037 s
% 8.62/2.51 # Maximum resident set size: 7128 pages
% 8.62/2.51
%------------------------------------------------------------------------------