%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM646^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 : 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:41 AM UTC 2026
% Result : Theorem 0.26s 0.40s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 98 ( 65 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 448 ( 52 ~; 32 |; 1 &; 356 @)
% ( 0 <=>; 7 =>; 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 : 11 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 72 ( 21 ^; 51 !; 0 ?; 72 :)
% 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,
pl: 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,
esk1_1: set > nat ).
thf(satz8,conjecture,
( ( pl @ x @ y )
!= ( pl @ x @ z ) ),
file('/export/starexec/sandbox/tmp/tmp.MJ357uy9o1/E---3.1_2026656.p',satz8) ).
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.MJ357uy9o1/E---3.1_2026656.p',ax5) ).
thf(satz4g,axiom,
! [X4: nat] :
( ( suc @ X4 )
= ( pl @ n_1 @ X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.MJ357uy9o1/E---3.1_2026656.p',satz4g) ).
thf(estii,axiom,
! [X1: nat > $o,X2: nat] :
( ( X1 @ X2 )
=> ( esti @ X2 @ ( setof @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MJ357uy9o1/E---3.1_2026656.p',estii) ).
thf(satz4h,axiom,
! [X4: nat,X5: nat] :
( ( suc @ ( pl @ X4 @ X5 ) )
= ( pl @ ( suc @ X4 ) @ X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.MJ357uy9o1/E---3.1_2026656.p',satz4h) ).
thf(satz1,axiom,
! [X4: nat,X5: nat] :
( ( X4 != X5 )
=> ( ( suc @ X4 )
!= ( suc @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MJ357uy9o1/E---3.1_2026656.p',satz1) ).
thf(estie,axiom,
! [X1: nat > $o,X2: nat] :
( ( esti @ X2 @ ( setof @ X1 ) )
=> ( X1 @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.MJ357uy9o1/E---3.1_2026656.p',estie) ).
thf(n,axiom,
y != z,
file('/export/starexec/sandbox/tmp/tmp.MJ357uy9o1/E---3.1_2026656.p',n) ).
thf(c_0_8,negated_conjecture,
~ ( ( ( pl @ x @ y )
!= ( pl @ x @ z ) ) ),
inference(assume_negation,[status(cth)],[satz8]) ).
thf(c_0_9,plain,
! [X20: set,X22: nat] :
( ( ( esti @ ( esk1_1 @ X20 ) @ X20 )
| ( esti @ X22 @ X20 )
| ~ ( esti @ n_1 @ X20 ) )
& ( ~ ( esti @ ( suc @ ( esk1_1 @ X20 ) ) @ X20 )
| ( esti @ X22 @ X20 )
| ~ ( esti @ n_1 @ X20 ) ) ),
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_10,plain,
! [X27: nat] :
( ( suc @ X27 )
= ( pl @ n_1 @ X27 ) ),
inference(variable_rename,[status(thm)],[satz4g]) ).
thf(c_0_11,plain,
! [X23: nat > $o,X24: nat] :
( ~ ( X23 @ X24 )
| ( esti @ X24 @ ( setof @ X23 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[estii])])]) ).
thf(c_0_12,negated_conjecture,
( ( pl @ x @ y )
= ( pl @ x @ z ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
! [X28: nat,X29: nat] :
( ( suc @ ( pl @ X28 @ X29 ) )
= ( pl @ ( suc @ X28 ) @ X29 ) ),
inference(variable_rename,[status(thm)],[satz4h]) ).
thf(c_0_14,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_9]) ).
thf(c_0_15,plain,
! [X2: nat] :
( ( suc @ X2 )
= ( pl @ n_1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X1: nat > $o,X2: nat] :
( ( esti @ X2 @ ( setof @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,negated_conjecture,
( ( pl @ x @ y )
= ( pl @ x @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,plain,
! [X2: nat,X4: nat] :
( ( suc @ ( pl @ X2 @ X4 ) )
= ( pl @ ( suc @ X2 ) @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,plain,
! [X2: nat,X3: set] :
( ( esti @ X2 @ X3 )
| ~ ( esti @ ( pl @ n_1 @ ( esk1_1 @ X3 ) ) @ X3 )
| ~ ( esti @ n_1 @ X3 ) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_20,plain,
! [X2: nat] :
( ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
| ( ( pl @ X2 @ y )
= ( pl @ X2 @ z ) ) ),
inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]),c_0_16,c_0_17]) ).
thf(c_0_21,plain,
! [X2: nat,X4: nat] :
( ( pl @ ( pl @ n_1 @ X2 ) @ X4 )
= ( pl @ n_1 @ ( pl @ X2 @ X4 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15]),c_0_15]) ).
thf(c_0_22,plain,
! [X4: nat,X5: nat] :
( ( X4 != X5 )
=> ( ( suc @ X4 )
!= ( suc @ X5 ) ) ),
inference(fof_simplification,[status(thm)],[satz1]) ).
thf(c_0_23,plain,
! [X18: nat > $o,X19: nat] :
( ~ ( esti @ X19 @ ( setof @ X18 ) )
| ( X18 @ X19 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[estie])])]) ).
thf(c_0_24,plain,
! [X2: nat] :
( ( ( pl @ n_1
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ y ) )
= ( pl @ n_1
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ z ) ) )
| ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
| ~ ( esti @ n_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_21]) ).
thf(c_0_25,plain,
! [X25: nat,X26: nat] :
( ( X25 = X26 )
| ( ( suc @ X25 )
!= ( suc @ X26 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[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,
! [X2: nat] :
( ( ( pl @ n_1
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ y ) )
= ( pl @ n_1
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ z ) ) )
| ( ( pl @ n_1 @ y )
= ( pl @ n_1 @ z ) )
| ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16])]) ).
thf(c_0_28,plain,
! [X2: nat,X3: set] :
( ( esti @ ( esk1_1 @ X3 ) @ X3 )
| ( esti @ X2 @ X3 )
| ~ ( esti @ n_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_29,plain,
! [X2: nat,X4: nat] :
( ( X2 = X4 )
| ( ( suc @ X2 )
!= ( suc @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_30,plain,
! [X2: nat] :
( ( ( pl @ n_1
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ y ) )
= ( pl @ n_1
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ z ) ) )
| ( ( pl @ n_1 @ y )
= ( pl @ n_1 @ z ) )
| ( ( pl @ X2 @ y )
!= ( pl @ X2 @ z ) ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27])]) ).
thf(c_0_31,plain,
! [X2: nat] :
( ( ( pl @ n_1 @ y )
= ( pl @ n_1 @ z ) )
| ( esti
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
| ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) ) ),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
thf(c_0_32,plain,
! [X2: nat,X4: nat] :
( ( X2 = X4 )
| ( ( pl @ n_1 @ X2 )
!= ( pl @ n_1 @ X4 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_15]),c_0_15]) ).
thf(c_0_33,negated_conjecture,
( ( ( pl @ n_1
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ y ) )
= ( pl @ n_1
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ z ) ) )
| ( ( pl @ n_1 @ y )
= ( pl @ n_1 @ z ) ) ),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
thf(c_0_34,plain,
( ( ( pl @ n_1 @ y )
= ( pl @ n_1 @ z ) )
| ( esti
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) ) ),
inference(ef,[status(thm)],[c_0_31]) ).
thf(c_0_35,negated_conjecture,
! [X2: nat] :
( ( X2
= ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ y ) )
| ( ( pl @ n_1 @ y )
= ( pl @ n_1 @ z ) )
| ( ( pl @ n_1 @ X2 )
!= ( pl @ n_1
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ z ) ) ) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_36,plain,
( ( ( pl @ n_1 @ y )
= ( pl @ n_1 @ z ) )
| ( ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ y )
!= ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ Z0 @ y )
!= ( pl @ Z0 @ z ) ) ) )
@ z ) ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_34])]) ).
thf(c_0_37,plain,
y != z,
inference(fof_simplification,[status(thm)],[n]) ).
thf(c_0_38,negated_conjecture,
( ( pl @ n_1 @ y )
= ( pl @ n_1 @ z ) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_35]),c_0_36]) ).
thf(c_0_39,plain,
y != z,
inference(fof_nnf,[status(thm)],[c_0_37]) ).
thf(c_0_40,negated_conjecture,
! [X2: nat] :
( ( X2 = y )
| ( ( pl @ n_1 @ X2 )
!= ( pl @ n_1 @ z ) ) ),
inference(spm,[status(thm)],[c_0_32,c_0_38]) ).
thf(c_0_41,plain,
y != z,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
thf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM646^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.27 % Computer : n013.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8046.5625MB
% 0.09/0.27 % OS : Linux 6.8.0-71-generic
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 300
% 0.09/0.27 % DateTime : Tue Sep 29 12:24:51 UTC 2026
% 0.09/0.27 % CPUTime :
% 0.09/0.27 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.34 Running higher-order theorem proving
% 0.26/0.37 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.MJ357uy9o1/E---3.1_2026656.p
% 0.26/0.40 % Version: 3.5.1-ho
% 0.26/0.40 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.26/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.40 % Starting new_ho_14 with 1200s (4) cores
% 0.26/0.40 % Starting new_ho_13 with 600s (2) cores
% 0.26/0.40 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.26/0.40 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.40 % new_ho_13 with pid 2026670 completed with status 0
% 0.26/0.40 % Result found by new_ho_13
% 0.26/0.40 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.26/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.40 % Starting new_ho_14 with 1200s (4) cores
% 0.26/0.40 % Starting new_ho_13 with 600s (2) cores
% 0.26/0.40 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.40 % No SInE strategy applied
% 0.26/0.40 % Search class: HGHSS-FFSF21-MSFFFSBN
% 0.26/0.40 % partial match(2): HGHSS-FFSF21-MSSFFMBN
% 0.26/0.40 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.26/0.40 % Starting SubtermCWHack with 55s (1) cores
% 0.26/0.40 % Starting new_ho_13 with 61s (1) cores
% 0.26/0.40 % SubtermCWHack with pid 2026673 completed with status 0
% 0.26/0.40 % Result found by SubtermCWHack
% 0.26/0.40 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.26/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.40 % Starting new_ho_14 with 1200s (4) cores
% 0.26/0.40 % Starting new_ho_13 with 600s (2) cores
% 0.26/0.40 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.40 % No SInE strategy applied
% 0.26/0.40 % Search class: HGHSS-FFSF21-MSFFFSBN
% 0.26/0.40 % partial match(2): HGHSS-FFSF21-MSSFFMBN
% 0.26/0.40 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.26/0.40 % Starting SubtermCWHack with 55s (1) cores
% 0.26/0.40 % Preprocessing time : 0.002 s
% 0.26/0.40
% 0.26/0.40 % Proof found!
% 0.26/0.40 % SZS status Theorem
% 0.26/0.40 % SZS output start CNFRefutation
% See solution above
% 0.26/0.41 % Parsed axioms : 18
% 0.26/0.41 % Removed by relevancy pruning/SinE : 0
% 0.26/0.41 % Initial clauses : 19
% 0.26/0.41 % Removed in clause preprocessing : 10
% 0.26/0.41 % Initial clauses in saturation : 13
% 0.26/0.41 % Processed clauses : 30
% 0.26/0.41 % ...of these trivial : 0
% 0.26/0.41 % ...subsumed : 2
% 0.26/0.41 % ...remaining for further processing : 28
% 0.26/0.41 % Other redundant clauses eliminated : 0
% 0.26/0.41 % Clauses deleted for lack of memory : 0
% 0.26/0.41 % Backward-subsumed : 4
% 0.26/0.41 % Backward-rewritten : 6
% 0.26/0.41 % Generated clauses : 50
% 0.26/0.41 % ...of the previous two non-redundant : 41
% 0.26/0.41 % ...aggressively subsumed : 0
% 0.26/0.41 % Contextual simplify-reflections : 1
% 0.26/0.41 % Paramodulations : 43
% 0.26/0.41 % Factorizations : 4
% 0.26/0.41 % NegExts : 0
% 0.26/0.41 % Equation resolutions : 3
% 0.26/0.41 % Disequality decompositions : 0
% 0.26/0.41 % Total rewrite steps : 19
% 0.26/0.41 % ...of those cached : 7
% 0.26/0.41 % Propositional unsat checks : 0
% 0.26/0.41 % Propositional check models : 0
% 0.26/0.41 % Propositional check unsatisfiable : 0
% 0.26/0.41 % Propositional clauses : 0
% 0.26/0.41 % Propositional clauses after purity: 0
% 0.26/0.41 % Propositional unsat core size : 0
% 0.26/0.41 % Propositional preprocessing time : 0.000
% 0.26/0.41 % Propositional encoding time : 0.000
% 0.26/0.41 % Propositional solver time : 0.000
% 0.26/0.41 % Success case prop preproc time : 0.000
% 0.26/0.41 % Success case prop encoding time : 0.000
% 0.26/0.41 % Success case prop solver time : 0.000
% 0.26/0.41 % Current number of processed clauses : 18
% 0.26/0.41 % Positive orientable unit clauses : 4
% 0.26/0.41 % Positive unorientable unit clauses: 0
% 0.26/0.41 % Negative unit clauses : 1
% 0.26/0.41 % Non-unit-clauses : 13
% 0.26/0.41 % Current number of unprocessed clauses: 14
% 0.26/0.41 % ...number of literals in the above : 43
% 0.26/0.41 % Current number of archived formulas : 0
% 0.26/0.41 % Current number of archived clauses : 10
% 0.26/0.41 % Clause-clause subsumption calls (NU) : 137
% 0.26/0.41 % Rec. Clause-clause subsumption calls : 126
% 0.26/0.41 % Non-unit clause-clause subsumptions : 7
% 0.26/0.41 % Unit Clause-clause subsumption calls : 3
% 0.26/0.41 % Rewrite failures with RHS unbound : 0
% 0.26/0.41 % BW rewrite match attempts : 1
% 0.26/0.41 % BW rewrite match successes : 1
% 0.26/0.41 % Condensation attempts : 0
% 0.26/0.41 % Condensation successes : 0
% 0.26/0.41 % Termbank termtop insertions : 2335
% 0.26/0.41 % Search garbage collected termcells : 155
% 0.26/0.41
% 0.26/0.41 % -------------------------------------------------
% 0.26/0.41 % User time : 0.011 s
% 0.26/0.41 % System time : 0.002 s
% 0.26/0.41 % Total time : 0.013 s
% 0.26/0.41 % Maximum resident set size: 3640 pages
% 0.26/0.41
% 0.26/0.41 % -------------------------------------------------
% 0.26/0.41 % User time : 0.024 s
% 0.26/0.41 % System time : 0.008 s
% 0.26/0.41 % Total time : 0.032 s
% 0.26/0.41 % Maximum resident set size: 4864 pages
% 0.26/0.41 % E exiting
%------------------------------------------------------------------------------