%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD014-1 : 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 : n014.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:22:40 PM UTC 2026
% Result : Unsatisfiable 160.18s 24.15s
% Output : CNFRefutation 160.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of clauses : 71 ( 23 unt; 0 nHn; 71 RR)
% Number of literals : 152 ( 0 equ; 84 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(transitivity_of_equality,axiom,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
cnf(compatibility_of_equality_and_addition,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
cnf(a_equals_b_3,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_b_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(commutativity_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
cnf(associativity_addition,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',associativity_addition) ).
cnf(well_definedness_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_addition) ).
cnf(additive_inverse_not_equal_to_additive_inverse_4,negated_conjecture,
~ equalish(additive_inverse(a),additive_inverse(b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse_not_equal_to_additive_inverse_4) ).
cnf(c_0_13,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_14,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_15,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_16,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_addition]) ).
cnf(c_0_17,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
equalish(a,b),
a_equals_b_3 ).
cnf(c_0_19,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
equalish(b,a),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ equalish(X1,a)
| equalish(X1,b) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,plain,
( ~ equalish(X1,add(X2,additive_inverse(X2)))
| ~ defined(X2)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ defined(X1)
| equalish(add(b,X1),add(a,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_27,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_28,negated_conjecture,
equalish(b,b),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_29,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_30,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(b,additive_inverse(a)),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_31,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_27 ).
cnf(c_0_32,negated_conjecture,
( ~ defined(X1)
| equalish(add(b,X1),add(b,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_33,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_34,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
equalish(add(b,additive_inverse(a)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26])]) ).
cnf(c_0_36,negated_conjecture,
( ~ defined(additive_inverse(b))
| equalish(add(b,additive_inverse(b)),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_32]),c_0_33])]) ).
cnf(c_0_37,plain,
( ~ equalish(X1,add(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
equalish(additive_identity,add(b,additive_inverse(a))),
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_39,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_40,negated_conjecture,
equalish(add(b,additive_inverse(b)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_33])]) ).
cnf(c_0_41,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(additive_identity,add(additive_inverse(a),b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_33])]) ).
cnf(c_0_42,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_39 ).
cnf(c_0_43,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[associativity_addition]) ).
cnf(c_0_44,negated_conjecture,
equalish(additive_identity,add(b,additive_inverse(b))),
inference(spm,[status(thm)],[c_0_17,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
equalish(additive_identity,add(additive_inverse(a),b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_26])]) ).
cnf(c_0_46,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_42]) ).
cnf(c_0_47,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),add(additive_identity,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_48,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
c_0_43 ).
cnf(c_0_49,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_50,negated_conjecture,
( ~ equalish(X1,additive_identity)
| equalish(X1,add(b,additive_inverse(b))) ),
inference(spm,[status(thm)],[c_0_19,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
equalish(add(additive_inverse(a),b),additive_identity),
inference(spm,[status(thm)],[c_0_17,c_0_45]) ).
cnf(c_0_52,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(X1,add(X2,X3))) ),
inference(spm,[status(thm)],[c_0_17,c_0_48]) ).
cnf(c_0_54,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_49 ).
cnf(c_0_55,negated_conjecture,
equalish(add(additive_inverse(a),b),add(b,additive_inverse(b))),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( ~ equalish(X1,add(add(X3,additive_inverse(X3)),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_52]) ).
cnf(c_0_57,plain,
( ~ defined(X2)
| ~ defined(X3)
| ~ defined(X1)
| equalish(add(add(X1,X2),X3),add(add(X2,X3),X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_53]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( ~ defined(additive_inverse(b))
| equalish(add(additive_inverse(a),b),add(additive_inverse(b),b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_55]),c_0_33])]) ).
cnf(c_0_59,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(add(X1,X2),additive_inverse(X2)),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_31]) ).
cnf(c_0_60,negated_conjecture,
equalish(add(additive_inverse(a),b),add(additive_inverse(b),b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_31]),c_0_33])]) ).
cnf(c_0_61,plain,
( ~ equalish(X1,add(add(X2,X3),additive_inverse(X3)))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
( ~ defined(X1)
| equalish(add(add(additive_inverse(a),b),X1),add(add(additive_inverse(b),b),X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
( ~ defined(additive_inverse(b))
| equalish(add(add(additive_inverse(a),b),additive_inverse(b)),additive_inverse(b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_33])]) ).
cnf(c_0_64,negated_conjecture,
equalish(add(add(additive_inverse(a),b),additive_inverse(b)),additive_inverse(b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_31]),c_0_33])]) ).
cnf(c_0_65,negated_conjecture,
equalish(additive_inverse(b),add(add(additive_inverse(a),b),additive_inverse(b))),
inference(spm,[status(thm)],[c_0_17,c_0_64]) ).
cnf(c_0_66,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(additive_inverse(b),additive_inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_65]),c_0_33])]) ).
cnf(c_0_67,negated_conjecture,
~ equalish(additive_inverse(a),additive_inverse(b)),
inference(fof_simplification,[status(thm)],[additive_inverse_not_equal_to_additive_inverse_4]) ).
cnf(c_0_68,negated_conjecture,
equalish(additive_inverse(b),additive_inverse(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_31]),c_0_26])]) ).
cnf(c_0_69,negated_conjecture,
~ equalish(additive_inverse(a),additive_inverse(b)),
c_0_67 ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_68]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD014-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 % Computer : n014.cluster.edu
% 0.16/0.44 % Model : x86_64 x86_64
% 0.16/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44 % Memory : 8046.5625MB
% 0.16/0.44 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Mon Sep 21 15:37:19 UTC 2026
% 0.16/0.45 % CPUTime :
% 0.16/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.52 Running first-order theorem proving
% 0.25/0.52 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
% 160.18/24.15 % Version: 3.5.1
% 160.18/24.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 160.18/24.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 160.18/24.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 160.18/24.15 % Starting new_bool_3 with 300s (1) cores
% 160.18/24.15 % Starting new_bool_1 with 300s (1) cores
% 160.18/24.15 % Starting sh5l with 300s (1) cores
% 160.18/24.15 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 221263 completed with status 0
% 160.18/24.15 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 160.18/24.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 160.18/24.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 160.18/24.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 160.18/24.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 160.18/24.15 % No SInE strategy applied
% 160.18/24.15 % Search class: FGUNF-FFMS21-SFFFFFNN
% 160.18/24.15 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 160.18/24.15 % Starting SubtermCWHack with 136s (1) cores
% 160.18/24.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 160.18/24.15 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 160.18/24.15 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 160.18/24.15 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 160.18/24.15 % G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 221270 completed with status 0
% 160.18/24.15 % Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 160.18/24.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 160.18/24.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 160.18/24.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 160.18/24.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 160.18/24.15 % No SInE strategy applied
% 160.18/24.15 % Search class: FGUNF-FFMS21-SFFFFFNN
% 160.18/24.15 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 160.18/24.15 % Starting SubtermCWHack with 136s (1) cores
% 160.18/24.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 160.18/24.15 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 160.18/24.15 % Preprocessing time : 0.002 s
% 160.18/24.15 % Presaturation interreduction done
% 160.18/24.15
% 160.18/24.15 % Proof found!
% 160.18/24.15 % SZS status Unsatisfiable
% 160.18/24.15 % SZS output start CNFRefutation
% See solution above
% 160.18/24.15 % Parsed axioms : 31
% 160.18/24.15 % Removed by relevancy pruning/SinE : 0
% 160.18/24.15 % Initial clauses : 31
% 160.18/24.15 % Removed in clause preprocessing : 0
% 160.18/24.15 % Initial clauses in saturation : 31
% 160.18/24.15 % Processed clauses : 42959
% 160.18/24.15 % ...of these trivial : 9367
% 160.18/24.15 % ...subsumed : 16465
% 160.18/24.15 % ...remaining for further processing : 17127
% 160.18/24.15 % Other redundant clauses eliminated : 0
% 160.18/24.15 % Clauses deleted for lack of memory : 0
% 160.18/24.15 % Backward-subsumed : 301
% 160.18/24.15 % Backward-rewritten : 1826
% 160.18/24.15 % Generated clauses : 1222890
% 160.18/24.15 % ...of the previous two non-redundant : 1069872
% 160.18/24.15 % ...aggressively subsumed : 0
% 160.18/24.15 % Contextual simplify-reflections : 446
% 160.18/24.15 % Paramodulations : 1222868
% 160.18/24.15 % Factorizations : 22
% 160.18/24.15 % NegExts : 0
% 160.18/24.15 % Equation resolutions : 0
% 160.18/24.15 % Disequality decompositions : 0
% 160.18/24.15 % Total rewrite steps : 492059
% 160.18/24.15 % ...of those cached : 488588
% 160.18/24.15 % Propositional unsat checks : 0
% 160.18/24.15 % Propositional check models : 0
% 160.18/24.15 % Propositional check unsatisfiable : 0
% 160.18/24.15 % Propositional clauses : 0
% 160.18/24.15 % Propositional clauses after purity: 0
% 160.18/24.15 % Propositional unsat core size : 0
% 160.18/24.15 % Propositional preprocessing time : 0.000
% 160.18/24.15 % Propositional encoding time : 0.000
% 160.18/24.15 % Propositional solver time : 0.000
% 160.18/24.15 % Success case prop preproc time : 0.000
% 160.18/24.15 % Success case prop encoding time : 0.000
% 160.18/24.15 % Success case prop solver time : 0.000
% 160.18/24.15 % Current number of processed clauses : 14969
% 160.18/24.15 % Positive orientable unit clauses : 3475
% 160.18/24.15 % Positive unorientable unit clauses: 0
% 160.18/24.15 % Negative unit clauses : 2
% 160.18/24.15 % Non-unit-clauses : 11492
% 160.18/24.15 % Current number of unprocessed clauses: 1026396
% 160.18/24.15 % ...number of literals in the above : 2333601
% 160.18/24.15 % Current number of archived formulas : 0
% 160.18/24.15 % Current number of archived clauses : 2158
% 160.18/24.15 % Clause-clause subsumption calls (NU) : 5673256
% 160.18/24.15 % Rec. Clause-clause subsumption calls : 4819967
% 160.18/24.15 % Non-unit clause-clause subsumptions : 17212
% 160.18/24.15 % Unit Clause-clause subsumption calls : 449190
% 160.18/24.15 % Rewrite failures with RHS unbound : 0
% 160.18/24.15 % BW rewrite match attempts : 39609
% 160.18/24.15 % BW rewrite match successes : 1403
% 160.18/24.15 % Condensation attempts : 0
% 160.18/24.15 % Condensation successes : 0
% 160.18/24.15 % Termbank termtop insertions : 19968111
% 160.18/24.15 % Search garbage collected termcells : 71
% 160.18/24.15
% 160.18/24.15 % -------------------------------------------------
% 160.18/24.15 % User time : 21.711 s
% 160.18/24.15 % System time : 0.862 s
% 160.18/24.15 % Total time : 22.572 s
% 160.18/24.15 % Maximum resident set size: 3608 pages
% 160.18/24.15
% 160.18/24.15 % -------------------------------------------------
% 160.18/24.15 % User time : 109.087 s
% 160.18/24.15 % System time : 4.172 s
% 160.18/24.15 % Total time : 113.258 s
% 160.18/24.15 % Maximum resident set size: 4864 pages
% 160.18/24.15 % E exiting
%------------------------------------------------------------------------------