%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU449+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:25:14 PM UTC 2026
% Result : Theorem 0.44s 0.52s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 8 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 108 ( 48 ~; 38 |; 8 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 77 ( 1 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t63_relset_2,conjecture,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X2))
=> ! [X5] :
( m2_relset_1(X5,X1,X2)
=> ( r1_tarski(X4,k8_relset_2(X1,X2,k8_relset_2(X2,X1,X4,k6_relset_1(X1,X2,X5)),X5))
& r1_tarski(X3,k8_relset_2(X2,X1,k8_relset_2(X1,X2,X3,X5),k6_relset_1(X1,X2,X5))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_relset_2) ).
fof(t61_relset_2,axiom,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X2))
=> ! [X5] :
( m2_relset_1(X5,X1,X2)
=> ( r1_tarski(X3,k8_relset_2(X2,X1,X4,k6_relset_1(X1,X2,X5)))
<=> r1_tarski(X4,k8_relset_2(X1,X2,X3,X5)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t61_relset_2) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(dt_k8_relset_2,axiom,
! [X1,X2,X3,X4] :
( ( m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
& m1_subset_1(X3,k1_zfmisc_1(X1)) )
=> m1_subset_1(k8_relset_2(X1,X2,X3,X4),k1_zfmisc_1(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k8_relset_2) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X1,X2)
=> m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m2_relset_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/benchmark/theBenchmark.p',dt_k6_relset_1) ).
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/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X2))
=> ! [X5] :
( m2_relset_1(X5,X1,X2)
=> ( r1_tarski(X4,k8_relset_2(X1,X2,k8_relset_2(X2,X1,X4,k6_relset_1(X1,X2,X5)),X5))
& r1_tarski(X3,k8_relset_2(X2,X1,k8_relset_2(X1,X2,X3,X5),k6_relset_1(X1,X2,X5))) ) ) ) ),
inference(assume_negation,[status(cth)],[t63_relset_2]) ).
fof(c_0_8,plain,
! [X111,X112,X113,X114,X115] :
( ( ~ m1_subset_1(X113,k1_zfmisc_1(X111))
| ~ m1_subset_1(X114,k1_zfmisc_1(X112))
| ~ m2_relset_1(X115,X111,X112)
| r1_tarski(X113,k8_relset_2(X112,X111,X114,k6_relset_1(X111,X112,X115)))
| ~ r1_tarski(X114,k8_relset_2(X111,X112,X113,X115)) )
& ( ~ m1_subset_1(X113,k1_zfmisc_1(X111))
| ~ m1_subset_1(X114,k1_zfmisc_1(X112))
| ~ m2_relset_1(X115,X111,X112)
| r1_tarski(X114,k8_relset_2(X111,X112,X113,X115))
| ~ r1_tarski(X113,k8_relset_2(X112,X111,X114,k6_relset_1(X111,X112,X115))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_relset_2])])])])]) ).
fof(c_0_9,plain,
! [X82] : r1_tarski(X82,X82),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_10,negated_conjecture,
( ( ~ r1_tarski(esk4_0,k8_relset_2(esk1_0,esk2_0,k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),esk5_0))
| ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0))) )
& m2_relset_1(esk5_0,esk1_0,esk2_0)
& m1_subset_1(esk4_0,k1_zfmisc_1(esk2_0))
& m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_11,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X3))
| ~ m1_subset_1(X4,k1_zfmisc_1(X2))
| ~ m2_relset_1(X5,X3,X2)
| ~ r1_tarski(X1,k8_relset_2(X2,X3,X4,k6_relset_1(X3,X2,X5)))
| r1_tarski(X4,k8_relset_2(X3,X2,X1,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ r1_tarski(esk4_0,k8_relset_2(esk1_0,esk2_0,k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),esk5_0))
| ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X3))
| ~ m1_subset_1(k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X4)),k1_zfmisc_1(X2))
| ~ m2_relset_1(X4,X2,X3)
| r1_tarski(X1,k8_relset_2(X2,X3,k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X4)),X4)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
m2_relset_1(esk5_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ m1_subset_1(k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),k1_zfmisc_1(esk1_0))
| ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_18,plain,
( ~ m1_subset_1(X4,k1_zfmisc_1(X2))
| ~ m1_subset_1(X1,k1_zfmisc_1(X3))
| ~ m2_relset_1(X5,X2,X3)
| ~ r1_tarski(X1,k8_relset_2(X2,X3,X4,X5))
| r1_tarski(X4,k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X5))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_20,plain,
! [X101,X102,X103,X104] :
( m1_subset_1(k8_relset_2(X101,X102,X103,X104),k1_zfmisc_1(X102))
| ~ m1_subset_1(X104,k1_zfmisc_1(k2_zfmisc_1(X101,X102)))
| ~ m1_subset_1(X103,k1_zfmisc_1(X101)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relset_2])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0))
| ~ m1_subset_1(k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),k1_zfmisc_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]),c_0_15]),c_0_19])]) ).
cnf(c_0_22,plain,
( ~ m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X4)))
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| m1_subset_1(k8_relset_2(X2,X4,X1,X3),k1_zfmisc_1(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X105,X106,X107] :
( m1_subset_1(X107,k1_zfmisc_1(k2_zfmisc_1(X105,X106)))
| ~ m2_relset_1(X107,X105,X106) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0))
| ~ m1_subset_1(k6_relset_1(esk1_0,esk2_0,esk5_0),k1_zfmisc_1(k2_zfmisc_1(esk2_0,esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16])]) ).
cnf(c_0_25,plain,
( ~ m2_relset_1(X1,X2,X3)
| m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_26,plain,
! [X98,X99,X100] :
( m2_relset_1(k6_relset_1(X98,X99,X100),X99,X98)
| ~ m1_relset_1(X100,X98,X99) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_relset_1])])]) ).
cnf(c_0_27,negated_conjecture,
( ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0))
| ~ m2_relset_1(k6_relset_1(esk1_0,esk2_0,esk5_0),esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ m1_relset_1(X1,X2,X3)
| m2_relset_1(k6_relset_1(X2,X3,X1),X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0))
| ~ m1_relset_1(esk5_0,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_30,plain,
! [X95,X96,X97] :
( ( m2_relset_1(X97,X95,X96)
| ~ m1_relset_1(X97,X95,X96) )
& ( m1_relset_1(X97,X95,X96)
| ~ m2_relset_1(X97,X95,X96) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))
| ~ m1_relset_1(esk5_0,esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_19])]) ).
cnf(c_0_32,plain,
( ~ m2_relset_1(X1,X2,X3)
| m1_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_15])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU449+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 06:34:37 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 0.44/0.52 % Version: 3.5.1
% 0.44/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.44/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.44/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.44/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.44/0.52 % Starting sh5l with 300s (1) cores
% 0.44/0.52 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1809113 completed with status 0
% 0.44/0.52 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.44/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.44/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.44/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.44/0.52 % No SInE strategy applied
% 0.44/0.52 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.44/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.44/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.44/0.52 % Starting G-E--_300_C18_F1_URBAN_S0Y with 369s (1) cores
% 0.44/0.52 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.44/0.52 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.44/0.52 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 1809120 completed with status 0
% 0.44/0.52 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.44/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.44/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.44/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.44/0.52 % No SInE strategy applied
% 0.44/0.52 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.44/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.44/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.44/0.52 % Starting G-E--_300_C18_F1_URBAN_S0Y with 369s (1) cores
% 0.44/0.52 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.44/0.52 % Preprocessing time : 0.035 s
% 0.44/0.52
% 0.44/0.52 % Proof found!
% 0.44/0.52 % SZS status Theorem
% 0.44/0.52 % SZS output start CNFRefutation
% See solution above
% 0.44/0.52 % Parsed axioms : 55
% 0.44/0.52 % Removed by relevancy pruning/SinE : 0
% 0.44/0.52 % Initial clauses : 75
% 0.44/0.52 % Removed in clause preprocessing : 7
% 0.44/0.52 % Initial clauses in saturation : 68
% 0.44/0.52 % Processed clauses : 172
% 0.44/0.52 % ...of these trivial : 2
% 0.44/0.52 % ...subsumed : 20
% 0.44/0.52 % ...remaining for further processing : 150
% 0.44/0.52 % Other redundant clauses eliminated : 0
% 0.44/0.52 % Clauses deleted for lack of memory : 0
% 0.44/0.52 % Backward-subsumed : 1
% 0.44/0.52 % Backward-rewritten : 6
% 0.44/0.52 % Generated clauses : 251
% 0.44/0.52 % ...of the previous two non-redundant : 223
% 0.44/0.52 % ...aggressively subsumed : 0
% 0.44/0.52 % Contextual simplify-reflections : 4
% 0.44/0.52 % Paramodulations : 251
% 0.44/0.52 % Factorizations : 0
% 0.44/0.52 % NegExts : 0
% 0.44/0.52 % Equation resolutions : 0
% 0.44/0.52 % Disequality decompositions : 0
% 0.44/0.52 % Total rewrite steps : 66
% 0.44/0.52 % ...of those cached : 46
% 0.44/0.52 % Propositional unsat checks : 0
% 0.44/0.52 % Propositional check models : 0
% 0.44/0.52 % Propositional check unsatisfiable : 0
% 0.44/0.52 % Propositional clauses : 0
% 0.44/0.52 % Propositional clauses after purity: 0
% 0.44/0.52 % Propositional unsat core size : 0
% 0.44/0.52 % Propositional preprocessing time : 0.000
% 0.44/0.52 % Propositional encoding time : 0.000
% 0.44/0.52 % Propositional solver time : 0.000
% 0.44/0.52 % Success case prop preproc time : 0.000
% 0.44/0.52 % Success case prop encoding time : 0.000
% 0.44/0.52 % Success case prop solver time : 0.000
% 0.44/0.52 % Current number of processed clauses : 143
% 0.44/0.52 % Positive orientable unit clauses : 37
% 0.44/0.52 % Positive unorientable unit clauses: 1
% 0.44/0.52 % Negative unit clauses : 7
% 0.44/0.52 % Non-unit-clauses : 98
% 0.44/0.52 % Current number of unprocessed clauses: 111
% 0.44/0.52 % ...number of literals in the above : 347
% 0.44/0.52 % Current number of archived formulas : 0
% 0.44/0.52 % Current number of archived clauses : 7
% 0.44/0.52 % Clause-clause subsumption calls (NU) : 1567
% 0.44/0.52 % Rec. Clause-clause subsumption calls : 1039
% 0.44/0.52 % Non-unit clause-clause subsumptions : 17
% 0.44/0.52 % Unit Clause-clause subsumption calls : 392
% 0.44/0.52 % Rewrite failures with RHS unbound : 0
% 0.44/0.52 % BW rewrite match attempts : 30
% 0.44/0.52 % BW rewrite match successes : 4
% 0.44/0.52 % Condensation attempts : 0
% 0.44/0.52 % Condensation successes : 0
% 0.44/0.52 % Termbank termtop insertions : 7405
% 0.44/0.52 % Search garbage collected termcells : 663
% 0.44/0.52
% 0.44/0.52 % -------------------------------------------------
% 0.44/0.52 % User time : 0.043 s
% 0.44/0.52 % System time : 0.013 s
% 0.44/0.52 % Total time : 0.055 s
% 0.44/0.52 % Maximum resident set size: 3688 pages
% 0.44/0.52
% 0.44/0.52 % -------------------------------------------------
% 0.44/0.52 % User time : 0.286 s
% 0.44/0.52 % System time : 0.041 s
% 0.44/0.52 % Total time : 0.327 s
% 0.44/0.52 % Maximum resident set size: 4864 pages
% 0.44/0.52 % E exiting
%------------------------------------------------------------------------------