TSTP Solution File: SWC236+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC236+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:14:28 EDT 2022
% Result : Theorem 7.66s 2.29s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 40 ( 10 unt; 8 nHn; 40 RR)
% Number of literals : 122 ( 34 equ; 83 neg)
% Maximal clause size : 5 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_198,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ lt(X2,esk52_3(X2,X1,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_198) ).
cnf(i_0_176,plain,
( X1 = X2
| lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_176) ).
cnf(i_0_202,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_202) ).
cnf(i_0_199,negated_conjecture,
( leq(X1,esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_199) ).
cnf(i_0_201,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_201) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_44) ).
cnf(i_0_79,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_79) ).
cnf(i_0_154,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_154) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_43) ).
cnf(i_0_50,plain,
( nil = X1
| cons(esk26_1(X1),esk25_1(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_50) ).
cnf(i_0_52,plain,
( nil = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_52) ).
cnf(i_0_51,plain,
( nil = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_51) ).
cnf(i_0_207,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_207) ).
cnf(i_0_204,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_204) ).
cnf(i_0_203,negated_conjecture,
nil != esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba7njquz/input.p',i_0_203) ).
cnf(c_0_224,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ lt(X2,esk52_3(X2,X1,X3)) ),
i_0_198 ).
cnf(c_0_225,plain,
( X1 = X2
| lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X1,X2) ),
i_0_176 ).
cnf(c_0_226,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_202 ).
cnf(c_0_227,negated_conjecture,
( leq(X1,esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_199 ).
cnf(c_0_228,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_201 ).
cnf(c_0_229,plain,
( esk52_3(X1,X2,X3) = X1
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_226]),c_0_227]) ).
cnf(c_0_230,negated_conjecture,
( memberP(X1,X2)
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_228,c_0_229]) ).
cnf(c_0_231,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_232,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_233,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
i_0_79 ).
cnf(c_0_234,plain,
( app(cons(X1,nil),X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232])]),c_0_233]) ).
cnf(c_0_235,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_236,plain,
( cons(X1,X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_234,c_0_235]) ).
cnf(c_0_237,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_238,plain,
( cons(X1,X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_232])]) ).
cnf(c_0_239,plain,
( nil = X1
| cons(esk26_1(X1),esk25_1(X1)) = X1
| ~ ssList(X1) ),
i_0_50 ).
cnf(c_0_240,plain,
( nil = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
i_0_52 ).
cnf(c_0_241,plain,
( nil = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
i_0_51 ).
cnf(c_0_242,negated_conjecture,
ssList(esk50_0),
i_0_207 ).
cnf(c_0_243,negated_conjecture,
esk50_0 = esk48_0,
i_0_204 ).
cnf(c_0_244,plain,
( nil = X1
| X1 != esk48_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_240]),c_0_241]) ).
cnf(c_0_245,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_242,c_0_243]) ).
cnf(c_0_246,negated_conjecture,
nil != esk48_0,
i_0_203 ).
cnf(c_0_247,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_246]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC236+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 : 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 23:19:28 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.66/2.29 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.66/2.29 # Version: 2.1pre011
% 7.66/2.29 # Preprocessing time : 0.013 s
% 7.66/2.29
% 7.66/2.29 # Proof found!
% 7.66/2.29 # SZS status Theorem
% 7.66/2.29 # SZS output start CNFRefutation
% See solution above
% 7.66/2.29 # Proof object total steps : 40
% 7.66/2.29 # Proof object clause steps : 24
% 7.66/2.29 # Proof object formula steps : 16
% 7.66/2.29 # Proof object conjectures : 17
% 7.66/2.29 # Proof object clause conjectures : 10
% 7.66/2.29 # Proof object formula conjectures : 7
% 7.66/2.29 # Proof object initial clauses used : 16
% 7.66/2.29 # Proof object initial formulas used : 16
% 7.66/2.29 # Proof object generating inferences : 7
% 7.66/2.29 # Proof object simplifying inferences : 11
% 7.66/2.29 # Training examples: 0 positive, 0 negative
% 7.66/2.29 # Parsed axioms : 207
% 7.66/2.29 # Removed by relevancy pruning/SinE : 0
% 7.66/2.29 # Initial clauses : 207
% 7.66/2.29 # Removed in clause preprocessing : 0
% 7.66/2.29 # Initial clauses in saturation : 207
% 7.66/2.29 # Processed clauses : 438
% 7.66/2.29 # ...of these trivial : 2
% 7.66/2.29 # ...subsumed : 124
% 7.66/2.29 # ...remaining for further processing : 312
% 7.66/2.29 # Other redundant clauses eliminated : 86
% 7.66/2.29 # Clauses deleted for lack of memory : 0
% 7.66/2.29 # Backward-subsumed : 23
% 7.66/2.29 # Backward-rewritten : 0
% 7.66/2.29 # Generated clauses : 1564
% 7.66/2.29 # ...of the previous two non-trivial : 1376
% 7.66/2.29 # Contextual simplify-reflections : 113
% 7.66/2.29 # Paramodulations : 1453
% 7.66/2.29 # Factorizations : 0
% 7.66/2.29 # Equation resolutions : 111
% 7.66/2.29 # Propositional unsat checks : 0
% 7.66/2.29 # Propositional unsat check successes : 0
% 7.66/2.29 # Current number of processed clauses : 283
% 7.66/2.29 # Positive orientable unit clauses : 19
% 7.66/2.29 # Positive unorientable unit clauses: 0
% 7.66/2.29 # Negative unit clauses : 6
% 7.66/2.29 # Non-unit-clauses : 258
% 7.66/2.29 # Current number of unprocessed clauses: 1074
% 7.66/2.29 # ...number of literals in the above : 7968
% 7.66/2.29 # Current number of archived formulas : 0
% 7.66/2.29 # Current number of archived clauses : 23
% 7.66/2.29 # Clause-clause subsumption calls (NU) : 23468
% 7.66/2.29 # Rec. Clause-clause subsumption calls : 5366
% 7.66/2.29 # Non-unit clause-clause subsumptions : 188
% 7.66/2.29 # Unit Clause-clause subsumption calls : 471
% 7.66/2.29 # Rewrite failures with RHS unbound : 0
% 7.66/2.29 # BW rewrite match attempts : 0
% 7.66/2.29 # BW rewrite match successes : 0
% 7.66/2.29 # Condensation attempts : 0
% 7.66/2.29 # Condensation successes : 0
% 7.66/2.29 # Termbank termtop insertions : 35817
% 7.66/2.29
% 7.66/2.29 # -------------------------------------------------
% 7.66/2.29 # User time : 0.045 s
% 7.66/2.29 # System time : 0.004 s
% 7.66/2.29 # Total time : 0.049 s
% 7.66/2.29 # ...preprocessing : 0.013 s
% 7.66/2.29 # ...main loop : 0.036 s
% 7.66/2.29 # Maximum resident set size: 7136 pages
% 7.66/2.29
%------------------------------------------------------------------------------