%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD062-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:23:23 PM UTC 2026
% Result : Unsatisfiable 5.67s 1.19s
% Output : CNFRefutation 5.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 66 ( 18 unt; 3 nHn; 66 RR)
% Number of literals : 166 ( 0 equ; 101 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 121 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(additive_inverse(b),additive_inverse(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_4) ).
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_order_relation) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).
cnf(commutativity_addition,axiom,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
cnf(totality_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_inverse) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(associativity_addition_2,axiom,
( ~ sum(X4,X6,X3)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X5,X1)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_2) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
cnf(antisymmetry_of_order_relation,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| sum(additive_identity,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',antisymmetry_of_order_relation) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(associativity_addition_1,axiom,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_1) ).
cnf(c_0_14,negated_conjecture,
~ less_or_equal(additive_inverse(b),additive_inverse(a)),
inference(fof_simplification,[status(thm)],[not_less_or_equal_4]) ).
cnf(c_0_15,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_16,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_17,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_18,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_19,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[totality_of_addition]) ).
cnf(c_0_20,negated_conjecture,
~ less_or_equal(additive_inverse(b),additive_inverse(a)),
c_0_14 ).
cnf(c_0_21,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_15 ).
cnf(c_0_22,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_23,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
c_0_16 ).
cnf(c_0_24,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
c_0_17 ).
cnf(c_0_25,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
c_0_18 ).
cnf(c_0_26,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
c_0_19 ).
cnf(c_0_27,negated_conjecture,
( ~ defined(additive_inverse(b))
| ~ defined(additive_inverse(a))
| less_or_equal(additive_inverse(a),additive_inverse(b)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_22 ).
cnf(c_0_29,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_30,plain,
( ~ sum(X2,X3,X1)
| ~ defined(X3)
| ~ less_or_equal(X2,additive_inverse(X3))
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X2,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( ~ defined(additive_inverse(b))
| less_or_equal(additive_inverse(a),additive_inverse(b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_33,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_34,plain,
( ~ sum(X4,X6,X3)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X5,X1)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_addition_2]) ).
cnf(c_0_35,plain,
( ~ sum(X4,X3,X1)
| ~ defined(X2)
| ~ defined(X3)
| ~ less_or_equal(X4,X2)
| less_or_equal(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_36,plain,
( ~ defined(X1)
| sum(X1,additive_inverse(X1),additive_identity) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_37,plain,
( ~ defined(X2)
| ~ defined(X1)
| ~ less_or_equal(X2,additive_inverse(X1))
| less_or_equal(add(X1,X2),additive_identity) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
less_or_equal(additive_inverse(a),additive_inverse(b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_33])]) ).
cnf(c_0_39,plain,
( ~ sum(X4,X6,X3)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X5,X1)
| sum(X1,X2,X3) ),
c_0_34 ).
cnf(c_0_40,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_41,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| sum(additive_identity,X1,X2) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_42,plain,
( ~ defined(X2)
| ~ defined(X1)
| ~ less_or_equal(X2,X1)
| less_or_equal(additive_identity,add(X1,additive_inverse(X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_28]) ).
cnf(c_0_43,negated_conjecture,
less_or_equal(a,b),
less_or_equal_3 ).
cnf(c_0_44,negated_conjecture,
( ~ defined(additive_inverse(a))
| less_or_equal(add(b,additive_inverse(a)),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_33])]) ).
cnf(c_0_45,plain,
( ~ sum(X5,X4,X1)
| ~ sum(X5,add(X4,X2),X3)
| ~ defined(X4)
| ~ defined(X2)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_26]) ).
cnf(c_0_46,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
c_0_40 ).
cnf(c_0_47,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| sum(additive_identity,X1,X2) ),
c_0_41 ).
cnf(c_0_48,negated_conjecture,
less_or_equal(additive_identity,add(b,additive_inverse(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_33]),c_0_29])]) ).
cnf(c_0_49,negated_conjecture,
less_or_equal(add(b,additive_inverse(a)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_28]),c_0_29])]) ).
cnf(c_0_50,plain,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_addition_1]) ).
cnf(c_0_51,plain,
( ~ sum(additive_identity,add(X1,X2),X3)
| ~ defined(X1)
| ~ defined(X2)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
sum(additive_identity,add(b,additive_inverse(a)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_53,plain,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
c_0_50 ).
cnf(c_0_54,negated_conjecture,
( ~ defined(additive_inverse(a))
| sum(b,additive_inverse(a),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_33])]) ).
cnf(c_0_55,plain,
( ~ sum(X4,X3,X2)
| ~ sum(X1,X4,additive_identity)
| ~ defined(X3)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_53,c_0_46]) ).
cnf(c_0_56,negated_conjecture,
sum(b,additive_inverse(a),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_28]),c_0_29])]) ).
cnf(c_0_57,plain,
( ~ defined(X1)
| sum(X1,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_46]) ).
cnf(c_0_58,plain,
( ~ sum(X1,X2,additive_identity)
| ~ defined(X2)
| sum(X1,additive_identity,additive_inverse(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_36]),c_0_28]) ).
cnf(c_0_59,negated_conjecture,
sum(additive_inverse(a),b,additive_identity),
inference(spm,[status(thm)],[c_0_25,c_0_56]) ).
cnf(c_0_60,plain,
( ~ sum(X3,additive_identity,X1)
| ~ defined(X2)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
sum(additive_inverse(a),additive_identity,additive_inverse(b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_33])]) ).
cnf(c_0_62,negated_conjecture,
( ~ defined(X1)
| ~ less_or_equal(additive_inverse(a),X1)
| less_or_equal(additive_inverse(b),X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_63,plain,
( ~ defined(X1)
| less_or_equal(X1,X1) ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_64,negated_conjecture,
~ defined(additive_inverse(a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_20]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD062-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 15:46:53 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 5.67/1.19 % Version: 3.5.1
% 5.67/1.19 % Preprocessing class: FSMSSMSSSSSNFFN.
% 5.67/1.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.67/1.19 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.67/1.19 % Starting new_bool_3 with 300s (1) cores
% 5.67/1.19 % Starting new_bool_1 with 300s (1) cores
% 5.67/1.19 % Starting sh5l with 300s (1) cores
% 5.67/1.19 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2642343 completed with status 0
% 5.67/1.19 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 5.67/1.19 % Preprocessing class: FSMSSMSSSSSNFFN.
% 5.67/1.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.67/1.19 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.67/1.19 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.67/1.19 % No SInE strategy applied
% 5.67/1.19 % Search class: FGUNF-FFMS21-SFFFFFNN
% 5.67/1.19 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 5.67/1.19 % Starting SubtermCWHack with 136s (1) cores
% 5.67/1.19 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.67/1.19 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 5.67/1.19 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.67/1.19 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.67/1.19 % G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 2642353 completed with status 0
% 5.67/1.19 % Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 5.67/1.19 % Preprocessing class: FSMSSMSSSSSNFFN.
% 5.67/1.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.67/1.19 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.67/1.19 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.67/1.19 % No SInE strategy applied
% 5.67/1.19 % Search class: FGUNF-FFMS21-SFFFFFNN
% 5.67/1.19 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 5.67/1.19 % Starting SubtermCWHack with 136s (1) cores
% 5.67/1.19 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.67/1.19 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 5.67/1.19 % Preprocessing time : 0.002 s
% 5.67/1.19 % Presaturation interreduction done
% 5.67/1.19
% 5.67/1.19 % Proof found!
% 5.67/1.19 % SZS status Unsatisfiable
% 5.67/1.19 % SZS output start CNFRefutation
% See solution above
% 5.67/1.19 % Parsed axioms : 30
% 5.67/1.19 % Removed by relevancy pruning/SinE : 0
% 5.67/1.19 % Initial clauses : 30
% 5.67/1.19 % Removed in clause preprocessing : 0
% 5.67/1.19 % Initial clauses in saturation : 30
% 5.67/1.19 % Processed clauses : 4785
% 5.67/1.19 % ...of these trivial : 190
% 5.67/1.19 % ...subsumed : 2342
% 5.67/1.19 % ...remaining for further processing : 2253
% 5.67/1.19 % Other redundant clauses eliminated : 0
% 5.67/1.19 % Clauses deleted for lack of memory : 0
% 5.67/1.19 % Backward-subsumed : 254
% 5.67/1.19 % Backward-rewritten : 162
% 5.67/1.19 % Generated clauses : 36029
% 5.67/1.19 % ...of the previous two non-redundant : 29601
% 5.67/1.19 % ...aggressively subsumed : 0
% 5.67/1.19 % Contextual simplify-reflections : 30
% 5.67/1.19 % Paramodulations : 36011
% 5.67/1.19 % Factorizations : 18
% 5.67/1.19 % NegExts : 0
% 5.67/1.19 % Equation resolutions : 0
% 5.67/1.19 % Disequality decompositions : 0
% 5.67/1.19 % Total rewrite steps : 20354
% 5.67/1.19 % ...of those cached : 20099
% 5.67/1.19 % Propositional unsat checks : 0
% 5.67/1.19 % Propositional check models : 0
% 5.67/1.19 % Propositional check unsatisfiable : 0
% 5.67/1.19 % Propositional clauses : 0
% 5.67/1.19 % Propositional clauses after purity: 0
% 5.67/1.19 % Propositional unsat core size : 0
% 5.67/1.19 % Propositional preprocessing time : 0.000
% 5.67/1.19 % Propositional encoding time : 0.000
% 5.67/1.19 % Propositional solver time : 0.000
% 5.67/1.19 % Success case prop preproc time : 0.000
% 5.67/1.19 % Success case prop encoding time : 0.000
% 5.67/1.19 % Success case prop solver time : 0.000
% 5.67/1.19 % Current number of processed clauses : 1807
% 5.67/1.19 % Positive orientable unit clauses : 272
% 5.67/1.19 % Positive unorientable unit clauses: 0
% 5.67/1.19 % Negative unit clauses : 3
% 5.67/1.19 % Non-unit-clauses : 1532
% 5.67/1.19 % Current number of unprocessed clauses: 24845
% 5.67/1.19 % ...number of literals in the above : 83245
% 5.67/1.19 % Current number of archived formulas : 0
% 5.67/1.19 % Current number of archived clauses : 446
% 5.67/1.19 % Clause-clause subsumption calls (NU) : 291951
% 5.67/1.19 % Rec. Clause-clause subsumption calls : 144886
% 5.67/1.19 % Non-unit clause-clause subsumptions : 2619
% 5.67/1.19 % Unit Clause-clause subsumption calls : 43581
% 5.67/1.19 % Rewrite failures with RHS unbound : 0
% 5.67/1.19 % BW rewrite match attempts : 2230
% 5.67/1.19 % BW rewrite match successes : 72
% 5.67/1.19 % Condensation attempts : 0
% 5.67/1.19 % Condensation successes : 0
% 5.67/1.19 % Termbank termtop insertions : 557163
% 5.67/1.19 % Search garbage collected termcells : 116
% 5.67/1.19
% 5.67/1.19 % -------------------------------------------------
% 5.67/1.19 % User time : 0.697 s
% 5.67/1.19 % System time : 0.032 s
% 5.67/1.19 % Total time : 0.729 s
% 5.67/1.19 % Maximum resident set size: 3404 pages
% 5.67/1.19
% 5.67/1.19 % -------------------------------------------------
% 5.67/1.19 % User time : 3.430 s
% 5.67/1.19 % System time : 0.146 s
% 5.67/1.19 % Total time : 3.576 s
% 5.67/1.19 % Maximum resident set size: 4608 pages
% 5.67/1.19 % E exiting
%------------------------------------------------------------------------------