TSTP Solution File: SEU446+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU446+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 19:32:15 EDT 2023
% Result : Theorem 29.13s 4.62s
% Output : CNFRefutation 29.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 53 ( 20 unt; 0 def)
% Number of atoms : 99 ( 35 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 77 ( 31 ~; 26 |; 7 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-5 aty)
% Number of variables : 91 ( 2 sgn; 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t58_relset_2,conjecture,
! [X1,X2,X3] :
( m2_relset_1(X3,X1,X2)
=> k10_relset_1(X1,X2,X3,X1) = k10_relset_1(X2,X2,k9_relset_2(X2,X1,X2,k6_relset_1(X1,X2,X3),X3),X2) ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',t58_relset_2) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X1,X2)
<=> m1_relset_1(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',redefinition_m2_relset_1) ).
fof(d1_relset_1,axiom,
! [X1,X2,X3] :
( m1_relset_1(X3,X1,X2)
<=> r1_tarski(X3,k2_zfmisc_1(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',d1_relset_1) ).
fof(redefinition_k6_relset_1,axiom,
! [X1,X2,X3] :
( m1_relset_1(X3,X1,X2)
=> k6_relset_1(X1,X2,X3) = k4_relat_1(X3) ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',redefinition_k6_relset_1) ).
fof(t3_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ( r1_tarski(X1,X2)
=> v1_relat_1(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',t3_relat_1) ).
fof(t6_relat_1,axiom,
! [X1,X2] : v1_relat_1(k2_zfmisc_1(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',t6_relat_1) ).
fof(dt_k6_relset_1,axiom,
! [X1,X2,X3] :
( m1_relset_1(X3,X1,X2)
=> m2_relset_1(k6_relset_1(X1,X2,X3),X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',dt_k6_relset_1) ).
fof(t21_funct_5,axiom,
! [X1] :
( v1_relat_1(X1)
=> ( k1_funct_5(X1) = k1_relat_1(X1)
& k2_funct_5(X1) = k2_relat_1(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',t21_funct_5) ).
fof(involutiveness_k4_relat_1,axiom,
! [X1] :
( v1_relat_1(X1)
=> k4_relat_1(k4_relat_1(X1)) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',involutiveness_k4_relat_1) ).
fof(t51_relset_2,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k2_funct_5(X3) = k10_relset_1(X2,X1,X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',t51_relset_2) ).
fof(redefinition_k10_relset_1,axiom,
! [X1,X2,X3,X4] :
( m1_relset_1(X3,X1,X2)
=> k10_relset_1(X1,X2,X3,X4) = k9_relat_1(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',redefinition_k10_relset_1) ).
fof(t57_relset_2,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) = k10_relset_1(X2,X2,k9_relset_2(X2,X1,X2,X3,k6_relset_1(X2,X1,X3)),X2) ),
file('/export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p',t57_relset_2) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2,X3] :
( m2_relset_1(X3,X1,X2)
=> k10_relset_1(X1,X2,X3,X1) = k10_relset_1(X2,X2,k9_relset_2(X2,X1,X2,k6_relset_1(X1,X2,X3),X3),X2) ),
inference(assume_negation,[status(cth)],[t58_relset_2]) ).
fof(c_0_13,plain,
! [X505,X506,X507] :
( ( ~ m2_relset_1(X507,X505,X506)
| m1_relset_1(X507,X505,X506) )
& ( ~ m1_relset_1(X507,X505,X506)
| m2_relset_1(X507,X505,X506) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
fof(c_0_14,negated_conjecture,
( m2_relset_1(esk3_0,esk1_0,esk2_0)
& k10_relset_1(esk1_0,esk2_0,esk3_0,esk1_0) != k10_relset_1(esk2_0,esk2_0,k9_relset_2(esk2_0,esk1_0,esk2_0,k6_relset_1(esk1_0,esk2_0,esk3_0),esk3_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_15,plain,
! [X499,X500,X501] :
( ( ~ m1_relset_1(X501,X499,X500)
| r1_tarski(X501,k2_zfmisc_1(X499,X500)) )
& ( ~ r1_tarski(X501,k2_zfmisc_1(X499,X500))
| m1_relset_1(X501,X499,X500) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_relset_1])]) ).
cnf(c_0_16,plain,
( m1_relset_1(X1,X2,X3)
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
m2_relset_1(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X79,X80,X81] :
( ~ m1_relset_1(X81,X79,X80)
| k6_relset_1(X79,X80,X81) = k4_relat_1(X81) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k6_relset_1])]) ).
fof(c_0_19,plain,
! [X1118,X1119] :
( ~ v1_relat_1(X1119)
| ~ r1_tarski(X1118,X1119)
| v1_relat_1(X1118) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_relat_1])]) ).
cnf(c_0_20,plain,
( r1_tarski(X1,k2_zfmisc_1(X2,X3))
| ~ m1_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
m1_relset_1(esk3_0,esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_22,plain,
! [X1004,X1005] : v1_relat_1(k2_zfmisc_1(X1004,X1005)),
inference(variable_rename,[status(thm)],[t6_relat_1]) ).
fof(c_0_23,plain,
! [X73,X74,X75] :
( ~ m1_relset_1(X75,X73,X74)
| m2_relset_1(k6_relset_1(X73,X74,X75),X74,X73) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_relset_1])]) ).
cnf(c_0_24,plain,
( k6_relset_1(X2,X3,X1) = k4_relat_1(X1)
| ~ m1_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X1164] :
( ( k1_funct_5(X1164) = k1_relat_1(X1164)
| ~ v1_relat_1(X1164) )
& ( k2_funct_5(X1164) = k2_relat_1(X1164)
| ~ v1_relat_1(X1164) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_funct_5])])]) ).
cnf(c_0_26,plain,
( v1_relat_1(X2)
| ~ v1_relat_1(X1)
| ~ r1_tarski(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
r1_tarski(esk3_0,k2_zfmisc_1(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
v1_relat_1(k2_zfmisc_1(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( m2_relset_1(k6_relset_1(X2,X3,X1),X3,X2)
| ~ m1_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
k6_relset_1(esk1_0,esk2_0,esk3_0) = k4_relat_1(esk3_0),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
fof(c_0_31,plain,
! [X1373] :
( ~ v1_relat_1(X1373)
| k4_relat_1(k4_relat_1(X1373)) = X1373 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k4_relat_1])]) ).
fof(c_0_32,plain,
! [X82,X83,X84] :
( ( k1_funct_5(X84) = k10_relset_1(X82,X83,k6_relset_1(X83,X82,X84),X82)
| ~ m2_relset_1(X84,X83,X82) )
& ( k2_funct_5(X84) = k10_relset_1(X83,X82,X84,X83)
| ~ m2_relset_1(X84,X83,X82) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t51_relset_2])])]) ).
cnf(c_0_33,plain,
( k2_funct_5(X1) = k2_relat_1(X1)
| ~ v1_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
v1_relat_1(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
fof(c_0_35,plain,
! [X28,X29,X30,X31] :
( ~ m1_relset_1(X30,X28,X29)
| k10_relset_1(X28,X29,X30,X31) = k9_relat_1(X30,X31) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k10_relset_1])]) ).
cnf(c_0_36,negated_conjecture,
m2_relset_1(k4_relat_1(esk3_0),esk2_0,esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_30]) ).
cnf(c_0_37,plain,
( k4_relat_1(k4_relat_1(X1)) = X1
| ~ v1_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( k2_funct_5(X1) = k10_relset_1(X2,X3,X1,X2)
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
k2_funct_5(esk3_0) = k2_relat_1(esk3_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
( k10_relset_1(X2,X3,X1,X4) = k9_relat_1(X1,X4)
| ~ m1_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,negated_conjecture,
k10_relset_1(esk1_0,esk2_0,esk3_0,esk1_0) != k10_relset_1(esk2_0,esk2_0,k9_relset_2(esk2_0,esk1_0,esk2_0,k6_relset_1(esk1_0,esk2_0,esk3_0),esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_42,plain,
! [X67,X68,X69] :
( ~ m2_relset_1(X69,X68,X67)
| k10_relset_1(X67,X68,k6_relset_1(X68,X67,X69),X67) = k10_relset_1(X68,X68,k9_relset_2(X68,X67,X68,X69,k6_relset_1(X68,X67,X69)),X68) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t57_relset_2])]) ).
cnf(c_0_43,negated_conjecture,
m1_relset_1(k4_relat_1(esk3_0),esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
k4_relat_1(k4_relat_1(esk3_0)) = esk3_0,
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_45,negated_conjecture,
k10_relset_1(esk1_0,esk2_0,esk3_0,esk1_0) = k2_relat_1(esk3_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_17]),c_0_39]) ).
cnf(c_0_46,negated_conjecture,
k10_relset_1(esk1_0,esk2_0,esk3_0,X1) = k9_relat_1(esk3_0,X1),
inference(spm,[status(thm)],[c_0_40,c_0_21]) ).
cnf(c_0_47,negated_conjecture,
k10_relset_1(esk2_0,esk2_0,k9_relset_2(esk2_0,esk1_0,esk2_0,k4_relat_1(esk3_0),esk3_0),esk2_0) != k10_relset_1(esk1_0,esk2_0,esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_48,plain,
( k10_relset_1(X3,X2,k6_relset_1(X2,X3,X1),X3) = k10_relset_1(X2,X2,k9_relset_2(X2,X3,X2,X1,k6_relset_1(X2,X3,X1)),X2)
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,negated_conjecture,
k6_relset_1(esk2_0,esk1_0,k4_relat_1(esk3_0)) = esk3_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_43]),c_0_44]) ).
cnf(c_0_50,negated_conjecture,
k9_relat_1(esk3_0,esk1_0) = k2_relat_1(esk3_0),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
k10_relset_1(esk2_0,esk2_0,k9_relset_2(esk2_0,esk1_0,esk2_0,k4_relat_1(esk3_0),esk3_0),esk2_0) != k2_relat_1(esk3_0),
inference(rw,[status(thm)],[c_0_47,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_36]),c_0_49]),c_0_46]),c_0_50]),c_0_49]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU446+2 : TPTP v8.1.2. Released v3.4.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:08:50 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.58/0.79 Running first-order model finding
% 0.58/0.79 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.2mFrjQu2FU/E---3.1_19913.p
% 29.13/4.62 # Version: 3.1pre001
% 29.13/4.62 # Preprocessing class: FMLMSMLLSSSNFFN.
% 29.13/4.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.13/4.62 # Starting new_bool_3 with 900s (3) cores
% 29.13/4.62 # Starting new_bool_1 with 900s (3) cores
% 29.13/4.62 # Starting sh5l with 300s (1) cores
% 29.13/4.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 29.13/4.62 # new_bool_3 with pid 19990 completed with status 0
% 29.13/4.62 # Result found by new_bool_3
% 29.13/4.62 # Preprocessing class: FMLMSMLLSSSNFFN.
% 29.13/4.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.13/4.62 # Starting new_bool_3 with 900s (3) cores
% 29.13/4.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 29.13/4.62 # Search class: FGHSM-SMLM32-MFFFFFNN
% 29.13/4.62 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 29.13/4.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 29.13/4.62 # Starting new_bool_3 with 91s (1) cores
% 29.13/4.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 68s (1) cores
% 29.13/4.62 # G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 20000 completed with status 0
% 29.13/4.62 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2g
% 29.13/4.62 # Preprocessing class: FMLMSMLLSSSNFFN.
% 29.13/4.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.13/4.62 # Starting new_bool_3 with 900s (3) cores
% 29.13/4.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 29.13/4.62 # Search class: FGHSM-SMLM32-MFFFFFNN
% 29.13/4.62 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 29.13/4.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 29.13/4.62 # Starting new_bool_3 with 91s (1) cores
% 29.13/4.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 68s (1) cores
% 29.13/4.62 # Preprocessing time : 0.027 s
% 29.13/4.62 # Presaturation interreduction done
% 29.13/4.62
% 29.13/4.62 # Proof found!
% 29.13/4.62 # SZS status Theorem
% 29.13/4.62 # SZS output start CNFRefutation
% See solution above
% 29.13/4.62 # Parsed axioms : 4530
% 29.13/4.62 # Removed by relevancy pruning/SinE : 3518
% 29.13/4.62 # Initial clauses : 1810
% 29.13/4.62 # Removed in clause preprocessing : 43
% 29.13/4.62 # Initial clauses in saturation : 1767
% 29.13/4.62 # Processed clauses : 16187
% 29.13/4.62 # ...of these trivial : 444
% 29.13/4.62 # ...subsumed : 8247
% 29.13/4.62 # ...remaining for further processing : 7496
% 29.13/4.62 # Other redundant clauses eliminated : 551
% 29.13/4.62 # Clauses deleted for lack of memory : 0
% 29.13/4.62 # Backward-subsumed : 45
% 29.13/4.62 # Backward-rewritten : 166
% 29.13/4.62 # Generated clauses : 134835
% 29.13/4.62 # ...of the previous two non-redundant : 125577
% 29.13/4.62 # ...aggressively subsumed : 0
% 29.13/4.62 # Contextual simplify-reflections : 92
% 29.13/4.62 # Paramodulations : 134238
% 29.13/4.62 # Factorizations : 12
% 29.13/4.62 # NegExts : 0
% 29.13/4.62 # Equation resolutions : 595
% 29.13/4.62 # Total rewrite steps : 53856
% 29.13/4.62 # Propositional unsat checks : 0
% 29.13/4.62 # Propositional check models : 0
% 29.13/4.62 # Propositional check unsatisfiable : 0
% 29.13/4.62 # Propositional clauses : 0
% 29.13/4.62 # Propositional clauses after purity: 0
% 29.13/4.62 # Propositional unsat core size : 0
% 29.13/4.62 # Propositional preprocessing time : 0.000
% 29.13/4.62 # Propositional encoding time : 0.000
% 29.13/4.62 # Propositional solver time : 0.000
% 29.13/4.62 # Success case prop preproc time : 0.000
% 29.13/4.62 # Success case prop encoding time : 0.000
% 29.13/4.62 # Success case prop solver time : 0.000
% 29.13/4.62 # Current number of processed clauses : 5474
% 29.13/4.62 # Positive orientable unit clauses : 1867
% 29.13/4.62 # Positive unorientable unit clauses: 5
% 29.13/4.62 # Negative unit clauses : 961
% 29.13/4.62 # Non-unit-clauses : 2641
% 29.13/4.62 # Current number of unprocessed clauses: 112579
% 29.13/4.62 # ...number of literals in the above : 251718
% 29.13/4.62 # Current number of archived formulas : 0
% 29.13/4.62 # Current number of archived clauses : 1826
% 29.13/4.62 # Clause-clause subsumption calls (NU) : 1860670
% 29.13/4.62 # Rec. Clause-clause subsumption calls : 780195
% 29.13/4.62 # Non-unit clause-clause subsumptions : 1549
% 29.13/4.62 # Unit Clause-clause subsumption calls : 257549
% 29.13/4.62 # Rewrite failures with RHS unbound : 0
% 29.13/4.62 # BW rewrite match attempts : 1542
% 29.13/4.62 # BW rewrite match successes : 393
% 29.13/4.62 # Condensation attempts : 0
% 29.13/4.62 # Condensation successes : 0
% 29.13/4.62 # Termbank termtop insertions : 2140471
% 29.13/4.62
% 29.13/4.62 # -------------------------------------------------
% 29.13/4.62 # User time : 3.532 s
% 29.13/4.62 # System time : 0.124 s
% 29.13/4.62 # Total time : 3.656 s
% 29.13/4.62 # Maximum resident set size: 13052 pages
% 29.13/4.62
% 29.13/4.62 # -------------------------------------------------
% 29.13/4.62 # User time : 10.500 s
% 29.13/4.62 # System time : 0.258 s
% 29.13/4.62 # Total time : 10.758 s
% 29.13/4.62 # Maximum resident set size: 7224 pages
% 29.13/4.62 % E---3.1 exiting
%------------------------------------------------------------------------------