%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM712^1 : 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 : n002.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:56 AM UTC 2026
% Result : Theorem 2.29s 0.61s
% Output : CNFRefutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 75 ( 41 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 476 ( 18 ~; 17 |; 1 &; 435 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 69 ( 19 ^; 50 !; 0 ?; 69 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
set: $tType ).
thf(decl_23,type,
x: nat ).
thf(decl_24,type,
y: nat ).
thf(decl_25,type,
z: nat ).
thf(decl_26,type,
ts: nat > nat > nat ).
thf(decl_27,type,
esti: nat > set > $o ).
thf(decl_28,type,
setof: ( nat > $o ) > set ).
thf(decl_29,type,
n_1: nat ).
thf(decl_30,type,
suc: nat > nat ).
thf(decl_31,type,
pl: nat > nat > nat ).
thf(decl_32,type,
esk1_1: set > nat ).
thf(satz31,conjecture,
( ( ts @ ( ts @ x @ y ) @ z )
= ( ts @ x @ ( ts @ y @ z ) ) ),
file('/export/starexec/sandbox/tmp/tmp.n9kcUx6W0e/E---3.1_1224725.p',satz31) ).
thf(estii,axiom,
! [X1: nat > $o,X2: nat] :
( ( X1 @ X2 )
=> ( esti @ X2 @ ( setof @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.n9kcUx6W0e/E---3.1_1224725.p',estii) ).
thf(satz28e,axiom,
! [X4: nat] :
( X4
= ( ts @ X4 @ n_1 ) ),
file('/export/starexec/sandbox/tmp/tmp.n9kcUx6W0e/E---3.1_1224725.p',satz28e) ).
thf(ax5,axiom,
! [X3: set] :
( ( esti @ n_1 @ X3 )
=> ( ! [X4: nat] :
( ( esti @ X4 @ X3 )
=> ( esti @ ( suc @ X4 ) @ X3 ) )
=> ! [X4: nat] : ( esti @ X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.n9kcUx6W0e/E---3.1_1224725.p',ax5) ).
thf(satz30,axiom,
! [X4: nat,X5: nat,X6: nat] :
( ( ts @ X4 @ ( pl @ X5 @ X6 ) )
= ( pl @ ( ts @ X4 @ X5 ) @ ( ts @ X4 @ X6 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.n9kcUx6W0e/E---3.1_1224725.p',satz30) ).
thf(satz28b,axiom,
! [X4: nat,X5: nat] :
( ( ts @ X4 @ ( suc @ X5 ) )
= ( pl @ ( ts @ X4 @ X5 ) @ X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.n9kcUx6W0e/E---3.1_1224725.p',satz28b) ).
thf(estie,axiom,
! [X1: nat > $o,X2: nat] :
( ( esti @ X2 @ ( setof @ X1 ) )
=> ( X1 @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.n9kcUx6W0e/E---3.1_1224725.p',estie) ).
thf(c_0_7,negated_conjecture,
( ( ts @ ( ts @ x @ y ) @ z )
!= ( ts @ x @ ( ts @ y @ z ) ) ),
inference(assume_negation,[status(cth)],[satz31]) ).
thf(c_0_8,negated_conjecture,
( ( ts @ ( ts @ x @ y ) @ z )
!= ( ts @ x @ ( ts @ y @ z ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
thf(c_0_9,plain,
! [X37: nat > $o,X38: nat] :
( ~ ( X37 @ X38 )
| ( esti @ X38 @ ( setof @ X37 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[estii])])]) ).
thf(c_0_10,negated_conjecture,
( ( ts @ ( ts @ x @ y ) @ z )
!= ( ts @ x @ ( ts @ y @ z ) ) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
! [X1: nat > $o,X2: nat] :
( ( esti @ X2 @ ( setof @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
( ( ts @ ( ts @ x @ y ) @ z )
!= ( ts @ x @ ( ts @ y @ z ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,plain,
! [X23: nat] :
( X23
= ( ts @ X23 @ n_1 ) ),
inference(variable_rename,[status(thm)],[satz28e]) ).
thf(c_0_14,plain,
! [X32: set,X34: nat] :
( ( ( esti @ ( esk1_1 @ X32 ) @ X32 )
| ( esti @ X34 @ X32 )
| ~ ( esti @ n_1 @ X32 ) )
& ( ~ ( esti @ ( suc @ ( esk1_1 @ X32 ) ) @ X32 )
| ( esti @ X34 @ X32 )
| ~ ( esti @ n_1 @ X32 ) ) ),
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)],[ax5])])])])])]) ).
thf(c_0_15,plain,
! [X2: nat] :
( ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) )
| ( ( ts @ ( ts @ x @ y ) @ X2 )
!= ( ts @ x @ ( ts @ y @ X2 ) ) ) ),
inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]),c_0_11,c_0_12]) ).
thf(c_0_16,plain,
! [X2: nat] :
( X2
= ( ts @ X2 @ n_1 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
! [X27: nat,X28: nat,X29: nat] :
( ( ts @ X27 @ ( pl @ X28 @ X29 ) )
= ( pl @ ( ts @ X27 @ X28 ) @ ( ts @ X27 @ X29 ) ) ),
inference(variable_rename,[status(thm)],[satz30]) ).
thf(c_0_18,plain,
! [X30: nat,X31: nat] :
( ( ts @ X30 @ ( suc @ X31 ) )
= ( pl @ ( ts @ X30 @ X31 ) @ X30 ) ),
inference(variable_rename,[status(thm)],[satz28b]) ).
thf(c_0_19,plain,
! [X2: nat,X3: set] :
( ( esti @ ( esk1_1 @ X3 ) @ X3 )
| ( esti @ X2 @ X3 )
| ~ ( esti @ n_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,plain,
( esti @ n_1
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16])]) ).
thf(c_0_21,plain,
! [X2: nat,X4: nat,X5: nat] :
( ( ts @ X2 @ ( pl @ X4 @ X5 ) )
= ( pl @ ( ts @ X2 @ X4 ) @ ( ts @ X2 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_22,plain,
! [X4: nat,X2: nat] :
( ( ts @ X2 @ ( suc @ X4 ) )
= ( pl @ ( ts @ X2 @ X4 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,plain,
! [X35: nat > $o,X36: nat] :
( ~ ( esti @ X36 @ ( setof @ X35 ) )
| ( X35 @ X36 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[estie])])]) ).
thf(c_0_24,plain,
! [X2: nat] :
( ( esti
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) )
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) )
| ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_25,plain,
! [X2: nat,X4: nat] :
( ( ts @ X2 @ ( suc @ X4 ) )
= ( ts @ X2 @ ( pl @ X4 @ n_1 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_22]) ).
thf(c_0_26,plain,
! [X2: nat,X1: nat > $o] :
( ( X1 @ X2 )
| ~ ( esti @ X2 @ ( setof @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_27,plain,
( esti
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) )
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ),
inference(ef,[status(thm)],[c_0_24]) ).
thf(c_0_28,plain,
! [X2: nat,X4: nat] :
( ( pl @ ( ts @ X2 @ X4 ) @ X2 )
= ( ts @ X2 @ ( pl @ X4 @ n_1 ) ) ),
inference(rw,[status(thm)],[c_0_22,c_0_25]) ).
thf(c_0_29,plain,
( ( ts @ ( ts @ x @ y )
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ) )
= ( ts @ x
@ ( ts @ y
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ) ) ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27])]) ).
thf(c_0_30,plain,
! [X2: nat,X3: set] :
( ( esti @ X2 @ X3 )
| ~ ( esti @ ( suc @ ( esk1_1 @ X3 ) ) @ X3 )
| ~ ( esti @ n_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_31,plain,
! [X2: nat] :
( ( esti @ ( suc @ X2 )
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) )
| ( ( ts @ ( ts @ x @ y ) @ ( pl @ X2 @ n_1 ) )
!= ( ts @ x @ ( ts @ y @ ( pl @ X2 @ n_1 ) ) ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_25]) ).
thf(c_0_32,plain,
( ( ts @ ( ts @ x @ y )
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) )
@ n_1 ) )
= ( ts @ x
@ ( ts @ y
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) )
@ n_1 ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]),c_0_28]) ).
thf(c_0_33,plain,
! [X2: nat] :
( ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) )
| ~ ( esti
@ ( suc
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ) )
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
thf(c_0_34,plain,
( esti
@ ( suc
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ) )
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_35,plain,
! [X2: nat] :
( ( ( ts @ ( ts @ x @ y ) @ X2 )
= ( ts @ x @ ( ts @ y @ X2 ) ) )
| ~ ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ) ),
inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]),c_0_26,c_0_12]) ).
thf(c_0_36,plain,
! [X2: nat] :
( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( ts @ ( ts @ x @ y ) @ Z0 )
= ( ts @ x @ ( ts @ y @ Z0 ) ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
thf(c_0_37,plain,
! [X2: nat] :
( ( ts @ ( ts @ x @ y ) @ X2 )
= ( ts @ x @ ( ts @ y @ X2 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
thf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM712^1 : 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 : n002.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 12:47:07 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.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.n9kcUx6W0e/E---3.1_1224725.p
% 2.29/0.61 % Version: 3.5.1-ho
% 2.29/0.61 % Preprocessing class: HSMSSMSSSSSNSFA.
% 2.29/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.29/0.61 % Starting new_ho_14 with 1200s (4) cores
% 2.29/0.61 % Starting new_ho_13 with 600s (2) cores
% 2.29/0.61 % Starting new_ho_10_cnf2 with 300s (1) cores
% 2.29/0.61 % Starting new_bool_3 with 300s (1) cores
% 2.29/0.61 % new_bool_3 with pid 1224752 completed with status 9
% 2.29/0.61 % new_ho_14 with pid 1224749 completed with status 0
% 2.29/0.61 % Result found by new_ho_14
% 2.29/0.61 % Preprocessing class: HSMSSMSSSSSNSFA.
% 2.29/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.29/0.61 % Starting new_ho_14 with 1200s (4) cores
% 2.29/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 2.29/0.61 % SinE strategy is gf500_gu_R04_F100_L20000
% 2.29/0.61 % Search class: HGUSM-FFSF21-MSFFFSBN
% 2.29/0.61 % partial match(1): HGUSM-FFSF21-SSFFFSBN
% 2.29/0.61 % Scheduled 5 strats onto 4 cores with 1200 seconds (1200 total)
% 2.29/0.61 % Starting SubtermCWHack with 121s (1) cores
% 2.29/0.61 % Starting new_ho_14 with 721s (1) cores
% 2.29/0.61 % Starting new_ho_13 with 121s (1) cores
% 2.29/0.61 % Starting new_bool_3 with 121s (1) cores
% 2.29/0.61 % new_ho_13 with pid 1224755 completed with status 0
% 2.29/0.61 % Result found by new_ho_13
% 2.29/0.61 % Preprocessing class: HSMSSMSSSSSNSFA.
% 2.29/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.29/0.61 % Starting new_ho_14 with 1200s (4) cores
% 2.29/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 2.29/0.61 % SinE strategy is gf500_gu_R04_F100_L20000
% 2.29/0.61 % Search class: HGUSM-FFSF21-MSFFFSBN
% 2.29/0.61 % partial match(1): HGUSM-FFSF21-SSFFFSBN
% 2.29/0.61 % Scheduled 5 strats onto 4 cores with 1200 seconds (1200 total)
% 2.29/0.61 % Starting SubtermCWHack with 121s (1) cores
% 2.29/0.61 % Starting new_ho_14 with 721s (1) cores
% 2.29/0.61 % Starting new_ho_13 with 121s (1) cores
% 2.29/0.61 % Preprocessing time : 0.001 s
% 2.29/0.61 % Presaturation interreduction done
% 2.29/0.61
% 2.29/0.61 % Proof found!
% 2.29/0.61 % SZS status Theorem
% 2.29/0.61 % SZS output start CNFRefutation
% See solution above
% 2.29/0.61 % Parsed axioms : 20
% 2.29/0.61 % Removed by relevancy pruning/SinE : 11
% 2.29/0.61 % Initial clauses : 10
% 2.29/0.61 % Removed in clause preprocessing : 0
% 2.29/0.61 % Initial clauses in saturation : 14
% 2.29/0.61 % Processed clauses : 478
% 2.29/0.61 % ...of these trivial : 172
% 2.29/0.61 % ...subsumed : 53
% 2.29/0.61 % ...remaining for further processing : 253
% 2.29/0.61 % Other redundant clauses eliminated : 0
% 2.29/0.61 % Clauses deleted for lack of memory : 0
% 2.29/0.61 % Backward-subsumed : 1
% 2.29/0.61 % Backward-rewritten : 82
% 2.29/0.61 % Generated clauses : 14372
% 2.29/0.61 % ...of the previous two non-redundant : 12329
% 2.29/0.61 % ...aggressively subsumed : 0
% 2.29/0.61 % Contextual simplify-reflections : 0
% 2.29/0.61 % Paramodulations : 14370
% 2.29/0.61 % Factorizations : 2
% 2.29/0.61 % NegExts : 0
% 2.29/0.61 % Equation resolutions : 0
% 2.29/0.61 % Disequality decompositions : 0
% 2.29/0.61 % Total rewrite steps : 23934
% 2.29/0.61 % ...of those cached : 10922
% 2.29/0.61 % Propositional unsat checks : 0
% 2.29/0.61 % Propositional check models : 0
% 2.29/0.61 % Propositional check unsatisfiable : 0
% 2.29/0.61 % Propositional clauses : 0
% 2.29/0.61 % Propositional clauses after purity: 0
% 2.29/0.61 % Propositional unsat core size : 0
% 2.29/0.61 % Propositional preprocessing time : 0.000
% 2.29/0.61 % Propositional encoding time : 0.000
% 2.29/0.61 % Propositional solver time : 0.000
% 2.29/0.61 % Success case prop preproc time : 0.000
% 2.29/0.61 % Success case prop encoding time : 0.000
% 2.29/0.61 % Success case prop solver time : 0.000
% 2.29/0.61 % Current number of processed clauses : 158
% 2.29/0.61 % Positive orientable unit clauses : 134
% 2.29/0.61 % Positive unorientable unit clauses: 18
% 2.29/0.61 % Negative unit clauses : 0
% 2.29/0.61 % Non-unit-clauses : 6
% 2.29/0.61 % Current number of unprocessed clauses: 11861
% 2.29/0.61 % ...number of literals in the above : 12943
% 2.29/0.61 % Current number of archived formulas : 0
% 2.29/0.61 % Current number of archived clauses : 95
% 2.29/0.61 % Clause-clause subsumption calls (NU) : 548
% 2.29/0.61 % Rec. Clause-clause subsumption calls : 459
% 2.29/0.61 % Non-unit clause-clause subsumptions : 15
% 2.29/0.61 % Unit Clause-clause subsumption calls : 444
% 2.29/0.61 % Rewrite failures with RHS unbound : 0
% 2.29/0.61 % BW rewrite match attempts : 2244
% 2.29/0.61 % BW rewrite match successes : 83
% 2.29/0.61 % Condensation attempts : 0
% 2.29/0.61 % Condensation successes : 0
% 2.29/0.61 % Termbank termtop insertions : 793175
% 2.29/0.61 % Search garbage collected termcells : 144
% 2.29/0.61
% 2.29/0.61 % -------------------------------------------------
% 2.29/0.61 % User time : 0.321 s
% 2.29/0.61 % System time : 0.017 s
% 2.29/0.61 % Total time : 0.338 s
% 2.29/0.61 % Maximum resident set size: 3644 pages
% 2.29/0.61
% 2.29/0.61 % -------------------------------------------------
% 2.29/0.61 % User time : 1.329 s
% 2.29/0.61 % System time : 0.087 s
% 2.29/0.61 % Total time : 1.416 s
% 2.29/0.61 % Maximum resident set size: 4608 pages
% 2.29/0.61 % E exiting
%------------------------------------------------------------------------------