%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU749^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 : n010.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:28 AM UTC 2026
% Result : Theorem 0.22s 0.28s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 123 ( 0 equ; 0 cnn)
% Maximal formula atoms : 25 ( 5 avg)
% Number of connectives : 599 ( 47 ~; 46 |; 8 &; 452 @)
% ( 4 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 12 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 12 usr; 8 con; 0-3 aty)
% Number of variables : 77 ( 0 ^; 77 !; 0 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
powerset: $i > $i ).
thf(decl_25,type,
binunion: $i > $i > $i ).
thf(decl_26,type,
setminus: $i > $i > $i ).
thf(decl_27,type,
binunionT_lem: $o ).
thf(decl_28,type,
complementT_lem: $o ).
thf(decl_29,type,
powersetTI1: $o ).
thf(decl_30,type,
demorgan2a1: $o ).
thf(decl_31,type,
esk1_3: $i > $i > $i > $i ).
thf(decl_32,type,
esk2_0: $i ).
thf(decl_33,type,
esk3_0: $i ).
thf(decl_34,type,
esk4_0: $i ).
thf(complementUnionInPowersetComplement,conjecture,
( binunionT_lem
=> ( complementT_lem
=> ( powersetTI1
=> ( demorgan2a1
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( in @ ( setminus @ X1 @ ( binunion @ X2 @ X3 ) ) @ ( powerset @ ( setminus @ X1 @ X2 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lyqmL3rnmt/E---3.1_2931765.p',complementUnionInPowersetComplement) ).
thf(binunionT_lem,axiom,
( binunionT_lem
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( in @ ( binunion @ X2 @ X3 ) @ ( powerset @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lyqmL3rnmt/E---3.1_2931765.p',binunionT_lem) ).
thf(complementT_lem,axiom,
( complementT_lem
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ( in @ ( setminus @ X1 @ X2 ) @ ( powerset @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lyqmL3rnmt/E---3.1_2931765.p',complementT_lem) ).
thf(powersetTI1,axiom,
( powersetTI1
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( in @ X4 @ X2 )
=> ( in @ X4 @ X3 ) ) )
=> ( in @ X2 @ ( powerset @ X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lyqmL3rnmt/E---3.1_2931765.p',powersetTI1) ).
thf(demorgan2a1,axiom,
( demorgan2a1
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( in @ X4 @ ( setminus @ X1 @ ( binunion @ X2 @ X3 ) ) )
=> ( in @ X4 @ ( setminus @ X1 @ X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lyqmL3rnmt/E---3.1_2931765.p',demorgan2a1) ).
thf(c_0_5,negated_conjecture,
~ ( binunionT_lem
=> ( complementT_lem
=> ( powersetTI1
=> ( demorgan2a1
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( in @ ( setminus @ X1 @ ( binunion @ X2 @ X3 ) ) @ ( powerset @ ( setminus @ X1 @ X2 ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[complementUnionInPowersetComplement]) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X21: $i,X22: $i] :
( ( in @ X22 @ ( powerset @ X21 ) )
=> ! [X23: $i] :
( ( in @ X23 @ ( powerset @ X21 ) )
=> ( in @ ( binunion @ X22 @ X23 ) @ ( powerset @ X21 ) ) ) )
=> ( ! [X24: $i,X25: $i] :
( ( in @ X25 @ ( powerset @ X24 ) )
=> ( in @ ( setminus @ X24 @ X25 ) @ ( powerset @ X24 ) ) )
=> ( ! [X26: $i,X27: $i] :
( ( in @ X27 @ ( powerset @ X26 ) )
=> ! [X28: $i] :
( ( in @ X28 @ ( powerset @ X26 ) )
=> ( ! [X29: $i] :
( ( in @ X29 @ X26 )
=> ( ( in @ X29 @ X27 )
=> ( in @ X29 @ X28 ) ) )
=> ( in @ X27 @ ( powerset @ X28 ) ) ) ) )
=> ( ! [X30: $i,X31: $i] :
( ( in @ X31 @ ( powerset @ X30 ) )
=> ! [X32: $i] :
( ( in @ X32 @ ( powerset @ X30 ) )
=> ! [X33: $i] :
( ( in @ X33 @ X30 )
=> ( ( in @ X33 @ ( setminus @ X30 @ ( binunion @ X31 @ X32 ) ) )
=> ( in @ X33 @ ( setminus @ X30 @ X31 ) ) ) ) ) )
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( in @ ( setminus @ X1 @ ( binunion @ X2 @ X3 ) ) @ ( powerset @ ( setminus @ X1 @ X2 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,binunionT_lem]),complementT_lem]),powersetTI1]),demorgan2a1]) ).
thf(c_0_7,negated_conjecture,
! [X34: $i,X35: $i,X36: $i,X37: $i,X38: $i,X39: $i,X40: $i,X41: $i,X43: $i,X44: $i,X45: $i,X46: $i] :
( ( ~ ( in @ X35 @ ( powerset @ X34 ) )
| ~ ( in @ X36 @ ( powerset @ X34 ) )
| ( in @ ( binunion @ X35 @ X36 ) @ ( powerset @ X34 ) ) )
& ( ~ ( in @ X38 @ ( powerset @ X37 ) )
| ( in @ ( setminus @ X37 @ X38 ) @ ( powerset @ X37 ) ) )
& ( ( in @ ( esk1_3 @ X39 @ X40 @ X41 ) @ X39 )
| ( in @ X40 @ ( powerset @ X41 ) )
| ~ ( in @ X41 @ ( powerset @ X39 ) )
| ~ ( in @ X40 @ ( powerset @ X39 ) ) )
& ( ( in @ ( esk1_3 @ X39 @ X40 @ X41 ) @ X40 )
| ( in @ X40 @ ( powerset @ X41 ) )
| ~ ( in @ X41 @ ( powerset @ X39 ) )
| ~ ( in @ X40 @ ( powerset @ X39 ) ) )
& ( ~ ( in @ ( esk1_3 @ X39 @ X40 @ X41 ) @ X41 )
| ( in @ X40 @ ( powerset @ X41 ) )
| ~ ( in @ X41 @ ( powerset @ X39 ) )
| ~ ( in @ X40 @ ( powerset @ X39 ) ) )
& ( ~ ( in @ X44 @ ( powerset @ X43 ) )
| ~ ( in @ X45 @ ( powerset @ X43 ) )
| ~ ( in @ X46 @ X43 )
| ~ ( in @ X46 @ ( setminus @ X43 @ ( binunion @ X44 @ X45 ) ) )
| ( in @ X46 @ ( setminus @ X43 @ X44 ) ) )
& ( in @ esk3_0 @ ( powerset @ esk2_0 ) )
& ( in @ esk4_0 @ ( powerset @ esk2_0 ) )
& ~ ( in @ ( setminus @ esk2_0 @ ( binunion @ esk3_0 @ esk4_0 ) ) @ ( powerset @ ( 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_6])])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i,X4: $i,X3: $i] :
( ( in @ X4 @ ( setminus @ X2 @ X1 ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) )
| ~ ( in @ X4 @ X2 )
| ~ ( in @ X4 @ ( setminus @ X2 @ ( binunion @ X1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X2 )
| ( in @ X2 @ ( powerset @ X3 ) )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X2 @ ( powerset @ X3 ) )
| ~ ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X3 )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i,X4: $i,X5: $i,X3: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ ( setminus @ X2 @ ( binunion @ X3 @ X4 ) ) @ X5 ) @ ( setminus @ X2 @ X3 ) )
| ( in @ ( setminus @ X2 @ ( binunion @ X3 @ X4 ) ) @ ( powerset @ X5 ) )
| ~ ( in @ ( esk1_3 @ X1 @ ( setminus @ X2 @ ( binunion @ X3 @ X4 ) ) @ X5 ) @ X2 )
| ~ ( in @ ( setminus @ X2 @ ( binunion @ X3 @ X4 ) ) @ ( powerset @ X1 ) )
| ~ ( in @ X4 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) )
| ~ ( in @ X5 @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X4: $i,X3: $i,X2: $i,X1: $i] :
( ( in @ ( setminus @ X1 @ ( binunion @ X2 @ X3 ) ) @ ( powerset @ ( setminus @ X1 @ X2 ) ) )
| ~ ( in @ ( esk1_3 @ X4 @ ( setminus @ X1 @ ( binunion @ X2 @ X3 ) ) @ ( setminus @ X1 @ X2 ) ) @ X1 )
| ~ ( in @ ( setminus @ X1 @ ( binunion @ X2 @ X3 ) ) @ ( powerset @ X4 ) )
| ~ ( in @ ( setminus @ X1 @ X2 ) @ ( powerset @ X4 ) )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X1 )
| ( in @ X2 @ ( powerset @ X3 ) )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( setminus @ X2 @ X1 ) @ ( powerset @ X2 ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,negated_conjecture,
~ ( in @ ( setminus @ esk2_0 @ ( binunion @ esk3_0 @ esk4_0 ) ) @ ( powerset @ ( setminus @ esk2_0 @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( setminus @ X1 @ ( binunion @ X2 @ X3 ) ) @ ( powerset @ ( setminus @ X1 @ X2 ) ) )
| ~ ( in @ ( setminus @ X1 @ ( binunion @ X2 @ X3 ) ) @ ( powerset @ X1 ) )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_17,negated_conjecture,
in @ esk4_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_18,negated_conjecture,
in @ esk3_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_19,negated_conjecture,
~ ( in @ ( setminus @ esk2_0 @ ( binunion @ esk3_0 @ esk4_0 ) ) @ ( powerset @ esk2_0 ) ),
inference(cn,[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])]) ).
thf(c_0_20,negated_conjecture,
~ ( in @ ( binunion @ esk3_0 @ esk4_0 ) @ ( powerset @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( binunion @ X1 @ X3 ) @ ( powerset @ X2 ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU749^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.08/0.19 % Computer : n010.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 14:21:49 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.25 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.lyqmL3rnmt/E---3.1_2931765.p
% 0.22/0.28 % Version: 3.5.1-ho
% 0.22/0.28 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.22/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.28 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.22/0.28 % Starting post_as_ho8 with 300s (1) cores
% 0.22/0.28 % Starting post_as_ho3 with 300s (1) cores
% 0.22/0.28 % Starting post_as_ho2 with 300s (1) cores
% 0.22/0.28 % lpo6_lambda_fix with pid 2931792 completed with status 0
% 0.22/0.28 % Result found by lpo6_lambda_fix
% 0.22/0.28 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.22/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.28 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.22/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.22/0.28 % No SInE strategy applied
% 0.22/0.28 % Search class: HGUNF-FFSF32-SFFFMFNN
% 0.22/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.28 % Starting lpo6_lambda_fix with 151s (1) cores
% 0.22/0.28 % Starting sh5l with 136s (1) cores
% 0.22/0.28 % Starting new_bool_1 with 136s (1) cores
% 0.22/0.28 % Starting new_bool_2 with 136s (1) cores
% 0.22/0.28 % sh5l with pid 2931800 completed with status 0
% 0.22/0.28 % Result found by sh5l
% 0.22/0.28 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.22/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.28 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.22/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.22/0.28 % No SInE strategy applied
% 0.22/0.28 % Search class: HGUNF-FFSF32-SFFFMFNN
% 0.22/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.28 % Starting lpo6_lambda_fix with 151s (1) cores
% 0.22/0.28 % Starting sh5l with 136s (1) cores
% 0.22/0.28 % Preprocessing time : 0.001 s
% 0.22/0.28 % Presaturation interreduction done
% 0.22/0.28
% 0.22/0.28 % Proof found!
% 0.22/0.28 % SZS status Theorem
% 0.22/0.28 % SZS output start CNFRefutation
% See solution above
% 0.22/0.28 % Parsed axioms : 13
% 0.22/0.28 % Removed by relevancy pruning/SinE : 0
% 0.22/0.28 % Initial clauses : 17
% 0.22/0.28 % Removed in clause preprocessing : 8
% 0.22/0.28 % Initial clauses in saturation : 9
% 0.22/0.28 % Processed clauses : 77
% 0.22/0.28 % ...of these trivial : 0
% 0.22/0.28 % ...subsumed : 19
% 0.22/0.28 % ...remaining for further processing : 58
% 0.22/0.28 % Other redundant clauses eliminated : 0
% 0.22/0.28 % Clauses deleted for lack of memory : 0
% 0.22/0.28 % Backward-subsumed : 0
% 0.22/0.28 % Backward-rewritten : 0
% 0.22/0.28 % Generated clauses : 155
% 0.22/0.28 % ...of the previous two non-redundant : 151
% 0.22/0.28 % ...aggressively subsumed : 0
% 0.22/0.28 % Contextual simplify-reflections : 1
% 0.22/0.28 % Paramodulations : 155
% 0.22/0.28 % Factorizations : 0
% 0.22/0.28 % NegExts : 0
% 0.22/0.28 % Equation resolutions : 0
% 0.22/0.28 % Disequality decompositions : 0
% 0.22/0.28 % Total rewrite steps : 6
% 0.22/0.28 % ...of those cached : 2
% 0.22/0.28 % Propositional unsat checks : 0
% 0.22/0.28 % Propositional check models : 0
% 0.22/0.28 % Propositional check unsatisfiable : 0
% 0.22/0.28 % Propositional clauses : 0
% 0.22/0.28 % Propositional clauses after purity: 0
% 0.22/0.28 % Propositional unsat core size : 0
% 0.22/0.28 % Propositional preprocessing time : 0.000
% 0.22/0.28 % Propositional encoding time : 0.000
% 0.22/0.28 % Propositional solver time : 0.000
% 0.22/0.28 % Success case prop preproc time : 0.000
% 0.22/0.28 % Success case prop encoding time : 0.000
% 0.22/0.28 % Success case prop solver time : 0.000
% 0.22/0.28 % Current number of processed clauses : 49
% 0.22/0.28 % Positive orientable unit clauses : 4
% 0.22/0.28 % Positive unorientable unit clauses: 0
% 0.22/0.28 % Negative unit clauses : 3
% 0.22/0.28 % Non-unit-clauses : 42
% 0.22/0.28 % Current number of unprocessed clauses: 92
% 0.22/0.28 % ...number of literals in the above : 511
% 0.22/0.28 % Current number of archived formulas : 0
% 0.22/0.28 % Current number of archived clauses : 9
% 0.22/0.28 % Clause-clause subsumption calls (NU) : 883
% 0.22/0.28 % Rec. Clause-clause subsumption calls : 488
% 0.22/0.28 % Non-unit clause-clause subsumptions : 20
% 0.22/0.28 % Unit Clause-clause subsumption calls : 11
% 0.22/0.28 % Rewrite failures with RHS unbound : 0
% 0.22/0.28 % BW rewrite match attempts : 0
% 0.22/0.28 % BW rewrite match successes : 0
% 0.22/0.28 % Condensation attempts : 77
% 0.22/0.28 % Condensation successes : 0
% 0.22/0.28 % Termbank termtop insertions : 21720
% 0.22/0.28 % Search garbage collected termcells : 511
% 0.22/0.28
% 0.22/0.28 % -------------------------------------------------
% 0.22/0.28 % User time : 0.009 s
% 0.22/0.28 % System time : 0.003 s
% 0.22/0.28 % Total time : 0.012 s
% 0.22/0.28 % Maximum resident set size: 3640 pages
% 0.22/0.28
% 0.22/0.28 % -------------------------------------------------
% 0.22/0.28 % User time : 0.041 s
% 0.22/0.28 % System time : 0.013 s
% 0.22/0.28 % Total time : 0.054 s
% 0.22/0.28 % Maximum resident set size: 4864 pages
% 0.22/0.28 % E exiting
%------------------------------------------------------------------------------