TSTP Solution File: SWC110+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC110+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:41 EDT 2022
% Result : Theorem 8.11s 2.81s
% Output : CNFRefutation 8.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of clauses : 50 ( 18 unt; 2 nHn; 50 RR)
% Number of literals : 111 ( 49 equ; 64 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_198,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_198) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_200) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_201) ).
cnf(i_0_203,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_203) ).
cnf(i_0_158,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_158) ).
cnf(i_0_199,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_199) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_159) ).
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_191) ).
cnf(i_0_157,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_157) ).
cnf(i_0_195,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_195) ).
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-xa27g3bw/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_44) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_192) ).
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_193) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_41) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_107) ).
cnf(i_0_204,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xa27g3bw/input.p',i_0_204) ).
cnf(c_0_223,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
i_0_198 ).
cnf(c_0_224,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_225,negated_conjecture,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_226,negated_conjecture,
ssList(esk50_0),
i_0_203 ).
cnf(c_0_227,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_158 ).
cnf(c_0_228,negated_conjecture,
app(esk48_0,esk52_0) = esk49_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_224]),c_0_225]) ).
cnf(c_0_229,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_226,c_0_224]) ).
cnf(c_0_230,negated_conjecture,
ssList(esk52_0),
i_0_199 ).
cnf(c_0_231,negated_conjecture,
( esk52_0 = nil
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229]),c_0_230])]) ).
cnf(c_0_232,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_233,negated_conjecture,
( app(esk48_0,nil) = esk49_0
| esk49_0 != nil ),
inference(spm,[status(thm)],[c_0_228,c_0_231]) ).
cnf(c_0_234,negated_conjecture,
( nil != esk48_0
| ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_235,plain,
( esk48_0 = esk49_0
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_229])]) ).
cnf(c_0_236,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_157 ).
cnf(c_0_237,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
i_0_195 ).
cnf(c_0_238,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_239,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_240,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_241,negated_conjecture,
( esk49_0 != nil
| ~ segmentP(esk49_0,esk49_0)
| ~ neq(esk49_0,nil) ),
inference(spm,[status(thm)],[c_0_234,c_0_235]) ).
cnf(c_0_242,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_243,negated_conjecture,
( esk48_0 = nil
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_228]),c_0_230]),c_0_229])]) ).
cnf(c_0_244,negated_conjecture,
( nil = esk49_0
| ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_193 ).
cnf(c_0_245,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_246,negated_conjecture,
( esk49_0 = nil
| esk48_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_225]),c_0_224]) ).
cnf(c_0_247,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_238,c_0_239]),c_0_240])]) ).
cnf(c_0_248,negated_conjecture,
( esk49_0 != nil
| ~ segmentP(esk49_0,esk49_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_243]) ).
cnf(c_0_249,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_250,negated_conjecture,
ssList(esk49_0),
i_0_204 ).
cnf(c_0_251,negated_conjecture,
( esk49_0 = nil
| ~ segmentP(esk49_0,esk48_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_240]),c_0_229])]),c_0_246]) ).
cnf(c_0_252,negated_conjecture,
( segmentP(X1,esk48_0)
| esk49_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_228]),c_0_230]),c_0_229])]) ).
cnf(c_0_253,plain,
esk49_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_250])]) ).
cnf(c_0_254,negated_conjecture,
$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_250])]),c_0_253]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC110+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n009.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:40:09 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.11/2.81 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.11/2.81 # Version: 2.1pre011
% 8.11/2.81 # Preprocessing time : 0.013 s
% 8.11/2.81
% 8.11/2.81 # Proof found!
% 8.11/2.81 # SZS status Theorem
% 8.11/2.81 # SZS output start CNFRefutation
% See solution above
% 8.11/2.81 # Proof object total steps : 50
% 8.11/2.81 # Proof object clause steps : 32
% 8.11/2.81 # Proof object formula steps : 18
% 8.11/2.81 # Proof object conjectures : 31
% 8.11/2.81 # Proof object clause conjectures : 21
% 8.11/2.81 # Proof object formula conjectures : 10
% 8.11/2.81 # Proof object initial clauses used : 18
% 8.11/2.81 # Proof object initial formulas used : 18
% 8.11/2.81 # Proof object generating inferences : 11
% 8.11/2.81 # Proof object simplifying inferences : 28
% 8.11/2.81 # Training examples: 0 positive, 0 negative
% 8.11/2.81 # Parsed axioms : 203
% 8.11/2.81 # Removed by relevancy pruning/SinE : 0
% 8.11/2.81 # Initial clauses : 203
% 8.11/2.81 # Removed in clause preprocessing : 0
% 8.11/2.81 # Initial clauses in saturation : 203
% 8.11/2.81 # Processed clauses : 313
% 8.11/2.81 # ...of these trivial : 4
% 8.11/2.81 # ...subsumed : 52
% 8.11/2.81 # ...remaining for further processing : 257
% 8.11/2.81 # Other redundant clauses eliminated : 99
% 8.11/2.81 # Clauses deleted for lack of memory : 0
% 8.11/2.81 # Backward-subsumed : 6
% 8.11/2.81 # Backward-rewritten : 0
% 8.11/2.81 # Generated clauses : 1225
% 8.11/2.81 # ...of the previous two non-trivial : 1019
% 8.11/2.81 # Contextual simplify-reflections : 39
% 8.11/2.81 # Paramodulations : 1102
% 8.11/2.81 # Factorizations : 0
% 8.11/2.81 # Equation resolutions : 120
% 8.11/2.81 # Propositional unsat checks : 0
% 8.11/2.81 # Propositional unsat check successes : 0
% 8.11/2.81 # Current number of processed clauses : 242
% 8.11/2.81 # Positive orientable unit clauses : 21
% 8.11/2.81 # Positive unorientable unit clauses: 0
% 8.11/2.81 # Negative unit clauses : 4
% 8.11/2.81 # Non-unit-clauses : 217
% 8.11/2.81 # Current number of unprocessed clauses: 899
% 8.11/2.81 # ...number of literals in the above : 6440
% 8.11/2.81 # Current number of archived formulas : 0
% 8.11/2.81 # Current number of archived clauses : 9
% 8.11/2.81 # Clause-clause subsumption calls (NU) : 11083
% 8.11/2.81 # Rec. Clause-clause subsumption calls : 2419
% 8.11/2.81 # Non-unit clause-clause subsumptions : 70
% 8.11/2.81 # Unit Clause-clause subsumption calls : 68
% 8.11/2.81 # Rewrite failures with RHS unbound : 0
% 8.11/2.81 # BW rewrite match attempts : 1
% 8.11/2.81 # BW rewrite match successes : 1
% 8.11/2.81 # Condensation attempts : 0
% 8.11/2.81 # Condensation successes : 0
% 8.11/2.81 # Termbank termtop insertions : 28515
% 8.11/2.81
% 8.11/2.81 # -------------------------------------------------
% 8.11/2.81 # User time : 0.038 s
% 8.11/2.81 # System time : 0.000 s
% 8.11/2.81 # Total time : 0.038 s
% 8.11/2.81 # ...preprocessing : 0.013 s
% 8.11/2.81 # ...main loop : 0.025 s
% 8.11/2.81 # Maximum resident set size: 7124 pages
% 8.11/2.81
%------------------------------------------------------------------------------