%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG007-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 02:05:28 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.54s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of clauses : 77 ( 37 unt; 0 nHn; 43 RR)
% Number of literals : 166 ( 13 equ; 92 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 212 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(addition_is_well_defined,axiom,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',addition_is_well_defined) ).
cnf(commutativity_of_addition,axiom,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
cnf(associativity_of_addition2,axiom,
( ~ sum(X1,X5,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_addition2) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',closure_of_addition) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',left_inverse) ).
cnf(distributivity1,axiom,
( ~ product(X1,X6,X7)
| ~ sum(X2,X4,X6)
| ~ product(X1,X4,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',distributivity1) ).
cnf(x_squared_is_x,hypothesis,
product(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_squared_is_x) ).
cnf(associativity_of_addition1,axiom,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_addition1) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',closure_of_multiplication) ).
cnf(right_inverse,axiom,
sum(X1,additive_inverse(X1),additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',right_inverse) ).
cnf(distributivity3,axiom,
( ~ product(X6,X2,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',distributivity3) ).
cnf(prove_a_plus_a_is_id,negated_conjecture,
~ sum(a,a,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_plus_a_is_id) ).
cnf(c_0_13,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_14,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).
cnf(c_0_15,plain,
( ~ sum(X1,X5,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_addition2]) ).
cnf(c_0_16,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_13 ).
cnf(c_0_17,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_18,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
c_0_14 ).
cnf(c_0_19,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_20,plain,
( ~ sum(X1,X5,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X3,X4,X6) ),
c_0_15 ).
cnf(c_0_21,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_22,plain,
( ~ sum(additive_identity,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ product(X1,X6,X7)
| ~ sum(X2,X4,X6)
| ~ product(X1,X4,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
inference(fof_simplification,[status(thm)],[distributivity1]) ).
cnf(c_0_25,plain,
( ~ sum(X4,additive_identity,X3)
| ~ sum(X4,additive_inverse(X2),X1)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
add(X1,additive_identity) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ product(X1,X6,X7)
| ~ sum(X2,X4,X6)
| ~ product(X1,X4,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
c_0_24 ).
cnf(c_0_28,hypothesis,
product(X1,X1,X1),
x_squared_is_x ).
cnf(c_0_29,plain,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_addition1]) ).
cnf(c_0_30,plain,
( ~ sum(X3,additive_inverse(X2),X1)
| sum(X1,X2,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_26]) ).
cnf(c_0_31,hypothesis,
( ~ sum(X5,X4,X3)
| ~ product(X3,X5,X1)
| ~ product(X3,X4,X2)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
c_0_29 ).
cnf(c_0_33,plain,
( ~ sum(X2,X3,X1)
| X1 = add(X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_34,plain,
sum(additive_identity,X1,additive_inverse(additive_inverse(X1))),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_35,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_36,hypothesis,
( ~ sum(X3,X2,X2)
| ~ product(X2,X3,X1)
| sum(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_37,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_38,plain,
( ~ sum(additive_inverse(X2),X2,X1)
| X1 = additive_identity ),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_39,plain,
( ~ sum(X3,X4,X2)
| ~ sum(X1,X3,additive_inverse(X4))
| sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_40,axiom,
sum(X1,additive_inverse(X1),additive_identity),
right_inverse ).
cnf(c_0_41,plain,
additive_inverse(additive_inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_42,hypothesis,
( ~ sum(X2,X1,X1)
| sum(multiply(X1,X2),X1,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
sum(add(X1,additive_inverse(X2)),X2,X1),
inference(spm,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_44,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(spm,[status(thm)],[c_0_38,c_0_23]) ).
cnf(c_0_45,plain,
( ~ product(X6,X2,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
inference(fof_simplification,[status(thm)],[distributivity3]) ).
cnf(c_0_46,plain,
( ~ sum(X1,X2,X2)
| sum(X1,additive_identity,additive_identity) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_47,hypothesis,
sum(multiply(X1,additive_identity),X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_48,plain,
( ~ product(X6,X2,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
c_0_45 ).
cnf(c_0_49,hypothesis,
sum(multiply(X1,additive_identity),additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,hypothesis,
( ~ sum(X5,X4,X3)
| ~ product(X5,X3,X1)
| ~ product(X4,X3,X2)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_28]) ).
cnf(c_0_51,hypothesis,
multiply(X1,additive_identity) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_49]),c_0_26]) ).
cnf(c_0_52,hypothesis,
( ~ sum(X3,X2,X2)
| ~ product(X3,X2,X1)
| sum(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_28]) ).
cnf(c_0_53,hypothesis,
product(X1,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_37,c_0_51]) ).
cnf(c_0_54,hypothesis,
( ~ sum(X1,X2,X2)
| sum(multiply(X1,X2),X2,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_37]) ).
cnf(c_0_55,hypothesis,
( ~ sum(X5,X4,additive_identity)
| ~ product(X3,X5,X1)
| ~ product(X3,X4,X2)
| sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_27,c_0_53]) ).
cnf(c_0_56,plain,
( ~ sum(X4,X3,X2)
| ~ sum(X1,X4,additive_identity)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_17]) ).
cnf(c_0_57,hypothesis,
sum(multiply(additive_identity,X1),X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_43]),c_0_44]) ).
cnf(c_0_58,hypothesis,
( ~ sum(X3,X2,additive_identity)
| ~ product(X2,X3,X1)
| sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_55,c_0_28]) ).
cnf(c_0_59,plain,
( ~ sum(X1,X2,additive_identity)
| sum(X1,add(X2,X3),X3) ),
inference(spm,[status(thm)],[c_0_56,c_0_19]) ).
cnf(c_0_60,hypothesis,
sum(multiply(additive_identity,X1),additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_46,c_0_57]) ).
cnf(c_0_61,plain,
( ~ sum(X1,X5,X4)
| ~ sum(X5,X3,X2)
| sum(X1,X2,add(X3,X4)) ),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_62,hypothesis,
( ~ sum(X2,X1,additive_identity)
| sum(multiply(X1,X2),X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_58,c_0_37]) ).
cnf(c_0_63,plain,
sum(additive_inverse(X1),add(X1,X2),X2),
inference(spm,[status(thm)],[c_0_59,c_0_21]) ).
cnf(c_0_64,hypothesis,
multiply(additive_identity,X1) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_60]),c_0_26]) ).
cnf(c_0_65,plain,
( ~ sum(X1,additive_inverse(X2),X3)
| sum(X1,additive_identity,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_61,c_0_21]) ).
cnf(c_0_66,hypothesis,
sum(multiply(X1,additive_inverse(X1)),X1,additive_identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_26]),c_0_26]) ).
cnf(c_0_67,hypothesis,
product(additive_identity,X1,additive_identity),
inference(spm,[status(thm)],[c_0_37,c_0_64]) ).
cnf(c_0_68,hypothesis,
sum(multiply(additive_inverse(X1),X1),additive_identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_41]),c_0_26]) ).
cnf(c_0_69,hypothesis,
( ~ sum(X5,X3,additive_identity)
| ~ product(X5,X4,X1)
| ~ product(X3,X4,X2)
| sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_48,c_0_67]) ).
cnf(c_0_70,hypothesis,
multiply(additive_inverse(X1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_68]),c_0_26]) ).
cnf(c_0_71,negated_conjecture,
~ sum(a,a,additive_identity),
inference(fof_simplification,[status(thm)],[prove_a_plus_a_is_id]) ).
cnf(c_0_72,hypothesis,
( ~ sum(X3,X2,additive_identity)
| ~ product(X3,X2,X1)
| sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_69,c_0_28]) ).
cnf(c_0_73,hypothesis,
product(additive_inverse(X1),X1,X1),
inference(spm,[status(thm)],[c_0_37,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
~ sum(a,a,additive_identity),
c_0_71 ).
cnf(c_0_75,hypothesis,
sum(X1,X1,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_21])]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n016.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 04:15:07 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.54 % Version: 3.5.1
% 0.15/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.54 % Starting sh5l with 300s (1) cores
% 0.15/0.54 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1529561 completed with status 0
% 0.15/0.54 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.54 % No SInE strategy applied
% 0.15/0.54 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.15/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.15/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.54 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.54 % new_bool_3 with pid 1529566 completed with status 0
% 0.15/0.54 % Result found by new_bool_3
% 0.15/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.54 % No SInE strategy applied
% 0.15/0.54 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.15/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.15/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.54 % Preprocessing time : 0.002 s
% 0.15/0.54 % Presaturation interreduction done
% 0.15/0.54
% 0.15/0.54 % Proof found!
% 0.15/0.54 % SZS status Unsatisfiable
% 0.15/0.54 % SZS output start CNFRefutation
% See solution above
% 0.15/0.54 % Parsed axioms : 19
% 0.15/0.54 % Removed by relevancy pruning/SinE : 0
% 0.15/0.54 % Initial clauses : 19
% 0.15/0.54 % Removed in clause preprocessing : 0
% 0.15/0.54 % Initial clauses in saturation : 19
% 0.15/0.54 % Processed clauses : 1052
% 0.15/0.54 % ...of these trivial : 89
% 0.15/0.54 % ...subsumed : 571
% 0.15/0.54 % ...remaining for further processing : 392
% 0.15/0.54 % Other redundant clauses eliminated : 0
% 0.15/0.54 % Clauses deleted for lack of memory : 0
% 0.15/0.54 % Backward-subsumed : 7
% 0.15/0.54 % Backward-rewritten : 21
% 0.15/0.54 % Generated clauses : 4368
% 0.15/0.54 % ...of the previous two non-redundant : 2464
% 0.15/0.54 % ...aggressively subsumed : 0
% 0.15/0.54 % Contextual simplify-reflections : 0
% 0.15/0.54 % Paramodulations : 4368
% 0.15/0.54 % Factorizations : 0
% 0.15/0.54 % NegExts : 0
% 0.15/0.54 % Equation resolutions : 0
% 0.15/0.54 % Disequality decompositions : 0
% 0.15/0.54 % Total rewrite steps : 4182
% 0.15/0.54 % ...of those cached : 3976
% 0.15/0.54 % Propositional unsat checks : 0
% 0.15/0.54 % Propositional check models : 0
% 0.15/0.54 % Propositional check unsatisfiable : 0
% 0.15/0.54 % Propositional clauses : 0
% 0.15/0.54 % Propositional clauses after purity: 0
% 0.15/0.54 % Propositional unsat core size : 0
% 0.15/0.54 % Propositional preprocessing time : 0.000
% 0.15/0.54 % Propositional encoding time : 0.000
% 0.15/0.54 % Propositional solver time : 0.000
% 0.15/0.54 % Success case prop preproc time : 0.000
% 0.15/0.54 % Success case prop encoding time : 0.000
% 0.15/0.54 % Success case prop solver time : 0.000
% 0.15/0.54 % Current number of processed clauses : 345
% 0.15/0.54 % Positive orientable unit clauses : 44
% 0.15/0.54 % Positive unorientable unit clauses: 1
% 0.15/0.54 % Negative unit clauses : 0
% 0.15/0.54 % Non-unit-clauses : 300
% 0.15/0.54 % Current number of unprocessed clauses: 1278
% 0.15/0.54 % ...number of literals in the above : 2309
% 0.15/0.54 % Current number of archived formulas : 0
% 0.15/0.54 % Current number of archived clauses : 47
% 0.15/0.54 % Clause-clause subsumption calls (NU) : 30400
% 0.15/0.54 % Rec. Clause-clause subsumption calls : 23975
% 0.15/0.54 % Non-unit clause-clause subsumptions : 562
% 0.15/0.54 % Unit Clause-clause subsumption calls : 113
% 0.15/0.54 % Rewrite failures with RHS unbound : 0
% 0.15/0.54 % BW rewrite match attempts : 465
% 0.15/0.54 % BW rewrite match successes : 29
% 0.15/0.54 % Condensation attempts : 0
% 0.15/0.54 % Condensation successes : 0
% 0.15/0.54 % Termbank termtop insertions : 40648
% 0.15/0.54 % Search garbage collected termcells : 61
% 0.15/0.54
% 0.15/0.54 % -------------------------------------------------
% 0.15/0.54 % User time : 0.061 s
% 0.15/0.54 % System time : 0.005 s
% 0.15/0.54 % Total time : 0.066 s
% 0.15/0.54 % Maximum resident set size: 3648 pages
% 0.15/0.54
% 0.15/0.54 % -------------------------------------------------
% 0.15/0.54 % User time : 0.312 s
% 0.15/0.54 % System time : 0.027 s
% 0.15/0.54 % Total time : 0.339 s
% 0.15/0.54 % Maximum resident set size: 4608 pages
% 0.15/0.54 % E exiting
%------------------------------------------------------------------------------