TSTP Solution File: SWC247+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC247+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:31 EDT 2022
% Result : Theorem 7.74s 2.37s
% Output : CNFRefutation 7.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 34 ( 10 unt; 6 nHn; 34 RR)
% Number of literals : 89 ( 27 equ; 58 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_79,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tvm8ii_d/input.p',i_0_79) ).
cnf(i_0_194,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-tvm8ii_d/input.p',i_0_194) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tvm8ii_d/input.p',i_0_44) ).
cnf(i_0_195,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-tvm8ii_d/input.p',i_0_195) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tvm8ii_d/input.p',i_0_60) ).
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-tvm8ii_d/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-tvm8ii_d/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-tvm8ii_d/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-tvm8ii_d/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-tvm8ii_d/input.p',i_0_51) ).
cnf(i_0_203,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tvm8ii_d/input.p',i_0_203) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tvm8ii_d/input.p',i_0_200) ).
cnf(i_0_197,negated_conjecture,
nil != esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tvm8ii_d/input.p',i_0_197) ).
cnf(c_0_217,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
i_0_79 ).
cnf(c_0_218,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_194 ).
cnf(c_0_219,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_220,plain,
( app(app(nil,cons(X1,nil)),X2) != esk48_0
| ~ ssItem(esk52_3(X1,nil,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219])]) ).
cnf(c_0_221,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_195 ).
cnf(c_0_222,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_219])]) ).
cnf(c_0_223,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_224,plain,
( app(cons(X1,nil),X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_225,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_226,plain,
( cons(X1,X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_224,c_0_225]) ).
cnf(c_0_227,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_228,plain,
( cons(X1,X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_219])]) ).
cnf(c_0_229,plain,
( nil = X1
| cons(esk26_1(X1),esk25_1(X1)) = X1
| ~ ssList(X1) ),
i_0_50 ).
cnf(c_0_230,plain,
( nil = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
i_0_52 ).
cnf(c_0_231,plain,
( nil = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
i_0_51 ).
cnf(c_0_232,negated_conjecture,
ssList(esk50_0),
i_0_203 ).
cnf(c_0_233,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_234,plain,
( nil = X1
| X1 != esk48_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_230]),c_0_231]) ).
cnf(c_0_235,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_232,c_0_233]) ).
cnf(c_0_236,negated_conjecture,
nil != esk48_0,
i_0_197 ).
cnf(c_0_237,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_236]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC247+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 13:34:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.74/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.74/2.37 # Version: 2.1pre011
% 7.74/2.37 # Preprocessing time : 0.019 s
% 7.74/2.37
% 7.74/2.37 # Proof found!
% 7.74/2.37 # SZS status Theorem
% 7.74/2.37 # SZS output start CNFRefutation
% See solution above
% 7.74/2.37 # Proof object total steps : 34
% 7.74/2.37 # Proof object clause steps : 21
% 7.74/2.37 # Proof object formula steps : 13
% 7.74/2.37 # Proof object conjectures : 13
% 7.74/2.37 # Proof object clause conjectures : 8
% 7.74/2.37 # Proof object formula conjectures : 5
% 7.74/2.37 # Proof object initial clauses used : 13
% 7.74/2.37 # Proof object initial formulas used : 13
% 7.74/2.37 # Proof object generating inferences : 7
% 7.74/2.37 # Proof object simplifying inferences : 10
% 7.74/2.37 # Training examples: 0 positive, 0 negative
% 7.74/2.37 # Parsed axioms : 203
% 7.74/2.37 # Removed by relevancy pruning/SinE : 0
% 7.74/2.37 # Initial clauses : 203
% 7.74/2.37 # Removed in clause preprocessing : 0
% 7.74/2.37 # Initial clauses in saturation : 203
% 7.74/2.37 # Processed clauses : 342
% 7.74/2.37 # ...of these trivial : 2
% 7.74/2.37 # ...subsumed : 73
% 7.74/2.37 # ...remaining for further processing : 267
% 7.74/2.37 # Other redundant clauses eliminated : 99
% 7.74/2.37 # Clauses deleted for lack of memory : 0
% 7.74/2.37 # Backward-subsumed : 8
% 7.74/2.37 # Backward-rewritten : 0
% 7.74/2.37 # Generated clauses : 1272
% 7.74/2.37 # ...of the previous two non-trivial : 1075
% 7.74/2.37 # Contextual simplify-reflections : 97
% 7.74/2.37 # Paramodulations : 1150
% 7.74/2.37 # Factorizations : 0
% 7.74/2.37 # Equation resolutions : 122
% 7.74/2.37 # Propositional unsat checks : 0
% 7.74/2.37 # Propositional unsat check successes : 0
% 7.74/2.37 # Current number of processed clauses : 253
% 7.74/2.37 # Positive orientable unit clauses : 16
% 7.74/2.37 # Positive unorientable unit clauses: 0
% 7.74/2.37 # Negative unit clauses : 4
% 7.74/2.37 # Non-unit-clauses : 233
% 7.74/2.37 # Current number of unprocessed clauses: 896
% 7.74/2.37 # ...number of literals in the above : 6729
% 7.74/2.37 # Current number of archived formulas : 0
% 7.74/2.37 # Current number of archived clauses : 8
% 7.74/2.37 # Clause-clause subsumption calls (NU) : 13794
% 7.74/2.37 # Rec. Clause-clause subsumption calls : 3411
% 7.74/2.37 # Non-unit clause-clause subsumptions : 169
% 7.74/2.37 # Unit Clause-clause subsumption calls : 47
% 7.74/2.37 # Rewrite failures with RHS unbound : 0
% 7.74/2.37 # BW rewrite match attempts : 0
% 7.74/2.37 # BW rewrite match successes : 0
% 7.74/2.37 # Condensation attempts : 0
% 7.74/2.37 # Condensation successes : 0
% 7.74/2.37 # Termbank termtop insertions : 30039
% 7.74/2.37
% 7.74/2.37 # -------------------------------------------------
% 7.74/2.37 # User time : 0.044 s
% 7.74/2.37 # System time : 0.006 s
% 7.74/2.37 # Total time : 0.050 s
% 7.74/2.37 # ...preprocessing : 0.019 s
% 7.74/2.37 # ...main loop : 0.031 s
% 7.74/2.37 # Maximum resident set size: 7136 pages
% 7.74/2.37
%------------------------------------------------------------------------------