TSTP Solution File: SWC061+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC061+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:13:21 EDT 2022
% Result : Theorem 9.60s 2.74s
% Output : CNFRefutation 9.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 24
% Syntax : Number of clauses : 84 ( 23 unt; 8 nHn; 84 RR)
% Number of literals : 206 ( 67 equ; 127 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_191) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_201) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_192) ).
cnf(i_0_204,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_204) ).
cnf(i_0_199,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_199) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_200) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_107) ).
cnf(i_0_194,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_194) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_110) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_197) ).
cnf(i_0_196,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_198) ).
cnf(i_0_195,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_195) ).
cnf(i_0_59,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_59) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_44) ).
cnf(i_0_156,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_156) ).
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_193) ).
cnf(i_0_149,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_149) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_159) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_58) ).
cnf(i_0_203,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_203) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_41) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_60) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6dz8p3on/input.p',i_0_43) ).
cnf(c_0_229,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_191 ).
cnf(c_0_230,negated_conjecture,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_231,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_232,negated_conjecture,
ssList(esk49_0),
i_0_204 ).
cnf(c_0_233,negated_conjecture,
( esk48_0 != nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_229,c_0_230]) ).
cnf(c_0_234,negated_conjecture,
( neq(esk51_0,nil)
| esk48_0 != nil ),
inference(rw,[status(thm)],[c_0_231,c_0_230]) ).
cnf(c_0_235,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_232,c_0_230]) ).
cnf(c_0_236,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_199 ).
cnf(c_0_237,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_238,negated_conjecture,
( esk48_0 != nil
| ~ segmentP(esk48_0,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_235])]) ).
cnf(c_0_239,negated_conjecture,
( esk48_0 = nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[c_0_236,c_0_237]) ).
cnf(c_0_240,negated_conjecture,
( esk51_0 != nil
| ~ segmentP(nil,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(spm,[status(thm)],[c_0_238,c_0_239]) ).
cnf(c_0_241,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_242,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
i_0_194 ).
cnf(c_0_243,plain,
( esk51_0 != nil
| ~ segmentP(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_235])]) ).
cnf(c_0_244,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_245,negated_conjecture,
( esk51_0 = nil
| neq(esk51_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_242,c_0_230]),c_0_230]) ).
cnf(c_0_246,plain,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_235])]) ).
cnf(c_0_247,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_248,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_196 ).
cnf(c_0_249,negated_conjecture,
neq(esk51_0,nil),
inference(sr,[status(thm)],[c_0_245,c_0_246]) ).
cnf(c_0_250,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_198 ).
cnf(c_0_251,negated_conjecture,
( esk51_0 = nil
| ssList(esk53_0) ),
inference(spm,[status(thm)],[c_0_247,c_0_245]) ).
cnf(c_0_252,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_253,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
i_0_59 ).
cnf(c_0_254,negated_conjecture,
app(cons(esk52_0,nil),esk53_0) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_248,c_0_249])]) ).
cnf(c_0_255,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_250,c_0_249])]) ).
cnf(c_0_256,negated_conjecture,
ssList(esk53_0),
inference(sr,[status(thm)],[c_0_251,c_0_246]) ).
cnf(c_0_257,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_258,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk48_0
| ~ neq(esk51_0,nil) ),
inference(rw,[status(thm)],[c_0_252,c_0_237]) ).
cnf(c_0_259,plain,
cons(esk52_0,app(nil,esk53_0)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_254]),c_0_255]),c_0_256]),c_0_257])]) ).
cnf(c_0_260,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
i_0_156 ).
cnf(c_0_261,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_193 ).
cnf(c_0_262,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_263,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_264,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_265,negated_conjecture,
app(esk53_0,cons(esk52_0,nil)) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_258,c_0_249])]) ).
cnf(c_0_266,plain,
( cons(esk52_0,nil) = esk51_0
| esk53_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_259,c_0_260]),c_0_256]),c_0_257])]) ).
cnf(c_0_267,negated_conjecture,
( esk51_0 = nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_261,c_0_230]),c_0_230]) ).
cnf(c_0_268,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_262,c_0_263]),c_0_257])]),c_0_264]) ).
cnf(c_0_269,negated_conjecture,
( app(esk53_0,esk51_0) = esk48_0
| esk53_0 != nil ),
inference(spm,[status(thm)],[c_0_265,c_0_266]) ).
cnf(c_0_270,negated_conjecture,
ssList(esk50_0),
i_0_203 ).
cnf(c_0_271,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_272,negated_conjecture,
( ~ segmentP(esk48_0,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_267,c_0_249]),c_0_235])]),c_0_246]) ).
cnf(c_0_273,negated_conjecture,
( segmentP(X1,esk51_0)
| esk53_0 != nil
| esk48_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_268,c_0_269]),c_0_256]),c_0_235])]) ).
cnf(c_0_274,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_270,c_0_237]) ).
cnf(c_0_275,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_271,c_0_257]) ).
cnf(c_0_276,negated_conjecture,
( esk53_0 != nil
| ~ segmentP(esk51_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_272,c_0_273]),c_0_274])]) ).
cnf(c_0_277,negated_conjecture,
( esk53_0 = nil
| neq(esk53_0,nil) ),
inference(spm,[status(thm)],[c_0_275,c_0_256]) ).
cnf(c_0_278,plain,
esk53_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_276,c_0_241]),c_0_235])]) ).
cnf(c_0_279,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_280,negated_conjecture,
neq(esk53_0,nil),
inference(sr,[status(thm)],[c_0_277,c_0_278]) ).
cnf(c_0_281,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_262,c_0_279]),c_0_257])]) ).
cnf(c_0_282,negated_conjecture,
( ~ segmentP(esk48_0,esk53_0)
| ~ segmentP(esk51_0,esk53_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_267,c_0_280]),c_0_256])]),c_0_246]) ).
cnf(c_0_283,negated_conjecture,
( segmentP(X1,esk53_0)
| esk48_0 != X1
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_281,c_0_265]),c_0_256])]) ).
cnf(c_0_284,negated_conjecture,
( ~ segmentP(esk51_0,esk53_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_282,c_0_283]),c_0_274])]) ).
cnf(c_0_285,negated_conjecture,
( segmentP(X1,esk53_0)
| esk51_0 != X1
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_268,c_0_254]),c_0_256])]) ).
cnf(c_0_286,negated_conjecture,
~ ssList(cons(esk52_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_284,c_0_285]),c_0_235])]) ).
cnf(c_0_287,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_288,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_286,c_0_287]),c_0_255]),c_0_257])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC061+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 18:27:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.60/2.74 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 9.60/2.74 # Version: 2.1pre011
% 9.60/2.74 # Preprocessing time : 0.023 s
% 9.60/2.74
% 9.60/2.74 # Proof found!
% 9.60/2.74 # SZS status Theorem
% 9.60/2.74 # SZS output start CNFRefutation
% See solution above
% 9.60/2.74 # Proof object total steps : 84
% 9.60/2.74 # Proof object clause steps : 60
% 9.60/2.74 # Proof object formula steps : 24
% 9.60/2.74 # Proof object conjectures : 53
% 9.60/2.74 # Proof object clause conjectures : 40
% 9.60/2.74 # Proof object formula conjectures : 13
% 9.60/2.74 # Proof object initial clauses used : 24
% 9.60/2.74 # Proof object initial formulas used : 24
% 9.60/2.74 # Proof object generating inferences : 22
% 9.60/2.74 # Proof object simplifying inferences : 61
% 9.60/2.74 # Training examples: 0 positive, 0 negative
% 9.60/2.74 # Parsed axioms : 203
% 9.60/2.74 # Removed by relevancy pruning/SinE : 0
% 9.60/2.74 # Initial clauses : 203
% 9.60/2.74 # Removed in clause preprocessing : 0
% 9.60/2.74 # Initial clauses in saturation : 203
% 9.60/2.74 # Processed clauses : 886
% 9.60/2.74 # ...of these trivial : 23
% 9.60/2.74 # ...subsumed : 274
% 9.60/2.74 # ...remaining for further processing : 589
% 9.60/2.74 # Other redundant clauses eliminated : 44
% 9.60/2.74 # Clauses deleted for lack of memory : 0
% 9.60/2.74 # Backward-subsumed : 20
% 9.60/2.74 # Backward-rewritten : 24
% 9.60/2.74 # Generated clauses : 8544
% 9.60/2.74 # ...of the previous two non-trivial : 8093
% 9.60/2.74 # Contextual simplify-reflections : 139
% 9.60/2.74 # Paramodulations : 8422
% 9.60/2.74 # Factorizations : 30
% 9.60/2.74 # Equation resolutions : 70
% 9.60/2.74 # Propositional unsat checks : 0
% 9.60/2.74 # Propositional unsat check successes : 0
% 9.60/2.74 # Current number of processed clauses : 517
% 9.60/2.74 # Positive orientable unit clauses : 57
% 9.60/2.74 # Positive unorientable unit clauses: 0
% 9.60/2.74 # Negative unit clauses : 14
% 9.60/2.74 # Non-unit-clauses : 446
% 9.60/2.74 # Current number of unprocessed clauses: 6295
% 9.60/2.74 # ...number of literals in the above : 26437
% 9.60/2.74 # Current number of archived formulas : 0
% 9.60/2.74 # Current number of archived clauses : 66
% 9.60/2.74 # Clause-clause subsumption calls (NU) : 35133
% 9.60/2.74 # Rec. Clause-clause subsumption calls : 10354
% 9.60/2.74 # Non-unit clause-clause subsumptions : 270
% 9.60/2.74 # Unit Clause-clause subsumption calls : 5228
% 9.60/2.74 # Rewrite failures with RHS unbound : 0
% 9.60/2.74 # BW rewrite match attempts : 14
% 9.60/2.74 # BW rewrite match successes : 14
% 9.60/2.74 # Condensation attempts : 0
% 9.60/2.74 # Condensation successes : 0
% 9.60/2.74 # Termbank termtop insertions : 127220
% 9.60/2.74
% 9.60/2.74 # -------------------------------------------------
% 9.60/2.74 # User time : 0.150 s
% 9.60/2.74 # System time : 0.005 s
% 9.60/2.74 # Total time : 0.155 s
% 9.60/2.74 # ...preprocessing : 0.023 s
% 9.60/2.74 # ...main loop : 0.132 s
% 9.60/2.74 # Maximum resident set size: 12368 pages
% 9.60/2.74
%------------------------------------------------------------------------------