TSTP Solution File: SWC392+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC392+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:15:24 EDT 2022
% Result : Theorem 6.38s 2.12s
% Output : CNFRefutation 6.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 42 ( 22 unt; 15 nHn; 42 RR)
% Number of literals : 77 ( 29 equ; 28 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_78,plain,
( X1 = X2
| memberP(X3,X2)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(cons(X1,X3),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_78) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| cons(esk53_0,nil) = esk50_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_195) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_44) ).
cnf(i_0_197,negated_conjecture,
( esk50_0 = nil
| ssItem(esk53_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_197) ).
cnf(i_0_79,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_79) ).
cnf(i_0_200,negated_conjecture,
memberP(esk48_0,esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_200) ).
cnf(i_0_202,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_202) ).
cnf(i_0_98,plain,
( singletonP(X1)
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_98) ).
cnf(i_0_199,negated_conjecture,
~ memberP(esk49_0,esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_199) ).
cnf(i_0_203,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_203) ).
cnf(i_0_201,negated_conjecture,
ssItem(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_201) ).
cnf(i_0_196,negated_conjecture,
( nil = esk51_0
| cons(esk53_0,nil) = esk50_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_196) ).
cnf(i_0_205,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_205) ).
cnf(i_0_198,negated_conjecture,
( nil = esk51_0
| ssItem(esk53_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_198) ).
cnf(i_0_193,negated_conjecture,
( esk50_0 = nil
| memberP(esk51_0,esk53_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_193) ).
cnf(i_0_80,plain,
~ singletonP(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vggria9k/input.p',i_0_80) ).
cnf(c_0_222,plain,
( X1 = X2
| memberP(X3,X2)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(cons(X1,X3),X2) ),
i_0_78 ).
cnf(c_0_223,negated_conjecture,
( esk50_0 = nil
| cons(esk53_0,nil) = esk50_0 ),
i_0_195 ).
cnf(c_0_224,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_225,negated_conjecture,
( esk50_0 = nil
| ssItem(esk53_0) ),
i_0_197 ).
cnf(c_0_226,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
i_0_79 ).
cnf(c_0_227,negated_conjecture,
memberP(esk48_0,esk52_0),
i_0_200 ).
cnf(c_0_228,negated_conjecture,
esk50_0 = esk48_0,
i_0_202 ).
cnf(c_0_229,plain,
( singletonP(X1)
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_98 ).
cnf(c_0_230,negated_conjecture,
~ memberP(esk49_0,esk52_0),
i_0_199 ).
cnf(c_0_231,negated_conjecture,
esk49_0 = esk51_0,
i_0_203 ).
cnf(c_0_232,negated_conjecture,
( esk50_0 = nil
| esk53_0 = X1
| ~ memberP(esk50_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_224])]),c_0_225]),c_0_226]) ).
cnf(c_0_233,negated_conjecture,
memberP(esk50_0,esk52_0),
inference(rw,[status(thm)],[c_0_227,c_0_228]) ).
cnf(c_0_234,negated_conjecture,
ssItem(esk52_0),
i_0_201 ).
cnf(c_0_235,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_229]) ).
cnf(c_0_236,negated_conjecture,
( nil = esk51_0
| cons(esk53_0,nil) = esk50_0 ),
i_0_196 ).
cnf(c_0_237,negated_conjecture,
ssList(esk50_0),
i_0_205 ).
cnf(c_0_238,negated_conjecture,
( nil = esk51_0
| ssItem(esk53_0) ),
i_0_198 ).
cnf(c_0_239,negated_conjecture,
~ memberP(esk51_0,esk52_0),
inference(rw,[status(thm)],[c_0_230,c_0_231]) ).
cnf(c_0_240,negated_conjecture,
( esk52_0 = esk53_0
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_234])]) ).
cnf(c_0_241,negated_conjecture,
( esk50_0 = nil
| memberP(esk51_0,esk53_0) ),
i_0_193 ).
cnf(c_0_242,negated_conjecture,
( esk51_0 = nil
| singletonP(esk50_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_237])]),c_0_238]) ).
cnf(c_0_243,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_241]) ).
cnf(c_0_244,plain,
~ singletonP(nil),
i_0_80 ).
cnf(c_0_245,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_242,c_0_243]),c_0_244]) ).
cnf(c_0_246,negated_conjecture,
~ memberP(nil,esk52_0),
inference(rw,[status(thm)],[c_0_239,c_0_245]) ).
cnf(c_0_247,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_243]),c_0_246]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC392+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Sun Jun 12 06:26:27 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.12/0.33 # ENIGMATIC: Selected SinE mode:
% 0.12/0.34 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.34 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.34 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.34 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.38/2.12 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.38/2.12 # Version: 2.1pre011
% 6.38/2.12 # Preprocessing time : 0.016 s
% 6.38/2.12
% 6.38/2.12 # Proof found!
% 6.38/2.12 # SZS status Theorem
% 6.38/2.12 # SZS output start CNFRefutation
% See solution above
% 6.38/2.12 # Proof object total steps : 42
% 6.38/2.12 # Proof object clause steps : 26
% 6.38/2.12 # Proof object formula steps : 16
% 6.38/2.12 # Proof object conjectures : 31
% 6.38/2.12 # Proof object clause conjectures : 20
% 6.38/2.12 # Proof object formula conjectures : 11
% 6.38/2.12 # Proof object initial clauses used : 16
% 6.38/2.12 # Proof object initial formulas used : 16
% 6.38/2.12 # Proof object generating inferences : 5
% 6.38/2.12 # Proof object simplifying inferences : 17
% 6.38/2.12 # Training examples: 0 positive, 0 negative
% 6.38/2.12 # Parsed axioms : 205
% 6.38/2.12 # Removed by relevancy pruning/SinE : 0
% 6.38/2.12 # Initial clauses : 205
% 6.38/2.12 # Removed in clause preprocessing : 0
% 6.38/2.12 # Initial clauses in saturation : 205
% 6.38/2.12 # Processed clauses : 463
% 6.38/2.12 # ...of these trivial : 7
% 6.38/2.12 # ...subsumed : 120
% 6.38/2.12 # ...remaining for further processing : 335
% 6.38/2.12 # Other redundant clauses eliminated : 101
% 6.38/2.12 # Clauses deleted for lack of memory : 0
% 6.38/2.12 # Backward-subsumed : 4
% 6.38/2.12 # Backward-rewritten : 97
% 6.38/2.12 # Generated clauses : 1807
% 6.38/2.12 # ...of the previous two non-trivial : 1618
% 6.38/2.12 # Contextual simplify-reflections : 232
% 6.38/2.12 # Paramodulations : 1662
% 6.38/2.12 # Factorizations : 0
% 6.38/2.12 # Equation resolutions : 145
% 6.38/2.12 # Propositional unsat checks : 0
% 6.38/2.12 # Propositional unsat check successes : 0
% 6.38/2.12 # Current number of processed clauses : 228
% 6.38/2.12 # Positive orientable unit clauses : 15
% 6.38/2.12 # Positive unorientable unit clauses: 0
% 6.38/2.12 # Negative unit clauses : 3
% 6.38/2.12 # Non-unit-clauses : 210
% 6.38/2.12 # Current number of unprocessed clauses: 953
% 6.38/2.12 # ...number of literals in the above : 7234
% 6.38/2.12 # Current number of archived formulas : 0
% 6.38/2.12 # Current number of archived clauses : 101
% 6.38/2.12 # Clause-clause subsumption calls (NU) : 18341
% 6.38/2.12 # Rec. Clause-clause subsumption calls : 3891
% 6.38/2.12 # Non-unit clause-clause subsumptions : 356
% 6.38/2.12 # Unit Clause-clause subsumption calls : 131
% 6.38/2.12 # Rewrite failures with RHS unbound : 0
% 6.38/2.12 # BW rewrite match attempts : 3
% 6.38/2.12 # BW rewrite match successes : 3
% 6.38/2.12 # Condensation attempts : 0
% 6.38/2.12 # Condensation successes : 0
% 6.38/2.12 # Termbank termtop insertions : 39646
% 6.38/2.12
% 6.38/2.12 # -------------------------------------------------
% 6.38/2.12 # User time : 0.062 s
% 6.38/2.12 # System time : 0.003 s
% 6.38/2.12 # Total time : 0.065 s
% 6.38/2.12 # ...preprocessing : 0.016 s
% 6.38/2.12 # ...main loop : 0.049 s
% 6.38/2.12 # Maximum resident set size: 7124 pages
% 6.38/2.12
%------------------------------------------------------------------------------