%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM697^4 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:52 AM UTC 2026
% Result : Theorem 0.73s 0.40s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 45 ( 29 unt; 0 typ; 0 def)
% Number of atoms : 164 ( 41 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 297 ( 31 ~; 16 |; 5 &; 216 @)
% ( 0 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 6 con; 0-3 aty)
% Number of variables : 72 ( 58 ^; 14 !; 0 ?; 72 :)
% 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_131,type,
n_1: $i ).
thf(decl_143,type,
n_pl: $i > $i > $i ).
thf(decl_148,type,
diffprop: $i > $i > $i > $o ).
thf(decl_149,type,
d_29_ii: $i > $i > $o ).
thf(decl_152,type,
moreis: $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/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',def_imp) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',def_d_29_ii) ).
thf(def_l_or,axiom,
( l_or
= ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',def_l_or) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.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/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',def_is_of) ).
thf(def_moreis,axiom,
( moreis
= ( ^ [X1: $i,X229: $i] : ( l_or @ ( d_29_ii @ X1 @ X229 ) @ ( n_is @ X1 @ X229 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',def_moreis) ).
thf(def_n_some,axiom,
( n_some
= ( l_some @ nat ) ),
file('/export/starexec/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',def_n_some) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',def_n_is) ).
thf(satz25a,conjecture,
( 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/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',satz25a) ).
thf(satz4e,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( n_is @ ( ordsucc @ X1 ) @ ( n_pl @ X1 @ n_1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',satz4e) ).
thf(satz25,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X323: $i] : ( in @ X323 @ nat )
@ ^ [X324: $i] :
( ( d_29_ii @ X324 @ X1 )
=> ( moreis @ X324 @ ( n_pl @ X1 @ n_1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p',satz25) ).
thf(c_0_13,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_14,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_15,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_16,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_17,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_18,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_19,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_20,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_21,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_22,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,def_n_some]) ).
thf(c_0_23,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16,c_0_14]),c_0_17]) ).
thf(c_0_24,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_18]) ).
thf(c_0_25,negated_conjecture,
~ ( 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 ) ) ) ) ),
inference(assume_negation,[status(cth)],[satz25a]) ).
thf(c_0_26,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_27,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_21,c_0_22]),c_0_23]),c_0_24]) ).
thf(c_0_28,negated_conjecture,
~ ! [X418: $i] :
( ( in @ X418 @ nat )
=> ! [X417: $i] :
( ( in @ X417 @ nat )
=> ( ( l_some @ nat @ ( diffprop @ X417 @ X418 ) )
=> ( ( ( l_some @ nat @ ( diffprop @ X417 @ ( ordsucc @ X418 ) ) )
=> ~ $true )
=> ( X417
= ( ordsucc @ X418 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_25]),c_0_22]),c_0_26]),c_0_27]) ).
thf(c_0_29,negated_conjecture,
( ( in @ esk1_0 @ nat )
& ( in @ esk2_0 @ nat )
& ( l_some @ nat @ ( diffprop @ esk2_0 @ esk1_0 ) )
& ( ~ ( l_some @ nat @ ( diffprop @ esk2_0 @ ( ordsucc @ esk1_0 ) ) )
| ~ $true )
& ( esk2_0
!= ( ordsucc @ esk1_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
thf(c_0_30,plain,
! [X556: $i] :
( ( in @ X556 @ nat )
=> ( ( ordsucc @ X556 )
= ( n_pl @ X556 @ n_1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4e]),c_0_26]),c_0_24]) ).
thf(c_0_31,negated_conjecture,
( ~ ( l_some @ nat @ ( diffprop @ esk2_0 @ ( ordsucc @ esk1_0 ) ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_32,plain,
! [X792: $i] :
( ~ ( in @ X792 @ nat )
| ( ( ordsucc @ X792 )
= ( n_pl @ X792 @ n_1 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
thf(c_0_33,plain,
! [X548: $i] :
( ( in @ X548 @ nat )
=> ! [X547: $i] :
( ( in @ X547 @ nat )
=> ( ( l_some @ nat @ ( diffprop @ X547 @ X548 ) )
=> ( ( ( l_some @ nat @ ( diffprop @ X547 @ ( n_pl @ X548 @ n_1 ) ) )
=> ~ $true )
=> ( X547
= ( n_pl @ X548 @ n_1 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz25]),c_0_22]),c_0_26]),c_0_27]) ).
thf(c_0_34,negated_conjecture,
~ ( l_some @ nat @ ( diffprop @ esk2_0 @ ( ordsucc @ esk1_0 ) ) ),
inference(cn,[status(thm)],[c_0_31]) ).
thf(c_0_35,plain,
! [X1: $i] :
( ( ( ordsucc @ X1 )
= ( n_pl @ X1 @ n_1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_36,negated_conjecture,
in @ esk1_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_37,plain,
! [X777: $i,X778: $i] :
( ( ( l_some @ nat @ ( diffprop @ X778 @ ( n_pl @ X777 @ n_1 ) ) )
| ( X778
= ( n_pl @ X777 @ n_1 ) )
| ~ ( l_some @ nat @ ( diffprop @ X778 @ X777 ) )
| ~ ( in @ X778 @ nat )
| ~ ( in @ X777 @ nat ) )
& ( $true
| ( X778
= ( n_pl @ X777 @ n_1 ) )
| ~ ( l_some @ nat @ ( diffprop @ X778 @ X777 ) )
| ~ ( in @ X778 @ nat )
| ~ ( in @ X777 @ 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_33])])])])]) ).
thf(c_0_38,negated_conjecture,
( esk2_0
!= ( ordsucc @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_39,negated_conjecture,
~ ( l_some @ nat @ ( diffprop @ esk2_0 @ ( n_pl @ esk1_0 @ n_1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
thf(c_0_40,plain,
! [X1: $i,X4: $i] :
( ( l_some @ nat @ ( diffprop @ X1 @ ( n_pl @ X4 @ n_1 ) ) )
| ( X1
= ( n_pl @ X4 @ n_1 ) )
| ~ ( l_some @ nat @ ( diffprop @ X1 @ X4 ) )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_41,negated_conjecture,
l_some @ nat @ ( diffprop @ esk2_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_42,negated_conjecture,
in @ esk2_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_43,negated_conjecture,
( ( n_pl @ esk1_0 @ n_1 )
!= esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_35]),c_0_36])]) ).
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_39,c_0_40]),c_0_41]),c_0_36]),c_0_42])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM697^4 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.17 % Computer : n013.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 12:40:36 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running higher-order theorem proving
% 0.11/0.27 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.9bj5U0nWJ5/E---3.1_2044539.p
% 0.73/0.40 % Version: 3.5.1-ho
% 0.73/0.40 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.73/0.40 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.40 % Starting lpo1_fix with 900s (3) cores
% 0.73/0.40 % Starting full_lambda_9 with 300s (1) cores
% 0.73/0.40 % Starting almost_fo_4 with 300s (1) cores
% 0.73/0.40 % Starting new_ho_9 with 300s (1) cores
% 0.73/0.40 % Starting pre_casc_4 with 300s (1) cores
% 0.73/0.40 % Starting ho_unfolding_6 with 300s (1) cores
% 0.73/0.40 % full_lambda_9 with pid 2044578 completed with status 0
% 0.73/0.40 % Result found by full_lambda_9
% 0.73/0.40 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.73/0.40 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.40 % Starting lpo1_fix with 900s (3) cores
% 0.73/0.40 % Starting full_lambda_9 with 300s (1) cores
% 0.73/0.40 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.73/0.40 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.73/0.40 % Search class: HGHSM-FSLM32-DHSMMSBN
% 0.73/0.40 % partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.73/0.40 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.73/0.40 % Starting SubtermCWHack with 28s (1) cores
% 0.73/0.40 % SubtermCWHack with pid 2044588 completed with status 0
% 0.73/0.40 % Result found by SubtermCWHack
% 0.73/0.40 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.73/0.40 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.40 % Starting lpo1_fix with 900s (3) cores
% 0.73/0.40 % Starting full_lambda_9 with 300s (1) cores
% 0.73/0.40 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.73/0.40 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.73/0.40 % Search class: HGHSM-FSLM32-DHSMMSBN
% 0.73/0.40 % partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.73/0.40 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.73/0.40 % Starting SubtermCWHack with 28s (1) cores
% 0.73/0.40 % Preprocessing time : 0.007 s
% 0.73/0.40
% 0.73/0.40 % Proof found!
% 0.73/0.40 % SZS status Theorem
% 0.73/0.40 % SZS output start CNFRefutation
% See solution above
% 0.73/0.40 % Parsed axioms : 402
% 0.73/0.40 % Removed by relevancy pruning/SinE : 231
% 0.73/0.40 % Initial clauses : 423
% 0.73/0.40 % Removed in clause preprocessing : 187
% 0.73/0.40 % Initial clauses in saturation : 236
% 0.73/0.40 % Processed clauses : 1045
% 0.73/0.40 % ...of these trivial : 71
% 0.73/0.40 % ...subsumed : 559
% 0.73/0.40 % ...remaining for further processing : 415
% 0.73/0.40 % Other redundant clauses eliminated : 26
% 0.73/0.40 % Clauses deleted for lack of memory : 0
% 0.73/0.40 % Backward-subsumed : 3
% 0.73/0.40 % Backward-rewritten : 5
% 0.73/0.40 % Generated clauses : 2064
% 0.73/0.40 % ...of the previous two non-redundant : 1858
% 0.73/0.40 % ...aggressively subsumed : 0
% 0.73/0.40 % Contextual simplify-reflections : 3
% 0.73/0.40 % Paramodulations : 1939
% 0.73/0.40 % Factorizations : 2
% 0.73/0.40 % NegExts : 0
% 0.73/0.40 % Equation resolutions : 29
% 0.73/0.40 % Disequality decompositions : 0
% 0.73/0.40 % Total rewrite steps : 613
% 0.73/0.40 % ...of those cached : 519
% 0.73/0.40 % Propositional unsat checks : 0
% 0.73/0.40 % Propositional check models : 0
% 0.73/0.40 % Propositional check unsatisfiable : 0
% 0.73/0.40 % Propositional clauses : 0
% 0.73/0.40 % Propositional clauses after purity: 0
% 0.73/0.40 % Propositional unsat core size : 0
% 0.73/0.40 % Propositional preprocessing time : 0.000
% 0.73/0.40 % Propositional encoding time : 0.000
% 0.73/0.40 % Propositional solver time : 0.000
% 0.73/0.40 % Success case prop preproc time : 0.000
% 0.73/0.40 % Success case prop encoding time : 0.000
% 0.73/0.40 % Success case prop solver time : 0.000
% 0.73/0.40 % Current number of processed clauses : 398
% 0.73/0.40 % Positive orientable unit clauses : 123
% 0.73/0.40 % Positive unorientable unit clauses: 23
% 0.73/0.40 % Negative unit clauses : 116
% 0.73/0.40 % Non-unit-clauses : 136
% 0.73/0.40 % Current number of unprocessed clauses: 1029
% 0.73/0.40 % ...number of literals in the above : 3004
% 0.73/0.40 % Current number of archived formulas : 0
% 0.73/0.40 % Current number of archived clauses : 8
% 0.73/0.40 % Clause-clause subsumption calls (NU) : 4087
% 0.73/0.40 % Rec. Clause-clause subsumption calls : 2162
% 0.73/0.40 % Non-unit clause-clause subsumptions : 103
% 0.73/0.40 % Unit Clause-clause subsumption calls : 6922
% 0.73/0.40 % Rewrite failures with RHS unbound : 308
% 0.73/0.40 % BW rewrite match attempts : 311
% 0.73/0.40 % BW rewrite match successes : 40
% 0.73/0.40 % Condensation attempts : 0
% 0.73/0.40 % Condensation successes : 0
% 0.73/0.40 % Termbank termtop insertions : 81509
% 0.73/0.40 % Search garbage collected termcells : 20220
% 0.73/0.40
% 0.73/0.40 % -------------------------------------------------
% 0.73/0.40 % User time : 0.080 s
% 0.73/0.40 % System time : 0.018 s
% 0.73/0.40 % Total time : 0.098 s
% 0.73/0.40 % Maximum resident set size: 7124 pages
% 0.73/0.40
% 0.73/0.40 % -------------------------------------------------
% 0.73/0.40 % User time : 0.092 s
% 0.73/0.40 % System time : 0.023 s
% 0.73/0.40 % Total time : 0.115 s
% 0.73/0.40 % Maximum resident set size: 5632 pages
% 0.73/0.40 % E exiting
%------------------------------------------------------------------------------