TSTP Solution File: COM132+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : COM132+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:21:26 EDT 2023
% Result : Theorem 39.92s 5.63s
% Output : CNFRefutation 39.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 50 ( 12 unt; 0 def)
% Number of atoms : 155 ( 60 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 175 ( 70 ~; 62 |; 25 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 8 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-3 aty)
% Number of variables : 181 ( 13 sgn; 114 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('T-subst-abs-3',conjecture,
! [X15,X20,X9,X11,X21,X10,X34] :
( ( X9 != X21
& visFreeVar(X21,X11)
& vtcheck(X20,X11,X15)
& vtcheck(vbind(X9,X15,X20),vabs(X21,X10,veabs),X34) )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,veabs)),X34) ),
file('/export/starexec/sandbox/tmp/tmp.GwCJOKgCOw/E---3.1_16769.p','T-subst-abs-3') ).
fof('alpha-equiv-typing',axiom,
! [X11,X20,X12,X15] :
( ( vtcheck(X20,X11,X15)
& valphaEquivalent(X11,X12) )
=> vtcheck(X20,X12,X15) ),
file('/export/starexec/sandbox/tmp/tmp.GwCJOKgCOw/E---3.1_16769.p','alpha-equiv-typing') ).
fof('alpha-equiv-subst-abs',axiom,
! [X10,X9,X21,X11] :
( ~ visFreeVar(X21,X11)
=> valphaEquivalent(vabs(X9,X10,X11),vabs(X21,X10,vsubst(X9,vvar(X21),X11))) ),
file('/export/starexec/sandbox/tmp/tmp.GwCJOKgCOw/E---3.1_16769.p','alpha-equiv-subst-abs') ).
fof('T-subst-abs-2-gen',axiom,
! [X15,X20,X9,X11,X21,X10,X12,X34] :
( ( X9 != X21
& ~ visFreeVar(X21,X11)
& vtcheck(X20,X11,X15)
& vtcheck(vbind(X9,X15,X20),vabs(X21,X10,X12),X34) )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,X12)),X34) ),
file('/export/starexec/sandbox/tmp/tmp.GwCJOKgCOw/E---3.1_16769.p','T-subst-abs-2-gen') ).
fof(subst4,axiom,
! [X1,X4,X6,X19,X9,X11,X15,X21,X24,X12] :
( ( X1 = X9
& X4 = X11
& X6 = vabs(X21,X15,X12) )
=> ( ( X9 != X21
& visFreeVar(X21,X11)
& X24 = vgensym(vapp(vapp(X11,X12),vvar(X9))) )
=> ( X19 = vsubst(X1,X4,X6)
=> X19 = vsubst(X9,X11,vabs(X24,X15,vsubst(X21,vvar(X24),X12))) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GwCJOKgCOw/E---3.1_16769.p',subst4) ).
fof('fresh-free-2',axiom,
! [X11,X9,X24,X12] :
( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
=> ~ visFreeVar(X24,X12) ),
file('/export/starexec/sandbox/tmp/tmp.GwCJOKgCOw/E---3.1_16769.p','fresh-free-2') ).
fof('fresh-unequal-var-3',axiom,
! [X11,X12,X9,X24] :
( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
=> X9 != X24 ),
file('/export/starexec/sandbox/tmp/tmp.GwCJOKgCOw/E---3.1_16769.p','fresh-unequal-var-3') ).
fof(isFreeVar2,axiom,
! [X1,X4,X12,X14,X13] :
( ( X1 = X14
& X4 = vapp(X12,X13) )
=> ( ( ( visFreeVar(X14,X12)
| visFreeVar(X14,X13) )
=> visFreeVar(X1,X4) )
& ( visFreeVar(X1,X4)
=> ( visFreeVar(X14,X12)
| visFreeVar(X14,X13) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GwCJOKgCOw/E---3.1_16769.p',isFreeVar2) ).
fof('gensym-is-fresh',axiom,
! [X14,X11] :
( vgensym(X11) = X14
=> ~ visFreeVar(X14,X11) ),
file('/export/starexec/sandbox/tmp/tmp.GwCJOKgCOw/E---3.1_16769.p','gensym-is-fresh') ).
fof(c_0_9,negated_conjecture,
~ ! [X15,X20,X9,X11,X21,X10,X34] :
( ( X9 != X21
& visFreeVar(X21,X11)
& vtcheck(X20,X11,X15)
& vtcheck(vbind(X9,X15,X20),vabs(X21,X10,veabs),X34) )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,veabs)),X34) ),
inference(assume_negation,[status(cth)],['T-subst-abs-3']) ).
fof(c_0_10,plain,
! [X307,X308,X309,X310] :
( ~ vtcheck(X308,X307,X310)
| ~ valphaEquivalent(X307,X309)
| vtcheck(X308,X309,X310) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['alpha-equiv-typing'])]) ).
fof(c_0_11,negated_conjecture,
( esk34_0 != esk36_0
& visFreeVar(esk36_0,esk35_0)
& vtcheck(esk33_0,esk35_0,esk32_0)
& vtcheck(vbind(esk34_0,esk32_0,esk33_0),vabs(esk36_0,esk37_0,veabs),esk38_0)
& ~ vtcheck(esk33_0,vsubst(esk34_0,esk35_0,vabs(esk36_0,esk37_0,veabs)),esk38_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [X10,X9,X21,X11] :
( ~ visFreeVar(X21,X11)
=> valphaEquivalent(vabs(X9,X10,X11),vabs(X21,X10,vsubst(X9,vvar(X21),X11))) ),
inference(fof_simplification,[status(thm)],['alpha-equiv-subst-abs']) ).
fof(c_0_13,plain,
! [X15,X20,X9,X11,X21,X10,X12,X34] :
( ( X9 != X21
& ~ visFreeVar(X21,X11)
& vtcheck(X20,X11,X15)
& vtcheck(vbind(X9,X15,X20),vabs(X21,X10,X12),X34) )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,X12)),X34) ),
inference(fof_simplification,[status(thm)],['T-subst-abs-2-gen']) ).
cnf(c_0_14,plain,
( vtcheck(X1,X4,X3)
| ~ vtcheck(X1,X2,X3)
| ~ valphaEquivalent(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
vtcheck(vbind(esk34_0,esk32_0,esk33_0),vabs(esk36_0,esk37_0,veabs),esk38_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X303,X304,X305,X306] :
( visFreeVar(X305,X306)
| valphaEquivalent(vabs(X304,X303,X306),vabs(X305,X303,vsubst(X304,vvar(X305),X306))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
fof(c_0_17,plain,
! [X329,X330,X331,X332,X333,X334,X335,X336] :
( X331 = X333
| visFreeVar(X333,X332)
| ~ vtcheck(X330,X332,X329)
| ~ vtcheck(vbind(X331,X329,X330),vabs(X333,X334,X335),X336)
| vtcheck(X330,vsubst(X331,X332,vabs(X333,X334,X335)),X336) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
cnf(c_0_18,negated_conjecture,
( vtcheck(vbind(esk34_0,esk32_0,esk33_0),X1,esk38_0)
| ~ valphaEquivalent(vabs(esk36_0,esk37_0,veabs),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( visFreeVar(X1,X2)
| valphaEquivalent(vabs(X3,X4,X2),vabs(X1,X4,vsubst(X3,vvar(X1),X2))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X179,X180,X181,X182,X183,X184,X185,X186,X187,X188] :
( X179 != X183
| X180 != X184
| X181 != vabs(X186,X185,X188)
| X183 = X186
| ~ visFreeVar(X186,X184)
| X187 != vgensym(vapp(vapp(X184,X188),vvar(X183)))
| X182 != vsubst(X179,X180,X181)
| X182 = vsubst(X183,X184,vabs(X187,X185,vsubst(X186,vvar(X187),X188))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subst4])]) ).
fof(c_0_21,plain,
! [X11,X9,X24,X12] :
( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
=> ~ visFreeVar(X24,X12) ),
inference(fof_simplification,[status(thm)],['fresh-free-2']) ).
cnf(c_0_22,plain,
( X1 = X2
| visFreeVar(X2,X3)
| vtcheck(X4,vsubst(X1,X3,vabs(X2,X6,X7)),X8)
| ~ vtcheck(X4,X3,X5)
| ~ vtcheck(vbind(X1,X5,X4),vabs(X2,X6,X7),X8) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( vtcheck(vbind(esk34_0,esk32_0,esk33_0),vabs(X1,esk37_0,vsubst(esk36_0,vvar(X1),veabs)),esk38_0)
| visFreeVar(X1,veabs) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( X2 = X6
| X10 = vsubst(X2,X4,vabs(X9,X7,vsubst(X6,vvar(X9),X8)))
| X1 != X2
| X3 != X4
| X5 != vabs(X6,X7,X8)
| ~ visFreeVar(X6,X4)
| X9 != vgensym(vapp(vapp(X4,X8),vvar(X2)))
| X10 != vsubst(X1,X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_25,plain,
! [X337,X338,X339,X340] :
( X340 != vgensym(vapp(vapp(X337,X338),vvar(X339)))
| X339 != X340 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['fresh-unequal-var-3'])]) ).
fof(c_0_26,plain,
! [X341,X342,X343,X344] :
( X343 != vgensym(vapp(vapp(X341,X344),vvar(X342)))
| ~ visFreeVar(X343,X344) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])]) ).
fof(c_0_27,plain,
! [X79,X80,X81,X82,X83] :
( ( ~ visFreeVar(X82,X81)
| visFreeVar(X79,X80)
| X79 != X82
| X80 != vapp(X81,X83) )
& ( ~ visFreeVar(X82,X83)
| visFreeVar(X79,X80)
| X79 != X82
| X80 != vapp(X81,X83) )
& ( ~ visFreeVar(X79,X80)
| visFreeVar(X82,X81)
| visFreeVar(X82,X83)
| X79 != X82
| X80 != vapp(X81,X83) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar2])])]) ).
cnf(c_0_28,negated_conjecture,
( esk34_0 = X1
| vtcheck(esk33_0,vsubst(esk34_0,X2,vabs(X1,esk37_0,vsubst(esk36_0,vvar(X1),veabs))),esk38_0)
| visFreeVar(X1,veabs)
| visFreeVar(X1,X2)
| ~ vtcheck(esk33_0,X2,esk32_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
vtcheck(esk33_0,esk35_0,esk32_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,plain,
( vsubst(X1,X2,vabs(vgensym(vapp(vapp(X2,X3),vvar(X1))),X4,vsubst(X5,vvar(vgensym(vapp(vapp(X2,X3),vvar(X1)))),X3))) = vsubst(X1,X2,vabs(X5,X4,X3))
| X1 = X5
| ~ visFreeVar(X5,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_24])])])])]) ).
cnf(c_0_31,negated_conjecture,
visFreeVar(esk36_0,esk35_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,plain,
( X1 != vgensym(vapp(vapp(X2,X3),vvar(X4)))
| X4 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( X1 != vgensym(vapp(vapp(X2,X3),vvar(X4)))
| ~ visFreeVar(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_34,plain,
! [X14,X11] :
( vgensym(X11) = X14
=> ~ visFreeVar(X14,X11) ),
inference(fof_simplification,[status(thm)],['gensym-is-fresh']) ).
cnf(c_0_35,plain,
( visFreeVar(X3,X4)
| ~ visFreeVar(X1,X2)
| X3 != X1
| X4 != vapp(X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( esk34_0 = X1
| vtcheck(esk33_0,vsubst(esk34_0,esk35_0,vabs(X1,esk37_0,vsubst(esk36_0,vvar(X1),veabs))),esk38_0)
| visFreeVar(X1,esk35_0)
| visFreeVar(X1,veabs) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
( vsubst(X1,esk35_0,vabs(vgensym(vapp(vapp(esk35_0,X2),vvar(X1))),X3,vsubst(esk36_0,vvar(vgensym(vapp(vapp(esk35_0,X2),vvar(X1)))),X2))) = vsubst(X1,esk35_0,vabs(esk36_0,X3,X2))
| X1 = esk36_0 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
vgensym(vapp(vapp(X1,X2),vvar(X3))) != X3,
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
~ vtcheck(esk33_0,vsubst(esk34_0,esk35_0,vabs(esk36_0,esk37_0,veabs)),esk38_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_40,plain,
~ visFreeVar(vgensym(vapp(vapp(X1,X2),vvar(X3))),X2),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
esk34_0 != esk36_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_42,plain,
! [X146,X147] :
( vgensym(X147) != X146
| ~ visFreeVar(X146,X147) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])]) ).
cnf(c_0_43,plain,
( visFreeVar(X1,vapp(X2,X3))
| ~ visFreeVar(X1,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_35])]) ).
cnf(c_0_44,negated_conjecture,
visFreeVar(vgensym(vapp(vapp(esk35_0,veabs),vvar(esk34_0))),esk35_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]),c_0_40]),c_0_41]) ).
cnf(c_0_45,plain,
( vgensym(X1) != X2
| ~ visFreeVar(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_46,negated_conjecture,
visFreeVar(vgensym(vapp(vapp(esk35_0,veabs),vvar(esk34_0))),vapp(esk35_0,X1)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
~ visFreeVar(vgensym(X1),X1),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_48,negated_conjecture,
visFreeVar(vgensym(vapp(vapp(esk35_0,veabs),vvar(esk34_0))),vapp(vapp(esk35_0,X1),X2)),
inference(spm,[status(thm)],[c_0_43,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_47,c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : COM132+1 : TPTP v8.1.2. Released v6.4.0.
% 0.00/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 05:13:51 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.GwCJOKgCOw/E---3.1_16769.p
% 39.92/5.63 # Version: 3.1pre001
% 39.92/5.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 39.92/5.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.92/5.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 39.92/5.63 # Starting new_bool_3 with 300s (1) cores
% 39.92/5.63 # Starting new_bool_1 with 300s (1) cores
% 39.92/5.63 # Starting sh5l with 300s (1) cores
% 39.92/5.63 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16961 completed with status 0
% 39.92/5.63 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 39.92/5.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 39.92/5.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.92/5.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 39.92/5.63 # No SInE strategy applied
% 39.92/5.63 # Search class: FGHSF-FSLS32-MFFFFFNN
% 39.92/5.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 39.92/5.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 811s (1) cores
% 39.92/5.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 39.92/5.63 # Starting new_bool_3 with 136s (1) cores
% 39.92/5.63 # Starting new_bool_1 with 136s (1) cores
% 39.92/5.63 # Starting sh5l with 136s (1) cores
% 39.92/5.63 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16979 completed with status 0
% 39.92/5.63 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 39.92/5.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 39.92/5.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.92/5.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 39.92/5.63 # No SInE strategy applied
% 39.92/5.63 # Search class: FGHSF-FSLS32-MFFFFFNN
% 39.92/5.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 39.92/5.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 811s (1) cores
% 39.92/5.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 39.92/5.63 # Preprocessing time : 0.009 s
% 39.92/5.63 # Presaturation interreduction done
% 39.92/5.63
% 39.92/5.63 # Proof found!
% 39.92/5.63 # SZS status Theorem
% 39.92/5.63 # SZS output start CNFRefutation
% See solution above
% 39.92/5.63 # Parsed axioms : 67
% 39.92/5.63 # Removed by relevancy pruning/SinE : 0
% 39.92/5.63 # Initial clauses : 432
% 39.92/5.63 # Removed in clause preprocessing : 10
% 39.92/5.63 # Initial clauses in saturation : 422
% 39.92/5.63 # Processed clauses : 10132
% 39.92/5.63 # ...of these trivial : 194
% 39.92/5.63 # ...subsumed : 5823
% 39.92/5.63 # ...remaining for further processing : 4115
% 39.92/5.63 # Other redundant clauses eliminated : 908
% 39.92/5.63 # Clauses deleted for lack of memory : 0
% 39.92/5.63 # Backward-subsumed : 198
% 39.92/5.63 # Backward-rewritten : 87
% 39.92/5.63 # Generated clauses : 168405
% 39.92/5.63 # ...of the previous two non-redundant : 160442
% 39.92/5.63 # ...aggressively subsumed : 0
% 39.92/5.63 # Contextual simplify-reflections : 62
% 39.92/5.63 # Paramodulations : 167511
% 39.92/5.63 # Factorizations : 4
% 39.92/5.63 # NegExts : 0
% 39.92/5.63 # Equation resolutions : 942
% 39.92/5.63 # Total rewrite steps : 11792
% 39.92/5.63 # Propositional unsat checks : 0
% 39.92/5.63 # Propositional check models : 0
% 39.92/5.63 # Propositional check unsatisfiable : 0
% 39.92/5.63 # Propositional clauses : 0
% 39.92/5.63 # Propositional clauses after purity: 0
% 39.92/5.63 # Propositional unsat core size : 0
% 39.92/5.63 # Propositional preprocessing time : 0.000
% 39.92/5.63 # Propositional encoding time : 0.000
% 39.92/5.63 # Propositional solver time : 0.000
% 39.92/5.63 # Success case prop preproc time : 0.000
% 39.92/5.63 # Success case prop encoding time : 0.000
% 39.92/5.63 # Success case prop solver time : 0.000
% 39.92/5.63 # Current number of processed clauses : 3352
% 39.92/5.63 # Positive orientable unit clauses : 229
% 39.92/5.63 # Positive unorientable unit clauses: 4
% 39.92/5.63 # Negative unit clauses : 173
% 39.92/5.63 # Non-unit-clauses : 2946
% 39.92/5.63 # Current number of unprocessed clauses: 150805
% 39.92/5.63 # ...number of literals in the above : 875166
% 39.92/5.63 # Current number of archived formulas : 0
% 39.92/5.63 # Current number of archived clauses : 667
% 39.92/5.63 # Clause-clause subsumption calls (NU) : 917198
% 39.92/5.63 # Rec. Clause-clause subsumption calls : 301877
% 39.92/5.63 # Non-unit clause-clause subsumptions : 4280
% 39.92/5.63 # Unit Clause-clause subsumption calls : 18706
% 39.92/5.63 # Rewrite failures with RHS unbound : 114
% 39.92/5.63 # BW rewrite match attempts : 3288
% 39.92/5.63 # BW rewrite match successes : 21
% 39.92/5.63 # Condensation attempts : 0
% 39.92/5.63 # Condensation successes : 0
% 39.92/5.63 # Termbank termtop insertions : 12941079
% 39.92/5.63
% 39.92/5.63 # -------------------------------------------------
% 39.92/5.63 # User time : 4.824 s
% 39.92/5.63 # System time : 0.102 s
% 39.92/5.63 # Total time : 4.926 s
% 39.92/5.63 # Maximum resident set size: 2880 pages
% 39.92/5.63
% 39.92/5.63 # -------------------------------------------------
% 39.92/5.63 # User time : 24.426 s
% 39.92/5.63 # System time : 0.241 s
% 39.92/5.63 # Total time : 24.668 s
% 39.92/5.63 # Maximum resident set size: 1812 pages
% 39.92/5.63 % E---3.1 exiting
% 39.92/5.63 % E---3.1 exiting
%------------------------------------------------------------------------------