TSTP Solution File: SWC241+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC241+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:29 EDT 2022
% Result : Theorem 7.56s 2.38s
% Output : CNFRefutation 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 10 unt; 8 nHn; 30 RR)
% Number of literals : 83 ( 26 equ; 52 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_197,negated_conjecture,
( lt(X1,esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-48eeexji/input.p',i_0_197) ).
cnf(i_0_202,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-48eeexji/input.p',i_0_202) ).
cnf(i_0_200,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/sandbox/tmp/enigma-theBenchmark.p-48eeexji/input.p',i_0_200) ).
cnf(i_0_196,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ leq(X2,esk52_3(X2,X1,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-48eeexji/input.p',i_0_196) ).
cnf(i_0_201,negated_conjecture,
nil != esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-48eeexji/input.p',i_0_201) ).
cnf(i_0_178,plain,
( leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-48eeexji/input.p',i_0_178) ).
cnf(i_0_192,negated_conjecture,
( esk50_0 = nil
| app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk50_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-48eeexji/input.p',i_0_192) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| ssItem(esk53_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-48eeexji/input.p',i_0_195) ).
cnf(i_0_193,negated_conjecture,
( esk50_0 = nil
| ssList(esk55_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-48eeexji/input.p',i_0_193) ).
cnf(i_0_194,negated_conjecture,
( esk50_0 = nil
| ssList(esk54_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-48eeexji/input.p',i_0_194) ).
cnf(c_0_213,negated_conjecture,
( lt(X1,esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_197 ).
cnf(c_0_214,negated_conjecture,
esk50_0 = esk48_0,
i_0_202 ).
cnf(c_0_215,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_200 ).
cnf(c_0_216,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ leq(X2,esk52_3(X2,X1,X3)) ),
i_0_196 ).
cnf(c_0_217,negated_conjecture,
nil != esk48_0,
i_0_201 ).
cnf(c_0_218,plain,
( leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X1,X2) ),
i_0_178 ).
cnf(c_0_219,negated_conjecture,
( lt(X1,esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk50_0
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[c_0_213,c_0_214]) ).
cnf(c_0_220,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk50_0
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[c_0_215,c_0_214]) ).
cnf(c_0_221,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk50_0
| ~ leq(X2,esk52_3(X2,X1,X3))
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_216,c_0_214]) ).
cnf(c_0_222,negated_conjecture,
( esk50_0 = nil
| app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk50_0 ),
i_0_192 ).
cnf(c_0_223,negated_conjecture,
esk50_0 != nil,
inference(rw,[status(thm)],[c_0_217,c_0_214]) ).
cnf(c_0_224,negated_conjecture,
( esk50_0 = nil
| ssItem(esk53_0) ),
i_0_195 ).
cnf(c_0_225,negated_conjecture,
( esk50_0 = nil
| ssList(esk55_0) ),
i_0_193 ).
cnf(c_0_226,negated_conjecture,
( esk50_0 = nil
| ssList(esk54_0) ),
i_0_194 ).
cnf(c_0_227,plain,
( app(app(X1,cons(X2,nil)),X3) != esk50_0
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_220]),c_0_221]) ).
cnf(c_0_228,negated_conjecture,
app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk50_0,
inference(sr,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_229,negated_conjecture,
ssItem(esk53_0),
inference(sr,[status(thm)],[c_0_224,c_0_223]) ).
cnf(c_0_230,negated_conjecture,
ssList(esk55_0),
inference(sr,[status(thm)],[c_0_225,c_0_223]) ).
cnf(c_0_231,negated_conjecture,
ssList(esk54_0),
inference(sr,[status(thm)],[c_0_226,c_0_223]) ).
cnf(c_0_232,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229]),c_0_230]),c_0_231])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC241+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 : Mon Jun 13 00:52:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.56/2.38 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.56/2.38 # Version: 2.1pre011
% 7.56/2.38 # Preprocessing time : 0.024 s
% 7.56/2.38
% 7.56/2.38 # Proof found!
% 7.56/2.38 # SZS status Theorem
% 7.56/2.38 # SZS output start CNFRefutation
% See solution above
% 7.56/2.38 # Proof object total steps : 30
% 7.56/2.38 # Proof object clause steps : 20
% 7.56/2.38 # Proof object formula steps : 10
% 7.56/2.38 # Proof object conjectures : 27
% 7.56/2.38 # Proof object clause conjectures : 18
% 7.56/2.38 # Proof object formula conjectures : 9
% 7.56/2.38 # Proof object initial clauses used : 10
% 7.56/2.38 # Proof object initial formulas used : 10
% 7.56/2.38 # Proof object generating inferences : 2
% 7.56/2.38 # Proof object simplifying inferences : 14
% 7.56/2.38 # Training examples: 0 positive, 0 negative
% 7.56/2.38 # Parsed axioms : 205
% 7.56/2.38 # Removed by relevancy pruning/SinE : 0
% 7.56/2.38 # Initial clauses : 205
% 7.56/2.38 # Removed in clause preprocessing : 0
% 7.56/2.38 # Initial clauses in saturation : 205
% 7.56/2.38 # Processed clauses : 359
% 7.56/2.38 # ...of these trivial : 4
% 7.56/2.38 # ...subsumed : 62
% 7.56/2.38 # ...remaining for further processing : 293
% 7.56/2.38 # Other redundant clauses eliminated : 86
% 7.56/2.38 # Clauses deleted for lack of memory : 0
% 7.56/2.38 # Backward-subsumed : 23
% 7.56/2.38 # Backward-rewritten : 1
% 7.56/2.38 # Generated clauses : 1516
% 7.56/2.38 # ...of the previous two non-trivial : 1312
% 7.56/2.38 # Contextual simplify-reflections : 73
% 7.56/2.38 # Paramodulations : 1405
% 7.56/2.38 # Factorizations : 0
% 7.56/2.38 # Equation resolutions : 107
% 7.56/2.38 # Propositional unsat checks : 0
% 7.56/2.38 # Propositional unsat check successes : 0
% 7.56/2.38 # Current number of processed clauses : 259
% 7.56/2.38 # Positive orientable unit clauses : 18
% 7.56/2.38 # Positive unorientable unit clauses: 0
% 7.56/2.38 # Negative unit clauses : 4
% 7.56/2.38 # Non-unit-clauses : 237
% 7.56/2.38 # Current number of unprocessed clauses: 1037
% 7.56/2.38 # ...number of literals in the above : 7425
% 7.56/2.38 # Current number of archived formulas : 0
% 7.56/2.38 # Current number of archived clauses : 28
% 7.56/2.38 # Clause-clause subsumption calls (NU) : 12653
% 7.56/2.38 # Rec. Clause-clause subsumption calls : 2900
% 7.56/2.38 # Non-unit clause-clause subsumptions : 142
% 7.56/2.38 # Unit Clause-clause subsumption calls : 116
% 7.56/2.38 # Rewrite failures with RHS unbound : 0
% 7.56/2.38 # BW rewrite match attempts : 1
% 7.56/2.38 # BW rewrite match successes : 1
% 7.56/2.38 # Condensation attempts : 0
% 7.56/2.38 # Condensation successes : 0
% 7.56/2.38 # Termbank termtop insertions : 34892
% 7.56/2.38
% 7.56/2.38 # -------------------------------------------------
% 7.56/2.38 # User time : 0.073 s
% 7.56/2.38 # System time : 0.006 s
% 7.56/2.38 # Total time : 0.079 s
% 7.56/2.38 # ...preprocessing : 0.024 s
% 7.56/2.38 # ...main loop : 0.056 s
% 7.56/2.38 # Maximum resident set size: 7128 pages
% 7.56/2.38
%------------------------------------------------------------------------------