%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO014-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:06:58 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 15
% Syntax : Number of clauses : 79 ( 79 unt; 0 nHn; 29 RR)
% Number of literals : 79 ( 78 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 84 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity2,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',distributivity2) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',multiplicative_id1) ).
cnf(multiplicative_inverse1,axiom,
multiply(X1,inverse(X1)) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',multiplicative_inverse1) ).
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',additive_id1) ).
cnf(distributivity4,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',distributivity4) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',commutativity_of_multiply) ).
cnf(additive_id2,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',additive_id2) ).
cnf(multiplicative_id2,axiom,
multiply(multiplicative_identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',multiplicative_id2) ).
cnf(a_inverse_times_b_inverse_is_d,hypothesis,
multiply(inverse(a),inverse(b)) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_inverse_times_b_inverse_is_d) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',commutativity_of_add) ).
cnf(distributivity3,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',distributivity3) ).
cnf(a_plus_b_is_c,hypothesis,
add(a,b) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_plus_b_is_c) ).
cnf(distributivity1,axiom,
add(multiply(X1,X2),X3) = multiply(add(X1,X3),add(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',distributivity1) ).
cnf(prove_c_inverse_is_d,negated_conjecture,
inverse(c) != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_inverse_is_d) ).
cnf(c_0_15,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
distributivity2 ).
cnf(c_0_16,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
additive_inverse1 ).
cnf(c_0_17,axiom,
multiply(X1,multiplicative_identity) = X1,
multiplicative_id1 ).
cnf(c_0_18,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,axiom,
multiply(X1,inverse(X1)) = additive_identity,
multiplicative_inverse1 ).
cnf(c_0_20,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_21,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distributivity4 ).
cnf(c_0_23,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_24,plain,
multiply(X1,add(X1,X2)) = add(X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_25,axiom,
add(additive_identity,X1) = X1,
additive_id2 ).
cnf(c_0_26,axiom,
multiply(multiplicative_identity,X1) = X1,
multiplicative_id2 ).
cnf(c_0_27,plain,
multiply(X1,add(X2,inverse(X1))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_20]) ).
cnf(c_0_28,plain,
add(X1,multiply(X1,X2)) = add(X1,multiply(X2,additive_identity)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_23]),c_0_24]) ).
cnf(c_0_29,hypothesis,
multiply(inverse(a),inverse(b)) = d,
a_inverse_times_b_inverse_is_d ).
cnf(c_0_30,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_31,plain,
inverse(additive_identity) = multiplicative_identity,
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_32,plain,
add(X1,multiplicative_identity) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_26]),c_0_16]) ).
cnf(c_0_33,plain,
multiply(X1,additive_identity) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_19]) ).
cnf(c_0_34,hypothesis,
add(inverse(a),multiply(additive_identity,inverse(b))) = add(d,inverse(a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23]),c_0_30]) ).
cnf(c_0_35,plain,
multiply(additive_identity,X1) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_31]),c_0_32]),c_0_17]) ).
cnf(c_0_36,plain,
add(X1,multiply(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_33]),c_0_20]) ).
cnf(c_0_37,hypothesis,
add(d,inverse(a)) = inverse(a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_20]) ).
cnf(c_0_38,plain,
add(X1,multiply(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
cnf(c_0_39,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distributivity3 ).
cnf(c_0_40,hypothesis,
multiply(a,d) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_37]),c_0_19]) ).
cnf(c_0_41,hypothesis,
add(d,inverse(b)) = inverse(b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_29]),c_0_30]) ).
cnf(c_0_42,hypothesis,
multiply(d,add(a,X1)) = multiply(X1,d),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_25]),c_0_23]) ).
cnf(c_0_43,hypothesis,
add(a,b) = c,
a_plus_b_is_c ).
cnf(c_0_44,hypothesis,
multiply(b,d) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_41]),c_0_19]) ).
cnf(c_0_45,axiom,
add(multiply(X1,X2),X3) = multiply(add(X1,X3),add(X2,X3)),
distributivity1 ).
cnf(c_0_46,hypothesis,
multiply(c,d) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_23]) ).
cnf(c_0_47,plain,
multiply(X1,add(X2,X1)) = add(X1,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_21]),c_0_30]) ).
cnf(c_0_48,plain,
add(X1,multiply(inverse(X1),X2)) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_26]) ).
cnf(c_0_49,hypothesis,
multiply(c,add(d,X1)) = multiply(c,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_46]),c_0_25]) ).
cnf(c_0_50,plain,
multiply(X1,add(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_47,c_0_36]) ).
cnf(c_0_51,plain,
add(X1,inverse(inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_19]),c_0_20]) ).
cnf(c_0_52,hypothesis,
multiply(c,inverse(d)) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_16]),c_0_17]) ).
cnf(c_0_53,plain,
multiply(X1,add(inverse(X1),X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_25]) ).
cnf(c_0_54,plain,
multiply(X1,inverse(inverse(X1))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_23]) ).
cnf(c_0_55,hypothesis,
multiply(c,add(a,X1)) = add(a,multiply(X1,b)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_43]),c_0_23]) ).
cnf(c_0_56,hypothesis,
add(c,inverse(d)) = inverse(d),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_52]),c_0_30]) ).
cnf(c_0_57,plain,
multiply(X1,multiply(X2,inverse(X1))) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_38]),c_0_19]) ).
cnf(c_0_58,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_16]),c_0_17]),c_0_54]) ).
cnf(c_0_59,hypothesis,
add(a,multiply(additive_identity,b)) = multiply(a,c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_20]),c_0_23]) ).
cnf(c_0_60,hypothesis,
add(multiply(c,X1),inverse(d)) = inverse(d),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_56]),c_0_50]) ).
cnf(c_0_61,plain,
multiply(inverse(X1),multiply(X2,X1)) = additive_identity,
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,hypothesis,
multiply(a,c) = a,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_35]),c_0_20]) ).
cnf(c_0_63,plain,
add(X1,add(X2,inverse(X1))) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_50]),c_0_16]) ).
cnf(c_0_64,hypothesis,
add(inverse(d),inverse(inverse(c))) = inverse(d),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_54]),c_0_30]) ).
cnf(c_0_65,hypothesis,
multiply(b,c) = b,
inference(spm,[status(thm)],[c_0_50,c_0_43]) ).
cnf(c_0_66,plain,
add(multiply(X1,X2),inverse(X1)) = add(X2,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_16]),c_0_26]) ).
cnf(c_0_67,hypothesis,
multiply(a,inverse(c)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_23]) ).
cnf(c_0_68,hypothesis,
add(inverse(c),inverse(d)) = multiplicative_identity,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,hypothesis,
multiply(b,inverse(c)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_65]),c_0_23]) ).
cnf(c_0_70,hypothesis,
add(inverse(a),inverse(c)) = inverse(a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_25]),c_0_30]) ).
cnf(c_0_71,hypothesis,
multiply(d,inverse(c)) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_68]),c_0_17]) ).
cnf(c_0_72,negated_conjecture,
inverse(c) != d,
inference(fof_simplification,[status(thm)],[prove_c_inverse_is_d]) ).
cnf(c_0_73,hypothesis,
multiply(inverse(a),add(inverse(b),X1)) = add(d,multiply(inverse(a),X1)),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_74,hypothesis,
add(inverse(b),inverse(c)) = inverse(b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_69]),c_0_25]),c_0_30]) ).
cnf(c_0_75,hypothesis,
multiply(inverse(a),inverse(c)) = inverse(c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_70]),c_0_23]) ).
cnf(c_0_76,hypothesis,
add(d,inverse(c)) = inverse(c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_71]),c_0_30]) ).
cnf(c_0_77,negated_conjecture,
inverse(c) != d,
c_0_72 ).
cnf(c_0_78,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_29]),c_0_75]),c_0_76]),c_0_77]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO014-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n003.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 13:49:33 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/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
% 0.18/0.51 % Version: 3.5.1
% 0.18/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 % Starting sh5l with 300s (1) cores
% 0.18/0.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 266036 completed with status 0
% 0.18/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.51 % No SInE strategy applied
% 0.18/0.51 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.18/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.51 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.18/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.18/0.51 % Starting new_bool_1 with 136s (1) cores
% 0.18/0.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 266041 completed with status 0
% 0.18/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.51 % No SInE strategy applied
% 0.18/0.51 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.18/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.51 % Preprocessing time : 0.002 s
% 0.18/0.51 % Presaturation interreduction done
% 0.18/0.51
% 0.18/0.51 % Proof found!
% 0.18/0.51 % SZS status Unsatisfiable
% 0.18/0.51 % SZS output start CNFRefutation
% See solution above
% 0.18/0.51 % Parsed axioms : 17
% 0.18/0.51 % Removed by relevancy pruning/SinE : 0
% 0.18/0.51 % Initial clauses : 17
% 0.18/0.51 % Removed in clause preprocessing : 0
% 0.18/0.51 % Initial clauses in saturation : 17
% 0.18/0.51 % Processed clauses : 543
% 0.18/0.51 % ...of these trivial : 270
% 0.18/0.51 % ...subsumed : 32
% 0.18/0.51 % ...remaining for further processing : 240
% 0.18/0.51 % Other redundant clauses eliminated : 0
% 0.18/0.51 % Clauses deleted for lack of memory : 0
% 0.18/0.51 % Backward-subsumed : 0
% 0.18/0.51 % Backward-rewritten : 51
% 0.18/0.51 % Generated clauses : 8727
% 0.18/0.51 % ...of the previous two non-redundant : 4967
% 0.18/0.51 % ...aggressively subsumed : 0
% 0.18/0.51 % Contextual simplify-reflections : 0
% 0.18/0.51 % Paramodulations : 8727
% 0.18/0.51 % Factorizations : 0
% 0.18/0.51 % NegExts : 0
% 0.18/0.51 % Equation resolutions : 0
% 0.18/0.51 % Disequality decompositions : 0
% 0.18/0.51 % Total rewrite steps : 9432
% 0.18/0.51 % ...of those cached : 7902
% 0.18/0.51 % Propositional unsat checks : 0
% 0.18/0.51 % Propositional check models : 0
% 0.18/0.51 % Propositional check unsatisfiable : 0
% 0.18/0.51 % Propositional clauses : 0
% 0.18/0.51 % Propositional clauses after purity: 0
% 0.18/0.51 % Propositional unsat core size : 0
% 0.18/0.51 % Propositional preprocessing time : 0.000
% 0.18/0.51 % Propositional encoding time : 0.000
% 0.18/0.51 % Propositional solver time : 0.000
% 0.18/0.51 % Success case prop preproc time : 0.000
% 0.18/0.51 % Success case prop encoding time : 0.000
% 0.18/0.51 % Success case prop solver time : 0.000
% 0.18/0.51 % Current number of processed clauses : 174
% 0.18/0.51 % Positive orientable unit clauses : 171
% 0.18/0.51 % Positive unorientable unit clauses: 2
% 0.18/0.51 % Negative unit clauses : 1
% 0.18/0.51 % Non-unit-clauses : 0
% 0.18/0.51 % Current number of unprocessed clauses: 4443
% 0.18/0.51 % ...number of literals in the above : 4443
% 0.18/0.51 % Current number of archived formulas : 0
% 0.18/0.51 % Current number of archived clauses : 66
% 0.18/0.51 % Clause-clause subsumption calls (NU) : 0
% 0.18/0.51 % Rec. Clause-clause subsumption calls : 0
% 0.18/0.51 % Non-unit clause-clause subsumptions : 0
% 0.18/0.51 % Unit Clause-clause subsumption calls : 2
% 0.18/0.51 % Rewrite failures with RHS unbound : 0
% 0.18/0.51 % BW rewrite match attempts : 312
% 0.18/0.51 % BW rewrite match successes : 70
% 0.18/0.51 % Condensation attempts : 0
% 0.18/0.51 % Condensation successes : 0
% 0.18/0.51 % Termbank termtop insertions : 79171
% 0.18/0.51 % Search garbage collected termcells : 2
% 0.18/0.51
% 0.18/0.51 % -------------------------------------------------
% 0.18/0.51 % User time : 0.049 s
% 0.18/0.51 % System time : 0.008 s
% 0.18/0.51 % Total time : 0.057 s
% 0.18/0.51 % Maximum resident set size: 3640 pages
% 0.18/0.51
% 0.18/0.51 % -------------------------------------------------
% 0.18/0.51 % User time : 0.242 s
% 0.18/0.51 % System time : 0.026 s
% 0.18/0.51 % Total time : 0.268 s
% 0.18/0.51 % Maximum resident set size: 4864 pages
% 0.18/0.51 % E exiting
%------------------------------------------------------------------------------