%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ANA126^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 07:45:36 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 53 ( 17 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 222 ( 23 ~; 17 |; 1 &; 176 @)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 15 ^; 36 !; 0 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
'type/nums/num': $tType ).
thf(decl_sort2,type,
'type/realax/real': $tType ).
thf(decl_23,type,
'const/realax/real_of_num': 'type/nums/num' > 'type/realax/real' ).
thf(decl_24,type,
'const/realax/real_neg': 'type/realax/real' > 'type/realax/real' ).
thf(decl_25,type,
'const/realax/real_mul': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(decl_26,type,
'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).
thf(decl_27,type,
'const/nums/BIT1': 'type/nums/num' > 'type/nums/num' ).
thf(decl_28,type,
'const/nums/_0': 'type/nums/num' ).
thf(decl_29,type,
'const/iterate/polynomial_function': ( 'type/realax/real' > 'type/realax/real' ) > $o ).
thf(decl_30,type,
esk1_0: 'type/realax/real' > 'type/realax/real' ).
thf(decl_32,type,
esk2_2: 'type/realax/real' > ( 'type/realax/real' > 'type/realax/real' ) > 'type/realax/real' ).
thf(decl_35,type,
esk5_1: 'type/realax/real' > 'type/realax/real' ).
thf('thm/iterate/POLYNOMIAL_FUNCTION_NEG_',conjecture,
! [X5: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function'
@ ^ [X2: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( X5 @ X2 ) ) )
<=> ( 'const/iterate/polynomial_function' @ X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.ImmxtLzZRn/E---3.1_687421.p','thm/iterate/POLYNOMIAL_FUNCTION_NEG_') ).
thf('thm/iterate/POLYNOMIAL_FUNCTION_LMUL_',axiom,
! [X3: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X3 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X4: 'type/realax/real'] : ( 'const/realax/real_mul' @ X2 @ ( X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ImmxtLzZRn/E---3.1_687421.p','thm/iterate/POLYNOMIAL_FUNCTION_LMUL_') ).
thf('thm/calc_int/REAL_MUL_LNEG_',axiom,
! [X1: 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_neg' @ X1 ) @ X2 )
= ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ImmxtLzZRn/E---3.1_687421.p','thm/calc_int/REAL_MUL_LNEG_') ).
thf('thm/realax/REAL_MUL_LID_',axiom,
! [X1: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ X1 )
= X1 ),
file('/export/starexec/sandbox/tmp/tmp.ImmxtLzZRn/E---3.1_687421.p','thm/realax/REAL_MUL_LID_') ).
thf('thm/calc_int/REAL_NEG_NEG_',axiom,
! [X1: 'type/realax/real'] :
( ( 'const/realax/real_neg' @ ( 'const/realax/real_neg' @ X1 ) )
= X1 ),
file('/export/starexec/sandbox/tmp/tmp.ImmxtLzZRn/E---3.1_687421.p','thm/calc_int/REAL_NEG_NEG_') ).
thf(c_0_5,negated_conjecture,
~ ! [X5: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function'
@ ^ [X2: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( X5 @ X2 ) ) )
<=> ( 'const/iterate/polynomial_function' @ X5 ) ),
inference(assume_negation,[status(cth)],['thm/iterate/POLYNOMIAL_FUNCTION_NEG_']) ).
thf(c_0_6,plain,
! [X3: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X3 )
=> ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X2 @ ( X3 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],['thm/iterate/POLYNOMIAL_FUNCTION_LMUL_']) ).
thf(c_0_7,negated_conjecture,
~ ! [X5: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( X5 @ Z0 ) ) )
<=> ( 'const/iterate/polynomial_function' @ X5 ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X16: 'type/realax/real' > 'type/realax/real',X17: 'type/realax/real'] :
( ~ ( 'const/iterate/polynomial_function' @ X16 )
| ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X17 @ ( X16 @ Z0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
thf(c_0_9,negated_conjecture,
( ( ~ ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( esk1_0 @ Z0 ) ) )
| ~ ( 'const/iterate/polynomial_function' @ esk1_0 ) )
& ( ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( esk1_0 @ Z0 ) ) )
| ( 'const/iterate/polynomial_function' @ esk1_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
thf(c_0_10,plain,
! [X1: 'type/realax/real',X3: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X3 @ Z0 ) ) )
| ~ ( 'const/iterate/polynomial_function' @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
( ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( esk1_0 @ Z0 ) ) )
| ( 'const/iterate/polynomial_function' @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( 'const/realax/real_neg' @ ( esk1_0 @ Z0 ) ) ) )
| ( 'const/iterate/polynomial_function' @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,plain,
! [X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ esk1_0 )
| ( ( ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( 'const/realax/real_neg' @ ( esk1_0 @ Z0 ) ) ) )
!= esk1_0 ) ),
inference(ext_eqfact,[status(thm)],[c_0_12]) ).
thf(c_0_14,plain,
! [X14: 'type/realax/real',X15: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_neg' @ X14 ) @ X15 )
= ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X14 @ X15 ) ) ),
inference(variable_rename,[status(thm)],['thm/calc_int/REAL_MUL_LNEG_']) ).
thf(c_0_15,negated_conjecture,
( ~ ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( esk1_0 @ Z0 ) ) )
| ~ ( 'const/iterate/polynomial_function' @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_16,plain,
! [X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ esk1_0 )
| ( ( 'const/realax/real_mul' @ X1 @ ( 'const/realax/real_neg' @ ( esk1_0 @ ( esk5_1 @ X1 ) ) ) )
!= ( esk1_0 @ ( esk5_1 @ X1 ) ) ) ),
inference(neg_ext,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
! [X1: 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_neg' @ X1 ) @ X2 )
= ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,plain,
! [X13: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ X13 )
= X13 ),
inference(variable_rename,[status(thm)],['thm/realax/REAL_MUL_LID_']) ).
thf(c_0_19,plain,
! [X18: 'type/realax/real'] :
( ( 'const/realax/real_neg' @ ( 'const/realax/real_neg' @ X18 ) )
= X18 ),
inference(variable_rename,[status(thm)],['thm/calc_int/REAL_NEG_NEG_']) ).
thf(c_0_20,plain,
! [X1: 'type/realax/real',X3: 'type/realax/real' > 'type/realax/real'] :
( ( ( ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_neg' @ ( esk1_0 @ Z0 ) ) )
!= ( ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X3 @ Z0 ) ) ) )
| ~ ( 'const/iterate/polynomial_function' @ esk1_0 )
| ~ ( 'const/iterate/polynomial_function' @ X3 ) ),
inference(ext_sup,[status(thm)],[c_0_15,c_0_10]) ).
thf(c_0_21,plain,
! [X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ esk1_0 )
| ( ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X1 @ ( 'const/realax/real_neg' @ ( esk1_0 @ ( esk5_1 @ ( 'const/realax/real_neg' @ X1 ) ) ) ) ) )
!= ( esk1_0 @ ( esk5_1 @ ( 'const/realax/real_neg' @ X1 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
! [X1: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,plain,
! [X1: 'type/realax/real'] :
( ( 'const/realax/real_neg' @ ( 'const/realax/real_neg' @ X1 ) )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_24,plain,
! [X1: 'type/realax/real',X3: 'type/realax/real' > 'type/realax/real'] :
( ( ( 'const/realax/real_neg' @ ( esk1_0 @ ( esk2_2 @ X1 @ X3 ) ) )
!= ( 'const/realax/real_mul' @ X1 @ ( X3 @ ( esk2_2 @ X1 @ X3 ) ) ) )
| ~ ( 'const/iterate/polynomial_function' @ esk1_0 )
| ~ ( 'const/iterate/polynomial_function' @ X3 ) ),
inference(neg_ext,[status(thm)],[c_0_20]) ).
thf(c_0_25,plain,
'const/iterate/polynomial_function' @ esk1_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_26,plain,
! [X1: 'type/realax/real',X3: 'type/realax/real' > 'type/realax/real'] :
( ( ( 'const/realax/real_neg' @ ( esk1_0 @ ( esk2_2 @ X1 @ X3 ) ) )
!= ( 'const/realax/real_mul' @ X1 @ ( X3 @ ( esk2_2 @ X1 @ X3 ) ) ) )
| ~ ( 'const/iterate/polynomial_function' @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
thf(c_0_27,plain,
! [X1: 'type/realax/real',X3: 'type/realax/real' > 'type/realax/real'] :
( ( ( 'const/realax/real_neg' @ ( esk1_0 @ ( esk2_2 @ ( 'const/realax/real_neg' @ X1 ) @ X3 ) ) )
!= ( 'const/realax/real_neg' @ ( 'const/realax/real_mul' @ X1 @ ( X3 @ ( esk2_2 @ ( 'const/realax/real_neg' @ X1 ) @ X3 ) ) ) ) )
| ~ ( 'const/iterate/polynomial_function' @ X3 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
thf(c_0_28,plain,
! [X3: 'type/realax/real' > 'type/realax/real'] :
( ( ( 'const/realax/real_neg' @ ( esk1_0 @ ( esk2_2 @ ( 'const/realax/real_neg' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) @ X3 ) ) )
!= ( 'const/realax/real_neg' @ ( X3 @ ( esk2_2 @ ( 'const/realax/real_neg' @ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) @ X3 ) ) ) )
| ~ ( 'const/iterate/polynomial_function' @ X3 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
thf(c_0_29,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA126^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n016.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 17:49:49 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.25 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.ImmxtLzZRn/E---3.1_687421.p
% 0.21/0.28 % Version: 3.5.1-ho
% 0.21/0.28 % Preprocessing class: HSSSSMSSSSMNSSN.
% 0.21/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28 % Starting sh3 with 1500s (5) cores
% 0.21/0.28 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.21/0.28 % Starting sh2lt with 300s (1) cores
% 0.21/0.28 % Starting ho_unfolding_1 with 300s (1) cores
% 0.21/0.28 % ehoh_best8_lambda with pid 687437 completed with status 0
% 0.21/0.28 % Result found by ehoh_best8_lambda
% 0.21/0.28 % Preprocessing class: HSSSSMSSSSMNSSN.
% 0.21/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28 % Starting sh3 with 1500s (5) cores
% 0.21/0.28 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.21/0.28 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 0.21/0.28 % No SInE strategy applied
% 0.21/0.28 % Search class: HGHSS-FFSF21-MSSFFFNN
% 0.21/0.28 % partial match(2): HGHSS-FFSF21-MSSFFMBN
% 0.21/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.28 % SubtermCWHack with pid 687441 completed with status 10
% 0.21/0.28 % Starting ehoh_best8_lambda with 31s (1) cores
% 0.21/0.28 % ehoh_best8_lambda with pid 687448 completed with status 0
% 0.21/0.28 % Result found by ehoh_best8_lambda
% 0.21/0.28 % Preprocessing class: HSSSSMSSSSMNSSN.
% 0.21/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28 % Starting sh3 with 1500s (5) cores
% 0.21/0.28 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.21/0.28 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 0.21/0.28 % No SInE strategy applied
% 0.21/0.28 % Search class: HGHSS-FFSF21-MSSFFFNN
% 0.21/0.28 % partial match(2): HGHSS-FFSF21-MSSFFMBN
% 0.21/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.28 % SubtermCWHack with pid 687441 completed with status 10
% 0.21/0.28 % Starting ehoh_best8_lambda with 31s (1) cores
% 0.21/0.28 % Preprocessing time : 0.001 s
% 0.21/0.28 % Presaturation interreduction done
% 0.21/0.28
% 0.21/0.28 % Proof found!
% 0.21/0.28 % SZS status Theorem
% 0.21/0.28 % SZS output start CNFRefutation
% See solution above
% 0.21/0.28 % Parsed axioms : 14
% 0.21/0.28 % Removed by relevancy pruning/SinE : 0
% 0.21/0.28 % Initial clauses : 15
% 0.21/0.28 % Removed in clause preprocessing : 9
% 0.21/0.28 % Initial clauses in saturation : 6
% 0.21/0.28 % Processed clauses : 102
% 0.21/0.28 % ...of these trivial : 11
% 0.21/0.28 % ...subsumed : 38
% 0.21/0.28 % ...remaining for further processing : 53
% 0.21/0.28 % Other redundant clauses eliminated : 0
% 0.21/0.28 % Clauses deleted for lack of memory : 0
% 0.21/0.28 % Backward-subsumed : 5
% 0.21/0.28 % Backward-rewritten : 8
% 0.21/0.28 % Generated clauses : 146
% 0.21/0.28 % ...of the previous two non-redundant : 141
% 0.21/0.28 % ...aggressively subsumed : 0
% 0.21/0.28 % Contextual simplify-reflections : 1
% 0.21/0.28 % Paramodulations : 108
% 0.21/0.28 % Factorizations : 0
% 0.21/0.28 % NegExts : 7
% 0.21/0.28 % Equation resolutions : 1
% 0.21/0.28 % Disequality decompositions : 0
% 0.21/0.28 % Total rewrite steps : 72
% 0.21/0.28 % ...of those cached : 43
% 0.21/0.28 % Propositional unsat checks : 0
% 0.21/0.28 % Propositional check models : 0
% 0.21/0.28 % Propositional check unsatisfiable : 0
% 0.21/0.28 % Propositional clauses : 0
% 0.21/0.28 % Propositional clauses after purity: 0
% 0.21/0.28 % Propositional unsat core size : 0
% 0.21/0.28 % Propositional preprocessing time : 0.000
% 0.21/0.28 % Propositional encoding time : 0.000
% 0.21/0.28 % Propositional solver time : 0.000
% 0.21/0.28 % Success case prop preproc time : 0.000
% 0.21/0.28 % Success case prop encoding time : 0.000
% 0.21/0.28 % Success case prop solver time : 0.000
% 0.21/0.28 % Current number of processed clauses : 34
% 0.21/0.28 % Positive orientable unit clauses : 8
% 0.21/0.28 % Positive unorientable unit clauses: 0
% 0.21/0.28 % Negative unit clauses : 3
% 0.21/0.28 % Non-unit-clauses : 23
% 0.21/0.28 % Current number of unprocessed clauses: 42
% 0.21/0.28 % ...number of literals in the above : 74
% 0.21/0.28 % Current number of archived formulas : 0
% 0.21/0.28 % Current number of archived clauses : 19
% 0.21/0.28 % Clause-clause subsumption calls (NU) : 309
% 0.21/0.28 % Rec. Clause-clause subsumption calls : 225
% 0.21/0.28 % Non-unit clause-clause subsumptions : 33
% 0.21/0.28 % Unit Clause-clause subsumption calls : 11
% 0.21/0.28 % Rewrite failures with RHS unbound : 0
% 0.21/0.28 % BW rewrite match attempts : 7
% 0.21/0.28 % BW rewrite match successes : 1
% 0.21/0.28 % Condensation attempts : 0
% 0.21/0.28 % Condensation successes : 0
% 0.21/0.28 % Termbank termtop insertions : 7533
% 0.21/0.28 % Search garbage collected termcells : 90
% 0.21/0.28
% 0.21/0.28 % -------------------------------------------------
% 0.21/0.28 % User time : 0.014 s
% 0.21/0.28 % System time : 0.001 s
% 0.21/0.28 % Total time : 0.015 s
% 0.21/0.28 % Maximum resident set size: 3636 pages
% 0.21/0.28
% 0.21/0.28 % -------------------------------------------------
% 0.21/0.28 % User time : 0.016 s
% 0.21/0.28 % System time : 0.004 s
% 0.21/0.28 % Total time : 0.021 s
% 0.21/0.28 % Maximum resident set size: 4864 pages
% 0.21/0.28 % E exiting
%------------------------------------------------------------------------------