%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP025+3 : 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 : n017.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 03:53:51 PM UTC 2026
% Result : Theorem 24.47s 4.89s
% Output : CNFRefutation 24.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 16 unt; 0 def)
% Number of atoms : 162 ( 26 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 183 ( 63 ~; 54 |; 38 &)
% ( 4 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 35 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t3_tsp_2,conjecture,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v1_tsp_2(X2,X1)
& ( v4_pre_topc(X2,X1)
| v3_pre_topc(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_tsp_2) ).
fof(d5_tsp_2,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
<=> ( k3_tex_4(X1,X2) = u1_struct_0(X1)
& v1_tsp_1(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tsp_2) ).
fof(t62_tex_4,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v4_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+405.ax',t62_tex_4) ).
fof(t58_tex_4,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v3_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+405.ax',t58_tex_4) ).
fof(rc2_tex_2,axiom,
! [X1] :
? [X2] :
( ~ v1_tex_2(X2,k1_zfmisc_1(X1))
& m1_subset_1(X2,k1_zfmisc_1(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+387.ax',rc2_tex_2) ).
fof(d2_tex_2,axiom,
! [X1,X2] :
( m1_subset_1(X2,X1)
=> ( v1_tex_2(X2,X1)
<=> X2 != k3_tarski(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+387.ax',d2_tex_2) ).
fof(t99_zfmisc_1,axiom,
! [X1] : k3_tarski(k1_zfmisc_1(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t99_zfmisc_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v1_tsp_2(X2,X1)
& ( v4_pre_topc(X2,X1)
| v3_pre_topc(X2,X1) ) ) ) ),
inference(assume_negation,[status(cth)],[t3_tsp_2]) ).
fof(c_0_8,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
<=> ( k3_tex_4(X1,X2) = u1_struct_0(X1)
& v1_tsp_1(X2,X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[d5_tsp_2]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
& v1_tsp_2(X2,X1)
& ( v4_pre_topc(X2,X1)
| v3_pre_topc(X2,X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v4_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
inference(fof_simplification,[status(thm)],[t62_tex_4]) ).
fof(c_0_11,plain,
! [X123,X124] :
( ( ~ l1_pre_topc(X123)
| ~ v2_pre_topc(X123)
| v3_struct_0(X123)
| ~ m1_subset_1(X124,k1_zfmisc_1(u1_struct_0(X123)))
| v1_tsp_2(X124,X123)
| k3_tex_4(X123,X124) != u1_struct_0(X123)
| ~ v1_tsp_1(X124,X123) )
& ( ~ l1_pre_topc(X123)
| ~ v2_pre_topc(X123)
| v3_struct_0(X123)
| ~ m1_subset_1(X124,k1_zfmisc_1(u1_struct_0(X123)))
| ~ v1_tsp_2(X124,X123)
| k3_tex_4(X123,X124) = u1_struct_0(X123) )
& ( ~ l1_pre_topc(X123)
| ~ v2_pre_topc(X123)
| v3_struct_0(X123)
| ~ m1_subset_1(X124,k1_zfmisc_1(u1_struct_0(X123)))
| ~ v1_tsp_2(X124,X123)
| v1_tsp_1(X124,X123) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_12,negated_conjecture,
( v1_tex_2(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& v1_tsp_2(esk2_0,esk1_0)
& ( v4_pre_topc(esk2_0,esk1_0)
| v3_pre_topc(esk2_0,esk1_0) )
& m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& l1_pre_topc(esk1_0)
& v2_pre_topc(esk1_0)
& ~ v3_struct_0(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v3_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
inference(fof_simplification,[status(thm)],[t58_tex_4]) ).
fof(c_0_14,plain,
! [X1] :
? [X2] :
( ~ v1_tex_2(X2,k1_zfmisc_1(X1))
& m1_subset_1(X2,k1_zfmisc_1(X1)) ),
inference(fof_simplification,[status(thm)],[rc2_tex_2]) ).
fof(c_0_15,plain,
! [X1,X2] :
( m1_subset_1(X2,X1)
=> ( v1_tex_2(X2,X1)
<=> X2 != k3_tarski(X1) ) ),
inference(fof_simplification,[status(thm)],[d2_tex_2]) ).
fof(c_0_16,plain,
! [X1434,X1435] :
( k3_tex_4(X1434,X1435) = X1435
| ~ v4_pre_topc(X1435,X1434)
| ~ m1_subset_1(X1435,k1_zfmisc_1(u1_struct_0(X1434)))
| ~ l1_pre_topc(X1434)
| ~ v2_pre_topc(X1434)
| v3_struct_0(X1434) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_17,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_2(X2,X1)
| v3_struct_0(X1)
| k3_tex_4(X1,X2) = u1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_23,plain,
! [X1428,X1429] :
( k3_tex_4(X1428,X1429) = X1429
| ~ v3_pre_topc(X1429,X1428)
| ~ m1_subset_1(X1429,k1_zfmisc_1(u1_struct_0(X1428)))
| ~ l1_pre_topc(X1428)
| ~ v2_pre_topc(X1428)
| v3_struct_0(X1428) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_24,plain,
! [X17] :
( ~ v1_tex_2(esk3_1(X17),k1_zfmisc_1(X17))
& m1_subset_1(esk3_1(X17),k1_zfmisc_1(X17)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_14])])]) ).
fof(c_0_25,plain,
! [X55,X56] :
( ( ~ m1_subset_1(X56,X55)
| v1_tex_2(X56,X55)
| X56 = k3_tarski(X55) )
& ( ~ m1_subset_1(X56,X55)
| X56 != k3_tarski(X55)
| ~ v1_tex_2(X56,X55) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_26,plain,
! [X519] : k3_tarski(k1_zfmisc_1(X519)) = X519,
inference(variable_rename,[status(thm)],[t99_zfmisc_1]) ).
cnf(c_0_27,plain,
( ~ v4_pre_topc(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| k3_tex_4(X1,X2) = X2
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
k3_tex_4(esk1_0,esk2_0) = u1_struct_0(esk1_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_17,c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_29,plain,
( ~ v3_pre_topc(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| k3_tex_4(X1,X2) = X2
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
~ v1_tex_2(esk3_1(X1),k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( ~ m1_subset_1(X1,X2)
| v1_tex_2(X1,X2)
| X1 = k3_tarski(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
k3_tarski(k1_zfmisc_1(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
m1_subset_1(esk3_1(X1),k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( ~ v4_pre_topc(esk2_0,esk1_0)
| u1_struct_0(esk1_0) = esk2_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_27,c_0_28]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_35,negated_conjecture,
( v4_pre_topc(esk2_0,esk1_0)
| v3_pre_topc(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( ~ v3_pre_topc(esk2_0,esk1_0)
| u1_struct_0(esk1_0) = esk2_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_29,c_0_28]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_37,plain,
esk3_1(X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_38,negated_conjecture,
v1_tex_2(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,negated_conjecture,
u1_struct_0(esk1_0) = esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,plain,
~ v1_tex_2(X1,k1_zfmisc_1(X1)),
inference(rw,[status(thm)],[c_0_30,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : TOP025+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n017.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 12:35:28 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.50 Running first-order theorem proving
% 0.25/0.51 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
% 24.47/4.89 % Version: 3.5.1
% 24.47/4.89 % Preprocessing class: FMLLSMLLSSSNFFN.
% 24.47/4.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.47/4.89 % Starting new_bool_3 with 900s (3) cores
% 24.47/4.89 % Starting new_bool_1 with 900s (3) cores
% 24.47/4.89 % Starting sh5l with 300s (1) cores
% 24.47/4.89 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 24.47/4.89 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 2322613 completed with status 0
% 24.47/4.89 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 24.47/4.89 % Preprocessing class: FMLLSMLLSSSNFFN.
% 24.47/4.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.47/4.89 % Starting new_bool_3 with 900s (3) cores
% 24.47/4.89 % Starting new_bool_1 with 900s (3) cores
% 24.47/4.89 % Starting sh5l with 300s (1) cores
% 24.47/4.89 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 24.47/4.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 24.47/4.89 % SinE strategy is gf120_gu_R02_F100_L20000
% 24.47/4.89 % Search class: FGHSM-SMLM31-MFFFFFNN
% 24.47/4.89 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 24.47/4.89 % Starting SubtermCWHack with 28s (1) cores
% 24.47/4.89 % SubtermCWHack with pid 2322614 completed with status 0
% 24.47/4.89 % Result found by SubtermCWHack
% 24.47/4.89 % Preprocessing class: FMLLSMLLSSSNFFN.
% 24.47/4.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.47/4.89 % Starting new_bool_3 with 900s (3) cores
% 24.47/4.89 % Starting new_bool_1 with 900s (3) cores
% 24.47/4.89 % Starting sh5l with 300s (1) cores
% 24.47/4.89 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 24.47/4.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 24.47/4.89 % SinE strategy is gf120_gu_R02_F100_L20000
% 24.47/4.89 % Search class: FGHSM-SMLM31-MFFFFFNN
% 24.47/4.89 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 24.47/4.89 % Starting SubtermCWHack with 28s (1) cores
% 24.47/4.89 % Preprocessing time : 0.055 s
% 24.47/4.89
% 24.47/4.89 % Proof found!
% 24.47/4.89 % SZS status Theorem
% 24.47/4.89 % SZS output start CNFRefutation
% See solution above
% 24.47/4.89 % Parsed axioms : 13478
% 24.47/4.89 % Removed by relevancy pruning/SinE : 12907
% 24.47/4.89 % Initial clauses : 1463
% 24.47/4.89 % Removed in clause preprocessing : 43
% 24.47/4.89 % Initial clauses in saturation : 1420
% 24.47/4.89 % Processed clauses : 11083
% 24.47/4.89 % ...of these trivial : 159
% 24.47/4.89 % ...subsumed : 5953
% 24.47/4.89 % ...remaining for further processing : 4971
% 24.47/4.89 % Other redundant clauses eliminated : 101
% 24.47/4.89 % Clauses deleted for lack of memory : 0
% 24.47/4.89 % Backward-subsumed : 254
% 24.47/4.89 % Backward-rewritten : 125
% 24.47/4.89 % Generated clauses : 49217
% 24.47/4.89 % ...of the previous two non-redundant : 44066
% 24.47/4.89 % ...aggressively subsumed : 0
% 24.47/4.89 % Contextual simplify-reflections : 125
% 24.47/4.89 % Paramodulations : 49106
% 24.47/4.89 % Factorizations : 2
% 24.47/4.89 % NegExts : 0
% 24.47/4.89 % Equation resolutions : 109
% 24.47/4.89 % Disequality decompositions : 0
% 24.47/4.89 % Total rewrite steps : 8934
% 24.47/4.89 % ...of those cached : 8419
% 24.47/4.89 % Propositional unsat checks : 0
% 24.47/4.89 % Propositional check models : 0
% 24.47/4.89 % Propositional check unsatisfiable : 0
% 24.47/4.89 % Propositional clauses : 0
% 24.47/4.89 % Propositional clauses after purity: 0
% 24.47/4.89 % Propositional unsat core size : 0
% 24.47/4.89 % Propositional preprocessing time : 0.000
% 24.47/4.89 % Propositional encoding time : 0.000
% 24.47/4.89 % Propositional solver time : 0.000
% 24.47/4.89 % Success case prop preproc time : 0.000
% 24.47/4.89 % Success case prop encoding time : 0.000
% 24.47/4.89 % Success case prop solver time : 0.000
% 24.47/4.89 % Current number of processed clauses : 4524
% 24.47/4.89 % Positive orientable unit clauses : 412
% 24.47/4.89 % Positive unorientable unit clauses: 0
% 24.47/4.89 % Negative unit clauses : 328
% 24.47/4.89 % Non-unit-clauses : 3784
% 24.47/4.89 % Current number of unprocessed clauses: 33749
% 24.47/4.89 % ...number of literals in the above : 157962
% 24.47/4.89 % Current number of archived formulas : 0
% 24.47/4.89 % Current number of archived clauses : 380
% 24.47/4.89 % Clause-clause subsumption calls (NU) : 3254944
% 24.47/4.89 % Rec. Clause-clause subsumption calls : 996158
% 24.47/4.89 % Non-unit clause-clause subsumptions : 4348
% 24.47/4.89 % Unit Clause-clause subsumption calls : 152989
% 24.47/4.89 % Rewrite failures with RHS unbound : 0
% 24.47/4.89 % BW rewrite match attempts : 215
% 24.47/4.89 % BW rewrite match successes : 47
% 24.47/4.89 % Condensation attempts : 0
% 24.47/4.89 % Condensation successes : 0
% 24.47/4.89 % Termbank termtop insertions : 1069314
% 24.47/4.89 % Search garbage collected termcells : 138491
% 24.47/4.89
% 24.47/4.89 % -------------------------------------------------
% 24.47/4.89 % User time : 3.569 s
% 24.47/4.89 % System time : 0.166 s
% 24.47/4.89 % Total time : 3.734 s
% 24.47/4.89 % Maximum resident set size: 28032 pages
% 24.47/4.89
% 24.47/4.89 % -------------------------------------------------
% 24.47/4.89 % User time : 4.063 s
% 24.47/4.89 % System time : 0.201 s
% 24.47/4.89 % Total time : 4.264 s
% 24.47/4.89 % Maximum resident set size: 22784 pages
% 24.47/4.89 % E exiting
%------------------------------------------------------------------------------