%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP025+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 0.39s 0.47s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 14 unt; 0 def)
% Number of atoms : 162 ( 22 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 186 ( 64 ~; 57 |; 36 &)
% ( 5 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 1 sgn 37 !; 0 ?)
% 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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',t58_tex_4) ).
fof(t5_tex_2,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> ( v1_tex_2(X2,k1_zfmisc_1(X1))
<=> X2 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_tex_2) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
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,
! [X45,X46] :
( ( ~ l1_pre_topc(X45)
| ~ v2_pre_topc(X45)
| v3_struct_0(X45)
| ~ m1_subset_1(X46,k1_zfmisc_1(u1_struct_0(X45)))
| v1_tsp_2(X46,X45)
| k3_tex_4(X45,X46) != u1_struct_0(X45)
| ~ v1_tsp_1(X46,X45) )
& ( ~ l1_pre_topc(X45)
| ~ v2_pre_topc(X45)
| v3_struct_0(X45)
| ~ m1_subset_1(X46,k1_zfmisc_1(u1_struct_0(X45)))
| ~ v1_tsp_2(X46,X45)
| k3_tex_4(X45,X46) = u1_struct_0(X45) )
& ( ~ l1_pre_topc(X45)
| ~ v2_pre_topc(X45)
| v3_struct_0(X45)
| ~ m1_subset_1(X46,k1_zfmisc_1(u1_struct_0(X45)))
| ~ v1_tsp_2(X46,X45)
| v1_tsp_1(X46,X45) ) ),
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,
! [X95,X96] :
( k3_tex_4(X95,X96) = X96
| ~ v4_pre_topc(X96,X95)
| ~ m1_subset_1(X96,k1_zfmisc_1(u1_struct_0(X95)))
| ~ l1_pre_topc(X95)
| ~ v2_pre_topc(X95)
| v3_struct_0(X95) ),
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_15,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_16,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_17,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
l1_pre_topc(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,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_21,plain,
! [X88,X89] :
( k3_tex_4(X88,X89) = X89
| ~ v3_pre_topc(X89,X88)
| ~ m1_subset_1(X89,k1_zfmisc_1(u1_struct_0(X88)))
| ~ l1_pre_topc(X88)
| ~ v2_pre_topc(X88)
| v3_struct_0(X88) ),
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_22,plain,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> ( v1_tex_2(X2,k1_zfmisc_1(X1))
<=> X2 != X1 ) ),
inference(fof_simplification,[status(thm)],[t5_tex_2]) ).
fof(c_0_23,plain,
! [X83,X84] :
( ( m1_subset_1(X83,k1_zfmisc_1(X84))
| ~ r1_tarski(X83,X84) )
& ( r1_tarski(X83,X84)
| ~ m1_subset_1(X83,k1_zfmisc_1(X84)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_24,plain,
! [X78] : r1_tarski(X78,X78),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_25,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_14]) ).
cnf(c_0_26,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_15,c_0_16]),c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_27,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_21]) ).
fof(c_0_28,plain,
! [X93,X94] :
( ( ~ m1_subset_1(X94,k1_zfmisc_1(X93))
| v1_tex_2(X94,k1_zfmisc_1(X93))
| X94 = X93 )
& ( ~ m1_subset_1(X94,k1_zfmisc_1(X93))
| X94 != X93
| ~ v1_tex_2(X94,k1_zfmisc_1(X93)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
cnf(c_0_29,plain,
( ~ r1_tarski(X1,X2)
| m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( ~ v4_pre_topc(esk2_0,esk1_0)
| u1_struct_0(esk1_0) = esk2_0 ),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_18]),c_0_19])]),c_0_20]),c_0_26]) ).
cnf(c_0_32,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_33,negated_conjecture,
( ~ v3_pre_topc(esk2_0,esk1_0)
| u1_struct_0(esk1_0) = esk2_0 ),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_16]),c_0_18]),c_0_19])]),c_0_20]),c_0_26]) ).
cnf(c_0_34,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| X1 != X2
| ~ v1_tex_2(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
m1_subset_1(X1,k1_zfmisc_1(X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,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_37,negated_conjecture,
u1_struct_0(esk1_0) = esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_38,plain,
~ v1_tex_2(X1,k1_zfmisc_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_34]),c_0_35])]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : TOP025+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 12:40:19 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.39/0.47 % Version: 3.5.1
% 0.39/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.39/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.39/0.47 % Starting sh5l with 300s (1) cores
% 0.39/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3137178 completed with status 0
% 0.39/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.39/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/0.47 % No SInE strategy applied
% 0.39/0.47 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.39/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.39/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.39/0.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/0.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.39/0.47 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.39/0.47 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 3137193 completed with status 0
% 0.39/0.47 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.39/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/0.47 % No SInE strategy applied
% 0.39/0.47 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.39/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.39/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.39/0.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/0.47 % Preprocessing time : 0.002 s
% 0.39/0.47
% 0.39/0.47 % Proof found!
% 0.39/0.47 % SZS status Theorem
% 0.39/0.47 % SZS output start CNFRefutation
% See solution above
% 0.39/0.47 % Parsed axioms : 61
% 0.39/0.47 % Removed by relevancy pruning/SinE : 0
% 0.39/0.47 % Initial clauses : 146
% 0.39/0.47 % Removed in clause preprocessing : 8
% 0.39/0.47 % Initial clauses in saturation : 138
% 0.39/0.47 % Processed clauses : 273
% 0.39/0.47 % ...of these trivial : 0
% 0.39/0.47 % ...subsumed : 35
% 0.39/0.47 % ...remaining for further processing : 238
% 0.39/0.47 % Other redundant clauses eliminated : 1
% 0.39/0.47 % Clauses deleted for lack of memory : 0
% 0.39/0.47 % Backward-subsumed : 1
% 0.39/0.47 % Backward-rewritten : 25
% 0.39/0.47 % Generated clauses : 664
% 0.39/0.47 % ...of the previous two non-redundant : 628
% 0.39/0.47 % ...aggressively subsumed : 0
% 0.39/0.47 % Contextual simplify-reflections : 2
% 0.39/0.47 % Paramodulations : 663
% 0.39/0.47 % Factorizations : 0
% 0.39/0.47 % NegExts : 0
% 0.39/0.47 % Equation resolutions : 1
% 0.39/0.47 % Disequality decompositions : 0
% 0.39/0.47 % Total rewrite steps : 129
% 0.39/0.47 % ...of those cached : 109
% 0.39/0.47 % Propositional unsat checks : 0
% 0.39/0.47 % Propositional check models : 0
% 0.39/0.47 % Propositional check unsatisfiable : 0
% 0.39/0.47 % Propositional clauses : 0
% 0.39/0.47 % Propositional clauses after purity: 0
% 0.39/0.47 % Propositional unsat core size : 0
% 0.39/0.47 % Propositional preprocessing time : 0.000
% 0.39/0.47 % Propositional encoding time : 0.000
% 0.39/0.47 % Propositional solver time : 0.000
% 0.39/0.47 % Success case prop preproc time : 0.000
% 0.39/0.47 % Success case prop encoding time : 0.000
% 0.39/0.47 % Success case prop solver time : 0.000
% 0.39/0.47 % Current number of processed clauses : 211
% 0.39/0.47 % Positive orientable unit clauses : 33
% 0.39/0.47 % Positive unorientable unit clauses: 0
% 0.39/0.47 % Negative unit clauses : 8
% 0.39/0.47 % Non-unit-clauses : 170
% 0.39/0.47 % Current number of unprocessed clauses: 452
% 0.39/0.47 % ...number of literals in the above : 1482
% 0.39/0.47 % Current number of archived formulas : 0
% 0.39/0.47 % Current number of archived clauses : 26
% 0.39/0.47 % Clause-clause subsumption calls (NU) : 7859
% 0.39/0.47 % Rec. Clause-clause subsumption calls : 3960
% 0.39/0.47 % Non-unit clause-clause subsumptions : 30
% 0.39/0.47 % Unit Clause-clause subsumption calls : 308
% 0.39/0.47 % Rewrite failures with RHS unbound : 0
% 0.39/0.47 % BW rewrite match attempts : 19
% 0.39/0.47 % BW rewrite match successes : 2
% 0.39/0.47 % Condensation attempts : 0
% 0.39/0.47 % Condensation successes : 0
% 0.39/0.47 % Termbank termtop insertions : 16413
% 0.39/0.47 % Search garbage collected termcells : 1507
% 0.39/0.47
% 0.39/0.47 % -------------------------------------------------
% 0.39/0.47 % User time : 0.021 s
% 0.39/0.47 % System time : 0.006 s
% 0.39/0.47 % Total time : 0.027 s
% 0.39/0.47 % Maximum resident set size: 3948 pages
% 0.39/0.47
% 0.39/0.47 % -------------------------------------------------
% 0.39/0.47 % User time : 0.093 s
% 0.39/0.47 % System time : 0.024 s
% 0.39/0.47 % Total time : 0.117 s
% 0.39/0.47 % Maximum resident set size: 4864 pages
% 0.39/0.47 % E exiting
%------------------------------------------------------------------------------