TSTP Solution File: SWC309+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC309+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:53 EDT 2022
% Result : Theorem 8.19s 2.52s
% Output : CNFRefutation 8.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 15 unt; 6 nHn; 34 RR)
% Number of literals : 78 ( 31 equ; 46 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
( app(X1,cons(X2,nil)) != esk48_0
| app(cons(X2,nil),X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-la7nhh6c/input.p',i_0_193) ).
cnf(i_0_195,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-la7nhh6c/input.p',i_0_195) ).
cnf(i_0_196,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-la7nhh6c/input.p',i_0_196) ).
cnf(i_0_192,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-la7nhh6c/input.p',i_0_192) ).
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-la7nhh6c/input.p',i_0_154) ).
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-la7nhh6c/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-la7nhh6c/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-la7nhh6c/input.p',i_0_51) ).
cnf(i_0_199,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-la7nhh6c/input.p',i_0_199) ).
cnf(i_0_194,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-la7nhh6c/input.p',i_0_194) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-la7nhh6c/input.p',i_0_42) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-la7nhh6c/input.p',i_0_44) ).
cnf(c_0_212,negated_conjecture,
( app(X1,cons(X2,nil)) != esk48_0
| app(cons(X2,nil),X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_193 ).
cnf(c_0_213,negated_conjecture,
esk50_0 = esk48_0,
i_0_195 ).
cnf(c_0_214,negated_conjecture,
esk49_0 = esk51_0,
i_0_196 ).
cnf(c_0_215,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_192 ).
cnf(c_0_216,negated_conjecture,
( app(X1,cons(X2,nil)) != esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_213]),c_0_214]) ).
cnf(c_0_217,negated_conjecture,
( app(cons(X1,nil),X2) != esk51_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_218,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_219,plain,
( cons(X1,X2) != esk51_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_217,c_0_218]) ).
cnf(c_0_220,plain,
( nil = X1
| cons(esk26_1(X1),esk25_1(X1)) = X1
| ~ ssList(X1) ),
i_0_50 ).
cnf(c_0_221,plain,
( nil = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
i_0_52 ).
cnf(c_0_222,plain,
( nil = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
i_0_51 ).
cnf(c_0_223,negated_conjecture,
ssList(esk49_0),
i_0_199 ).
cnf(c_0_224,negated_conjecture,
neq(esk49_0,nil),
i_0_194 ).
cnf(c_0_225,plain,
( nil = X1
| X1 != esk51_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221]),c_0_222]) ).
cnf(c_0_226,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_223,c_0_214]) ).
cnf(c_0_227,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_228,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_224,c_0_214]) ).
cnf(c_0_229,negated_conjecture,
esk51_0 = nil,
inference(spm,[status(thm)],[c_0_225,c_0_226]) ).
cnf(c_0_230,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_227]) ).
cnf(c_0_231,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_228,c_0_229]) ).
cnf(c_0_232,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_233,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC309+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 11 23:48:35 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.45 # ENIGMATIC: Selected SinE mode:
% 0.21/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.19/2.52 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.19/2.52 # Version: 2.1pre011
% 8.19/2.52 # Preprocessing time : 0.012 s
% 8.19/2.52
% 8.19/2.52 # Proof found!
% 8.19/2.52 # SZS status Theorem
% 8.19/2.52 # SZS output start CNFRefutation
% See solution above
% 8.19/2.52 # Proof object total steps : 34
% 8.19/2.52 # Proof object clause steps : 22
% 8.19/2.52 # Proof object formula steps : 12
% 8.19/2.52 # Proof object conjectures : 18
% 8.19/2.52 # Proof object clause conjectures : 12
% 8.19/2.52 # Proof object formula conjectures : 6
% 8.19/2.52 # Proof object initial clauses used : 12
% 8.19/2.52 # Proof object initial formulas used : 12
% 8.19/2.52 # Proof object generating inferences : 4
% 8.19/2.52 # Proof object simplifying inferences : 11
% 8.19/2.52 # Training examples: 0 positive, 0 negative
% 8.19/2.52 # Parsed axioms : 198
% 8.19/2.52 # Removed by relevancy pruning/SinE : 0
% 8.19/2.52 # Initial clauses : 198
% 8.19/2.52 # Removed in clause preprocessing : 0
% 8.19/2.52 # Initial clauses in saturation : 198
% 8.19/2.52 # Processed clauses : 308
% 8.19/2.52 # ...of these trivial : 4
% 8.19/2.52 # ...subsumed : 60
% 8.19/2.52 # ...remaining for further processing : 244
% 8.19/2.52 # Other redundant clauses eliminated : 86
% 8.19/2.52 # Clauses deleted for lack of memory : 0
% 8.19/2.52 # Backward-subsumed : 9
% 8.19/2.52 # Backward-rewritten : 14
% 8.19/2.52 # Generated clauses : 1219
% 8.19/2.52 # ...of the previous two non-trivial : 1042
% 8.19/2.52 # Contextual simplify-reflections : 67
% 8.19/2.52 # Paramodulations : 1114
% 8.19/2.52 # Factorizations : 0
% 8.19/2.52 # Equation resolutions : 105
% 8.19/2.52 # Propositional unsat checks : 0
% 8.19/2.52 # Propositional unsat check successes : 0
% 8.19/2.52 # Current number of processed clauses : 215
% 8.19/2.52 # Positive orientable unit clauses : 14
% 8.19/2.52 # Positive unorientable unit clauses: 0
% 8.19/2.52 # Negative unit clauses : 2
% 8.19/2.52 # Non-unit-clauses : 199
% 8.19/2.52 # Current number of unprocessed clauses: 857
% 8.19/2.52 # ...number of literals in the above : 6319
% 8.19/2.52 # Current number of archived formulas : 0
% 8.19/2.52 # Current number of archived clauses : 23
% 8.19/2.52 # Clause-clause subsumption calls (NU) : 11103
% 8.19/2.52 # Rec. Clause-clause subsumption calls : 2584
% 8.19/2.52 # Non-unit clause-clause subsumptions : 135
% 8.19/2.52 # Unit Clause-clause subsumption calls : 59
% 8.19/2.52 # Rewrite failures with RHS unbound : 0
% 8.19/2.52 # BW rewrite match attempts : 1
% 8.19/2.52 # BW rewrite match successes : 1
% 8.19/2.52 # Condensation attempts : 0
% 8.19/2.52 # Condensation successes : 0
% 8.19/2.52 # Termbank termtop insertions : 28308
% 8.19/2.52
% 8.19/2.52 # -------------------------------------------------
% 8.19/2.52 # User time : 0.036 s
% 8.19/2.52 # System time : 0.002 s
% 8.19/2.52 # Total time : 0.038 s
% 8.19/2.52 # ...preprocessing : 0.012 s
% 8.19/2.52 # ...main loop : 0.026 s
% 8.19/2.52 # Maximum resident set size: 7132 pages
% 8.19/2.52
%------------------------------------------------------------------------------