%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU816^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:25:45 AM UTC 2026
% Result : Theorem 0.24s 0.35s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 170 ( 16 equ; 0 cnn)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 534 ( 38 ~; 51 |; 30 &; 368 @)
% ( 1 <=>; 46 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 5 con; 0-2 aty)
% Number of variables : 78 ( 7 ^; 65 !; 6 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_25,type,
powerset: $i > $i ).
thf(decl_26,type,
nonempty: $i > $o ).
thf(decl_27,type,
subset: $i > $i > $o ).
thf(decl_28,type,
binintersect: $i > $i > $i ).
thf(decl_29,type,
transitiveset: $i > $o ).
thf(decl_30,type,
binintTransitive: $o ).
thf(decl_31,type,
stricttotalorderedByIn: $i > $o ).
thf(decl_32,type,
wellorderedByIn: $i > $o ).
thf(decl_33,type,
ordinal: $i > $o ).
thf(decl_34,type,
esk1_1: $i > $i ).
thf(decl_35,type,
esk2_2: $i > $i > $i ).
thf(decl_36,type,
esk3_0: $i ).
thf(decl_37,type,
esk4_1: $i > $i ).
thf(decl_38,type,
esk5_0: $i ).
thf(decl_39,type,
esk6_1: $i > $i ).
thf(decl_40,type,
esk7_0: $i ).
thf(ordinal,axiom,
( ordinal
= ( ^ [X1: $i] :
( ( transitiveset @ X1 )
& ( wellorderedByIn @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mNvH41YMDj/E---3.1_1137463.p',ordinal) ).
thf(wellorderedByIn,axiom,
( wellorderedByIn
= ( ^ [X2: $i] :
( ( stricttotalorderedByIn @ X2 )
& ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X2 ) )
=> ( ( nonempty @ X3 )
=> ? [X1: $i] :
( ( in @ X1 @ X3 )
& ! [X4: $i] :
( ( in @ X4 @ X3 )
=> ( ( X1 = X4 )
| ( in @ X1 @ X4 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mNvH41YMDj/E---3.1_1137463.p',wellorderedByIn) ).
thf(transitiveset,axiom,
( transitiveset
= ( ^ [X2: $i] :
! [X3: $i] :
( ( in @ X3 @ X2 )
=> ( subset @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mNvH41YMDj/E---3.1_1137463.p',transitiveset) ).
thf(ordinalMinLem1,conjecture,
( binintTransitive
=> ! [X3: $i] :
( ( ordinal @ X3 )
=> ! [X4: $i] :
( ( ordinal @ X4 )
=> ( transitiveset @ ( binintersect @ X3 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mNvH41YMDj/E---3.1_1137463.p',ordinalMinLem1) ).
thf(binintTransitive,axiom,
( binintTransitive
<=> ! [X3: $i] :
( ( transitiveset @ X3 )
=> ! [X4: $i] :
( ( transitiveset @ X4 )
=> ( transitiveset @ ( binintersect @ X3 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mNvH41YMDj/E---3.1_1137463.p',binintTransitive) ).
thf(c_0_5,plain,
( ordinal
= ( ^ [Z0: $i] :
( ! [X12: $i] :
( ( in @ X12 @ Z0 )
=> ( subset @ X12 @ Z0 ) )
& ( stricttotalorderedByIn @ Z0 )
& ! [X13: $i] :
( ( in @ X13 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X13 )
=> ? [X14: $i] :
( ( in @ X14 @ X13 )
& ! [X15: $i] :
( ( in @ X15 @ X13 )
=> ( ( X14 = X15 )
| ( in @ X14 @ X15 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ordinal]) ).
thf(c_0_6,plain,
( wellorderedByIn
= ( ^ [Z0: $i] :
( ( stricttotalorderedByIn @ Z0 )
& ! [X3: $i] :
( ( in @ X3 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X3 )
=> ? [X1: $i] :
( ( in @ X1 @ X3 )
& ! [X4: $i] :
( ( in @ X4 @ X3 )
=> ( ( X1 = X4 )
| ( in @ X1 @ X4 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[wellorderedByIn]) ).
thf(c_0_7,plain,
( transitiveset
= ( ^ [Z0: $i] :
! [X3: $i] :
( ( in @ X3 @ Z0 )
=> ( subset @ X3 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitiveset]) ).
thf(c_0_8,negated_conjecture,
~ ( binintTransitive
=> ! [X3: $i] :
( ( ordinal @ X3 )
=> ! [X4: $i] :
( ( ordinal @ X4 )
=> ( transitiveset @ ( binintersect @ X3 @ X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[ordinalMinLem1]) ).
thf(c_0_9,plain,
( ordinal
= ( ^ [Z0: $i] :
( ! [X12: $i] :
( ( in @ X12 @ Z0 )
=> ( subset @ X12 @ Z0 ) )
& ( stricttotalorderedByIn @ Z0 )
& ! [X13: $i] :
( ( in @ X13 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X13 )
=> ? [X14: $i] :
( ( in @ X14 @ X13 )
& ! [X15: $i] :
( ( in @ X15 @ X13 )
=> ( ( X14 = X15 )
| ( in @ X14 @ X15 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
thf(c_0_10,axiom,
( binintTransitive
= ( ! [X3: $i] :
( ! [X9: $i] :
( ( in @ X9 @ X3 )
=> ( subset @ X9 @ X3 ) )
=> ! [X4: $i] :
( ! [X10: $i] :
( ( in @ X10 @ X4 )
=> ( subset @ X10 @ X4 ) )
=> ! [X11: $i] :
( ( in @ X11 @ ( binintersect @ X3 @ X4 ) )
=> ( subset @ X11 @ ( binintersect @ X3 @ X4 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[binintTransitive,c_0_7]) ).
thf(c_0_11,negated_conjecture,
~ ( ! [X16: $i] :
( ! [X17: $i] :
( ( in @ X17 @ X16 )
=> ( subset @ X17 @ X16 ) )
=> ! [X18: $i] :
( ! [X19: $i] :
( ( in @ X19 @ X18 )
=> ( subset @ X19 @ X18 ) )
=> ! [X20: $i] :
( ( in @ X20 @ ( binintersect @ X16 @ X18 ) )
=> ( subset @ X20 @ ( binintersect @ X16 @ X18 ) ) ) ) )
=> ! [X3: $i] :
( ( ! [X21: $i] :
( ( in @ X21 @ X3 )
=> ( subset @ X21 @ X3 ) )
& ( stricttotalorderedByIn @ X3 )
& ! [X22: $i] :
( ( in @ X22 @ ( powerset @ X3 ) )
=> ( ( nonempty @ X22 )
=> ? [X23: $i] :
( ( in @ X23 @ X22 )
& ! [X24: $i] :
( ( in @ X24 @ X22 )
=> ( ( X23 = X24 )
| ( in @ X23 @ X24 ) ) ) ) ) ) )
=> ! [X4: $i] :
( ( ! [X25: $i] :
( ( in @ X25 @ X4 )
=> ( subset @ X25 @ X4 ) )
& ( stricttotalorderedByIn @ X4 )
& ! [X26: $i] :
( ( in @ X26 @ ( powerset @ X4 ) )
=> ( ( nonempty @ X26 )
=> ? [X27: $i] :
( ( in @ X27 @ X26 )
& ! [X28: $i] :
( ( in @ X28 @ X26 )
=> ( ( X27 = X28 )
| ( in @ X27 @ X28 ) ) ) ) ) ) )
=> ! [X29: $i] :
( ( in @ X29 @ ( binintersect @ X3 @ X4 ) )
=> ( subset @ X29 @ ( binintersect @ X3 @ X4 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X30: $i,X32: $i,X34: $i,X36: $i,X37: $i,X39: $i,X41: $i,X42: $i,X44: $i] :
( ( ( in @ ( esk2_2 @ X30 @ X32 ) @ X32 )
| ~ ( in @ X34 @ ( binintersect @ X30 @ X32 ) )
| ( subset @ X34 @ ( binintersect @ X30 @ X32 ) )
| ( in @ ( esk1_1 @ X30 ) @ X30 ) )
& ( ~ ( subset @ ( esk2_2 @ X30 @ X32 ) @ X32 )
| ~ ( in @ X34 @ ( binintersect @ X30 @ X32 ) )
| ( subset @ X34 @ ( binintersect @ X30 @ X32 ) )
| ( in @ ( esk1_1 @ X30 ) @ X30 ) )
& ( ( in @ ( esk2_2 @ X30 @ X32 ) @ X32 )
| ~ ( in @ X34 @ ( binintersect @ X30 @ X32 ) )
| ( subset @ X34 @ ( binintersect @ X30 @ X32 ) )
| ~ ( subset @ ( esk1_1 @ X30 ) @ X30 ) )
& ( ~ ( subset @ ( esk2_2 @ X30 @ X32 ) @ X32 )
| ~ ( in @ X34 @ ( binintersect @ X30 @ X32 ) )
| ( subset @ X34 @ ( binintersect @ X30 @ X32 ) )
| ~ ( subset @ ( esk1_1 @ X30 ) @ X30 ) )
& ( ~ ( in @ X36 @ esk3_0 )
| ( subset @ X36 @ esk3_0 ) )
& ( stricttotalorderedByIn @ esk3_0 )
& ( ( in @ ( esk4_1 @ X37 ) @ X37 )
| ~ ( nonempty @ X37 )
| ~ ( in @ X37 @ ( powerset @ esk3_0 ) ) )
& ( ~ ( in @ X39 @ X37 )
| ( ( esk4_1 @ X37 )
= X39 )
| ( in @ ( esk4_1 @ X37 ) @ X39 )
| ~ ( nonempty @ X37 )
| ~ ( in @ X37 @ ( powerset @ esk3_0 ) ) )
& ( ~ ( in @ X41 @ esk5_0 )
| ( subset @ X41 @ esk5_0 ) )
& ( stricttotalorderedByIn @ esk5_0 )
& ( ( in @ ( esk6_1 @ X42 ) @ X42 )
| ~ ( nonempty @ X42 )
| ~ ( in @ X42 @ ( powerset @ esk5_0 ) ) )
& ( ~ ( in @ X44 @ X42 )
| ( ( esk6_1 @ X42 )
= X44 )
| ( in @ ( esk6_1 @ X42 ) @ X44 )
| ~ ( nonempty @ X42 )
| ~ ( in @ X42 @ ( powerset @ esk5_0 ) ) )
& ( in @ esk7_0 @ ( binintersect @ esk3_0 @ esk5_0 ) )
& ~ ( subset @ esk7_0 @ ( binintersect @ esk3_0 @ esk5_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_11])])])])])]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( subset @ X3 @ ( binintersect @ X1 @ X2 ) )
| ( in @ ( esk1_1 @ X1 ) @ X1 )
| ~ ( subset @ ( esk2_2 @ X1 @ X2 ) @ X2 )
| ~ ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ esk5_0 )
| ~ ( in @ X1 @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( esk2_2 @ X1 @ X2 ) @ X2 )
| ( subset @ X3 @ ( binintersect @ X1 @ X2 ) )
| ( in @ ( esk1_1 @ X1 ) @ X1 )
| ~ ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( subset @ X3 @ ( binintersect @ X1 @ X2 ) )
| ~ ( subset @ ( esk2_2 @ X1 @ X2 ) @ X2 )
| ~ ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
| ~ ( subset @ ( esk1_1 @ X1 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk2_2 @ X1 @ X2 ) @ X2 )
| ( subset @ X3 @ ( binintersect @ X1 @ X2 ) )
| ~ ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
| ~ ( subset @ ( esk1_1 @ X1 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ ( binintersect @ X2 @ esk5_0 ) )
| ( in @ ( esk1_1 @ X2 ) @ X2 )
| ~ ( in @ X1 @ ( binintersect @ X2 @ esk5_0 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_19,negated_conjecture,
in @ esk7_0 @ ( binintersect @ esk3_0 @ esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_20,negated_conjecture,
~ ( subset @ esk7_0 @ ( binintersect @ esk3_0 @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ ( binintersect @ X2 @ esk5_0 ) )
| ~ ( in @ X1 @ ( binintersect @ X2 @ esk5_0 ) )
| ~ ( subset @ ( esk1_1 @ X2 ) @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_17]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ esk3_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_23,negated_conjecture,
in @ ( esk1_1 @ esk3_0 ) @ esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ ( binintersect @ esk3_0 @ esk5_0 ) )
| ~ ( in @ X1 @ ( binintersect @ esk3_0 @ esk5_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_24]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU816^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.25 % Computer : n020.cluster.edu
% 0.09/0.25 % Model : x86_64 x86_64
% 0.09/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.25 % Memory : 8046.5625MB
% 0.09/0.25 % OS : Linux 6.8.0-71-generic
% 0.09/0.25 % CPULimit : 300
% 0.09/0.25 % WCLimit : 300
% 0.09/0.25 % DateTime : Tue Sep 29 14:34:49 UTC 2026
% 0.09/0.25 % CPUTime :
% 0.09/0.25 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.30 Running higher-order theorem proving
% 0.24/0.31 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.mNvH41YMDj/E---3.1_1137463.p
% 0.24/0.35 % Version: 3.5.1-ho
% 0.24/0.35 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.24/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.35 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.24/0.35 % Starting post_as_ho5 with 300s (1) cores
% 0.24/0.35 % Starting sh4l with 300s (1) cores
% 0.24/0.35 % Starting ho_unfolding_2 with 300s (1) cores
% 0.24/0.35 % post_as_ho5 with pid 1137477 completed with status 0
% 0.24/0.35 % Result found by post_as_ho5
% 0.24/0.35 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.24/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.35 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.24/0.35 % Starting post_as_ho5 with 300s (1) cores
% 0.24/0.35 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.24/0.35 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.24/0.35 % Search class: HGUSF-FFSS21-SSFFMFNN
% 0.24/0.35 % partial match(1): HGHSF-FFSS21-SSFFMFNN
% 0.24/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.35 % SubtermCWHack with pid 1137480 completed with status 0
% 0.24/0.35 % Result found by SubtermCWHack
% 0.24/0.35 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.24/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.35 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.24/0.35 % Starting post_as_ho5 with 300s (1) cores
% 0.24/0.35 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.24/0.35 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.24/0.35 % Search class: HGUSF-FFSS21-SSFFMFNN
% 0.24/0.35 % partial match(1): HGHSF-FFSS21-SSFFMFNN
% 0.24/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.35 % Preprocessing time : 0.001 s
% 0.24/0.35
% 0.24/0.35 % Proof found!
% 0.24/0.35 % SZS status Theorem
% 0.24/0.35 % SZS output start CNFRefutation
% See solution above
% 0.24/0.35 % Parsed axioms : 18
% 0.24/0.35 % Removed by relevancy pruning/SinE : 13
% 0.24/0.35 % Initial clauses : 14
% 0.24/0.35 % Removed in clause preprocessing : 0
% 0.24/0.35 % Initial clauses in saturation : 14
% 0.24/0.35 % Processed clauses : 24
% 0.24/0.35 % ...of these trivial : 0
% 0.24/0.35 % ...subsumed : 0
% 0.24/0.35 % ...remaining for further processing : 24
% 0.24/0.35 % Other redundant clauses eliminated : 0
% 0.24/0.35 % Clauses deleted for lack of memory : 0
% 0.24/0.35 % Backward-subsumed : 1
% 0.24/0.35 % Backward-rewritten : 0
% 0.24/0.35 % Generated clauses : 40
% 0.24/0.35 % ...of the previous two non-redundant : 35
% 0.24/0.35 % ...aggressively subsumed : 0
% 0.24/0.35 % Contextual simplify-reflections : 5
% 0.24/0.35 % Paramodulations : 40
% 0.24/0.35 % Factorizations : 0
% 0.24/0.35 % NegExts : 0
% 0.24/0.35 % Equation resolutions : 0
% 0.24/0.35 % Disequality decompositions : 0
% 0.24/0.35 % Total rewrite steps : 2
% 0.24/0.35 % ...of those cached : 0
% 0.24/0.35 % Propositional unsat checks : 0
% 0.24/0.35 % Propositional check models : 0
% 0.24/0.35 % Propositional check unsatisfiable : 0
% 0.24/0.35 % Propositional clauses : 0
% 0.24/0.35 % Propositional clauses after purity: 0
% 0.24/0.35 % Propositional unsat core size : 0
% 0.24/0.35 % Propositional preprocessing time : 0.000
% 0.24/0.35 % Propositional encoding time : 0.000
% 0.24/0.35 % Propositional solver time : 0.000
% 0.24/0.35 % Success case prop preproc time : 0.000
% 0.24/0.35 % Success case prop encoding time : 0.000
% 0.24/0.35 % Success case prop solver time : 0.000
% 0.24/0.35 % Current number of processed clauses : 23
% 0.24/0.35 % Positive orientable unit clauses : 5
% 0.24/0.35 % Positive unorientable unit clauses: 0
% 0.24/0.35 % Negative unit clauses : 1
% 0.24/0.35 % Non-unit-clauses : 17
% 0.24/0.35 % Current number of unprocessed clauses: 25
% 0.24/0.35 % ...number of literals in the above : 140
% 0.24/0.35 % Current number of archived formulas : 0
% 0.24/0.35 % Current number of archived clauses : 1
% 0.24/0.35 % Clause-clause subsumption calls (NU) : 57
% 0.24/0.35 % Rec. Clause-clause subsumption calls : 19
% 0.24/0.35 % Non-unit clause-clause subsumptions : 5
% 0.24/0.35 % Unit Clause-clause subsumption calls : 3
% 0.24/0.35 % Rewrite failures with RHS unbound : 0
% 0.24/0.35 % BW rewrite match attempts : 1
% 0.24/0.35 % BW rewrite match successes : 1
% 0.24/0.35 % Condensation attempts : 0
% 0.24/0.35 % Condensation successes : 0
% 0.24/0.35 % Termbank termtop insertions : 2813
% 0.24/0.35 % Search garbage collected termcells : 692
% 0.24/0.35
% 0.24/0.35 % -------------------------------------------------
% 0.24/0.35 % User time : 0.008 s
% 0.24/0.35 % System time : 0.004 s
% 0.24/0.35 % Total time : 0.011 s
% 0.24/0.35 % Maximum resident set size: 3900 pages
% 0.24/0.35
% 0.24/0.35 % -------------------------------------------------
% 0.24/0.35 % User time : 0.011 s
% 0.24/0.35 % System time : 0.007 s
% 0.24/0.35 % Total time : 0.018 s
% 0.24/0.35 % Maximum resident set size: 4864 pages
% 0.24/0.35 % E exiting
%------------------------------------------------------------------------------