%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU649^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 : n020.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:24:52 AM UTC 2026
% Result : Theorem 0.11s 0.25s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 120 ( 55 equ; 0 cnn)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 486 ( 27 ~; 45 |; 9 &; 368 @)
% ( 5 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 77 ( 0 ^; 77 !; 0 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
emptyset: $i ).
thf(decl_25,type,
setadjoin: $i > $i > $i ).
thf(decl_26,type,
setext: $o ).
thf(decl_27,type,
setadjoinIL: $o ).
thf(decl_28,type,
uniqinunit: $o ).
thf(decl_29,type,
eqinunit: $o ).
thf(decl_30,type,
upairset2E: $o ).
thf(decl_31,type,
esk1_2: $i > $i > $i ).
thf(decl_32,type,
esk2_2: $i > $i > $i ).
thf(decl_33,type,
esk3_0: $i ).
thf(decl_34,type,
esk4_0: $i ).
thf(setukpairinjR11,conjecture,
( setext
=> ( setadjoinIL
=> ( uniqinunit
=> ( eqinunit
=> ( upairset2E
=> ! [X3: $i,X4: $i] :
( ( X3 = X4 )
=> ( ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) )
= ( setadjoin @ X3 @ emptyset ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6b7ULGU2Gu/E---3.1_1103086.p',setukpairinjR11) ).
thf(setext,axiom,
( setext
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X2 )
=> ( in @ X3 @ X1 ) )
=> ( X1 = X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6b7ULGU2Gu/E---3.1_1103086.p',setext) ).
thf(setadjoinIL,axiom,
( setadjoinIL
<=> ! [X3: $i,X4: $i] : ( in @ X3 @ ( setadjoin @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6b7ULGU2Gu/E---3.1_1103086.p',setadjoinIL) ).
thf(uniqinunit,axiom,
( uniqinunit
<=> ! [X3: $i,X4: $i] :
( ( in @ X3 @ ( setadjoin @ X4 @ emptyset ) )
=> ( X3 = X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6b7ULGU2Gu/E---3.1_1103086.p',uniqinunit) ).
thf(eqinunit,axiom,
( eqinunit
<=> ! [X3: $i,X4: $i] :
( ( X3 = X4 )
=> ( in @ X3 @ ( setadjoin @ X4 @ emptyset ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6b7ULGU2Gu/E---3.1_1103086.p',eqinunit) ).
thf(upairset2E,axiom,
( upairset2E
<=> ! [X3: $i,X4: $i,X5: $i] :
( ( in @ X5 @ ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) ) )
=> ( ( X5 = X3 )
| ( X5 = X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6b7ULGU2Gu/E---3.1_1103086.p',upairset2E) ).
thf(c_0_6,negated_conjecture,
~ ( setext
=> ( setadjoinIL
=> ( uniqinunit
=> ( eqinunit
=> ( upairset2E
=> ! [X3: $i,X4: $i] :
( ( X3 = X4 )
=> ( ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) )
= ( setadjoin @ X3 @ emptyset ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[setukpairinjR11]) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X21: $i,X22: $i] :
( ! [X23: $i] :
( ( in @ X23 @ X21 )
=> ( in @ X23 @ X22 ) )
=> ( ! [X24: $i] :
( ( in @ X24 @ X22 )
=> ( in @ X24 @ X21 ) )
=> ( X21 = X22 ) ) )
=> ( ! [X25: $i,X26: $i] : ( in @ X25 @ ( setadjoin @ X25 @ X26 ) )
=> ( ! [X27: $i,X28: $i] :
( ( in @ X27 @ ( setadjoin @ X28 @ emptyset ) )
=> ( X27 = X28 ) )
=> ( ! [X29: $i,X30: $i] :
( ( X29 = X30 )
=> ( in @ X29 @ ( setadjoin @ X30 @ emptyset ) ) )
=> ( ! [X31: $i,X32: $i,X33: $i] :
( ( in @ X33 @ ( setadjoin @ X31 @ ( setadjoin @ X32 @ emptyset ) ) )
=> ( ( X33 = X31 )
| ( X33 = X32 ) ) )
=> ! [X3: $i,X4: $i] :
( ( X3 = X4 )
=> ( ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) )
= ( setadjoin @ X3 @ emptyset ) ) ) ) ) ) ) ),
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,setext]),setadjoinIL]),uniqinunit]),eqinunit]),upairset2E]) ).
thf(c_0_8,negated_conjecture,
! [X34: $i,X35: $i,X38: $i,X39: $i,X40: $i,X41: $i,X42: $i,X43: $i,X44: $i,X45: $i,X46: $i] :
( ( ( in @ ( esk2_2 @ X34 @ X35 ) @ X35 )
| ( X34 = X35 )
| ( in @ ( esk1_2 @ X34 @ X35 ) @ X34 ) )
& ( ~ ( in @ ( esk2_2 @ X34 @ X35 ) @ X34 )
| ( X34 = X35 )
| ( in @ ( esk1_2 @ X34 @ X35 ) @ X34 ) )
& ( ( in @ ( esk2_2 @ X34 @ X35 ) @ X35 )
| ( X34 = X35 )
| ~ ( in @ ( esk1_2 @ X34 @ X35 ) @ X35 ) )
& ( ~ ( in @ ( esk2_2 @ X34 @ X35 ) @ X34 )
| ( X34 = X35 )
| ~ ( in @ ( esk1_2 @ X34 @ X35 ) @ X35 ) )
& ( in @ X38 @ ( setadjoin @ X38 @ X39 ) )
& ( ~ ( in @ X40 @ ( setadjoin @ X41 @ emptyset ) )
| ( X40 = X41 ) )
& ( ( X42 != X43 )
| ( in @ X42 @ ( setadjoin @ X43 @ emptyset ) ) )
& ( ~ ( in @ X46 @ ( setadjoin @ X44 @ ( setadjoin @ X45 @ emptyset ) ) )
| ( X46 = X44 )
| ( X46 = X45 ) )
& ( esk3_0 = esk4_0 )
& ( ( setadjoin @ esk3_0 @ ( setadjoin @ esk4_0 @ emptyset ) )
!= ( setadjoin @ esk3_0 @ emptyset ) ) ),
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,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk2_2 @ X1 @ X2 ) @ X2 )
| ( X1 = X2 )
| ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] :
( ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= X1 )
| ( ( setadjoin @ X1 @ emptyset )
= X2 )
| ( in @ ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ X2 ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
= X1 )
| ( ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
= X3 )
| ( ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
= X2 )
| ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X2: $i,X1: $i] :
( ( X1 = X2 )
| ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 )
| ~ ( in @ ( esk2_2 @ X1 @ X2 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X2: $i] :
( ( ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
= X1 )
| ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_13])]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk2_2 @ X1 @ X2 ) @ X2 )
| ( X1 = X2 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( in @ ( esk2_2 @ X1 @ X2 ) @ X1 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_18,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
= X1 )
| ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_9]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( ( esk2_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
= X3 )
| ( ( esk2_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
= X2 )
| ( X1
= ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
| ~ ( in @ ( esk1_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
thf(c_0_20,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) ) @ ( setadjoin @ X1 @ emptyset ) )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
thf(c_0_22,negated_conjecture,
( ( setadjoin @ esk3_0 @ ( setadjoin @ esk4_0 @ emptyset ) )
!= ( setadjoin @ esk3_0 @ emptyset ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_23,negated_conjecture,
esk3_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_24,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_26,negated_conjecture,
( ( setadjoin @ esk3_0 @ ( setadjoin @ esk3_0 @ emptyset ) )
!= ( setadjoin @ esk3_0 @ emptyset ) ),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i] :
( ( setadjoin @ X1 @ ( setadjoin @ X1 @ emptyset ) )
= ( setadjoin @ X1 @ emptyset ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_25])]) ).
thf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU649^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.17 % Computer : n020.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Tue Sep 29 14:03:19 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running higher-order theorem proving
% 0.11/0.22 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.6b7ULGU2Gu/E---3.1_1103086.p
% 0.11/0.25 % Version: 3.5.1-ho
% 0.11/0.25 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.11/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.11/0.25 % Starting post_as_ho8 with 300s (1) cores
% 0.11/0.25 % Starting post_as_ho3 with 300s (1) cores
% 0.11/0.25 % Starting post_as_ho2 with 300s (1) cores
% 0.11/0.25 % post_as_ho2 with pid 1103102 completed with status 0
% 0.11/0.25 % Result found by post_as_ho2
% 0.11/0.25 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.11/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.11/0.25 % Starting post_as_ho8 with 300s (1) cores
% 0.11/0.25 % Starting post_as_ho3 with 300s (1) cores
% 0.11/0.25 % Starting post_as_ho2 with 300s (1) cores
% 0.11/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.25 % No SInE strategy applied
% 0.11/0.25 % Search class: HGUSF-FFSF22-SFFFMFNN
% 0.11/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.25 % SubtermCWHack with pid 1103103 completed with status 0
% 0.11/0.25 % Result found by SubtermCWHack
% 0.11/0.25 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.11/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.11/0.25 % Starting post_as_ho8 with 300s (1) cores
% 0.11/0.25 % Starting post_as_ho3 with 300s (1) cores
% 0.11/0.25 % Starting post_as_ho2 with 300s (1) cores
% 0.11/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.25 % No SInE strategy applied
% 0.11/0.25 % Search class: HGUSF-FFSF22-SFFFMFNN
% 0.11/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.25 % Preprocessing time : 0.001 s
% 0.11/0.25
% 0.11/0.25 % Proof found!
% 0.11/0.25 % SZS status Theorem
% 0.11/0.25 % SZS output start CNFRefutation
% See solution above
% 0.11/0.25 % Parsed axioms : 14
% 0.11/0.25 % Removed by relevancy pruning/SinE : 0
% 0.11/0.25 % Initial clauses : 18
% 0.11/0.25 % Removed in clause preprocessing : 8
% 0.11/0.25 % Initial clauses in saturation : 10
% 0.11/0.25 % Processed clauses : 38
% 0.11/0.25 % ...of these trivial : 0
% 0.11/0.25 % ...subsumed : 3
% 0.11/0.25 % ...remaining for further processing : 35
% 0.11/0.25 % Other redundant clauses eliminated : 3
% 0.11/0.25 % Clauses deleted for lack of memory : 0
% 0.11/0.25 % Backward-subsumed : 4
% 0.11/0.25 % Backward-rewritten : 4
% 0.11/0.25 % Generated clauses : 88
% 0.11/0.25 % ...of the previous two non-redundant : 55
% 0.11/0.25 % ...aggressively subsumed : 0
% 0.11/0.25 % Contextual simplify-reflections : 2
% 0.11/0.25 % Paramodulations : 83
% 0.11/0.25 % Factorizations : 2
% 0.11/0.25 % NegExts : 0
% 0.11/0.25 % Equation resolutions : 3
% 0.11/0.25 % Disequality decompositions : 0
% 0.11/0.25 % Total rewrite steps : 38
% 0.11/0.25 % ...of those cached : 30
% 0.11/0.25 % Propositional unsat checks : 0
% 0.11/0.25 % Propositional check models : 0
% 0.11/0.25 % Propositional check unsatisfiable : 0
% 0.11/0.25 % Propositional clauses : 0
% 0.11/0.25 % Propositional clauses after purity: 0
% 0.11/0.25 % Propositional unsat core size : 0
% 0.11/0.25 % Propositional preprocessing time : 0.000
% 0.11/0.25 % Propositional encoding time : 0.000
% 0.11/0.25 % Propositional solver time : 0.000
% 0.11/0.25 % Success case prop preproc time : 0.000
% 0.11/0.25 % Success case prop encoding time : 0.000
% 0.11/0.25 % Success case prop solver time : 0.000
% 0.11/0.25 % Current number of processed clauses : 26
% 0.11/0.25 % Positive orientable unit clauses : 3
% 0.11/0.25 % Positive unorientable unit clauses: 0
% 0.11/0.25 % Negative unit clauses : 0
% 0.11/0.25 % Non-unit-clauses : 23
% 0.11/0.25 % Current number of unprocessed clauses: 22
% 0.11/0.25 % ...number of literals in the above : 100
% 0.11/0.25 % Current number of archived formulas : 0
% 0.11/0.25 % Current number of archived clauses : 8
% 0.11/0.25 % Clause-clause subsumption calls (NU) : 247
% 0.11/0.25 % Rec. Clause-clause subsumption calls : 139
% 0.11/0.25 % Non-unit clause-clause subsumptions : 9
% 0.11/0.25 % Unit Clause-clause subsumption calls : 15
% 0.11/0.25 % Rewrite failures with RHS unbound : 0
% 0.11/0.25 % BW rewrite match attempts : 4
% 0.11/0.25 % BW rewrite match successes : 2
% 0.11/0.25 % Condensation attempts : 0
% 0.11/0.25 % Condensation successes : 0
% 0.11/0.25 % Termbank termtop insertions : 4500
% 0.11/0.25 % Search garbage collected termcells : 403
% 0.11/0.25
% 0.11/0.25 % -------------------------------------------------
% 0.11/0.25 % User time : 0.007 s
% 0.11/0.25 % System time : 0.003 s
% 0.11/0.25 % Total time : 0.010 s
% 0.11/0.25 % Maximum resident set size: 3636 pages
% 0.11/0.25
% 0.11/0.25 % -------------------------------------------------
% 0.11/0.25 % User time : 0.008 s
% 0.11/0.25 % System time : 0.008 s
% 0.11/0.25 % Total time : 0.016 s
% 0.11/0.25 % Maximum resident set size: 4864 pages
% 0.11/0.25 % E exiting
%------------------------------------------------------------------------------