TSTP Solution File: SWC053+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC053+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:18 EDT 2022
% Result : Theorem 8.29s 2.55s
% Output : CNFRefutation 8.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 27
% Syntax : Number of clauses : 88 ( 18 unt; 22 nHn; 88 RR)
% Number of literals : 234 ( 74 equ; 137 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_85,plain,
( frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ frontsegP(X3,X2)
| ~ frontsegP(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_85) ).
cnf(i_0_196,negated_conjecture,
( nil = esk51_0
| frontsegP(esk50_0,esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_196) ).
cnf(i_0_206,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_206) ).
cnf(i_0_202,negated_conjecture,
( nil = esk51_0
| ssList(esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_202) ).
cnf(i_0_94,plain,
( nil = X1
| ~ ssList(X1)
| ~ frontsegP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_94) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_44) ).
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-nccx4d57/input.p',i_0_191) ).
cnf(i_0_203,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_203) ).
cnf(i_0_204,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_204) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_192) ).
cnf(i_0_207,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_207) ).
cnf(i_0_93,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_93) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_42) ).
cnf(i_0_200,negated_conjecture,
( nil = esk51_0
| neq(esk52_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_200) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_107) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_109) ).
cnf(i_0_197,negated_conjecture,
( esk50_0 = nil
| frontsegP(esk51_0,esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_197) ).
cnf(i_0_201,negated_conjecture,
( esk50_0 = nil
| ssList(esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_201) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| frontsegP(esk50_0,esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_195) ).
cnf(i_0_92,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_92) ).
cnf(i_0_86,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| ~ frontsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_86) ).
cnf(i_0_199,negated_conjecture,
( esk50_0 = nil
| neq(esk52_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_199) ).
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-nccx4d57/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-nccx4d57/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_60) ).
cnf(i_0_114,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/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/sandbox2/tmp/enigma-theBenchmark.p-nccx4d57/input.p',i_0_115) ).
cnf(c_0_235,plain,
( frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ frontsegP(X3,X2)
| ~ frontsegP(X1,X3) ),
i_0_85 ).
cnf(c_0_236,negated_conjecture,
( nil = esk51_0
| frontsegP(esk50_0,esk52_0) ),
i_0_196 ).
cnf(c_0_237,negated_conjecture,
ssList(esk50_0),
i_0_206 ).
cnf(c_0_238,negated_conjecture,
( nil = esk51_0
| ssList(esk52_0) ),
i_0_202 ).
cnf(c_0_239,plain,
( nil = X1
| ~ ssList(X1)
| ~ frontsegP(nil,X1) ),
i_0_94 ).
cnf(c_0_240,negated_conjecture,
( esk51_0 = nil
| frontsegP(X1,esk52_0)
| ~ frontsegP(X1,esk50_0)
| ~ 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,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_242,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_191 ).
cnf(c_0_243,negated_conjecture,
esk50_0 = esk48_0,
i_0_203 ).
cnf(c_0_244,negated_conjecture,
esk49_0 = esk51_0,
i_0_204 ).
cnf(c_0_245,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_246,negated_conjecture,
ssList(esk49_0),
i_0_207 ).
cnf(c_0_247,plain,
( esk51_0 = nil
| esk52_0 = nil
| ~ frontsegP(nil,esk50_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_241])]),c_0_238]) ).
cnf(c_0_248,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_93 ).
cnf(c_0_249,negated_conjecture,
( esk50_0 != nil
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_242,c_0_243]),c_0_243]),c_0_244]) ).
cnf(c_0_250,negated_conjecture,
( neq(esk51_0,nil)
| esk50_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_245,c_0_244]),c_0_243]) ).
cnf(c_0_251,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_246,c_0_244]) ).
cnf(c_0_252,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_253,negated_conjecture,
( nil = esk51_0
| neq(esk52_0,nil) ),
i_0_200 ).
cnf(c_0_254,plain,
( esk52_0 = nil
| esk51_0 = nil
| esk50_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_237])]) ).
cnf(c_0_255,negated_conjecture,
( esk50_0 != nil
| ~ segmentP(esk50_0,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_251])]) ).
cnf(c_0_256,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_257,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_252]) ).
cnf(c_0_258,negated_conjecture,
( esk51_0 = nil
| neq(nil,nil)
| esk50_0 != nil ),
inference(spm,[status(thm)],[c_0_253,c_0_254]) ).
cnf(c_0_259,plain,
( esk50_0 != nil
| ~ segmentP(esk50_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_255,c_0_256]),c_0_251])]) ).
cnf(c_0_260,plain,
( esk51_0 = nil
| esk50_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_258]),c_0_241])]) ).
cnf(c_0_261,plain,
( esk50_0 != nil
| ~ segmentP(esk50_0,nil) ),
inference(spm,[status(thm)],[c_0_259,c_0_260]) ).
cnf(c_0_262,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_263,negated_conjecture,
( esk50_0 = nil
| frontsegP(esk51_0,esk52_0) ),
i_0_197 ).
cnf(c_0_264,plain,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_261,c_0_262]),c_0_237])]) ).
cnf(c_0_265,negated_conjecture,
( esk50_0 = nil
| ssList(esk52_0) ),
i_0_201 ).
cnf(c_0_266,negated_conjecture,
frontsegP(esk51_0,esk52_0),
inference(sr,[status(thm)],[c_0_263,c_0_264]) ).
cnf(c_0_267,negated_conjecture,
ssList(esk52_0),
inference(sr,[status(thm)],[c_0_265,c_0_264]) ).
cnf(c_0_268,negated_conjecture,
( esk50_0 = nil
| frontsegP(X1,esk52_0)
| ~ frontsegP(X1,esk51_0)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_263]),c_0_251])]),c_0_265]) ).
cnf(c_0_269,negated_conjecture,
( esk50_0 = nil
| frontsegP(esk50_0,esk52_0) ),
i_0_195 ).
cnf(c_0_270,plain,
( frontsegP(X1,esk52_0)
| ~ frontsegP(X1,esk51_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_266]),c_0_251]),c_0_267])]) ).
cnf(c_0_271,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
i_0_92 ).
cnf(c_0_272,plain,
( esk50_0 = nil
| esk52_0 = nil
| ~ frontsegP(nil,esk51_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_268]),c_0_241])]),c_0_265]) ).
cnf(c_0_273,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| ~ frontsegP(X1,X2) ),
i_0_86 ).
cnf(c_0_274,negated_conjecture,
frontsegP(esk50_0,esk52_0),
inference(sr,[status(thm)],[c_0_269,c_0_264]) ).
cnf(c_0_275,plain,
( esk52_0 = nil
| ~ frontsegP(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_270]),c_0_267]),c_0_241])]) ).
cnf(c_0_276,plain,
( frontsegP(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_248]),c_0_241])]),c_0_271]) ).
cnf(c_0_277,negated_conjecture,
( esk50_0 = nil
| neq(esk52_0,nil) ),
i_0_199 ).
cnf(c_0_278,plain,
( esk52_0 = nil
| esk50_0 = nil
| esk51_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_272,c_0_248]),c_0_251])]) ).
cnf(c_0_279,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_193 ).
cnf(c_0_280,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_281,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_282,plain,
( esk52_0 = esk50_0
| ~ frontsegP(esk52_0,esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_273,c_0_274]),c_0_237]),c_0_267])]) ).
cnf(c_0_283,plain,
( esk52_0 = nil
| esk51_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_275,c_0_276]),c_0_251]),c_0_241])]) ).
cnf(c_0_284,negated_conjecture,
( esk50_0 = nil
| neq(nil,nil)
| esk51_0 != nil ),
inference(spm,[status(thm)],[c_0_277,c_0_278]) ).
cnf(c_0_285,negated_conjecture,
( esk51_0 = nil
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_279,c_0_244]),c_0_243]),c_0_244]) ).
cnf(c_0_286,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_280,c_0_281]),c_0_241])]) ).
cnf(c_0_287,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
i_0_114 ).
cnf(c_0_288,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
i_0_115 ).
cnf(c_0_289,plain,
( esk51_0 != nil
| ~ frontsegP(nil,esk50_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_282,c_0_283]),c_0_264]) ).
cnf(c_0_290,plain,
( esk50_0 = nil
| esk51_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_284]),c_0_241])]) ).
cnf(c_0_291,negated_conjecture,
( esk51_0 = nil
| ~ segmentP(esk50_0,esk52_0)
| ~ segmentP(esk51_0,esk52_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_285,c_0_253]),c_0_238]) ).
cnf(c_0_292,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_286,c_0_287])]),c_0_288]) ).
cnf(c_0_293,plain,
esk51_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_289,c_0_276]),c_0_237]),c_0_241])]),c_0_290]) ).
cnf(c_0_294,negated_conjecture,
~ segmentP(esk50_0,esk52_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_291,c_0_292]),c_0_266]),c_0_267]),c_0_251])]),c_0_293]) ).
cnf(c_0_295,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_294,c_0_292]),c_0_274]),c_0_267]),c_0_237])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC053+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 21:40:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/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
% 8.29/2.55 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.29/2.55 # Version: 2.1pre011
% 8.29/2.55 # Preprocessing time : 0.016 s
% 8.29/2.55
% 8.29/2.55 # Proof found!
% 8.29/2.55 # SZS status Theorem
% 8.29/2.55 # SZS output start CNFRefutation
% See solution above
% 8.29/2.55 # Proof object total steps : 88
% 8.29/2.55 # Proof object clause steps : 61
% 8.29/2.55 # Proof object formula steps : 27
% 8.29/2.55 # Proof object conjectures : 42
% 8.29/2.55 # Proof object clause conjectures : 28
% 8.29/2.55 # Proof object formula conjectures : 14
% 8.29/2.55 # Proof object initial clauses used : 27
% 8.29/2.55 # Proof object initial formulas used : 27
% 8.29/2.55 # Proof object generating inferences : 26
% 8.29/2.55 # Proof object simplifying inferences : 73
% 8.29/2.55 # Training examples: 0 positive, 0 negative
% 8.29/2.55 # Parsed axioms : 206
% 8.29/2.55 # Removed by relevancy pruning/SinE : 0
% 8.29/2.55 # Initial clauses : 206
% 8.29/2.55 # Removed in clause preprocessing : 0
% 8.29/2.55 # Initial clauses in saturation : 206
% 8.29/2.55 # Processed clauses : 423
% 8.29/2.55 # ...of these trivial : 2
% 8.29/2.55 # ...subsumed : 104
% 8.29/2.55 # ...remaining for further processing : 317
% 8.29/2.55 # Other redundant clauses eliminated : 122
% 8.29/2.55 # Clauses deleted for lack of memory : 0
% 8.29/2.55 # Backward-subsumed : 31
% 8.29/2.55 # Backward-rewritten : 0
% 8.29/2.55 # Generated clauses : 1550
% 8.29/2.55 # ...of the previous two non-trivial : 1275
% 8.29/2.55 # Contextual simplify-reflections : 143
% 8.29/2.55 # Paramodulations : 1392
% 8.29/2.55 # Factorizations : 0
% 8.29/2.55 # Equation resolutions : 154
% 8.29/2.55 # Propositional unsat checks : 0
% 8.29/2.55 # Propositional unsat check successes : 0
% 8.29/2.55 # Current number of processed clauses : 276
% 8.29/2.55 # Positive orientable unit clauses : 19
% 8.29/2.55 # Positive unorientable unit clauses: 0
% 8.29/2.55 # Negative unit clauses : 6
% 8.29/2.55 # Non-unit-clauses : 251
% 8.29/2.55 # Current number of unprocessed clauses: 1033
% 8.29/2.55 # ...number of literals in the above : 7769
% 8.29/2.55 # Current number of archived formulas : 0
% 8.29/2.55 # Current number of archived clauses : 35
% 8.29/2.55 # Clause-clause subsumption calls (NU) : 17299
% 8.29/2.55 # Rec. Clause-clause subsumption calls : 3866
% 8.29/2.55 # Non-unit clause-clause subsumptions : 231
% 8.29/2.55 # Unit Clause-clause subsumption calls : 377
% 8.29/2.55 # Rewrite failures with RHS unbound : 0
% 8.29/2.55 # BW rewrite match attempts : 5
% 8.29/2.55 # BW rewrite match successes : 5
% 8.29/2.55 # Condensation attempts : 0
% 8.29/2.55 # Condensation successes : 0
% 8.29/2.55 # Termbank termtop insertions : 34317
% 8.29/2.55
% 8.29/2.55 # -------------------------------------------------
% 8.29/2.55 # User time : 0.049 s
% 8.29/2.55 # System time : 0.004 s
% 8.29/2.55 # Total time : 0.053 s
% 8.29/2.55 # ...preprocessing : 0.016 s
% 8.29/2.55 # ...main loop : 0.038 s
% 8.29/2.55 # Maximum resident set size: 7136 pages
% 8.29/2.55
%------------------------------------------------------------------------------