TSTP Solution File: SWC018+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC018+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:05 EDT 2022
% Result : Theorem 6.74s 2.21s
% Output : CNFRefutation 6.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 46 ( 18 unt; 2 nHn; 46 RR)
% Number of literals : 112 ( 38 equ; 71 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 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 : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_191) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_200) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_192) ).
cnf(i_0_198,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_198) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_201) ).
cnf(i_0_204,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_204) ).
cnf(i_0_157,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_157) ).
cnf(i_0_199,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_199) ).
cnf(i_0_203,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_203) ).
cnf(i_0_87,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_87) ).
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_193) ).
cnf(i_0_93,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_93) ).
cnf(i_0_88,plain,
( frontsegP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ frontsegP(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_88) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_44) ).
cnf(i_0_195,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jarcudj_/input.p',i_0_195) ).
cnf(c_0_221,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1) ),
i_0_191 ).
cnf(c_0_222,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_223,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_224,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
i_0_198 ).
cnf(c_0_225,negated_conjecture,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_226,negated_conjecture,
( esk50_0 != nil
| ~ frontsegP(esk50_0,X1)
| ~ frontsegP(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_227,negated_conjecture,
( neq(esk49_0,nil)
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_223,c_0_222]) ).
cnf(c_0_228,negated_conjecture,
ssList(esk49_0),
i_0_204 ).
cnf(c_0_229,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_157 ).
cnf(c_0_230,negated_conjecture,
app(esk50_0,esk52_0) = esk49_0,
inference(rw,[status(thm)],[c_0_224,c_0_225]) ).
cnf(c_0_231,negated_conjecture,
ssList(esk52_0),
i_0_199 ).
cnf(c_0_232,negated_conjecture,
ssList(esk50_0),
i_0_203 ).
cnf(c_0_233,negated_conjecture,
( esk50_0 != nil
| ~ frontsegP(esk50_0,esk49_0)
| ~ frontsegP(esk49_0,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_228])]) ).
cnf(c_0_234,negated_conjecture,
( esk50_0 = nil
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231]),c_0_232])]) ).
cnf(c_0_235,negated_conjecture,
( esk49_0 != nil
| ~ frontsegP(nil,esk49_0)
| ~ frontsegP(esk49_0,esk49_0) ),
inference(spm,[status(thm)],[c_0_233,c_0_234]) ).
cnf(c_0_236,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
i_0_87 ).
cnf(c_0_237,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1) ),
i_0_193 ).
cnf(c_0_238,plain,
( esk49_0 != nil
| ~ frontsegP(nil,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_228])]) ).
cnf(c_0_239,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_93 ).
cnf(c_0_240,plain,
( frontsegP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ frontsegP(X1,X3) ),
i_0_88 ).
cnf(c_0_241,negated_conjecture,
( esk49_0 = nil
| ~ frontsegP(esk50_0,X1)
| ~ frontsegP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_237,c_0_222]) ).
cnf(c_0_242,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_243,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_244,plain,
esk49_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_228])]) ).
cnf(c_0_245,negated_conjecture,
( frontsegP(esk49_0,X1)
| ~ frontsegP(esk50_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_230]),c_0_231]),c_0_232])]) ).
cnf(c_0_246,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
i_0_195 ).
cnf(c_0_247,negated_conjecture,
( X1 = nil
| ~ frontsegP(esk50_0,X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_243])]),c_0_244]),c_0_245]) ).
cnf(c_0_248,negated_conjecture,
( esk49_0 = nil
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_246,c_0_225]) ).
cnf(c_0_249,plain,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_236]),c_0_232])]) ).
cnf(c_0_250,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_248,c_0_249])]),c_0_244]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC018+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jun 12 18:08:10 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected SinE mode:
% 0.17/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.74/2.21 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 6.74/2.21 # Version: 2.1pre011
% 6.74/2.21 # Preprocessing time : 0.022 s
% 6.74/2.21
% 6.74/2.21 # Proof found!
% 6.74/2.21 # SZS status Theorem
% 6.74/2.21 # SZS output start CNFRefutation
% See solution above
% 6.74/2.21 # Proof object total steps : 46
% 6.74/2.21 # Proof object clause steps : 30
% 6.74/2.21 # Proof object formula steps : 16
% 6.74/2.21 # Proof object conjectures : 31
% 6.74/2.21 # Proof object clause conjectures : 21
% 6.74/2.21 # Proof object formula conjectures : 10
% 6.74/2.21 # Proof object initial clauses used : 16
% 6.74/2.21 # Proof object initial formulas used : 16
% 6.74/2.21 # Proof object generating inferences : 8
% 6.74/2.21 # Proof object simplifying inferences : 27
% 6.74/2.21 # Training examples: 0 positive, 0 negative
% 6.74/2.21 # Parsed axioms : 203
% 6.74/2.21 # Removed by relevancy pruning/SinE : 0
% 6.74/2.21 # Initial clauses : 203
% 6.74/2.21 # Removed in clause preprocessing : 0
% 6.74/2.21 # Initial clauses in saturation : 203
% 6.74/2.21 # Processed clauses : 241
% 6.74/2.21 # ...of these trivial : 2
% 6.74/2.21 # ...subsumed : 13
% 6.74/2.21 # ...remaining for further processing : 226
% 6.74/2.21 # Other redundant clauses eliminated : 82
% 6.74/2.21 # Clauses deleted for lack of memory : 0
% 6.74/2.21 # Backward-subsumed : 7
% 6.74/2.21 # Backward-rewritten : 15
% 6.74/2.21 # Generated clauses : 909
% 6.74/2.21 # ...of the previous two non-trivial : 759
% 6.74/2.21 # Contextual simplify-reflections : 14
% 6.74/2.21 # Paramodulations : 809
% 6.74/2.21 # Factorizations : 0
% 6.74/2.21 # Equation resolutions : 99
% 6.74/2.21 # Propositional unsat checks : 0
% 6.74/2.21 # Propositional unsat check successes : 0
% 6.74/2.21 # Current number of processed clauses : 197
% 6.74/2.21 # Positive orientable unit clauses : 16
% 6.74/2.21 # Positive unorientable unit clauses: 0
% 6.74/2.21 # Negative unit clauses : 4
% 6.74/2.21 # Non-unit-clauses : 177
% 6.74/2.21 # Current number of unprocessed clauses: 673
% 6.74/2.21 # ...number of literals in the above : 5104
% 6.74/2.21 # Current number of archived formulas : 0
% 6.74/2.21 # Current number of archived clauses : 23
% 6.74/2.21 # Clause-clause subsumption calls (NU) : 7557
% 6.74/2.21 # Rec. Clause-clause subsumption calls : 1854
% 6.74/2.21 # Non-unit clause-clause subsumptions : 29
% 6.74/2.21 # Unit Clause-clause subsumption calls : 67
% 6.74/2.21 # Rewrite failures with RHS unbound : 0
% 6.74/2.21 # BW rewrite match attempts : 2
% 6.74/2.21 # BW rewrite match successes : 2
% 6.74/2.21 # Condensation attempts : 0
% 6.74/2.21 # Condensation successes : 0
% 6.74/2.21 # Termbank termtop insertions : 23479
% 6.74/2.21
% 6.74/2.21 # -------------------------------------------------
% 6.74/2.21 # User time : 0.045 s
% 6.74/2.21 # System time : 0.003 s
% 6.74/2.21 # Total time : 0.048 s
% 6.74/2.21 # ...preprocessing : 0.022 s
% 6.74/2.21 # ...main loop : 0.026 s
% 6.74/2.21 # Maximum resident set size: 7128 pages
% 6.74/2.21
%------------------------------------------------------------------------------