%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM699^4 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:16:53 AM UTC 2026
% Result : Theorem 0.23s 0.37s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 45 ( 34 unt; 0 typ; 0 def)
% Number of atoms : 181 ( 45 equ; 0 cnn)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 281 ( 29 ~; 14 |; 5 &; 201 @)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 5 con; 0-3 aty)
% Number of variables : 79 ( 68 ^; 11 !; 0 ?; 79 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_24,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_26,type,
in: $i > $i > $o ).
thf(decl_48,type,
ordsucc: $i > $i ).
thf(decl_62,type,
imp: $o > $o > $o ).
thf(decl_63,type,
d_not: $o > $o ).
thf(decl_68,type,
l_or: $o > $o > $o ).
thf(decl_73,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_78,type,
e_is: $i > $i > $i > $o ).
thf(decl_124,type,
nat: $i ).
thf(decl_125,type,
n_is: $i > $i > $o ).
thf(decl_128,type,
n_some: ( $i > $o ) > $o ).
thf(decl_148,type,
diffprop: $i > $i > $i > $o ).
thf(decl_149,type,
d_29_ii: $i > $i > $o ).
thf(decl_150,type,
iii: $i > $i > $o ).
thf(decl_152,type,
moreis: $i > $i > $o ).
thf(decl_153,type,
lessis: $i > $i > $o ).
thf(decl_156,type,
esk1_0: $i ).
thf(decl_157,type,
esk2_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_imp) ).
thf(def_iii,axiom,
( iii
= ( ^ [X1: $i,X211: $i] : ( n_some @ ( diffprop @ X211 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_iii) ).
thf(def_l_or,axiom,
( l_or
= ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_l_or) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_e_is) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_is_of) ).
thf(def_lessis,axiom,
( lessis
= ( ^ [X1: $i,X230: $i] : ( l_or @ ( iii @ X1 @ X230 ) @ ( n_is @ X1 @ X230 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_lessis) ).
thf(def_n_some,axiom,
( n_some
= ( l_some @ nat ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_n_some) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_n_is) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_d_29_ii) ).
thf(satz25c,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X329: $i] : ( in @ X329 @ nat )
@ ^ [X330: $i] :
( ( iii @ X330 @ X1 )
=> ( lessis @ ( ordsucc @ X330 ) @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',satz25c) ).
thf(def_moreis,axiom,
( moreis
= ( ^ [X1: $i,X229: $i] : ( l_or @ ( d_29_ii @ X1 @ X229 ) @ ( n_is @ X1 @ X229 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',def_moreis) ).
thf(satz25a,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X325: $i] : ( in @ X325 @ nat )
@ ^ [X326: $i] :
( ( d_29_ii @ X326 @ X1 )
=> ( moreis @ X326 @ ( ordsucc @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WbQFML2ZuD/E---3.1_3464885.p',satz25a) ).
thf(c_0_14,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_15,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_16,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z1 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_iii]) ).
thf(c_0_17,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_18,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_19,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_20,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_21,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_22,plain,
( lessis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat @ ( diffprop @ Z1 @ Z0 ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_lessis]) ).
thf(c_0_23,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z1 @ Z0 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_16,def_n_some]) ).
thf(c_0_24,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17,c_0_15]),c_0_18]) ).
thf(c_0_25,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_19]) ).
thf(c_0_26,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_27,negated_conjecture,
~ ( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X329: $i] : ( in @ X329 @ nat )
@ ^ [X330: $i] :
( ( iii @ X330 @ X1 )
=> ( lessis @ ( ordsucc @ X330 ) @ X1 ) ) ) ),
inference(assume_negation,[status(cth)],[satz25c]) ).
thf(c_0_28,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_29,plain,
( lessis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat @ ( diffprop @ Z1 @ Z0 ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]) ).
thf(c_0_30,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moreis]) ).
thf(c_0_31,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_26,def_n_some]) ).
thf(c_0_32,negated_conjecture,
~ ! [X422: $i] :
( ( in @ X422 @ nat )
=> ! [X421: $i] :
( ( in @ X421 @ nat )
=> ( ( l_some @ nat @ ( diffprop @ X422 @ X421 ) )
=> ( ( ( l_some @ nat @ ( diffprop @ X422 @ ( ordsucc @ X421 ) ) )
=> ~ $true )
=> ( ( ordsucc @ X421 )
= X422 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_27]),c_0_23]),c_0_28]),c_0_29]) ).
thf(c_0_33,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_30,c_0_31]),c_0_24]),c_0_25]) ).
thf(c_0_34,negated_conjecture,
( ( in @ esk1_0 @ nat )
& ( in @ esk2_0 @ nat )
& ( l_some @ nat @ ( diffprop @ esk1_0 @ esk2_0 ) )
& ( ~ ( l_some @ nat @ ( diffprop @ esk1_0 @ ( ordsucc @ esk2_0 ) ) )
| ~ $true )
& ( ( ordsucc @ esk2_0 )
!= esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])]) ).
thf(c_0_35,plain,
! [X568: $i] :
( ( in @ X568 @ nat )
=> ! [X567: $i] :
( ( in @ X567 @ nat )
=> ( ( l_some @ nat @ ( diffprop @ X567 @ X568 ) )
=> ( ( ( l_some @ nat @ ( diffprop @ X567 @ ( ordsucc @ X568 ) ) )
=> ~ $true )
=> ( X567
= ( ordsucc @ X568 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz25a]),c_0_31]),c_0_28]),c_0_33]) ).
thf(c_0_36,negated_conjecture,
( ~ ( l_some @ nat @ ( diffprop @ esk1_0 @ ( ordsucc @ esk2_0 ) ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_37,plain,
! [X807: $i,X808: $i] :
( ( ( l_some @ nat @ ( diffprop @ X808 @ ( ordsucc @ X807 ) ) )
| ( X808
= ( ordsucc @ X807 ) )
| ~ ( l_some @ nat @ ( diffprop @ X808 @ X807 ) )
| ~ ( in @ X808 @ nat )
| ~ ( in @ X807 @ nat ) )
& ( $true
| ( X808
= ( ordsucc @ X807 ) )
| ~ ( l_some @ nat @ ( diffprop @ X808 @ X807 ) )
| ~ ( in @ X808 @ nat )
| ~ ( in @ X807 @ nat ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])])]) ).
thf(c_0_38,negated_conjecture,
~ ( l_some @ nat @ ( diffprop @ esk1_0 @ ( ordsucc @ esk2_0 ) ) ),
inference(cn,[status(thm)],[c_0_36]) ).
thf(c_0_39,plain,
! [X1: $i,X4: $i] :
( ( l_some @ nat @ ( diffprop @ X1 @ ( ordsucc @ X4 ) ) )
| ( X1
= ( ordsucc @ X4 ) )
| ~ ( l_some @ nat @ ( diffprop @ X1 @ X4 ) )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_40,negated_conjecture,
l_some @ nat @ ( diffprop @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_41,negated_conjecture,
in @ esk2_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_42,negated_conjecture,
in @ esk1_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_43,negated_conjecture,
( ( ordsucc @ esk2_0 )
!= esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]),c_0_42])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM699^4 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n015.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 12:44:47 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.23/0.27 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.WbQFML2ZuD/E---3.1_3464885.p
% 0.23/0.37 % Version: 3.5.1-ho
% 0.23/0.37 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.23/0.37 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.37 % Starting lpo1_fix with 900s (3) cores
% 0.23/0.37 % Starting full_lambda_9 with 300s (1) cores
% 0.23/0.37 % Starting almost_fo_4 with 300s (1) cores
% 0.23/0.37 % Starting new_ho_9 with 300s (1) cores
% 0.23/0.37 % Starting pre_casc_4 with 300s (1) cores
% 0.23/0.37 % Starting ho_unfolding_6 with 300s (1) cores
% 0.23/0.37 % full_lambda_9 with pid 3464927 completed with status 0
% 0.23/0.37 % Result found by full_lambda_9
% 0.23/0.37 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.23/0.37 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.37 % Starting lpo1_fix with 900s (3) cores
% 0.23/0.37 % Starting full_lambda_9 with 300s (1) cores
% 0.23/0.37 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.23/0.37 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.23/0.37 % Search class: HGHSM-FSLM32-DHSMMSBN
% 0.23/0.37 % partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.23/0.37 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.37 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.37 % SubtermCWHack with pid 3464945 completed with status 0
% 0.23/0.37 % Result found by SubtermCWHack
% 0.23/0.37 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.23/0.37 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.37 % Starting lpo1_fix with 900s (3) cores
% 0.23/0.37 % Starting full_lambda_9 with 300s (1) cores
% 0.23/0.37 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.23/0.37 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.23/0.37 % Search class: HGHSM-FSLM32-DHSMMSBN
% 0.23/0.37 % partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.23/0.37 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.37 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.37 % Preprocessing time : 0.004 s
% 0.23/0.37
% 0.23/0.37 % Proof found!
% 0.23/0.37 % SZS status Theorem
% 0.23/0.37 % SZS output start CNFRefutation
% See solution above
% 0.23/0.37 % Parsed axioms : 404
% 0.23/0.37 % Removed by relevancy pruning/SinE : 231
% 0.23/0.37 % Initial clauses : 427
% 0.23/0.37 % Removed in clause preprocessing : 189
% 0.23/0.37 % Initial clauses in saturation : 238
% 0.23/0.37 % Processed clauses : 814
% 0.23/0.37 % ...of these trivial : 71
% 0.23/0.37 % ...subsumed : 412
% 0.23/0.37 % ...remaining for further processing : 331
% 0.23/0.37 % Other redundant clauses eliminated : 15
% 0.23/0.37 % Clauses deleted for lack of memory : 0
% 0.23/0.37 % Backward-subsumed : 3
% 0.23/0.37 % Backward-rewritten : 5
% 0.23/0.37 % Generated clauses : 1372
% 0.23/0.37 % ...of the previous two non-redundant : 1176
% 0.23/0.37 % ...aggressively subsumed : 0
% 0.23/0.37 % Contextual simplify-reflections : 3
% 0.23/0.37 % Paramodulations : 1258
% 0.23/0.37 % Factorizations : 2
% 0.23/0.37 % NegExts : 0
% 0.23/0.37 % Equation resolutions : 18
% 0.23/0.37 % Disequality decompositions : 0
% 0.23/0.37 % Total rewrite steps : 590
% 0.23/0.37 % ...of those cached : 497
% 0.23/0.37 % Propositional unsat checks : 0
% 0.23/0.37 % Propositional check models : 0
% 0.23/0.37 % Propositional check unsatisfiable : 0
% 0.23/0.37 % Propositional clauses : 0
% 0.23/0.37 % Propositional clauses after purity: 0
% 0.23/0.37 % Propositional unsat core size : 0
% 0.23/0.37 % Propositional preprocessing time : 0.000
% 0.23/0.37 % Propositional encoding time : 0.000
% 0.23/0.37 % Propositional solver time : 0.000
% 0.23/0.37 % Success case prop preproc time : 0.000
% 0.23/0.37 % Success case prop encoding time : 0.000
% 0.23/0.37 % Success case prop solver time : 0.000
% 0.23/0.37 % Current number of processed clauses : 315
% 0.23/0.37 % Positive orientable unit clauses : 123
% 0.23/0.37 % Positive unorientable unit clauses: 23
% 0.23/0.37 % Negative unit clauses : 50
% 0.23/0.37 % Non-unit-clauses : 119
% 0.23/0.37 % Current number of unprocessed clauses: 580
% 0.23/0.37 % ...number of literals in the above : 1947
% 0.23/0.37 % Current number of archived formulas : 0
% 0.23/0.37 % Current number of archived clauses : 8
% 0.23/0.37 % Clause-clause subsumption calls (NU) : 3372
% 0.23/0.37 % Rec. Clause-clause subsumption calls : 1986
% 0.23/0.37 % Non-unit clause-clause subsumptions : 96
% 0.23/0.37 % Unit Clause-clause subsumption calls : 1624
% 0.23/0.37 % Rewrite failures with RHS unbound : 298
% 0.23/0.37 % BW rewrite match attempts : 311
% 0.23/0.37 % BW rewrite match successes : 40
% 0.23/0.37 % Condensation attempts : 0
% 0.23/0.37 % Condensation successes : 0
% 0.23/0.37 % Termbank termtop insertions : 73881
% 0.23/0.37 % Search garbage collected termcells : 20568
% 0.23/0.37
% 0.23/0.37 % -------------------------------------------------
% 0.23/0.37 % User time : 0.063 s
% 0.23/0.37 % System time : 0.013 s
% 0.23/0.37 % Total time : 0.076 s
% 0.23/0.37 % Maximum resident set size: 7384 pages
% 0.23/0.37
% 0.23/0.37 % -------------------------------------------------
% 0.23/0.37 % User time : 0.073 s
% 0.23/0.37 % System time : 0.020 s
% 0.23/0.37 % Total time : 0.093 s
% 0.23/0.37 % Maximum resident set size: 5632 pages
% 0.23/0.37 % E exiting
%------------------------------------------------------------------------------