TSTP Solution File: SWC052+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC052+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:18 EDT 2022
% Result : Theorem 7.77s 2.34s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of clauses : 63 ( 19 unt; 4 nHn; 63 RR)
% Number of literals : 151 ( 36 equ; 94 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 : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_191) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_201) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_192) ).
cnf(i_0_204,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_204) ).
cnf(i_0_199,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_199) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_200) ).
cnf(i_0_194,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_194) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_107) ).
cnf(i_0_198,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_198) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_110) ).
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/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/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/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_44) ).
cnf(i_0_195,negated_conjecture,
( frontsegP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_195) ).
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-iej7h__t/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-iej7h__t/input.p',i_0_115) ).
cnf(i_0_203,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_203) ).
cnf(i_0_196,negated_conjecture,
( frontsegP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iej7h__t/input.p',i_0_196) ).
cnf(c_0_225,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_191 ).
cnf(c_0_226,negated_conjecture,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_227,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_228,negated_conjecture,
ssList(esk49_0),
i_0_204 ).
cnf(c_0_229,negated_conjecture,
( esk48_0 != nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_225,c_0_226]) ).
cnf(c_0_230,negated_conjecture,
( neq(esk51_0,nil)
| esk48_0 != nil ),
inference(rw,[status(thm)],[c_0_227,c_0_226]) ).
cnf(c_0_231,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_228,c_0_226]) ).
cnf(c_0_232,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_199 ).
cnf(c_0_233,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_234,negated_conjecture,
( esk48_0 != nil
| ~ segmentP(esk48_0,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231])]) ).
cnf(c_0_235,negated_conjecture,
( esk48_0 = nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[c_0_232,c_0_233]) ).
cnf(c_0_236,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
i_0_194 ).
cnf(c_0_237,negated_conjecture,
( esk51_0 != nil
| ~ segmentP(nil,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(spm,[status(thm)],[c_0_234,c_0_235]) ).
cnf(c_0_238,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_239,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_198 ).
cnf(c_0_240,negated_conjecture,
( esk51_0 = nil
| neq(esk51_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_226]),c_0_226]) ).
cnf(c_0_241,plain,
( esk51_0 != nil
| ~ segmentP(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_231])]) ).
cnf(c_0_242,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_243,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_193 ).
cnf(c_0_244,negated_conjecture,
( esk51_0 = nil
| ssList(esk52_0) ),
inference(spm,[status(thm)],[c_0_239,c_0_240]) ).
cnf(c_0_245,plain,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_231])]) ).
cnf(c_0_246,negated_conjecture,
( esk51_0 = nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_243,c_0_226]),c_0_226]) ).
cnf(c_0_247,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_248,negated_conjecture,
ssList(esk52_0),
inference(sr,[status(thm)],[c_0_244,c_0_245]) ).
cnf(c_0_249,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_250,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_251,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_252,negated_conjecture,
( frontsegP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_253,negated_conjecture,
( ~ segmentP(esk48_0,esk52_0)
| ~ segmentP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_247]),c_0_248])]),c_0_245]) ).
cnf(c_0_254,negated_conjecture,
neq(esk51_0,nil),
inference(sr,[status(thm)],[c_0_240,c_0_245]) ).
cnf(c_0_255,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_249,c_0_250]),c_0_251])]) ).
cnf(c_0_256,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
i_0_114 ).
cnf(c_0_257,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
i_0_115 ).
cnf(c_0_258,negated_conjecture,
( frontsegP(esk48_0,esk52_0)
| ~ neq(esk51_0,nil) ),
inference(rw,[status(thm)],[c_0_252,c_0_233]) ).
cnf(c_0_259,negated_conjecture,
ssList(esk50_0),
i_0_203 ).
cnf(c_0_260,negated_conjecture,
( ~ segmentP(esk48_0,esk52_0)
| ~ segmentP(esk51_0,esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_253,c_0_254])]) ).
cnf(c_0_261,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_255,c_0_256])]),c_0_257]) ).
cnf(c_0_262,negated_conjecture,
frontsegP(esk48_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_258,c_0_254])]) ).
cnf(c_0_263,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_259,c_0_233]) ).
cnf(c_0_264,negated_conjecture,
( frontsegP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_196 ).
cnf(c_0_265,negated_conjecture,
~ segmentP(esk51_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_260,c_0_261]),c_0_262]),c_0_248]),c_0_263])]) ).
cnf(c_0_266,negated_conjecture,
frontsegP(esk51_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_264,c_0_254])]) ).
cnf(c_0_267,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_265,c_0_261]),c_0_266]),c_0_248]),c_0_231])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC052+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 : Sat Jun 11 21:58:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/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.77/2.34 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.77/2.34 # Version: 2.1pre011
% 7.77/2.34 # Preprocessing time : 0.024 s
% 7.77/2.34
% 7.77/2.34 # Proof found!
% 7.77/2.34 # SZS status Theorem
% 7.77/2.34 # SZS output start CNFRefutation
% See solution above
% 7.77/2.34 # Proof object total steps : 63
% 7.77/2.34 # Proof object clause steps : 43
% 7.77/2.34 # Proof object formula steps : 20
% 7.77/2.34 # Proof object conjectures : 44
% 7.77/2.34 # Proof object clause conjectures : 31
% 7.77/2.34 # Proof object formula conjectures : 13
% 7.77/2.34 # Proof object initial clauses used : 20
% 7.77/2.34 # Proof object initial formulas used : 20
% 7.77/2.34 # Proof object generating inferences : 10
% 7.77/2.34 # Proof object simplifying inferences : 39
% 7.77/2.34 # Training examples: 0 positive, 0 negative
% 7.77/2.34 # Parsed axioms : 203
% 7.77/2.34 # Removed by relevancy pruning/SinE : 0
% 7.77/2.34 # Initial clauses : 203
% 7.77/2.34 # Removed in clause preprocessing : 0
% 7.77/2.34 # Initial clauses in saturation : 203
% 7.77/2.34 # Processed clauses : 380
% 7.77/2.34 # ...of these trivial : 3
% 7.77/2.34 # ...subsumed : 92
% 7.77/2.34 # ...remaining for further processing : 285
% 7.77/2.34 # Other redundant clauses eliminated : 121
% 7.77/2.34 # Clauses deleted for lack of memory : 0
% 7.77/2.34 # Backward-subsumed : 12
% 7.77/2.34 # Backward-rewritten : 5
% 7.77/2.34 # Generated clauses : 1292
% 7.77/2.34 # ...of the previous two non-trivial : 1074
% 7.77/2.34 # Contextual simplify-reflections : 74
% 7.77/2.34 # Paramodulations : 1146
% 7.77/2.34 # Factorizations : 0
% 7.77/2.34 # Equation resolutions : 144
% 7.77/2.34 # Propositional unsat checks : 0
% 7.77/2.34 # Propositional unsat check successes : 0
% 7.77/2.34 # Current number of processed clauses : 260
% 7.77/2.34 # Positive orientable unit clauses : 19
% 7.77/2.34 # Positive unorientable unit clauses: 0
% 7.77/2.34 # Negative unit clauses : 10
% 7.77/2.34 # Non-unit-clauses : 231
% 7.77/2.34 # Current number of unprocessed clauses: 875
% 7.77/2.34 # ...number of literals in the above : 6482
% 7.77/2.34 # Current number of archived formulas : 0
% 7.77/2.34 # Current number of archived clauses : 19
% 7.77/2.34 # Clause-clause subsumption calls (NU) : 12489
% 7.77/2.34 # Rec. Clause-clause subsumption calls : 3324
% 7.77/2.34 # Non-unit clause-clause subsumptions : 129
% 7.77/2.34 # Unit Clause-clause subsumption calls : 891
% 7.77/2.34 # Rewrite failures with RHS unbound : 0
% 7.77/2.34 # BW rewrite match attempts : 4
% 7.77/2.34 # BW rewrite match successes : 4
% 7.77/2.34 # Condensation attempts : 0
% 7.77/2.34 # Condensation successes : 0
% 7.77/2.34 # Termbank termtop insertions : 29491
% 7.77/2.34
% 7.77/2.34 # -------------------------------------------------
% 7.77/2.34 # User time : 0.059 s
% 7.77/2.34 # System time : 0.004 s
% 7.77/2.34 # Total time : 0.063 s
% 7.77/2.34 # ...preprocessing : 0.024 s
% 7.77/2.34 # ...main loop : 0.040 s
% 7.77/2.34 # Maximum resident set size: 7136 pages
% 7.77/2.34
%------------------------------------------------------------------------------