%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG001-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 : n010.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:26 PM UTC 2026
% Result : Unsatisfiable 1.06s 0.60s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of clauses : 75 ( 35 unt; 0 nHn; 43 RR)
% Number of literals : 159 ( 30 equ; 87 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 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 : 227 ( 9 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(distributivity4,axiom,
( ~ sum(X3,X5,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| product(X6,X2,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',distributivity4) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',closure_of_multiplication) ).
cnf(multiplication_is_well_defined,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',multiplication_is_well_defined) ).
cnf(associativity_of_multiplication2,axiom,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_multiplication2) ).
cnf(distributivity2,axiom,
( ~ sum(X3,X5,X7)
| ~ sum(X2,X4,X6)
| ~ product(X1,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X6,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',distributivity2) ).
cnf(prove_a_times_0_is_0,negated_conjecture,
~ product(a,additive_identity,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_times_0_is_0) ).
cnf(c_0_12,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_13,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).
cnf(c_0_14,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_15,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_12 ).
cnf(c_0_16,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_17,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
c_0_13 ).
cnf(c_0_18,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_19,plain,
( ~ sum(X1,X5,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X3,X4,X6) ),
c_0_14 ).
cnf(c_0_20,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_21,plain,
( ~ sum(additive_identity,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ sum(X4,additive_identity,X3)
| ~ sum(X4,additive_inverse(X2),X1)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
add(X1,additive_identity) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ sum(X3,additive_inverse(X2),X1)
| sum(X1,X2,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_24]) ).
cnf(c_0_26,plain,
( ~ sum(X3,X5,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| product(X6,X2,X7) ),
inference(fof_simplification,[status(thm)],[distributivity4]) ).
cnf(c_0_27,plain,
sum(add(X1,additive_inverse(X2)),X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_28,plain,
( ~ sum(X2,X3,X1)
| X1 = add(X2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_29,plain,
sum(additive_identity,X1,additive_inverse(additive_inverse(X1))),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_30,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_31,plain,
( ~ sum(X3,X5,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| product(X6,X2,X7) ),
c_0_26 ).
cnf(c_0_32,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_33,plain,
( ~ sum(add(X2,additive_inverse(X3)),X3,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
cnf(c_0_34,plain,
additive_inverse(additive_inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_35,plain,
( ~ sum(X4,X6,X1)
| ~ sum(X5,multiply(X6,X2),X3)
| ~ product(X4,X2,X5)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( ~ sum(add(X2,X3),additive_inverse(X3),X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
add(X1,X2) = add(X2,X1),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_38,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[multiplication_is_well_defined]) ).
cnf(c_0_39,plain,
( ~ sum(X4,X5,X1)
| ~ sum(multiply(X4,X2),multiply(X5,X2),X3)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_40,plain,
( ~ sum(add(X3,X2),additive_inverse(X3),X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
c_0_38 ).
cnf(c_0_42,plain,
( ~ sum(multiply(additive_identity,X2),multiply(X1,X2),X3)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_16]) ).
cnf(c_0_43,plain,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_multiplication2]) ).
cnf(c_0_44,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_18]),c_0_37]) ).
cnf(c_0_45,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_18]),c_0_37]) ).
cnf(c_0_46,plain,
( ~ product(X2,X3,X1)
| X1 = multiply(X2,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_32]) ).
cnf(c_0_47,plain,
product(X1,X2,add(multiply(additive_identity,X2),multiply(X1,X2))),
inference(spm,[status(thm)],[c_0_42,c_0_18]) ).
cnf(c_0_48,plain,
( ~ sum(additive_inverse(X2),X2,X1)
| X1 = additive_identity ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_49,plain,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
c_0_43 ).
cnf(c_0_50,plain,
add(X1,additive_inverse(add(X2,X1))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_37]) ).
cnf(c_0_51,plain,
add(multiply(additive_identity,X1),multiply(X2,X1)) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(spm,[status(thm)],[c_0_48,c_0_22]) ).
cnf(c_0_53,plain,
( ~ sum(X3,X5,X7)
| ~ sum(X2,X4,X6)
| ~ product(X1,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X6,X7) ),
inference(fof_simplification,[status(thm)],[distributivity2]) ).
cnf(c_0_54,plain,
( ~ product(X4,X5,X1)
| ~ product(X4,multiply(X5,X2),X3)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_32]) ).
cnf(c_0_55,plain,
additive_inverse(multiply(additive_identity,X1)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_56,plain,
( ~ sum(X3,X5,X7)
| ~ sum(X2,X4,X6)
| ~ product(X1,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X6,X7) ),
c_0_53 ).
cnf(c_0_57,plain,
( ~ product(X1,multiply(X2,X3),X4)
| product(multiply(X1,X2),X3,X4) ),
inference(spm,[status(thm)],[c_0_54,c_0_32]) ).
cnf(c_0_58,plain,
multiply(additive_identity,X1) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_55]),c_0_24]) ).
cnf(c_0_59,plain,
( ~ sum(X4,X6,X2)
| ~ sum(X5,multiply(X1,X6),X3)
| ~ product(X1,X4,X5)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_56,c_0_32]) ).
cnf(c_0_60,plain,
( ~ product(X1,additive_identity,X3)
| product(multiply(X1,additive_identity),X2,X3) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
( ~ sum(X4,X5,X2)
| ~ sum(multiply(X1,X4),multiply(X1,X5),X3)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_59,c_0_32]) ).
cnf(c_0_62,plain,
product(multiply(X1,additive_identity),X2,multiply(X1,additive_identity)),
inference(spm,[status(thm)],[c_0_60,c_0_32]) ).
cnf(c_0_63,plain,
( ~ sum(multiply(X1,additive_identity),multiply(X1,X2),X3)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_61,c_0_16]) ).
cnf(c_0_64,plain,
( ~ product(multiply(X2,additive_identity),X3,X1)
| X1 = multiply(X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_41,c_0_62]) ).
cnf(c_0_65,plain,
product(X1,X2,add(multiply(X1,additive_identity),multiply(X1,X2))),
inference(spm,[status(thm)],[c_0_63,c_0_18]) ).
cnf(c_0_66,plain,
multiply(multiply(X1,additive_identity),X2) = multiply(X1,additive_identity),
inference(spm,[status(thm)],[c_0_46,c_0_62]) ).
cnf(c_0_67,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_44]),c_0_37]) ).
cnf(c_0_68,plain,
add(multiply(X1,additive_identity),multiply(X1,additive_identity)) = multiply(X1,additive_identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_66]) ).
cnf(c_0_69,plain,
additive_inverse(multiply(X1,additive_identity)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_52]) ).
cnf(c_0_70,negated_conjecture,
~ product(a,additive_identity,additive_identity),
inference(fof_simplification,[status(thm)],[prove_a_times_0_is_0]) ).
cnf(c_0_71,plain,
multiply(X1,additive_identity) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_69]),c_0_24]) ).
cnf(c_0_72,negated_conjecture,
~ product(a,additive_identity,additive_identity),
c_0_70 ).
cnf(c_0_73,plain,
product(X1,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_32,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG001-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.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 04:09:45 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 1.06/0.60 % Version: 3.5.1
% 1.06/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.06/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.06/0.60 % Starting new_bool_3 with 300s (1) cores
% 1.06/0.60 % Starting new_bool_1 with 300s (1) cores
% 1.06/0.60 % Starting sh5l with 300s (1) cores
% 1.06/0.60 % new_bool_3 with pid 4191058 completed with status 9
% 1.06/0.60 % new_bool_1 with pid 4191059 completed with status 9
% 1.06/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4191057 completed with status 0
% 1.06/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.06/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.06/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.06/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.06/0.60 % No SInE strategy applied
% 1.06/0.60 % Search class: FHUSM-FFMF21-SFFFFFNN
% 1.06/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.60 % Starting SubtermCWHack with 136s (1) cores
% 1.06/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.06/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 1.06/0.60 % Starting new_bool_3 with 136s (1) cores
% 1.06/0.60 % Starting new_bool_1 with 136s (1) cores
% 1.06/0.60 % G-E--_208_C18_F1_SE_CS_SP_PS_S4d with pid 4191065 completed with status 0
% 1.06/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4d
% 1.06/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.06/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.06/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.06/0.60 % No SInE strategy applied
% 1.06/0.60 % Search class: FHUSM-FFMF21-SFFFFFNN
% 1.06/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.60 % Starting SubtermCWHack with 136s (1) cores
% 1.06/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.06/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 1.06/0.60 % Preprocessing time : 0.001 s
% 1.06/0.60 % Presaturation interreduction done
% 1.06/0.60
% 1.06/0.60 % Proof found!
% 1.06/0.60 % SZS status Unsatisfiable
% 1.06/0.60 % SZS output start CNFRefutation
% See solution above
% 1.06/0.60 % Parsed axioms : 18
% 1.06/0.60 % Removed by relevancy pruning/SinE : 0
% 1.06/0.60 % Initial clauses : 18
% 1.06/0.60 % Removed in clause preprocessing : 0
% 1.06/0.60 % Initial clauses in saturation : 18
% 1.06/0.60 % Processed clauses : 2585
% 1.06/0.60 % ...of these trivial : 247
% 1.06/0.60 % ...subsumed : 1796
% 1.06/0.60 % ...remaining for further processing : 542
% 1.06/0.60 % Other redundant clauses eliminated : 0
% 1.06/0.60 % Clauses deleted for lack of memory : 0
% 1.06/0.60 % Backward-subsumed : 13
% 1.06/0.60 % Backward-rewritten : 39
% 1.06/0.60 % Generated clauses : 12174
% 1.06/0.60 % ...of the previous two non-redundant : 7936
% 1.06/0.60 % ...aggressively subsumed : 0
% 1.06/0.60 % Contextual simplify-reflections : 0
% 1.06/0.60 % Paramodulations : 12174
% 1.06/0.60 % Factorizations : 0
% 1.06/0.60 % NegExts : 0
% 1.06/0.60 % Equation resolutions : 0
% 1.06/0.60 % Disequality decompositions : 0
% 1.06/0.60 % Total rewrite steps : 13120
% 1.06/0.60 % ...of those cached : 12133
% 1.06/0.60 % Propositional unsat checks : 0
% 1.06/0.60 % Propositional check models : 0
% 1.06/0.60 % Propositional check unsatisfiable : 0
% 1.06/0.60 % Propositional clauses : 0
% 1.06/0.60 % Propositional clauses after purity: 0
% 1.06/0.60 % Propositional unsat core size : 0
% 1.06/0.60 % Propositional preprocessing time : 0.000
% 1.06/0.60 % Propositional encoding time : 0.000
% 1.06/0.60 % Propositional solver time : 0.000
% 1.06/0.60 % Success case prop preproc time : 0.000
% 1.06/0.60 % Success case prop encoding time : 0.000
% 1.06/0.60 % Success case prop solver time : 0.000
% 1.06/0.60 % Current number of processed clauses : 472
% 1.06/0.60 % Positive orientable unit clauses : 53
% 1.06/0.60 % Positive unorientable unit clauses: 1
% 1.06/0.60 % Negative unit clauses : 0
% 1.06/0.60 % Non-unit-clauses : 418
% 1.06/0.60 % Current number of unprocessed clauses: 5175
% 1.06/0.60 % ...number of literals in the above : 8201
% 1.06/0.60 % Current number of archived formulas : 0
% 1.06/0.60 % Current number of archived clauses : 70
% 1.06/0.60 % Clause-clause subsumption calls (NU) : 127263
% 1.06/0.60 % Rec. Clause-clause subsumption calls : 80187
% 1.06/0.60 % Non-unit clause-clause subsumptions : 1765
% 1.06/0.60 % Unit Clause-clause subsumption calls : 12
% 1.06/0.60 % Rewrite failures with RHS unbound : 0
% 1.06/0.60 % BW rewrite match attempts : 840
% 1.06/0.60 % BW rewrite match successes : 36
% 1.06/0.60 % Condensation attempts : 0
% 1.06/0.60 % Condensation successes : 0
% 1.06/0.60 % Termbank termtop insertions : 119632
% 1.06/0.60 % Search garbage collected termcells : 61
% 1.06/0.60
% 1.06/0.60 % -------------------------------------------------
% 1.06/0.60 % User time : 0.168 s
% 1.06/0.60 % System time : 0.015 s
% 1.06/0.60 % Total time : 0.182 s
% 1.06/0.60 % Maximum resident set size: 3392 pages
% 1.06/0.60
% 1.06/0.60 % -------------------------------------------------
% 1.06/0.60 % User time : 0.909 s
% 1.06/0.60 % System time : 0.072 s
% 1.06/0.60 % Total time : 0.982 s
% 1.06/0.60 % Maximum resident set size: 4608 pages
% 1.06/0.60 % E exiting
%------------------------------------------------------------------------------