%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU387+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:29:12 PM UTC 2026
% Result : Theorem 0.24s 0.62s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 18 unt; 0 def)
% Number of atoms : 191 ( 7 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 224 ( 71 ~; 47 |; 93 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 27 ( 25 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 42 ( 8 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_yellow19,conjecture,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(X1))))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& upper_relstr_subset(X2,boole_POSet(X1))
& filtered_subset(X2,boole_POSet(X1))
& ~ empty(X2) )
=> ! [X3] :
~ ( empty(X3)
& in(X3,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_yellow19) ).
fof(t8_waybel_7,axiom,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& transitive_relstr(X1)
& reflexive_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(X1)))
& upper_relstr_subset(X2,X1)
& filtered_subset(X2,X1)
& ~ empty(X2) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_waybel_7) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(fc1_waybel_7,axiom,
! [X1] :
( complete_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& with_suprema_relstr(boole_POSet(X1))
& boolean_relstr(boole_POSet(X1))
& complemented_relstr(boole_POSet(X1))
& heyting_relstr(boole_POSet(X1))
& distributive_relstr(boole_POSet(X1))
& ~ v1_yellow_3(boole_POSet(X1))
& join_complete_relstr(boole_POSet(X1))
& up_complete_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& ~ empty_carrier(boole_POSet(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_waybel_7) ).
fof(t18_yellow_1,axiom,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_yellow_1) ).
fof(dt_k3_yellow_1,axiom,
! [X1] :
( rel_str(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k3_yellow_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(X1))))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& upper_relstr_subset(X2,boole_POSet(X1))
& filtered_subset(X2,boole_POSet(X1))
& ~ empty(X2) )
=> ! [X3] :
~ ( empty(X3)
& in(X3,X2) ) ) ),
inference(assume_negation,[status(cth)],[t2_yellow19]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(X1))))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& upper_relstr_subset(X2,boole_POSet(X1))
& filtered_subset(X2,boole_POSet(X1))
& ~ empty(X2) )
=> ! [X3] :
~ ( empty(X3)
& in(X3,X2) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& transitive_relstr(X1)
& reflexive_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(X1)))
& upper_relstr_subset(X2,X1)
& filtered_subset(X2,X1)
& ~ empty(X2) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[t8_waybel_7]) ).
fof(c_0_10,plain,
! [X114] :
( X114 = empty_set
| ~ empty(X114) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_11,negated_conjecture,
( empty(esk30_0)
& in(esk30_0,esk29_0)
& element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))
& proper_element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))
& upper_relstr_subset(esk29_0,boole_POSet(esk28_0))
& filtered_subset(esk29_0,boole_POSet(esk28_0))
& ~ empty(esk29_0)
& ~ empty(esk28_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_12,plain,
! [X119,X120] :
( ( ~ rel_str(X119)
| ~ lower_bounded_relstr(X119)
| ~ antisymmetric_relstr(X119)
| ~ transitive_relstr(X119)
| ~ reflexive_relstr(X119)
| empty_carrier(X119)
| ~ element(X120,powerset(the_carrier(X119)))
| ~ upper_relstr_subset(X120,X119)
| ~ filtered_subset(X120,X119)
| empty(X120)
| proper_element(X120,powerset(the_carrier(X119)))
| in(bottom_of_relstr(X119),X120) )
& ( ~ rel_str(X119)
| ~ lower_bounded_relstr(X119)
| ~ antisymmetric_relstr(X119)
| ~ transitive_relstr(X119)
| ~ reflexive_relstr(X119)
| empty_carrier(X119)
| ~ element(X120,powerset(the_carrier(X119)))
| ~ upper_relstr_subset(X120,X119)
| ~ filtered_subset(X120,X119)
| empty(X120)
| ~ in(bottom_of_relstr(X119),X120)
| ~ proper_element(X120,powerset(the_carrier(X119))) ) ),
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_9])])])])]) ).
fof(c_0_13,plain,
! [X115,X116] :
( ~ empty(X116)
| ~ in(X115,X116) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_14,plain,
! [X1] :
( complete_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& with_suprema_relstr(boole_POSet(X1))
& boolean_relstr(boole_POSet(X1))
& complemented_relstr(boole_POSet(X1))
& heyting_relstr(boole_POSet(X1))
& distributive_relstr(boole_POSet(X1))
& ~ v1_yellow_3(boole_POSet(X1))
& join_complete_relstr(boole_POSet(X1))
& up_complete_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& ~ empty_carrier(boole_POSet(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_waybel_7]) ).
cnf(c_0_15,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
empty(esk30_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ rel_str(X2)
| ~ lower_bounded_relstr(X2)
| ~ antisymmetric_relstr(X2)
| ~ transitive_relstr(X2)
| ~ reflexive_relstr(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ upper_relstr_subset(X1,X2)
| ~ filtered_subset(X1,X2)
| ~ in(bottom_of_relstr(X2),X1)
| ~ proper_element(X1,powerset(the_carrier(X2)))
| empty_carrier(X2)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X52] :
( complete_relstr(boole_POSet(X52))
& with_infima_relstr(boole_POSet(X52))
& with_suprema_relstr(boole_POSet(X52))
& boolean_relstr(boole_POSet(X52))
& complemented_relstr(boole_POSet(X52))
& heyting_relstr(boole_POSet(X52))
& distributive_relstr(boole_POSet(X52))
& ~ v1_yellow_3(boole_POSet(X52))
& join_complete_relstr(boole_POSet(X52))
& up_complete_relstr(boole_POSet(X52))
& bounded_relstr(boole_POSet(X52))
& upper_bounded_relstr(boole_POSet(X52))
& lower_bounded_relstr(boole_POSet(X52))
& antisymmetric_relstr(boole_POSet(X52))
& transitive_relstr(boole_POSet(X52))
& reflexive_relstr(boole_POSet(X52))
& strict_rel_str(boole_POSet(X52))
& ~ empty_carrier(boole_POSet(X52)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
fof(c_0_20,plain,
! [X98] : bottom_of_relstr(boole_POSet(X98)) = empty_set,
inference(variable_rename,[status(thm)],[t18_yellow_1]) ).
fof(c_0_21,plain,
! [X32] :
( rel_str(boole_POSet(X32))
& strict_rel_str(boole_POSet(X32)) ),
inference(variable_rename,[status(thm)],[dt_k3_yellow_1]) ).
cnf(c_0_22,negated_conjecture,
in(esk30_0,esk29_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
esk30_0 = empty_set,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
( ~ rel_str(X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ reflexive_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ transitive_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ filtered_subset(X2,X1)
| ~ upper_relstr_subset(X2,X1)
| ~ proper_element(X2,powerset(the_carrier(X1)))
| empty_carrier(X1) ),
inference(csr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
proper_element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0)))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,negated_conjecture,
upper_relstr_subset(esk29_0,boole_POSet(esk28_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,negated_conjecture,
filtered_subset(esk29_0,boole_POSet(esk28_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0)))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,plain,
antisymmetric_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
transitive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,plain,
lower_bounded_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_32,plain,
reflexive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,plain,
bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_34,plain,
rel_str(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_35,plain,
~ empty_carrier(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_36,negated_conjecture,
in(empty_set,esk29_0),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31]),c_0_32]),c_0_33]),c_0_34])]),c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU387+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n006.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 06:17:57 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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.24/0.62 % Version: 3.5.1
% 0.24/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.62 % Starting sh5l with 300s (1) cores
% 0.24/0.62 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2169515 completed with status 0
% 0.24/0.62 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.24/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.62 % No SInE strategy applied
% 0.24/0.62 % Search class: FGHSM-FSMM21-MFFFFFNN
% 0.24/0.62 % partial match(1): FGHSM-FSLM21-MFFFFFNN
% 0.24/0.62 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.62 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/0.62 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.24/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.24/0.62 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 2169523 completed with status 0
% 0.24/0.62 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.24/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.62 % No SInE strategy applied
% 0.24/0.62 % Search class: FGHSM-FSMM21-MFFFFFNN
% 0.24/0.62 % partial match(1): FGHSM-FSLM21-MFFFFFNN
% 0.24/0.62 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.62 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/0.62 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.24/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.24/0.62 % Preprocessing time : 0.004 s
% 0.24/0.62
% 0.24/0.62 % Proof found!
% 0.24/0.62 % SZS status Theorem
% 0.24/0.62 % SZS output start CNFRefutation
% See solution above
% 0.24/0.62 % Parsed axioms : 85
% 0.24/0.62 % Removed by relevancy pruning/SinE : 0
% 0.24/0.62 % Initial clauses : 292
% 0.24/0.62 % Removed in clause preprocessing : 32
% 0.24/0.62 % Initial clauses in saturation : 260
% 0.24/0.62 % Processed clauses : 292
% 0.24/0.62 % ...of these trivial : 45
% 0.24/0.62 % ...subsumed : 20
% 0.24/0.62 % ...remaining for further processing : 226
% 0.24/0.62 % Other redundant clauses eliminated : 0
% 0.24/0.62 % Clauses deleted for lack of memory : 0
% 0.24/0.62 % Backward-subsumed : 1
% 0.24/0.62 % Backward-rewritten : 7
% 0.24/0.62 % Generated clauses : 231
% 0.24/0.62 % ...of the previous two non-redundant : 169
% 0.24/0.62 % ...aggressively subsumed : 0
% 0.24/0.62 % Contextual simplify-reflections : 4
% 0.24/0.62 % Paramodulations : 229
% 0.24/0.62 % Factorizations : 2
% 0.24/0.62 % NegExts : 0
% 0.24/0.62 % Equation resolutions : 0
% 0.24/0.62 % Disequality decompositions : 0
% 0.24/0.62 % Total rewrite steps : 397
% 0.24/0.62 % ...of those cached : 315
% 0.24/0.62 % Propositional unsat checks : 0
% 0.24/0.62 % Propositional check models : 0
% 0.24/0.62 % Propositional check unsatisfiable : 0
% 0.24/0.62 % Propositional clauses : 0
% 0.24/0.62 % Propositional clauses after purity: 0
% 0.24/0.62 % Propositional unsat core size : 0
% 0.24/0.62 % Propositional preprocessing time : 0.000
% 0.24/0.62 % Propositional encoding time : 0.000
% 0.24/0.62 % Propositional solver time : 0.000
% 0.24/0.62 % Success case prop preproc time : 0.000
% 0.24/0.62 % Success case prop encoding time : 0.000
% 0.24/0.62 % Success case prop solver time : 0.000
% 0.24/0.62 % Current number of processed clauses : 218
% 0.24/0.62 % Positive orientable unit clauses : 120
% 0.24/0.62 % Positive unorientable unit clauses: 0
% 0.24/0.62 % Negative unit clauses : 20
% 0.24/0.62 % Non-unit-clauses : 78
% 0.24/0.62 % Current number of unprocessed clauses: 131
% 0.24/0.62 % ...number of literals in the above : 262
% 0.24/0.62 % Current number of archived formulas : 0
% 0.24/0.62 % Current number of archived clauses : 8
% 0.24/0.62 % Clause-clause subsumption calls (NU) : 2256
% 0.24/0.62 % Rec. Clause-clause subsumption calls : 316
% 0.24/0.62 % Non-unit clause-clause subsumptions : 8
% 0.24/0.62 % Unit Clause-clause subsumption calls : 536
% 0.24/0.62 % Rewrite failures with RHS unbound : 0
% 0.24/0.62 % BW rewrite match attempts : 18
% 0.24/0.62 % BW rewrite match successes : 4
% 0.24/0.62 % Condensation attempts : 0
% 0.24/0.62 % Condensation successes : 0
% 0.24/0.62 % Termbank termtop insertions : 16230
% 0.24/0.62 % Search garbage collected termcells : 1936
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.030 s
% 0.24/0.62 % System time : 0.006 s
% 0.24/0.62 % Total time : 0.036 s
% 0.24/0.62 % Maximum resident set size: 3724 pages
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.103 s
% 0.24/0.62 % System time : 0.022 s
% 0.24/0.62 % Total time : 0.125 s
% 0.24/0.62 % Maximum resident set size: 4608 pages
% 0.24/0.62 % E exiting
%------------------------------------------------------------------------------