TSTP Solution File: COM132+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COM132+1 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : 300s
% DateTime : Mon May 20 19:07:30 EDT 2024
% Result : Theorem 45.12s 6.18s
% Output : CNFRefutation 45.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 11 unt; 0 def)
% Number of atoms : 162 ( 67 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 185 ( 72 ~; 64 |; 29 &)
% ( 0 <=>; 20 =>; 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 : 189 ( 13 sgn 116 !; 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/benchmark/theBenchmark.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/benchmark/Axioms/COM001+1.ax','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/benchmark/Axioms/COM001+1.ax','alpha-equiv-subst-abs') ).
fof('gensym-is-fresh',axiom,
! [X14,X11] :
( vgensym(X11) = X14
=> ~ visFreeVar(X14,X11) ),
file('/export/starexec/sandbox/benchmark/Axioms/COM001+0.ax','gensym-is-fresh') ).
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/benchmark/theBenchmark.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/benchmark/Axioms/COM001+0.ax',subst4) ).
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/benchmark/Axioms/COM001+0.ax',isFreeVar2) ).
fof('fresh-unequal-var-3',axiom,
! [X11,X12,X9,X24] :
( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
=> X9 != X24 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','fresh-unequal-var-3') ).
fof(c_0_8,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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['T-subst-abs-3'])]) ).
fof(c_0_9,plain,
! [X81,X82,X83,X84] :
( ~ vtcheck(X82,X81,X84)
| ~ valphaEquivalent(X81,X83)
| vtcheck(X82,X83,X84) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['alpha-equiv-typing'])])]) ).
fof(c_0_10,negated_conjecture,
( esk3_0 != esk5_0
& visFreeVar(esk5_0,esk4_0)
& vtcheck(esk2_0,esk4_0,esk1_0)
& vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(esk5_0,esk6_0,veabs),esk7_0)
& ~ vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(esk5_0,esk6_0,veabs)),esk7_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,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_12,plain,
! [X14,X11] :
( vgensym(X11) = X14
=> ~ visFreeVar(X14,X11) ),
inference(fof_simplification,[status(thm)],['gensym-is-fresh']) ).
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_9]) ).
cnf(c_0_15,negated_conjecture,
vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(esk5_0,esk6_0,veabs),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X182,X183,X184,X185] :
( visFreeVar(X184,X185)
| valphaEquivalent(vabs(X183,X182,X185),vabs(X184,X182,vsubst(X183,vvar(X184),X185))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
fof(c_0_17,plain,
! [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))) ) ) ),
inference(fof_simplification,[status(thm)],[subst4]) ).
fof(c_0_18,plain,
! [X275,X276] :
( vgensym(X276) != X275
| ~ visFreeVar(X275,X276) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_19,plain,
! [X270,X271,X272,X273,X274] :
( ( ~ visFreeVar(X273,X272)
| visFreeVar(X270,X271)
| X270 != X273
| X271 != vapp(X272,X274) )
& ( ~ visFreeVar(X273,X274)
| visFreeVar(X270,X271)
| X270 != X273
| X271 != vapp(X272,X274) )
& ( ~ visFreeVar(X270,X271)
| visFreeVar(X273,X272)
| visFreeVar(X273,X274)
| X270 != X273
| X271 != vapp(X272,X274) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar2])])])]) ).
fof(c_0_20,plain,
! [X100,X101,X102,X103,X104,X105,X106,X107] :
( X102 = X104
| visFreeVar(X104,X103)
| ~ vtcheck(X101,X103,X100)
| ~ vtcheck(vbind(X102,X100,X101),vabs(X104,X105,X106),X107)
| vtcheck(X101,vsubst(X102,X103,vabs(X104,X105,X106)),X107) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_21,negated_conjecture,
( vtcheck(vbind(esk3_0,esk1_0,esk2_0),X1,esk7_0)
| ~ valphaEquivalent(vabs(esk5_0,esk6_0,veabs),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,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_23,plain,
! [X139,X140,X141,X142,X143,X144,X145,X146,X147,X148] :
( X139 != X143
| X140 != X144
| X141 != vabs(X146,X145,X148)
| X143 = X146
| ~ visFreeVar(X146,X144)
| X147 != vgensym(vapp(vapp(X144,X148),vvar(X143)))
| X142 != vsubst(X139,X140,X141)
| X142 = vsubst(X143,X144,vabs(X147,X145,vsubst(X146,vvar(X147),X148))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
fof(c_0_24,plain,
! [X11,X12,X9,X24] :
( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
=> X9 != X24 ),
inference(fof_simplification,[status(thm)],['fresh-unequal-var-3']) ).
cnf(c_0_25,plain,
( vgensym(X1) != X2
| ~ visFreeVar(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( visFreeVar(X3,X4)
| ~ visFreeVar(X1,X2)
| X3 != X1
| X4 != vapp(X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,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_20]) ).
cnf(c_0_28,negated_conjecture,
( vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(X1,esk6_0,vsubst(esk5_0,vvar(X1),veabs)),esk7_0)
| visFreeVar(X1,veabs) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,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_23]) ).
fof(c_0_30,plain,
! [X294,X295,X296,X297] :
( X297 != vgensym(vapp(vapp(X294,X295),vvar(X296)))
| X296 != X297 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_31,plain,
~ visFreeVar(vgensym(X1),X1),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( visFreeVar(X1,vapp(X2,X3))
| ~ visFreeVar(X1,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]) ).
cnf(c_0_33,plain,
( visFreeVar(X3,X4)
| ~ visFreeVar(X1,X2)
| X3 != X1
| X4 != vapp(X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,negated_conjecture,
( esk3_0 = X1
| vtcheck(esk2_0,vsubst(esk3_0,X2,vabs(X1,esk6_0,vsubst(esk5_0,vvar(X1),veabs))),esk7_0)
| visFreeVar(X1,veabs)
| visFreeVar(X1,X2)
| ~ vtcheck(esk2_0,X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
vtcheck(esk2_0,esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_36,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_29])])])])]) ).
cnf(c_0_37,negated_conjecture,
visFreeVar(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,plain,
( X1 != vgensym(vapp(vapp(X2,X3),vvar(X4)))
| X4 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
~ visFreeVar(vgensym(vapp(X1,X2)),X1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
( visFreeVar(X1,vapp(X2,X3))
| ~ visFreeVar(X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])]) ).
cnf(c_0_41,negated_conjecture,
( esk3_0 = X1
| vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(X1,esk6_0,vsubst(esk5_0,vvar(X1),veabs))),esk7_0)
| visFreeVar(X1,esk4_0)
| visFreeVar(X1,veabs) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( vsubst(X1,esk4_0,vabs(vgensym(vapp(vapp(esk4_0,X2),vvar(X1))),X3,vsubst(esk5_0,vvar(vgensym(vapp(vapp(esk4_0,X2),vvar(X1)))),X2))) = vsubst(X1,esk4_0,vabs(esk5_0,X3,X2))
| X1 = esk5_0 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
vgensym(vapp(vapp(X1,X2),vvar(X3))) != X3,
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_44,negated_conjecture,
~ vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(esk5_0,esk6_0,veabs)),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_45,plain,
~ visFreeVar(vgensym(vapp(vapp(X1,X2),X3)),X1),
inference(spm,[status(thm)],[c_0_39,c_0_32]) ).
cnf(c_0_46,plain,
~ visFreeVar(vgensym(vapp(vapp(X1,X2),X3)),X2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
esk3_0 != esk5_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44]),c_0_45]),c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : COM132+1 : TPTP v8.2.0. Released v6.4.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n009.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 : 300
% 0.12/0.33 % DateTime : Sun May 19 10:34:22 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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/benchmark/theBenchmark.p
% 45.12/6.18 # Version: 3.1.0
% 45.12/6.18 # Preprocessing class: FSLSSMSSSSSNFFN.
% 45.12/6.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 45.12/6.18 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 45.12/6.18 # Starting new_bool_3 with 300s (1) cores
% 45.12/6.18 # Starting new_bool_1 with 300s (1) cores
% 45.12/6.18 # Starting sh5l with 300s (1) cores
% 45.12/6.18 # sh5l with pid 19128 completed with status 0
% 45.12/6.18 # Result found by sh5l
% 45.12/6.18 # Preprocessing class: FSLSSMSSSSSNFFN.
% 45.12/6.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 45.12/6.18 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 45.12/6.18 # Starting new_bool_3 with 300s (1) cores
% 45.12/6.18 # Starting new_bool_1 with 300s (1) cores
% 45.12/6.18 # Starting sh5l with 300s (1) cores
% 45.12/6.18 # SinE strategy is gf500_gu_R04_F100_L20000
% 45.12/6.18 # Search class: FGHSF-FSLS32-MFFFFFNN
% 45.12/6.18 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 45.12/6.18 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 181s (1) cores
% 45.12/6.18 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 19131 completed with status 0
% 45.12/6.18 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 45.12/6.18 # Preprocessing class: FSLSSMSSSSSNFFN.
% 45.12/6.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 45.12/6.18 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 45.12/6.18 # Starting new_bool_3 with 300s (1) cores
% 45.12/6.18 # Starting new_bool_1 with 300s (1) cores
% 45.12/6.18 # Starting sh5l with 300s (1) cores
% 45.12/6.18 # SinE strategy is gf500_gu_R04_F100_L20000
% 45.12/6.18 # Search class: FGHSF-FSLS32-MFFFFFNN
% 45.12/6.18 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 45.12/6.18 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 181s (1) cores
% 45.12/6.18 # Preprocessing time : 0.008 s
% 45.12/6.18 # Presaturation interreduction done
% 45.12/6.18
% 45.12/6.18 # Proof found!
% 45.12/6.18 # SZS status Theorem
% 45.12/6.18 # SZS output start CNFRefutation
% See solution above
% 45.12/6.18 # Parsed axioms : 67
% 45.12/6.18 # Removed by relevancy pruning/SinE : 1
% 45.12/6.18 # Initial clauses : 434
% 45.12/6.18 # Removed in clause preprocessing : 13
% 45.12/6.18 # Initial clauses in saturation : 421
% 45.12/6.18 # Processed clauses : 9202
% 45.12/6.18 # ...of these trivial : 399
% 45.12/6.18 # ...subsumed : 4951
% 45.12/6.18 # ...remaining for further processing : 3852
% 45.12/6.18 # Other redundant clauses eliminated : 4629
% 45.12/6.18 # Clauses deleted for lack of memory : 0
% 45.12/6.18 # Backward-subsumed : 194
% 45.12/6.18 # Backward-rewritten : 207
% 45.12/6.18 # Generated clauses : 355128
% 45.12/6.18 # ...of the previous two non-redundant : 347486
% 45.12/6.18 # ...aggressively subsumed : 0
% 45.12/6.18 # Contextual simplify-reflections : 94
% 45.12/6.18 # Paramodulations : 350500
% 45.12/6.18 # Factorizations : 22
% 45.12/6.18 # NegExts : 0
% 45.12/6.18 # Equation resolutions : 4657
% 45.12/6.18 # Disequality decompositions : 0
% 45.12/6.18 # Total rewrite steps : 6392
% 45.12/6.18 # ...of those cached : 5007
% 45.12/6.18 # Propositional unsat checks : 0
% 45.12/6.18 # Propositional check models : 0
% 45.12/6.18 # Propositional check unsatisfiable : 0
% 45.12/6.18 # Propositional clauses : 0
% 45.12/6.18 # Propositional clauses after purity: 0
% 45.12/6.18 # Propositional unsat core size : 0
% 45.12/6.18 # Propositional preprocessing time : 0.000
% 45.12/6.18 # Propositional encoding time : 0.000
% 45.12/6.18 # Propositional solver time : 0.000
% 45.12/6.18 # Success case prop preproc time : 0.000
% 45.12/6.18 # Success case prop encoding time : 0.000
% 45.12/6.18 # Success case prop solver time : 0.000
% 45.12/6.18 # Current number of processed clauses : 2975
% 45.12/6.18 # Positive orientable unit clauses : 134
% 45.12/6.18 # Positive unorientable unit clauses: 4
% 45.12/6.18 # Negative unit clauses : 511
% 45.12/6.18 # Non-unit-clauses : 2326
% 45.12/6.18 # Current number of unprocessed clauses: 291819
% 45.12/6.18 # ...number of literals in the above : 1362504
% 45.12/6.18 # Current number of archived formulas : 0
% 45.12/6.18 # Current number of archived clauses : 782
% 45.12/6.18 # Clause-clause subsumption calls (NU) : 568196
% 45.12/6.18 # Rec. Clause-clause subsumption calls : 212906
% 45.12/6.18 # Non-unit clause-clause subsumptions : 2913
% 45.12/6.18 # Unit Clause-clause subsumption calls : 76947
% 45.12/6.18 # Rewrite failures with RHS unbound : 0
% 45.12/6.18 # BW rewrite match attempts : 1122
% 45.12/6.18 # BW rewrite match successes : 136
% 45.12/6.18 # Condensation attempts : 0
% 45.12/6.18 # Condensation successes : 0
% 45.12/6.18 # Termbank termtop insertions : 13904288
% 45.12/6.18 # Search garbage collected termcells : 4220
% 45.12/6.18
% 45.12/6.18 # -------------------------------------------------
% 45.12/6.18 # User time : 5.476 s
% 45.12/6.18 # System time : 0.161 s
% 45.12/6.18 # Total time : 5.637 s
% 45.12/6.18 # Maximum resident set size: 2892 pages
% 45.12/6.18
% 45.12/6.18 # -------------------------------------------------
% 45.12/6.18 # User time : 5.478 s
% 45.12/6.18 # System time : 0.165 s
% 45.12/6.18 # Total time : 5.643 s
% 45.12/6.18 # Maximum resident set size: 1836 pages
% 45.12/6.18 % E---3.1 exiting
% 45.12/6.18 % E exiting
%------------------------------------------------------------------------------