%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM008+2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 : Thu Sep 24 12:11:26 PM UTC 2026
% Result : Theorem 0.16s 0.55s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 54 ( 13 unt; 0 def)
% Number of atoms : 160 ( 22 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 194 ( 88 ~; 88 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 85 ( 0 sgn 28 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(found,axiom,
! [X1] :
( ( transitive_reflexive_rewrite(c,X1)
& transitive_reflexive_rewrite(b,X1) )
=> goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',found) ).
fof(ih_cfl,axiom,
! [X1,X2,X3] :
( ( transitive_reflexive_rewrite(X1,X3)
& transitive_reflexive_rewrite(X1,X2)
& rewrite(a,X1) )
=> ? [X4] :
( transitive_reflexive_rewrite(X3,X4)
& transitive_reflexive_rewrite(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ih_cfl) ).
fof(transitivity_of_transitive_reflexive_rewrite,axiom,
! [X1,X2,X3] :
( ( transitive_reflexive_rewrite(X2,X3)
& transitive_reflexive_rewrite(X1,X2) )
=> transitive_reflexive_rewrite(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_transitive_reflexive_rewrite) ).
fof(equal_or_rewrite,axiom,
! [X1,X2] :
( transitive_reflexive_rewrite(X1,X2)
=> ( ? [X3] :
( transitive_reflexive_rewrite(X3,X2)
& rewrite(X1,X3) )
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_or_rewrite) ).
fof(assumption,axiom,
( transitive_reflexive_rewrite(a,c)
& transitive_reflexive_rewrite(a,b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption) ).
fof(lo_cfl,axiom,
! [X1,X2,X3] :
( ( rewrite(X1,X3)
& rewrite(X1,X2) )
=> ? [X4] :
( transitive_reflexive_rewrite(X3,X4)
& transitive_reflexive_rewrite(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lo_cfl) ).
fof(equality_in_transitive_reflexive_rewrite,axiom,
! [X1,X2] :
( X1 = X2
=> transitive_reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equality_in_transitive_reflexive_rewrite) ).
fof(c_0_8,negated_conjecture,
~ goal,
inference(assume_negation,[status(cth)],[goal_to_be_proved]) ).
fof(c_0_9,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X5] :
( goal
| ~ transitive_reflexive_rewrite(c,X5)
| ~ transitive_reflexive_rewrite(b,X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[found])])]) ).
fof(c_0_11,negated_conjecture,
~ goal,
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ transitive_reflexive_rewrite(c,X1)
| ~ transitive_reflexive_rewrite(b,X1)
| goal ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X17,X18,X19] :
( ( ~ transitive_reflexive_rewrite(X17,X19)
| ~ transitive_reflexive_rewrite(X17,X18)
| ~ rewrite(a,X17)
| transitive_reflexive_rewrite(X19,esk2_3(X17,X18,X19)) )
& ( ~ transitive_reflexive_rewrite(X17,X19)
| ~ transitive_reflexive_rewrite(X17,X18)
| ~ rewrite(a,X17)
| transitive_reflexive_rewrite(X18,esk2_3(X17,X18,X19)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ih_cfl])])])])]) ).
fof(c_0_15,plain,
! [X10,X11,X12] :
( transitive_reflexive_rewrite(X10,X12)
| ~ transitive_reflexive_rewrite(X11,X12)
| ~ transitive_reflexive_rewrite(X10,X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_of_transitive_reflexive_rewrite])])]) ).
cnf(c_0_16,plain,
( ~ transitive_reflexive_rewrite(c,X1)
| ~ transitive_reflexive_rewrite(b,X1) ),
inference(sr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ transitive_reflexive_rewrite(X2,X3)
| ~ transitive_reflexive_rewrite(X2,X1)
| ~ rewrite(a,X2)
| transitive_reflexive_rewrite(X1,esk2_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( ~ transitive_reflexive_rewrite(X2,X3)
| ~ transitive_reflexive_rewrite(X1,X2)
| transitive_reflexive_rewrite(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ transitive_reflexive_rewrite(X2,X1)
| ~ transitive_reflexive_rewrite(X2,X3)
| ~ rewrite(a,X2)
| transitive_reflexive_rewrite(X1,esk2_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X21,X22] :
( ( ~ transitive_reflexive_rewrite(X21,X22)
| X21 = X22
| transitive_reflexive_rewrite(esk3_2(X21,X22),X22) )
& ( ~ transitive_reflexive_rewrite(X21,X22)
| X21 = X22
| rewrite(X21,esk3_2(X21,X22)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_or_rewrite])])])])]) ).
cnf(c_0_21,plain,
( ~ transitive_reflexive_rewrite(X1,X2)
| ~ transitive_reflexive_rewrite(X1,c)
| ~ transitive_reflexive_rewrite(b,esk2_3(X1,c,X2))
| ~ rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ transitive_reflexive_rewrite(X2,X4)
| ~ transitive_reflexive_rewrite(X2,X3)
| ~ transitive_reflexive_rewrite(X1,X4)
| ~ rewrite(a,X2)
| transitive_reflexive_rewrite(X1,esk2_3(X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ transitive_reflexive_rewrite(X1,X2)
| X1 = X2
| rewrite(X1,esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
transitive_reflexive_rewrite(a,c),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_25,plain,
( ~ transitive_reflexive_rewrite(X1,X2)
| X1 = X2
| transitive_reflexive_rewrite(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( ~ transitive_reflexive_rewrite(X1,X2)
| ~ transitive_reflexive_rewrite(b,X2)
| ~ transitive_reflexive_rewrite(X1,c)
| ~ rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( rewrite(a,esk3_2(a,c))
| c = a ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( transitive_reflexive_rewrite(esk3_2(a,c),c)
| c = a ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_29,plain,
( ~ transitive_reflexive_rewrite(b,X1)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X1)
| c = a ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
fof(c_0_30,plain,
! [X13,X14,X15] :
( ( ~ rewrite(X13,X15)
| ~ rewrite(X13,X14)
| transitive_reflexive_rewrite(X15,esk1_3(X13,X14,X15)) )
& ( ~ rewrite(X13,X15)
| ~ rewrite(X13,X14)
| transitive_reflexive_rewrite(X14,esk1_3(X13,X14,X15)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lo_cfl])])])])]) ).
cnf(c_0_31,plain,
( ~ transitive_reflexive_rewrite(X1,X3)
| ~ transitive_reflexive_rewrite(X1,X2)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X3)
| ~ transitive_reflexive_rewrite(b,esk2_3(X1,X2,X3))
| ~ rewrite(a,X1)
| c = a ),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_32,plain,
( ~ rewrite(X2,X1)
| ~ rewrite(X2,X3)
| transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,plain,
( ~ transitive_reflexive_rewrite(X1,X2)
| ~ transitive_reflexive_rewrite(X1,b)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X2)
| ~ rewrite(a,X1)
| c = a ),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_34,plain,
( ~ transitive_reflexive_rewrite(X1,X4)
| ~ rewrite(X2,X4)
| ~ rewrite(X2,X3)
| transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
fof(c_0_35,plain,
! [X6,X7] :
( transitive_reflexive_rewrite(X6,X7)
| X6 != X7 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equality_in_transitive_reflexive_rewrite])])]) ).
cnf(c_0_36,plain,
( ~ transitive_reflexive_rewrite(X1,b)
| ~ transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X4))
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X4)
| ~ rewrite(X2,X4)
| ~ rewrite(X2,X3)
| ~ rewrite(a,X1)
| c = a ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( ~ rewrite(X2,X3)
| ~ rewrite(X2,X1)
| transitive_reflexive_rewrite(X1,esk1_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( X1 != X2
| transitive_reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,plain,
( ~ transitive_reflexive_rewrite(X1,b)
| ~ transitive_reflexive_rewrite(esk3_2(a,c),X3)
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1)
| ~ rewrite(a,X1)
| c = a ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
transitive_reflexive_rewrite(X1,X1),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_41,plain,
transitive_reflexive_rewrite(a,b),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_42,plain,
( ~ transitive_reflexive_rewrite(X2,b)
| ~ rewrite(X1,X2)
| ~ rewrite(a,X2)
| ~ rewrite(X1,esk3_2(a,c))
| c = a ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( ~ transitive_reflexive_rewrite(X1,a)
| transitive_reflexive_rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_18,c_0_41]) ).
cnf(c_0_44,plain,
( ~ transitive_reflexive_rewrite(X1,b)
| ~ rewrite(a,X1)
| c = a ),
inference(spm,[status(thm)],[c_0_42,c_0_27]) ).
cnf(c_0_45,plain,
( rewrite(a,esk3_2(a,b))
| b = a ),
inference(spm,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_46,plain,
( transitive_reflexive_rewrite(esk3_2(a,b),b)
| b = a ),
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_47,plain,
~ transitive_reflexive_rewrite(b,c),
inference(spm,[status(thm)],[c_0_16,c_0_40]) ).
cnf(c_0_48,plain,
( ~ transitive_reflexive_rewrite(X1,a)
| transitive_reflexive_rewrite(X1,c) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_49,plain,
~ transitive_reflexive_rewrite(c,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_43]),c_0_40])]) ).
cnf(c_0_50,plain,
( c = a
| b = a ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_51,plain,
~ transitive_reflexive_rewrite(b,a),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
b = a,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_40])]) ).
cnf(c_0_53,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM008+2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n015.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 14:16:51 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.55 % Version: 3.5.1
% 0.16/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.55 % Starting sh5l with 300s (1) cores
% 0.16/0.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1668610 completed with status 0
% 0.16/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.55 % No SInE strategy applied
% 0.16/0.55 % Search class: FGUSF-FFSF32-SFFFFFNN
% 0.16/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.16/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1668617 completed with status 0
% 0.16/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.55 % No SInE strategy applied
% 0.16/0.55 % Search class: FGUSF-FFSF32-SFFFFFNN
% 0.16/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.55 % Preprocessing time : 0.001 s
% 0.16/0.55 % Presaturation interreduction done
% 0.16/0.55
% 0.16/0.55 % Proof found!
% 0.16/0.55 % SZS status Theorem
% 0.16/0.55 % SZS output start CNFRefutation
% See solution above
% 0.16/0.55 % Parsed axioms : 9
% 0.16/0.55 % Removed by relevancy pruning/SinE : 0
% 0.16/0.55 % Initial clauses : 13
% 0.16/0.55 % Removed in clause preprocessing : 0
% 0.16/0.55 % Initial clauses in saturation : 13
% 0.16/0.55 % Processed clauses : 465
% 0.16/0.55 % ...of these trivial : 0
% 0.16/0.55 % ...subsumed : 195
% 0.16/0.55 % ...remaining for further processing : 270
% 0.16/0.55 % Other redundant clauses eliminated : 1
% 0.16/0.55 % Clauses deleted for lack of memory : 0
% 0.16/0.55 % Backward-subsumed : 16
% 0.16/0.55 % Backward-rewritten : 159
% 0.16/0.55 % Generated clauses : 905
% 0.16/0.55 % ...of the previous two non-redundant : 964
% 0.16/0.55 % ...aggressively subsumed : 0
% 0.16/0.55 % Contextual simplify-reflections : 7
% 0.16/0.55 % Paramodulations : 904
% 0.16/0.55 % Factorizations : 0
% 0.16/0.55 % NegExts : 0
% 0.16/0.55 % Equation resolutions : 1
% 0.16/0.55 % Disequality decompositions : 0
% 0.16/0.55 % Total rewrite steps : 377
% 0.16/0.55 % ...of those cached : 370
% 0.16/0.55 % Propositional unsat checks : 0
% 0.16/0.55 % Propositional check models : 0
% 0.16/0.55 % Propositional check unsatisfiable : 0
% 0.16/0.55 % Propositional clauses : 0
% 0.16/0.55 % Propositional clauses after purity: 0
% 0.16/0.55 % Propositional unsat core size : 0
% 0.16/0.55 % Propositional preprocessing time : 0.000
% 0.16/0.55 % Propositional encoding time : 0.000
% 0.16/0.55 % Propositional solver time : 0.000
% 0.16/0.55 % Success case prop preproc time : 0.000
% 0.16/0.55 % Success case prop encoding time : 0.000
% 0.16/0.55 % Success case prop solver time : 0.000
% 0.16/0.55 % Current number of processed clauses : 81
% 0.16/0.55 % Positive orientable unit clauses : 3
% 0.16/0.55 % Positive unorientable unit clauses: 0
% 0.16/0.55 % Negative unit clauses : 2
% 0.16/0.55 % Non-unit-clauses : 76
% 0.16/0.55 % Current number of unprocessed clauses: 457
% 0.16/0.55 % ...number of literals in the above : 2677
% 0.16/0.55 % Current number of archived formulas : 0
% 0.16/0.55 % Current number of archived clauses : 188
% 0.16/0.55 % Clause-clause subsumption calls (NU) : 10209
% 0.16/0.55 % Rec. Clause-clause subsumption calls : 2483
% 0.16/0.55 % Non-unit clause-clause subsumptions : 206
% 0.16/0.55 % Unit Clause-clause subsumption calls : 6
% 0.16/0.55 % Rewrite failures with RHS unbound : 0
% 0.16/0.55 % BW rewrite match attempts : 7
% 0.16/0.55 % BW rewrite match successes : 1
% 0.16/0.55 % Condensation attempts : 0
% 0.16/0.55 % Condensation successes : 0
% 0.16/0.55 % Termbank termtop insertions : 24842
% 0.16/0.55 % Search garbage collected termcells : 168
% 0.16/0.55
% 0.16/0.55 % -------------------------------------------------
% 0.16/0.55 % User time : 0.048 s
% 0.16/0.55 % System time : 0.006 s
% 0.16/0.55 % Total time : 0.054 s
% 0.16/0.55 % Maximum resident set size: 3584 pages
% 0.16/0.55
% 0.16/0.55 % -------------------------------------------------
% 0.16/0.55 % User time : 0.235 s
% 0.16/0.55 % System time : 0.024 s
% 0.16/0.55 % Total time : 0.259 s
% 0.16/0.55 % Maximum resident set size: 4608 pages
% 0.16/0.55 % E exiting
%------------------------------------------------------------------------------