TSTP Solution File: SWC003+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC003+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:12:59 EDT 2022
% Result : Theorem 7.95s 2.85s
% Output : CNFRefutation 7.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 16 unt; 2 nHn; 37 RR)
% Number of literals : 80 ( 22 equ; 47 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_206,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_206) ).
cnf(i_0_208,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_208) ).
cnf(i_0_203,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,X3),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ neq(X3,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_203) ).
cnf(i_0_207,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_207) ).
cnf(i_0_195,negated_conjecture,
( app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_195) ).
cnf(i_0_193,negated_conjecture,
( app(esk53_0,esk54_0) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk54_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_197) ).
cnf(i_0_199,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_199) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_44) ).
cnf(i_0_201,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_201) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_43) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-krcvvsgh/input.p',i_0_53) ).
cnf(c_0_222,negated_conjecture,
neq(esk49_0,nil),
i_0_206 ).
cnf(c_0_223,negated_conjecture,
esk49_0 = esk51_0,
i_0_208 ).
cnf(c_0_224,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,X3),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ neq(X3,nil)
| ~ neq(esk51_0,nil) ),
i_0_203 ).
cnf(c_0_225,negated_conjecture,
esk50_0 = esk48_0,
i_0_207 ).
cnf(c_0_226,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_227,negated_conjecture,
( app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_228,negated_conjecture,
( app(esk53_0,esk54_0) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_229,negated_conjecture,
( ssList(esk54_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_230,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_199 ).
cnf(c_0_231,negated_conjecture,
( app(app(X1,X2),X3) != esk51_0
| app(X1,X3) != esk50_0
| ~ neq(X2,nil)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_225]),c_0_223]),c_0_226])]) ).
cnf(c_0_232,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_227,c_0_226])]) ).
cnf(c_0_233,negated_conjecture,
app(esk53_0,esk54_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_226])]) ).
cnf(c_0_234,negated_conjecture,
ssList(esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_226])]) ).
cnf(c_0_235,negated_conjecture,
ssList(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_226])]) ).
cnf(c_0_236,negated_conjecture,
( ~ neq(cons(esk52_0,nil),nil)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_233]),c_0_234]),c_0_235])]) ).
cnf(c_0_237,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_238,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_239,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_201 ).
cnf(c_0_240,plain,
( cons(esk52_0,nil) = nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_238])]) ).
cnf(c_0_241,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_242,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_226])]) ).
cnf(c_0_243,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_244,plain,
cons(esk52_0,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242]),c_0_238])]) ).
cnf(c_0_245,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_242]),c_0_238])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC003+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 00:04:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.95/2.85 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.95/2.85 # Version: 2.1pre011
% 7.95/2.85 # Preprocessing time : 0.024 s
% 7.95/2.85
% 7.95/2.85 # Proof found!
% 7.95/2.85 # SZS status Theorem
% 7.95/2.85 # SZS output start CNFRefutation
% See solution above
% 7.95/2.85 # Proof object total steps : 37
% 7.95/2.85 # Proof object clause steps : 24
% 7.95/2.85 # Proof object formula steps : 13
% 7.95/2.85 # Proof object conjectures : 26
% 7.95/2.85 # Proof object clause conjectures : 17
% 7.95/2.85 # Proof object formula conjectures : 9
% 7.95/2.85 # Proof object initial clauses used : 13
% 7.95/2.85 # Proof object initial formulas used : 13
% 7.95/2.85 # Proof object generating inferences : 4
% 7.95/2.85 # Proof object simplifying inferences : 27
% 7.95/2.85 # Training examples: 0 positive, 0 negative
% 7.95/2.85 # Parsed axioms : 210
% 7.95/2.85 # Removed by relevancy pruning/SinE : 0
% 7.95/2.85 # Initial clauses : 210
% 7.95/2.85 # Removed in clause preprocessing : 0
% 7.95/2.85 # Initial clauses in saturation : 210
% 7.95/2.85 # Processed clauses : 229
% 7.95/2.85 # ...of these trivial : 10
% 7.95/2.85 # ...subsumed : 4
% 7.95/2.85 # ...remaining for further processing : 215
% 7.95/2.85 # Other redundant clauses eliminated : 82
% 7.95/2.85 # Clauses deleted for lack of memory : 0
% 7.95/2.85 # Backward-subsumed : 0
% 7.95/2.85 # Backward-rewritten : 8
% 7.95/2.85 # Generated clauses : 982
% 7.95/2.85 # ...of the previous two non-trivial : 793
% 7.95/2.85 # Contextual simplify-reflections : 2
% 7.95/2.85 # Paramodulations : 883
% 7.95/2.85 # Factorizations : 0
% 7.95/2.85 # Equation resolutions : 99
% 7.95/2.85 # Propositional unsat checks : 0
% 7.95/2.85 # Propositional unsat check successes : 0
% 7.95/2.85 # Current number of processed clauses : 201
% 7.95/2.85 # Positive orientable unit clauses : 20
% 7.95/2.85 # Positive unorientable unit clauses: 0
% 7.95/2.85 # Negative unit clauses : 2
% 7.95/2.85 # Non-unit-clauses : 179
% 7.95/2.85 # Current number of unprocessed clauses: 733
% 7.95/2.85 # ...number of literals in the above : 5464
% 7.95/2.85 # Current number of archived formulas : 0
% 7.95/2.85 # Current number of archived clauses : 8
% 7.95/2.85 # Clause-clause subsumption calls (NU) : 6829
% 7.95/2.85 # Rec. Clause-clause subsumption calls : 1806
% 7.95/2.85 # Non-unit clause-clause subsumptions : 6
% 7.95/2.85 # Unit Clause-clause subsumption calls : 1
% 7.95/2.85 # Rewrite failures with RHS unbound : 0
% 7.95/2.85 # BW rewrite match attempts : 1
% 7.95/2.85 # BW rewrite match successes : 1
% 7.95/2.85 # Condensation attempts : 0
% 7.95/2.85 # Condensation successes : 0
% 7.95/2.85 # Termbank termtop insertions : 25242
% 7.95/2.85
% 7.95/2.85 # -------------------------------------------------
% 7.95/2.85 # User time : 0.051 s
% 7.95/2.85 # System time : 0.005 s
% 7.95/2.85 # Total time : 0.056 s
% 7.95/2.85 # ...preprocessing : 0.024 s
% 7.95/2.85 # ...main loop : 0.032 s
% 7.95/2.85 # Maximum resident set size: 7124 pages
% 7.95/2.85
%------------------------------------------------------------------------------