%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU725^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 : Wed Sep 30 08:25:22 AM UTC 2026
% Result : Theorem 0.07s 0.26s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 138 ( 0 equ; 0 cnn)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 569 ( 50 ~; 48 |; 10 &; 410 @)
% ( 5 <=>; 46 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 13 usr; 9 con; 0-3 aty)
% Number of variables : 91 ( 0 ^; 91 !; 0 ?; 91 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
powerset: $i > $i ).
thf(decl_25,type,
subset: $i > $i > $o ).
thf(decl_26,type,
subsetE: $o ).
thf(decl_27,type,
setminus: $i > $i > $i ).
thf(decl_28,type,
setminusI: $o ).
thf(decl_29,type,
setminusER: $o ).
thf(decl_30,type,
complementT_lem: $o ).
thf(decl_31,type,
subsetTI: $o ).
thf(decl_32,type,
esk1_3: $i > $i > $i > $i ).
thf(decl_33,type,
esk2_0: $i ).
thf(decl_34,type,
esk3_0: $i ).
thf(decl_35,type,
esk4_0: $i ).
thf(contrasubsetT2,conjecture,
( subsetE
=> ( setminusI
=> ( setminusER
=> ( complementT_lem
=> ( subsetTI
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( ( subset @ X4 @ X5 )
=> ( subset @ ( setminus @ X1 @ X5 ) @ ( setminus @ X1 @ X4 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7rnRRZBGct/E---3.1_839829.p',contrasubsetT2) ).
thf(subsetE,axiom,
( subsetE
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( subset @ X1 @ X2 )
=> ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7rnRRZBGct/E---3.1_839829.p',subsetE) ).
thf(setminusI,axiom,
( setminusI
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ~ ( in @ X3 @ X2 )
=> ( in @ X3 @ ( setminus @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7rnRRZBGct/E---3.1_839829.p',setminusI) ).
thf(setminusER,axiom,
( setminusER
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( setminus @ X1 @ X2 ) )
=> ~ ( in @ X3 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7rnRRZBGct/E---3.1_839829.p',setminusER) ).
thf(complementT_lem,axiom,
( complementT_lem
<=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ( in @ ( setminus @ X1 @ X4 ) @ ( powerset @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7rnRRZBGct/E---3.1_839829.p',complementT_lem) ).
thf(subsetTI,axiom,
( subsetTI
<=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X3 @ X4 )
=> ( in @ X3 @ X5 ) ) )
=> ( subset @ X4 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7rnRRZBGct/E---3.1_839829.p',subsetTI) ).
thf(c_0_6,negated_conjecture,
~ ( subsetE
=> ( setminusI
=> ( setminusER
=> ( complementT_lem
=> ( subsetTI
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( ( subset @ X4 @ X5 )
=> ( subset @ ( setminus @ X1 @ X5 ) @ ( setminus @ X1 @ X4 ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[contrasubsetT2]) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X24: $i,X25: $i,X26: $i] :
( ( subset @ X24 @ X25 )
=> ( ( in @ X26 @ X24 )
=> ( in @ X26 @ X25 ) ) )
=> ( ! [X27: $i,X28: $i,X29: $i] :
( ( in @ X29 @ X27 )
=> ( ~ ( in @ X29 @ X28 )
=> ( in @ X29 @ ( setminus @ X27 @ X28 ) ) ) )
=> ( ! [X30: $i,X31: $i,X32: $i] :
( ( in @ X32 @ ( setminus @ X30 @ X31 ) )
=> ~ ( in @ X32 @ X31 ) )
=> ( ! [X33: $i,X34: $i] :
( ( in @ X34 @ ( powerset @ X33 ) )
=> ( in @ ( setminus @ X33 @ X34 ) @ ( powerset @ X33 ) ) )
=> ( ! [X35: $i,X36: $i] :
( ( in @ X36 @ ( powerset @ X35 ) )
=> ! [X37: $i] :
( ( in @ X37 @ ( powerset @ X35 ) )
=> ( ! [X38: $i] :
( ( in @ X38 @ X35 )
=> ( ( in @ X38 @ X36 )
=> ( in @ X38 @ X37 ) ) )
=> ( subset @ X36 @ X37 ) ) ) )
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( ( subset @ X4 @ X5 )
=> ( subset @ ( setminus @ X1 @ X5 ) @ ( setminus @ X1 @ X4 ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,subsetE]),setminusI]),setminusER]),complementT_lem]),subsetTI])]) ).
thf(c_0_8,negated_conjecture,
! [X39: $i,X40: $i,X41: $i,X42: $i,X43: $i,X44: $i,X45: $i,X46: $i,X47: $i,X48: $i,X49: $i,X50: $i,X51: $i,X52: $i] :
( ( ~ ( subset @ X39 @ X40 )
| ~ ( in @ X41 @ X39 )
| ( in @ X41 @ X40 ) )
& ( ~ ( in @ X44 @ X42 )
| ( in @ X44 @ X43 )
| ( in @ X44 @ ( setminus @ X42 @ X43 ) ) )
& ( ~ ( in @ X47 @ ( setminus @ X45 @ X46 ) )
| ~ ( in @ X47 @ X46 ) )
& ( ~ ( in @ X49 @ ( powerset @ X48 ) )
| ( in @ ( setminus @ X48 @ X49 ) @ ( powerset @ X48 ) ) )
& ( ( in @ ( esk1_3 @ X50 @ X51 @ X52 ) @ X50 )
| ( subset @ X51 @ X52 )
| ~ ( in @ X52 @ ( powerset @ X50 ) )
| ~ ( in @ X51 @ ( powerset @ X50 ) ) )
& ( ( in @ ( esk1_3 @ X50 @ X51 @ X52 ) @ X51 )
| ( subset @ X51 @ X52 )
| ~ ( in @ X52 @ ( powerset @ X50 ) )
| ~ ( in @ X51 @ ( powerset @ X50 ) ) )
& ( ~ ( in @ ( esk1_3 @ X50 @ X51 @ X52 ) @ X52 )
| ( subset @ X51 @ X52 )
| ~ ( in @ X52 @ ( powerset @ X50 ) )
| ~ ( in @ X51 @ ( powerset @ X50 ) ) )
& ( in @ esk3_0 @ ( powerset @ esk2_0 ) )
& ( in @ esk4_0 @ ( powerset @ esk2_0 ) )
& ( subset @ esk3_0 @ esk4_0 )
& ~ ( subset @ ( setminus @ esk2_0 @ esk4_0 ) @ ( setminus @ esk2_0 @ esk3_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
thf(c_0_9,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( subset @ X2 @ X3 )
| ~ ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X3 )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ X1 @ X3 )
| ( in @ X1 @ ( setminus @ X2 @ X3 ) )
| ~ ( in @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X3 @ X2 )
| ~ ( subset @ X1 @ X2 )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
subset @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X4: $i,X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ ( setminus @ X3 @ X4 ) ) @ X4 )
| ( subset @ X2 @ ( setminus @ X3 @ X4 ) )
| ~ ( in @ ( esk1_3 @ X1 @ X2 @ ( setminus @ X3 @ X4 ) ) @ X3 )
| ~ ( in @ ( setminus @ X3 @ X4 ) @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X1 )
| ( subset @ X2 @ X3 )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ~ ( in @ X1 @ ( setminus @ X2 @ X3 ) )
| ~ ( in @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X2 )
| ( subset @ X2 @ X3 )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk4_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_18,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ ( setminus @ X1 @ X3 ) ) @ X3 )
| ( subset @ X2 @ ( setminus @ X1 @ X3 ) )
| ~ ( in @ ( setminus @ X1 @ X3 ) @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( subset @ ( setminus @ X1 @ X2 ) @ X3 )
| ~ ( in @ ( esk1_3 @ X4 @ ( setminus @ X1 @ X2 ) @ X3 ) @ X2 )
| ~ ( in @ ( setminus @ X1 @ X2 ) @ ( powerset @ X4 ) )
| ~ ( in @ X3 @ ( powerset @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_20,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ ( setminus @ X1 @ esk3_0 ) ) @ esk4_0 )
| ( subset @ X2 @ ( setminus @ X1 @ esk3_0 ) )
| ~ ( in @ ( setminus @ X1 @ esk3_0 ) @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ ( setminus @ X1 @ esk4_0 ) @ ( setminus @ X2 @ esk3_0 ) )
| ~ ( in @ ( setminus @ X1 @ esk4_0 ) @ ( powerset @ X2 ) )
| ~ ( in @ ( setminus @ X2 @ esk3_0 ) @ ( powerset @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( setminus @ X2 @ X1 ) @ ( powerset @ X2 ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_23,negated_conjecture,
~ ( subset @ ( setminus @ esk2_0 @ esk4_0 ) @ ( setminus @ esk2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ ( setminus @ X1 @ esk4_0 ) @ ( setminus @ X2 @ esk3_0 ) )
| ~ ( in @ ( setminus @ X1 @ esk4_0 ) @ ( powerset @ X2 ) )
| ~ ( in @ esk3_0 @ ( powerset @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_25,negated_conjecture,
in @ esk3_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_26,negated_conjecture,
~ ( in @ ( setminus @ esk2_0 @ esk4_0 ) @ ( powerset @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
thf(c_0_27,negated_conjecture,
in @ esk4_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU725^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n019.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 14:17:02 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.23 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.7rnRRZBGct/E---3.1_839829.p
% 0.07/0.26 % Version: 3.5.1-ho
% 0.07/0.26 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho8 with 300s (1) cores
% 0.07/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.07/0.26 % Starting post_as_ho2 with 300s (1) cores
% 0.07/0.26 % post_as_ho3 with pid 839844 completed with status 0
% 0.07/0.26 % Result found by post_as_ho3
% 0.07/0.26 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho8 with 300s (1) cores
% 0.07/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26 % No SInE strategy applied
% 0.07/0.26 % Search class: HGHNF-FFSS32-SFFFMFNN
% 0.07/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26 % SubtermCWHack with pid 839850 completed with status 0
% 0.07/0.26 % Result found by SubtermCWHack
% 0.07/0.26 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho8 with 300s (1) cores
% 0.07/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26 % No SInE strategy applied
% 0.07/0.26 % Search class: HGHNF-FFSS32-SFFFMFNN
% 0.07/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26 % Preprocessing time : 0.001 s
% 0.07/0.26
% 0.07/0.26 % Proof found!
% 0.07/0.26 % SZS status Theorem
% 0.07/0.26 % SZS output start CNFRefutation
% See solution above
% 0.07/0.26 % Parsed axioms : 15
% 0.07/0.26 % Removed by relevancy pruning/SinE : 0
% 0.07/0.26 % Initial clauses : 20
% 0.07/0.26 % Removed in clause preprocessing : 9
% 0.07/0.26 % Initial clauses in saturation : 11
% 0.07/0.26 % Processed clauses : 62
% 0.07/0.26 % ...of these trivial : 0
% 0.07/0.26 % ...subsumed : 7
% 0.07/0.26 % ...remaining for further processing : 55
% 0.07/0.26 % Other redundant clauses eliminated : 0
% 0.07/0.26 % Clauses deleted for lack of memory : 0
% 0.07/0.26 % Backward-subsumed : 0
% 0.07/0.26 % Backward-rewritten : 0
% 0.07/0.26 % Generated clauses : 99
% 0.07/0.26 % ...of the previous two non-redundant : 89
% 0.07/0.26 % ...aggressively subsumed : 0
% 0.07/0.26 % Contextual simplify-reflections : 0
% 0.07/0.26 % Paramodulations : 99
% 0.07/0.26 % Factorizations : 0
% 0.07/0.26 % NegExts : 0
% 0.07/0.26 % Equation resolutions : 0
% 0.07/0.26 % Disequality decompositions : 0
% 0.07/0.26 % Total rewrite steps : 3
% 0.07/0.26 % ...of those cached : 0
% 0.07/0.26 % Propositional unsat checks : 0
% 0.07/0.26 % Propositional check models : 0
% 0.07/0.26 % Propositional check unsatisfiable : 0
% 0.07/0.26 % Propositional clauses : 0
% 0.07/0.26 % Propositional clauses after purity: 0
% 0.07/0.26 % Propositional unsat core size : 0
% 0.07/0.26 % Propositional preprocessing time : 0.000
% 0.07/0.26 % Propositional encoding time : 0.000
% 0.07/0.26 % Propositional solver time : 0.000
% 0.07/0.26 % Success case prop preproc time : 0.000
% 0.07/0.26 % Success case prop encoding time : 0.000
% 0.07/0.26 % Success case prop solver time : 0.000
% 0.07/0.26 % Current number of processed clauses : 55
% 0.07/0.26 % Positive orientable unit clauses : 5
% 0.07/0.26 % Positive unorientable unit clauses: 0
% 0.07/0.26 % Negative unit clauses : 2
% 0.07/0.26 % Non-unit-clauses : 48
% 0.07/0.26 % Current number of unprocessed clauses: 38
% 0.07/0.26 % ...number of literals in the above : 181
% 0.07/0.26 % Current number of archived formulas : 0
% 0.07/0.26 % Current number of archived clauses : 0
% 0.07/0.26 % Clause-clause subsumption calls (NU) : 722
% 0.07/0.26 % Rec. Clause-clause subsumption calls : 496
% 0.07/0.26 % Non-unit clause-clause subsumptions : 7
% 0.07/0.26 % Unit Clause-clause subsumption calls : 1
% 0.07/0.26 % Rewrite failures with RHS unbound : 0
% 0.07/0.26 % BW rewrite match attempts : 0
% 0.07/0.26 % BW rewrite match successes : 0
% 0.07/0.26 % Condensation attempts : 0
% 0.07/0.26 % Condensation successes : 0
% 0.07/0.26 % Termbank termtop insertions : 4440
% 0.07/0.26 % Search garbage collected termcells : 556
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.008 s
% 0.07/0.26 % System time : 0.001 s
% 0.07/0.26 % Total time : 0.009 s
% 0.07/0.26 % Maximum resident set size: 3640 pages
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.009 s
% 0.07/0.26 % System time : 0.005 s
% 0.07/0.26 % Total time : 0.014 s
% 0.07/0.26 % Maximum resident set size: 4864 pages
% 0.07/0.26 % E exiting
%------------------------------------------------------------------------------