TSTP Solution File: SWC079+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC079+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:28 EDT 2022
% Result : Theorem 8.99s 2.69s
% Output : CNFRefutation 8.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 25
% Syntax : Number of clauses : 81 ( 26 unt; 14 nHn; 81 RR)
% Number of literals : 228 ( 59 equ; 144 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_196,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_198) ).
cnf(i_0_193,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_197) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_201) ).
cnf(i_0_105,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_105) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_110) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_44) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_109) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_200) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_41) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_107) ).
cnf(i_0_191,negated_conjecture,
( esk50_0 = X1
| hd(esk51_0) != X2
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_191) ).
cnf(i_0_142,plain,
( nil = X1
| hd(X1) = esk34_1(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_142) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_43) ).
cnf(i_0_143,plain,
( nil = X1
| ssItem(esk34_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_143) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_53) ).
cnf(i_0_89,plain,
( frontsegP(cons(X1,X2),cons(X3,X4))
| X1 != X3
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_89) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_56) ).
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/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_60) ).
cnf(i_0_92,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_92) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_147) ).
cnf(i_0_114,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_114) ).
cnf(i_0_115,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t2a1himg/input.p',i_0_115) ).
cnf(c_0_227,negated_conjecture,
neq(esk49_0,nil),
i_0_196 ).
cnf(c_0_228,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_229,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_230,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_231,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_227,c_0_228]) ).
cnf(c_0_232,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_233,negated_conjecture,
( ~ segmentP(esk50_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_230]),c_0_228]),c_0_231])]) ).
cnf(c_0_234,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_232,c_0_228]) ).
cnf(c_0_235,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
i_0_105 ).
cnf(c_0_236,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_237,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_238,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_239,negated_conjecture,
( ~ segmentP(esk50_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_231]),c_0_234])]) ).
cnf(c_0_240,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
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_241,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_242,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_243,negated_conjecture,
( esk51_0 != nil
| ~ segmentP(esk51_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_234]),c_0_241])]) ).
cnf(c_0_244,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_245,negated_conjecture,
( esk50_0 = X1
| hd(esk51_0) != X2
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_246,negated_conjecture,
( X1 = esk51_0
| neq(X1,esk51_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_242,c_0_234]) ).
cnf(c_0_247,plain,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_234])]) ).
cnf(c_0_248,negated_conjecture,
( esk50_0 = X1
| cons(X2,nil) != X1
| hd(esk51_0) != X2
| ~ neq(nil,esk51_0)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_245,c_0_231])]) ).
cnf(c_0_249,plain,
neq(nil,esk51_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_237]),c_0_247]) ).
cnf(c_0_250,plain,
( nil = X1
| hd(X1) = esk34_1(X1)
| ~ ssList(X1) ),
i_0_142 ).
cnf(c_0_251,negated_conjecture,
( esk50_0 = X1
| cons(X2,nil) != X1
| hd(esk51_0) != X2
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_248,c_0_249])]) ).
cnf(c_0_252,negated_conjecture,
( esk34_1(esk51_0) = hd(esk51_0)
| esk51_0 = nil ),
inference(spm,[status(thm)],[c_0_250,c_0_234]) ).
cnf(c_0_253,negated_conjecture,
( cons(X1,nil) = esk50_0
| hd(esk51_0) != X1
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_251]) ).
cnf(c_0_254,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_255,plain,
( nil = X1
| ssItem(esk34_1(X1))
| ~ ssList(X1) ),
i_0_143 ).
cnf(c_0_256,negated_conjecture,
esk34_1(esk51_0) = hd(esk51_0),
inference(sr,[status(thm)],[c_0_252,c_0_247]) ).
cnf(c_0_257,plain,
( cons(X1,nil) = esk50_0
| hd(esk51_0) != X1
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_254]),c_0_237])]) ).
cnf(c_0_258,plain,
ssItem(hd(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_255,c_0_256]),c_0_234])]),c_0_247]) ).
cnf(c_0_259,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_260,plain,
cons(hd(esk51_0),nil) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_257]),c_0_258])]) ).
cnf(c_0_261,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_242,c_0_237]) ).
cnf(c_0_262,plain,
esk50_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_258]),c_0_237])]) ).
cnf(c_0_263,plain,
( frontsegP(cons(X1,X2),cons(X3,X4))
| X1 != X3
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X4) ),
i_0_89 ).
cnf(c_0_264,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_265,negated_conjecture,
neq(esk50_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_261,c_0_241]),c_0_262]) ).
cnf(c_0_266,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_267,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_268,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_263]) ).
cnf(c_0_269,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
i_0_92 ).
cnf(c_0_270,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_271,negated_conjecture,
( esk51_0 = nil
| ssList(tl(esk51_0)) ),
inference(spm,[status(thm)],[c_0_264,c_0_234]) ).
cnf(c_0_272,negated_conjecture,
( ~ segmentP(esk50_0,esk50_0)
| ~ segmentP(esk51_0,esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_265]),c_0_241])]) ).
cnf(c_0_273,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_266,c_0_267]),c_0_237])]) ).
cnf(c_0_274,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
i_0_114 ).
cnf(c_0_275,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
i_0_115 ).
cnf(c_0_276,plain,
( frontsegP(cons(hd(esk51_0),X1),esk50_0)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_268,c_0_260]),c_0_258]),c_0_237])]),c_0_269]) ).
cnf(c_0_277,negated_conjecture,
cons(hd(esk51_0),tl(esk51_0)) = esk51_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_270,c_0_234]),c_0_247]) ).
cnf(c_0_278,negated_conjecture,
ssList(tl(esk51_0)),
inference(sr,[status(thm)],[c_0_271,c_0_247]) ).
cnf(c_0_279,plain,
~ segmentP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_272,c_0_244]),c_0_241])]) ).
cnf(c_0_280,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_273,c_0_274])]),c_0_275]) ).
cnf(c_0_281,plain,
frontsegP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_276,c_0_277]),c_0_278])]) ).
cnf(c_0_282,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_279,c_0_280]),c_0_281]),c_0_241]),c_0_234])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC079+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jun 13 00:44:13 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected SinE mode:
% 0.22/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.99/2.69 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.99/2.69 # Version: 2.1pre011
% 8.99/2.69 # Preprocessing time : 0.023 s
% 8.99/2.69
% 8.99/2.69 # Proof found!
% 8.99/2.69 # SZS status Theorem
% 8.99/2.69 # SZS output start CNFRefutation
% See solution above
% 8.99/2.69 # Proof object total steps : 81
% 8.99/2.69 # Proof object clause steps : 56
% 8.99/2.69 # Proof object formula steps : 25
% 8.99/2.69 # Proof object conjectures : 30
% 8.99/2.69 # Proof object clause conjectures : 23
% 8.99/2.69 # Proof object formula conjectures : 7
% 8.99/2.69 # Proof object initial clauses used : 25
% 8.99/2.69 # Proof object initial formulas used : 25
% 8.99/2.69 # Proof object generating inferences : 23
% 8.99/2.69 # Proof object simplifying inferences : 54
% 8.99/2.69 # Training examples: 0 positive, 0 negative
% 8.99/2.69 # Parsed axioms : 200
% 8.99/2.69 # Removed by relevancy pruning/SinE : 0
% 8.99/2.69 # Initial clauses : 200
% 8.99/2.69 # Removed in clause preprocessing : 0
% 8.99/2.69 # Initial clauses in saturation : 200
% 8.99/2.69 # Processed clauses : 854
% 8.99/2.69 # ...of these trivial : 49
% 8.99/2.69 # ...subsumed : 200
% 8.99/2.69 # ...remaining for further processing : 605
% 8.99/2.69 # Other redundant clauses eliminated : 45
% 8.99/2.69 # Clauses deleted for lack of memory : 0
% 8.99/2.69 # Backward-subsumed : 6
% 8.99/2.69 # Backward-rewritten : 24
% 8.99/2.69 # Generated clauses : 9258
% 8.99/2.69 # ...of the previous two non-trivial : 8840
% 8.99/2.69 # Contextual simplify-reflections : 103
% 8.99/2.69 # Paramodulations : 9137
% 8.99/2.69 # Factorizations : 30
% 8.99/2.69 # Equation resolutions : 79
% 8.99/2.69 # Propositional unsat checks : 0
% 8.99/2.69 # Propositional unsat check successes : 0
% 8.99/2.69 # Current number of processed clauses : 557
% 8.99/2.69 # Positive orientable unit clauses : 48
% 8.99/2.69 # Positive unorientable unit clauses: 0
% 8.99/2.69 # Negative unit clauses : 18
% 8.99/2.69 # Non-unit-clauses : 491
% 8.99/2.69 # Current number of unprocessed clauses: 7336
% 8.99/2.69 # ...number of literals in the above : 30279
% 8.99/2.69 # Current number of archived formulas : 0
% 8.99/2.69 # Current number of archived clauses : 42
% 8.99/2.69 # Clause-clause subsumption calls (NU) : 37926
% 8.99/2.69 # Rec. Clause-clause subsumption calls : 11682
% 8.99/2.69 # Non-unit clause-clause subsumptions : 234
% 8.99/2.69 # Unit Clause-clause subsumption calls : 3281
% 8.99/2.69 # Rewrite failures with RHS unbound : 0
% 8.99/2.69 # BW rewrite match attempts : 10
% 8.99/2.69 # BW rewrite match successes : 10
% 8.99/2.69 # Condensation attempts : 0
% 8.99/2.69 # Condensation successes : 0
% 8.99/2.69 # Termbank termtop insertions : 147545
% 8.99/2.69
% 8.99/2.69 # -------------------------------------------------
% 8.99/2.69 # User time : 0.135 s
% 8.99/2.69 # System time : 0.008 s
% 8.99/2.69 # Total time : 0.143 s
% 8.99/2.69 # ...preprocessing : 0.023 s
% 8.99/2.69 # ...main loop : 0.120 s
% 8.99/2.69 # Maximum resident set size: 13688 pages
% 8.99/2.69
%------------------------------------------------------------------------------