%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD050-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 : 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:51 PM UTC 2026
% Result : Unsatisfiable 67.32s 15.41s
% Output : CNFRefutation 67.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 15
% Syntax : Number of clauses : 72 ( 33 unt; 7 nHn; 72 RR)
% Number of literals : 153 ( 0 equ; 83 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_multiplication_1,axiom,
( ~ product(X5,X6,X3)
| ~ product(X4,X6,X2)
| ~ product(X1,X4,X5)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_multiplication_1) ).
cnf(existence_of_identity_multiplication,axiom,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_multiplication) ).
cnf(commutativity_multiplication,axiom,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_multiplication) ).
cnf(product_7,negated_conjecture,
product(a,d,multiply(b,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_7) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(existence_of_inverse_multiplication,axiom,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_multiplication) ).
cnf(not_sum_6,negated_conjecture,
~ sum(additive_identity,d,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_6) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_is_defined) ).
cnf(associativity_multiplication_2,axiom,
( ~ product(X4,X6,X3)
| ~ product(X5,X2,X6)
| ~ product(X4,X5,X1)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_multiplication_2) ).
cnf(totality_of_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| product(X1,X2,multiply(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_multiplication) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(not_sum_5,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_5) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_multiplicative_inverse) ).
cnf(not_product_8,negated_conjecture,
~ product(a,multiplicative_inverse(b),multiply(c,multiplicative_inverse(d))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_product_8) ).
cnf(c_0_15,plain,
( ~ product(X5,X6,X3)
| ~ product(X4,X6,X2)
| ~ product(X1,X4,X5)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_multiplication_1]) ).
cnf(c_0_16,plain,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_17,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_18,plain,
( ~ product(X5,X6,X3)
| ~ product(X4,X6,X2)
| ~ product(X1,X4,X5)
| product(X1,X2,X3) ),
c_0_15 ).
cnf(c_0_19,plain,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
c_0_16 ).
cnf(c_0_20,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
product(a,d,multiply(b,c)),
product_7 ).
cnf(c_0_22,plain,
( ~ defined(X3)
| ~ product(X4,X3,X2)
| ~ product(X1,X4,multiplicative_identity)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
product(d,a,multiply(b,c)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_25,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_multiplication]) ).
cnf(c_0_26,negated_conjecture,
~ sum(additive_identity,d,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_6]) ).
cnf(c_0_27,negated_conjecture,
( ~ product(X1,d,multiplicative_identity)
| product(X1,multiply(b,c),a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
c_0_25 ).
cnf(c_0_29,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_30,negated_conjecture,
~ sum(additive_identity,d,additive_identity),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
product(multiplicative_inverse(d),multiply(b,c),a),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_32,negated_conjecture,
product(multiply(b,c),multiplicative_inverse(d),a),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( ~ product(X3,multiplicative_inverse(d),X2)
| ~ product(X1,X3,multiply(b,c))
| product(X1,X2,a) ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_34,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(X1,multiplicative_inverse(X1),multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_35,plain,
( ~ product(X4,X6,X3)
| ~ product(X5,X2,X6)
| ~ product(X4,X5,X1)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_multiplication_2]) ).
cnf(c_0_36,negated_conjecture,
( ~ product(X1,d,multiply(b,c))
| product(X1,multiplicative_identity,a) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29])]),c_0_30]) ).
cnf(c_0_37,plain,
( ~ product(X4,X6,X3)
| ~ product(X5,X2,X6)
| ~ product(X4,X5,X1)
| product(X1,X2,X3) ),
c_0_35 ).
cnf(c_0_38,negated_conjecture,
product(a,multiplicative_identity,a),
inference(spm,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_39,plain,
( ~ defined(X2)
| ~ defined(X1)
| product(X1,X2,multiply(X1,X2)) ),
inference(fof_simplification,[status(thm)],[totality_of_multiplication]) ).
cnf(c_0_40,negated_conjecture,
( ~ product(X3,a,X1)
| ~ product(X3,a,X2)
| product(X1,multiplicative_identity,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( ~ defined(X2)
| ~ defined(X1)
| product(X1,X2,multiply(X1,X2)) ),
c_0_39 ).
cnf(c_0_42,negated_conjecture,
( ~ defined(X2)
| ~ product(X2,a,X1)
| product(X1,multiplicative_identity,multiply(X2,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_24])]) ).
cnf(c_0_43,plain,
( ~ defined(X5)
| ~ defined(X2)
| ~ product(X4,X5,X1)
| ~ product(X4,multiply(X5,X2),X3)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
product(multiply(b,c),multiplicative_identity,multiply(d,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_23]),c_0_29])]) ).
cnf(c_0_45,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ product(multiplicative_identity,multiply(X1,X2),X3)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_43,c_0_19]) ).
cnf(c_0_46,negated_conjecture,
product(multiplicative_identity,multiply(b,c),multiply(d,a)),
inference(spm,[status(thm)],[c_0_20,c_0_44]) ).
cnf(c_0_47,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_48,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_49,negated_conjecture,
product(b,c,multiply(d,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48])]) ).
cnf(c_0_50,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_5]) ).
cnf(c_0_51,plain,
( ~ defined(X2)
| ~ defined(X1)
| product(X1,X2,multiply(X2,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( ~ product(X1,b,multiplicative_identity)
| product(X1,multiply(d,a),c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_49]),c_0_47])]) ).
cnf(c_0_53,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
c_0_50 ).
cnf(c_0_54,plain,
( ~ defined(X2)
| ~ defined(X1)
| ~ defined(X3)
| ~ product(X2,multiply(X1,X3),X4)
| product(multiply(X1,X2),X3,X4) ),
inference(spm,[status(thm)],[c_0_43,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
product(multiplicative_inverse(b),multiply(d,a),c),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_28]),c_0_48])]),c_0_53]) ).
cnf(c_0_56,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).
cnf(c_0_57,negated_conjecture,
( ~ defined(multiplicative_inverse(b))
| product(multiply(d,multiplicative_inverse(b)),a,c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_24]),c_0_29])]) ).
cnf(c_0_58,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
c_0_56 ).
cnf(c_0_59,negated_conjecture,
product(multiply(d,multiplicative_inverse(b)),a,c),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_48])]),c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( ~ defined(X1)
| ~ product(a,multiply(d,X1),X2)
| product(multiply(b,c),X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_21]),c_0_29])]) ).
cnf(c_0_61,negated_conjecture,
product(a,multiply(d,multiplicative_inverse(b)),c),
inference(spm,[status(thm)],[c_0_20,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
( ~ defined(multiplicative_inverse(b))
| product(multiply(b,c),multiplicative_inverse(b),c) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_63,plain,
( ~ defined(X3)
| ~ defined(X4)
| ~ product(X1,X5,X3)
| ~ product(X5,X4,X2)
| product(X1,X2,multiply(X3,X4)) ),
inference(spm,[status(thm)],[c_0_18,c_0_41]) ).
cnf(c_0_64,negated_conjecture,
product(multiply(b,c),multiplicative_inverse(b),c),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_58]),c_0_48])]),c_0_53]) ).
cnf(c_0_65,negated_conjecture,
( ~ defined(X2)
| ~ defined(multiplicative_inverse(d))
| ~ product(X1,multiply(b,c),X2)
| product(X1,a,multiply(X2,multiplicative_inverse(d))) ),
inference(spm,[status(thm)],[c_0_63,c_0_32]) ).
cnf(c_0_66,negated_conjecture,
product(multiplicative_inverse(b),multiply(b,c),c),
inference(spm,[status(thm)],[c_0_20,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( ~ defined(multiplicative_inverse(d))
| product(multiplicative_inverse(b),a,multiply(c,multiplicative_inverse(d))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_47])]) ).
cnf(c_0_68,negated_conjecture,
~ product(a,multiplicative_inverse(b),multiply(c,multiplicative_inverse(d))),
inference(fof_simplification,[status(thm)],[not_product_8]) ).
cnf(c_0_69,negated_conjecture,
product(multiplicative_inverse(b),a,multiply(c,multiplicative_inverse(d))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_58]),c_0_29])]),c_0_30]) ).
cnf(c_0_70,negated_conjecture,
~ product(a,multiplicative_inverse(b),multiply(c,multiplicative_inverse(d))),
c_0_68 ).
cnf(c_0_71,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_69]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD050-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.46 % Computer : n014.cluster.edu
% 0.18/5.46 % Model : x86_64 x86_64
% 0.18/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.46 % Memory : 8046.5625MB
% 0.18/5.46 % OS : Linux 6.8.0-71-generic
% 0.18/5.46 % CPULimit : 300
% 0.18/5.46 % WCLimit : 300
% 0.18/5.46 % DateTime : Mon Sep 21 15:41:25 UTC 2026
% 0.18/5.46 % CPUTime :
% 0.18/5.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.52 Running first-order theorem proving
% 0.23/5.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
% 67.32/15.41 % Version: 3.5.1
% 67.32/15.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 67.32/15.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 67.32/15.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 67.32/15.41 % Starting new_bool_3 with 300s (1) cores
% 67.32/15.41 % Starting new_bool_1 with 300s (1) cores
% 67.32/15.41 % Starting sh5l with 300s (1) cores
% 67.32/15.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 227813 completed with status 0
% 67.32/15.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 67.32/15.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 67.32/15.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 67.32/15.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 67.32/15.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 67.32/15.41 % No SInE strategy applied
% 67.32/15.41 % Search class: FGUNF-FFMM21-SFFFFFNN
% 67.32/15.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 67.32/15.41 % Starting SubtermCWHack with 136s (1) cores
% 67.32/15.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 67.32/15.41 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 67.32/15.41 % Starting new_bool_3 with 269s (1) cores
% 67.32/15.41 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 67.32/15.41 % new_bool_3 with pid 227823 completed with status 0
% 67.32/15.41 % Result found by new_bool_3
% 67.32/15.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 67.32/15.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 67.32/15.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 67.32/15.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 67.32/15.41 % No SInE strategy applied
% 67.32/15.41 % Search class: FGUNF-FFMM21-SFFFFFNN
% 67.32/15.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 67.32/15.41 % Starting SubtermCWHack with 136s (1) cores
% 67.32/15.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 67.32/15.41 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 67.32/15.41 % Starting new_bool_3 with 269s (1) cores
% 67.32/15.41 % Preprocessing time : 0.002 s
% 67.32/15.41 % Presaturation interreduction done
% 67.32/15.41
% 67.32/15.41 % Proof found!
% 67.32/15.41 % SZS status Unsatisfiable
% 67.32/15.41 % SZS output start CNFRefutation
% See solution above
% 67.32/15.41 % Parsed axioms : 34
% 67.32/15.41 % Removed by relevancy pruning/SinE : 0
% 67.32/15.41 % Initial clauses : 34
% 67.32/15.41 % Removed in clause preprocessing : 0
% 67.32/15.41 % Initial clauses in saturation : 34
% 67.32/15.41 % Processed clauses : 16207
% 67.32/15.41 % ...of these trivial : 2269
% 67.32/15.41 % ...subsumed : 2661
% 67.32/15.41 % ...remaining for further processing : 11277
% 67.32/15.41 % Other redundant clauses eliminated : 0
% 67.32/15.41 % Clauses deleted for lack of memory : 0
% 67.32/15.41 % Backward-subsumed : 57
% 67.32/15.41 % Backward-rewritten : 709
% 67.32/15.41 % Generated clauses : 418958
% 67.32/15.41 % ...of the previous two non-redundant : 373560
% 67.32/15.41 % ...aggressively subsumed : 0
% 67.32/15.41 % Contextual simplify-reflections : 25
% 67.32/15.41 % Paramodulations : 418948
% 67.32/15.41 % Factorizations : 10
% 67.32/15.41 % NegExts : 0
% 67.32/15.41 % Equation resolutions : 0
% 67.32/15.41 % Disequality decompositions : 0
% 67.32/15.41 % Total rewrite steps : 154510
% 67.32/15.41 % ...of those cached : 151390
% 67.32/15.41 % Propositional unsat checks : 2
% 67.32/15.41 % Propositional check models : 0
% 67.32/15.41 % Propositional check unsatisfiable : 0
% 67.32/15.41 % Propositional clauses : 0
% 67.32/15.41 % Propositional clauses after purity: 0
% 67.32/15.41 % Propositional unsat core size : 0
% 67.32/15.41 % Propositional preprocessing time : 0.000
% 67.32/15.41 % Propositional encoding time : 0.359
% 67.32/15.41 % Propositional solver time : 0.546
% 67.32/15.41 % Success case prop preproc time : 0.000
% 67.32/15.41 % Success case prop encoding time : 0.000
% 67.32/15.41 % Success case prop solver time : 0.000
% 67.32/15.41 % Current number of processed clauses : 10477
% 67.32/15.41 % Positive orientable unit clauses : 4346
% 67.32/15.41 % Positive unorientable unit clauses: 0
% 67.32/15.41 % Negative unit clauses : 57
% 67.32/15.41 % Non-unit-clauses : 6074
% 67.32/15.41 % Current number of unprocessed clauses: 357414
% 67.32/15.41 % ...number of literals in the above : 980211
% 67.32/15.41 % Current number of archived formulas : 0
% 67.32/15.41 % Current number of archived clauses : 800
% 67.32/15.41 % Clause-clause subsumption calls (NU) : 2357622
% 67.32/15.41 % Rec. Clause-clause subsumption calls : 1883904
% 67.32/15.41 % Non-unit clause-clause subsumptions : 2566
% 67.32/15.41 % Unit Clause-clause subsumption calls : 228947
% 67.32/15.41 % Rewrite failures with RHS unbound : 0
% 67.32/15.41 % BW rewrite match attempts : 37238
% 67.32/15.41 % BW rewrite match successes : 514
% 67.32/15.41 % Condensation attempts : 0
% 67.32/15.41 % Condensation successes : 0
% 67.32/15.41 % Termbank termtop insertions : 9513044
% 67.32/15.41 % Search garbage collected termcells : 120
% 67.32/15.41
% 67.32/15.41 % -------------------------------------------------
% 67.32/15.41 % User time : 9.188 s
% 67.32/15.41 % System time : 0.367 s
% 67.32/15.41 % Total time : 9.555 s
% 67.32/15.41 % Maximum resident set size: 3612 pages
% 67.32/15.41
% 67.32/15.41 % -------------------------------------------------
% 67.32/15.41 % User time : 46.648 s
% 67.32/15.41 % System time : 1.641 s
% 67.32/15.41 % Total time : 48.288 s
% 67.32/15.41 % Maximum resident set size: 4864 pages
% 67.32/15.41 % E exiting
%------------------------------------------------------------------------------