%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU822^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 : n001.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:46 AM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 194 ( 17 equ; 0 cnn)
% Maximal formula atoms : 39 ( 6 avg)
% Number of connectives : 583 ( 98 ~; 91 |; 29 &; 331 @)
% ( 1 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 67 ( 5 ^; 55 !; 7 ?; 67 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
powerset: $i > $i ).
thf(decl_25,type,
nonempty: $i > $o ).
thf(decl_26,type,
transitiveset: $i > $o ).
thf(decl_27,type,
stricttotalorderedByIn: $i > $o ).
thf(decl_28,type,
wellorderedByIn: $i > $o ).
thf(decl_29,type,
ordinal: $i > $o ).
thf(decl_30,type,
ordinalIrrefl: $o ).
thf(decl_31,type,
esk1_1: $i > $i ).
thf(decl_32,type,
esk2_2: $i > $i > $i ).
thf(decl_33,type,
esk3_0: $i ).
thf(decl_34,type,
esk4_1: $i > $i ).
thf(ordinal,axiom,
( ordinal
= ( ^ [X2: $i] :
( ( transitiveset @ X2 )
& ( wellorderedByIn @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.R2KlOvpKgN/E---3.1_1336062.p',ordinal) ).
thf(wellorderedByIn,axiom,
( wellorderedByIn
= ( ^ [X1: $i] :
( ( stricttotalorderedByIn @ X1 )
& ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( ( nonempty @ X3 )
=> ? [X2: $i] :
( ( in @ X2 @ X3 )
& ! [X4: $i] :
( ( in @ X4 @ X3 )
=> ( ( X2 = X4 )
| ( in @ X2 @ X4 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.R2KlOvpKgN/E---3.1_1336062.p',wellorderedByIn) ).
thf(ordinalIrrefl2,conjecture,
( ordinalIrrefl
=> ! [X3: $i] :
( ( ordinal @ X3 )
=> ~ ( in @ X3 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.R2KlOvpKgN/E---3.1_1336062.p',ordinalIrrefl2) ).
thf(ordinalIrrefl,axiom,
( ordinalIrrefl
<=> ! [X3: $i] :
( ( ordinal @ X3 )
=> ! [X1: $i] :
( ( in @ X1 @ X3 )
=> ~ ( in @ X1 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.R2KlOvpKgN/E---3.1_1336062.p',ordinalIrrefl) ).
thf(c_0_4,plain,
( ordinal
= ( ^ [Z0: $i] :
( ( transitiveset @ Z0 )
& ( stricttotalorderedByIn @ Z0 )
& ! [X8: $i] :
( ( in @ X8 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X8 )
=> ? [X9: $i] :
( ( in @ X9 @ X8 )
& ! [X10: $i] :
( ( in @ X10 @ X8 )
=> ( ( X9 = X10 )
| ( in @ X9 @ X10 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ordinal]) ).
thf(c_0_5,plain,
( wellorderedByIn
= ( ^ [Z0: $i] :
( ( stricttotalorderedByIn @ Z0 )
& ! [X3: $i] :
( ( in @ X3 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X3 )
=> ? [X2: $i] :
( ( in @ X2 @ X3 )
& ! [X4: $i] :
( ( in @ X4 @ X3 )
=> ( ( X2 = X4 )
| ( in @ X2 @ X4 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[wellorderedByIn]) ).
thf(c_0_6,plain,
( ordinal
= ( ^ [Z0: $i] :
( ( transitiveset @ Z0 )
& ( stricttotalorderedByIn @ Z0 )
& ! [X8: $i] :
( ( in @ X8 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X8 )
=> ? [X9: $i] :
( ( in @ X9 @ X8 )
& ! [X10: $i] :
( ( in @ X10 @ X8 )
=> ( ( X9 = X10 )
| ( in @ X9 @ X10 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,negated_conjecture,
~ ( ordinalIrrefl
=> ! [X3: $i] :
( ( ordinal @ X3 )
=> ~ ( in @ X3 @ X3 ) ) ),
inference(assume_negation,[status(cth)],[ordinalIrrefl2]) ).
thf(c_0_8,axiom,
( ordinalIrrefl
= ( ! [X3: $i] :
( ( ( transitiveset @ X3 )
& ( stricttotalorderedByIn @ X3 )
& ! [X11: $i] :
( ( in @ X11 @ ( powerset @ X3 ) )
=> ( ( nonempty @ X11 )
=> ? [X12: $i] :
( ( in @ X12 @ X11 )
& ! [X13: $i] :
( ( in @ X13 @ X11 )
=> ( ( X12 = X13 )
| ( in @ X12 @ X13 ) ) ) ) ) ) )
=> ! [X1: $i] :
( ( in @ X1 @ X3 )
=> ~ ( in @ X1 @ X1 ) ) ) ) ),
inference(apply_def,[status(thm)],[ordinalIrrefl,c_0_6]) ).
thf(c_0_9,negated_conjecture,
~ ( ! [X14: $i] :
( ( ( transitiveset @ X14 )
& ( stricttotalorderedByIn @ X14 )
& ! [X15: $i] :
( ( in @ X15 @ ( powerset @ X14 ) )
=> ( ( nonempty @ X15 )
=> ? [X16: $i] :
( ( in @ X16 @ X15 )
& ! [X17: $i] :
( ( in @ X17 @ X15 )
=> ( ( X16 = X17 )
| ( in @ X16 @ X17 ) ) ) ) ) ) )
=> ! [X18: $i] :
( ( in @ X18 @ X14 )
=> ~ ( in @ X18 @ X18 ) ) )
=> ! [X3: $i] :
( ( ( transitiveset @ X3 )
& ( stricttotalorderedByIn @ X3 )
& ! [X19: $i] :
( ( in @ X19 @ ( powerset @ X3 ) )
=> ( ( nonempty @ X19 )
=> ? [X20: $i] :
( ( in @ X20 @ X19 )
& ! [X21: $i] :
( ( in @ X21 @ X19 )
=> ( ( X20 = X21 )
| ( in @ X20 @ X21 ) ) ) ) ) ) )
=> ~ ( in @ X3 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7,c_0_8]),c_0_6])]) ).
thf(c_0_10,negated_conjecture,
! [X22: $i,X24: $i,X26: $i,X28: $i,X30: $i] :
( ( ( in @ ( esk1_1 @ X22 ) @ ( powerset @ X22 ) )
| ~ ( stricttotalorderedByIn @ X22 )
| ~ ( transitiveset @ X22 )
| ~ ( in @ X26 @ X22 )
| ~ ( in @ X26 @ X26 ) )
& ( ( nonempty @ ( esk1_1 @ X22 ) )
| ~ ( stricttotalorderedByIn @ X22 )
| ~ ( transitiveset @ X22 )
| ~ ( in @ X26 @ X22 )
| ~ ( in @ X26 @ X26 ) )
& ( ( in @ ( esk2_2 @ X22 @ X24 ) @ ( esk1_1 @ X22 ) )
| ~ ( in @ X24 @ ( esk1_1 @ X22 ) )
| ~ ( stricttotalorderedByIn @ X22 )
| ~ ( transitiveset @ X22 )
| ~ ( in @ X26 @ X22 )
| ~ ( in @ X26 @ X26 ) )
& ( ( X24
!= ( esk2_2 @ X22 @ X24 ) )
| ~ ( in @ X24 @ ( esk1_1 @ X22 ) )
| ~ ( stricttotalorderedByIn @ X22 )
| ~ ( transitiveset @ X22 )
| ~ ( in @ X26 @ X22 )
| ~ ( in @ X26 @ X26 ) )
& ( ~ ( in @ X24 @ ( esk2_2 @ X22 @ X24 ) )
| ~ ( in @ X24 @ ( esk1_1 @ X22 ) )
| ~ ( stricttotalorderedByIn @ X22 )
| ~ ( transitiveset @ X22 )
| ~ ( in @ X26 @ X22 )
| ~ ( in @ X26 @ X26 ) )
& ( transitiveset @ esk3_0 )
& ( stricttotalorderedByIn @ esk3_0 )
& ( ( in @ ( esk4_1 @ X28 ) @ X28 )
| ~ ( nonempty @ X28 )
| ~ ( in @ X28 @ ( powerset @ esk3_0 ) ) )
& ( ~ ( in @ X30 @ X28 )
| ( ( esk4_1 @ X28 )
= X30 )
| ( in @ ( esk4_1 @ X28 ) @ X30 )
| ~ ( nonempty @ X28 )
| ~ ( in @ X28 @ ( powerset @ esk3_0 ) ) )
& ( in @ esk3_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_9])])])])])]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ~ ( in @ X1 @ ( esk2_2 @ X2 @ X1 ) )
| ~ ( in @ X1 @ ( esk1_1 @ X2 ) )
| ~ ( stricttotalorderedByIn @ X2 )
| ~ ( transitiveset @ X2 )
| ~ ( in @ X3 @ X2 )
| ~ ( in @ X3 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] :
( ( ( esk4_1 @ X2 )
= X1 )
| ( in @ ( esk4_1 @ X2 ) @ X1 )
| ~ ( in @ X1 @ X2 )
| ~ ( nonempty @ X2 )
| ~ ( in @ X2 @ ( powerset @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X1
!= ( esk2_2 @ X2 @ X1 ) )
| ~ ( in @ X1 @ ( esk1_1 @ X2 ) )
| ~ ( stricttotalorderedByIn @ X2 )
| ~ ( transitiveset @ X2 )
| ~ ( in @ X3 @ X2 )
| ~ ( in @ X3 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( esk2_2 @ X1 @ X2 ) @ ( esk1_1 @ X1 ) )
| ~ ( in @ X2 @ ( esk1_1 @ X1 ) )
| ~ ( stricttotalorderedByIn @ X1 )
| ~ ( transitiveset @ X1 )
| ~ ( in @ X3 @ X1 )
| ~ ( in @ X3 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,negated_conjecture,
in @ esk3_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ~ ( in @ ( esk2_2 @ X1 @ ( esk4_1 @ X2 ) ) @ X2 )
| ~ ( in @ ( esk4_1 @ X2 ) @ ( esk1_1 @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ esk3_0 ) )
| ~ ( in @ X3 @ X3 )
| ~ ( in @ X3 @ X1 )
| ~ ( transitiveset @ X1 )
| ~ ( stricttotalorderedByIn @ X1 )
| ~ ( nonempty @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk2_2 @ X1 @ X2 ) @ ( esk1_1 @ X1 ) )
| ~ ( in @ X2 @ ( esk1_1 @ X1 ) )
| ~ ( in @ esk3_0 @ X1 )
| ~ ( transitiveset @ X1 )
| ~ ( stricttotalorderedByIn @ X1 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i] :
( ( nonempty @ ( esk1_1 @ X1 ) )
| ~ ( stricttotalorderedByIn @ X1 )
| ~ ( transitiveset @ X1 )
| ~ ( in @ X2 @ X1 )
| ~ ( in @ X2 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_19,negated_conjecture,
! [X2: $i,X1: $i] :
( ~ ( in @ ( esk4_1 @ ( esk1_1 @ X1 ) ) @ ( esk1_1 @ X1 ) )
| ~ ( in @ ( esk1_1 @ X1 ) @ ( powerset @ esk3_0 ) )
| ~ ( in @ esk3_0 @ X1 )
| ~ ( in @ X2 @ X2 )
| ~ ( in @ X2 @ X1 )
| ~ ( transitiveset @ X1 )
| ~ ( stricttotalorderedByIn @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk4_1 @ X1 ) @ X1 )
| ~ ( nonempty @ X1 )
| ~ ( in @ X1 @ ( powerset @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_1 @ X1 ) @ ( powerset @ X1 ) )
| ~ ( stricttotalorderedByIn @ X1 )
| ~ ( transitiveset @ X1 )
| ~ ( in @ X2 @ X1 )
| ~ ( in @ X2 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_22,negated_conjecture,
! [X2: $i,X1: $i] :
( ~ ( in @ ( esk1_1 @ X1 ) @ ( powerset @ esk3_0 ) )
| ~ ( in @ esk3_0 @ X1 )
| ~ ( in @ X2 @ X2 )
| ~ ( in @ X2 @ X1 )
| ~ ( transitiveset @ X1 )
| ~ ( stricttotalorderedByIn @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk1_1 @ X1 ) @ ( powerset @ X1 ) )
| ~ ( in @ esk3_0 @ X1 )
| ~ ( transitiveset @ X1 )
| ~ ( stricttotalorderedByIn @ X1 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
thf(c_0_24,negated_conjecture,
transitiveset @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_25,negated_conjecture,
stricttotalorderedByIn @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ esk3_0 )
| ~ ( in @ X1 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15]),c_0_24]),c_0_25])]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU822^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.08/0.17 % Computer : n001.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 14:40:50 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/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.R2KlOvpKgN/E---3.1_1336062.p
% 0.08/0.24 % Version: 3.5.1-ho
% 0.08/0.24 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.24 % Starting post_as_ho5 with 300s (1) cores
% 0.08/0.24 % Starting sh4l with 300s (1) cores
% 0.08/0.24 % Starting ho_unfolding_2 with 300s (1) cores
% 0.08/0.24 % post_as_ho5 with pid 1336076 completed with status 0
% 0.08/0.24 % Result found by post_as_ho5
% 0.08/0.24 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.24 % Starting post_as_ho5 with 300s (1) cores
% 0.08/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.08/0.24 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.08/0.24 % Search class: HGHSF-FFSS21-SSFFMFNN
% 0.08/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.24 % SubtermCWHack with pid 1336079 completed with status 0
% 0.08/0.24 % Result found by SubtermCWHack
% 0.08/0.24 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.24 % Starting post_as_ho5 with 300s (1) cores
% 0.08/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.08/0.24 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.08/0.24 % Search class: HGHSF-FFSS21-SSFFMFNN
% 0.08/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.24 % Preprocessing time : 0.001 s
% 0.08/0.24
% 0.08/0.24 % Proof found!
% 0.08/0.24 % SZS status Theorem
% 0.08/0.24 % SZS output start CNFRefutation
% See solution above
% 0.08/0.24 % Parsed axioms : 13
% 0.08/0.24 % Removed by relevancy pruning/SinE : 9
% 0.08/0.24 % Initial clauses : 10
% 0.08/0.24 % Removed in clause preprocessing : 0
% 0.08/0.24 % Initial clauses in saturation : 10
% 0.08/0.24 % Processed clauses : 17
% 0.08/0.24 % ...of these trivial : 0
% 0.08/0.24 % ...subsumed : 0
% 0.08/0.24 % ...remaining for further processing : 17
% 0.08/0.24 % Other redundant clauses eliminated : 0
% 0.08/0.24 % Clauses deleted for lack of memory : 0
% 0.08/0.24 % Backward-subsumed : 1
% 0.08/0.24 % Backward-rewritten : 0
% 0.08/0.24 % Generated clauses : 11
% 0.08/0.24 % ...of the previous two non-redundant : 10
% 0.08/0.24 % ...aggressively subsumed : 0
% 0.08/0.24 % Contextual simplify-reflections : 3
% 0.08/0.24 % Paramodulations : 11
% 0.08/0.24 % Factorizations : 0
% 0.08/0.24 % NegExts : 0
% 0.08/0.24 % Equation resolutions : 0
% 0.08/0.24 % Disequality decompositions : 0
% 0.08/0.24 % Total rewrite steps : 4
% 0.08/0.24 % ...of those cached : 1
% 0.08/0.24 % Propositional unsat checks : 0
% 0.08/0.24 % Propositional check models : 0
% 0.08/0.24 % Propositional check unsatisfiable : 0
% 0.08/0.24 % Propositional clauses : 0
% 0.08/0.24 % Propositional clauses after purity: 0
% 0.08/0.24 % Propositional unsat core size : 0
% 0.08/0.24 % Propositional preprocessing time : 0.000
% 0.08/0.24 % Propositional encoding time : 0.000
% 0.08/0.24 % Propositional solver time : 0.000
% 0.08/0.24 % Success case prop preproc time : 0.000
% 0.08/0.24 % Success case prop encoding time : 0.000
% 0.08/0.24 % Success case prop solver time : 0.000
% 0.08/0.24 % Current number of processed clauses : 16
% 0.08/0.24 % Positive orientable unit clauses : 3
% 0.08/0.24 % Positive unorientable unit clauses: 0
% 0.08/0.24 % Negative unit clauses : 0
% 0.08/0.24 % Non-unit-clauses : 13
% 0.08/0.24 % Current number of unprocessed clauses: 1
% 0.08/0.24 % ...number of literals in the above : 9
% 0.08/0.24 % Current number of archived formulas : 0
% 0.08/0.24 % Current number of archived clauses : 1
% 0.08/0.24 % Clause-clause subsumption calls (NU) : 58
% 0.08/0.24 % Rec. Clause-clause subsumption calls : 5
% 0.08/0.24 % Non-unit clause-clause subsumptions : 4
% 0.08/0.24 % Unit Clause-clause subsumption calls : 0
% 0.08/0.24 % Rewrite failures with RHS unbound : 0
% 0.08/0.24 % BW rewrite match attempts : 0
% 0.08/0.24 % BW rewrite match successes : 0
% 0.08/0.24 % Condensation attempts : 0
% 0.08/0.24 % Condensation successes : 0
% 0.08/0.24 % Termbank termtop insertions : 2069
% 0.08/0.24 % Search garbage collected termcells : 497
% 0.08/0.24
% 0.08/0.24 % -------------------------------------------------
% 0.08/0.24 % User time : 0.005 s
% 0.08/0.24 % System time : 0.002 s
% 0.08/0.24 % Total time : 0.006 s
% 0.08/0.24 % Maximum resident set size: 3896 pages
% 0.08/0.24
% 0.08/0.24 % -------------------------------------------------
% 0.08/0.24 % User time : 0.006 s
% 0.08/0.24 % System time : 0.006 s
% 0.08/0.24 % Total time : 0.012 s
% 0.08/0.24 % Maximum resident set size: 4608 pages
% 0.08/0.24 % E exiting
%------------------------------------------------------------------------------