%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG004-1 : 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 : n009.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:27 PM UTC 2026
% Result : Unsatisfiable 0.39s 0.58s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 15
% Syntax : Number of clauses : 81 ( 46 unt; 0 nHn; 55 RR)
% Number of literals : 165 ( 28 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 187 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(addition_is_well_defined,axiom,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',addition_is_well_defined) ).
cnf(associativity_of_addition2,axiom,
( ~ sum(X1,X5,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X3,X4,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',associativity_of_addition2) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',additive_identity2) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',left_inverse) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',closure_of_addition) ).
cnf(commutativity_of_addition,axiom,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
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/sandbox/benchmark/Axioms/RNG001-0.ax',distributivity1) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).
cnf(a_times_b,hypothesis,
product(a,b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',closure_of_multiplication) ).
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/sandbox/benchmark/Axioms/RNG001-0.ax',distributivity4) ).
cnf(right_inverse,axiom,
sum(X1,additive_inverse(X1),additive_identity),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/RNG001-0.ax',distributivity3) ).
cnf(a_inverse_times_b_inverse,hypothesis,
product(additive_inverse(a),additive_inverse(b),d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_inverse_times_b_inverse) ).
cnf(prove_c_equals_d,negated_conjecture,
c != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_equals_d) ).
cnf(c_0_15,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_16,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_17,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_15 ).
cnf(c_0_18,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
cnf(c_0_19,plain,
( ~ sum(X1,X5,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X3,X4,X6) ),
c_0_16 ).
cnf(c_0_20,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_21,plain,
( ~ sum(X2,additive_identity,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_23,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).
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_19,c_0_20]) ).
cnf(c_0_26,plain,
add(X1,additive_identity) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
c_0_23 ).
cnf(c_0_28,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_29,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_30,hypothesis,
product(a,b,c),
a_times_b ).
cnf(c_0_31,plain,
( ~ sum(X3,additive_inverse(X2),X1)
| sum(X1,X2,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_22]),c_0_26]) ).
cnf(c_0_32,plain,
( ~ sum(X2,X3,X1)
| X1 = add(X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_33,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_34,plain,
( ~ sum(additive_identity,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_35,hypothesis,
( ~ sum(X4,X3,b)
| ~ product(a,X4,X1)
| ~ product(a,X3,X2)
| sum(X1,X2,c) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
sum(add(X1,additive_inverse(X2)),X2,X1),
inference(spm,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_37,plain,
add(X1,X2) = add(X2,X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
sum(additive_identity,X1,additive_inverse(additive_inverse(X1))),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_39,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_40,hypothesis,
( ~ sum(X2,b,b)
| ~ product(a,X2,X1)
| sum(X1,c,c) ),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_41,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_42,plain,
( ~ sum(additive_inverse(X2),X2,X1)
| X1 = additive_identity ),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_43,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_36]),c_0_37]) ).
cnf(c_0_44,plain,
additive_inverse(additive_inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_38]),c_0_39]) ).
cnf(c_0_45,hypothesis,
( ~ sum(X1,b,b)
| sum(multiply(a,X1),c,c) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(spm,[status(thm)],[c_0_42,c_0_33]) ).
cnf(c_0_47,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,hypothesis,
sum(multiply(a,additive_identity),c,c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_36]),c_0_46]) ).
cnf(c_0_49,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_47,c_0_37]) ).
cnf(c_0_50,hypothesis,
add(c,multiply(a,additive_identity)) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_48]),c_0_37]) ).
cnf(c_0_51,hypothesis,
multiply(a,additive_identity) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_37]),c_0_46]) ).
cnf(c_0_52,hypothesis,
product(a,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_41,c_0_51]) ).
cnf(c_0_53,hypothesis,
( ~ sum(X4,X3,additive_identity)
| ~ product(a,X4,X1)
| ~ product(a,X3,X2)
| sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_29,c_0_52]) ).
cnf(c_0_54,hypothesis,
( ~ sum(X2,b,additive_identity)
| ~ product(a,X2,X1)
| sum(X1,c,additive_identity) ),
inference(spm,[status(thm)],[c_0_53,c_0_30]) ).
cnf(c_0_55,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_56,hypothesis,
( ~ sum(X1,b,additive_identity)
| sum(multiply(a,X1),c,additive_identity) ),
inference(spm,[status(thm)],[c_0_54,c_0_41]) ).
cnf(c_0_57,plain,
( ~ sum(X3,X5,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| product(X6,X2,X7) ),
c_0_55 ).
cnf(c_0_58,hypothesis,
sum(multiply(a,additive_inverse(b)),c,additive_identity),
inference(spm,[status(thm)],[c_0_56,c_0_20]) ).
cnf(c_0_59,axiom,
sum(X1,additive_inverse(X1),additive_identity),
right_inverse ).
cnf(c_0_60,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_61,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_57,c_0_41]) ).
cnf(c_0_62,hypothesis,
product(additive_inverse(a),additive_inverse(b),d),
a_inverse_times_b_inverse ).
cnf(c_0_63,plain,
add(X1,additive_inverse(add(X2,X1))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_37]) ).
cnf(c_0_64,hypothesis,
add(c,multiply(a,additive_inverse(b))) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_58]),c_0_37]) ).
cnf(c_0_65,plain,
additive_inverse(additive_identity) = additive_identity,
inference(spm,[status(thm)],[c_0_34,c_0_59]) ).
cnf(c_0_66,plain,
( ~ product(X6,X2,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
c_0_60 ).
cnf(c_0_67,hypothesis,
( ~ sum(additive_inverse(a),X3,X1)
| ~ sum(d,multiply(X3,additive_inverse(b)),X2)
| product(X1,additive_inverse(b),X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,hypothesis,
multiply(a,additive_inverse(b)) = additive_inverse(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_26]) ).
cnf(c_0_69,hypothesis,
( ~ sum(X4,X3,additive_inverse(a))
| ~ product(X4,additive_inverse(b),X1)
| ~ product(X3,additive_inverse(b),X2)
| sum(X1,X2,d) ),
inference(spm,[status(thm)],[c_0_66,c_0_62]) ).
cnf(c_0_70,hypothesis,
( ~ sum(d,additive_inverse(c),X1)
| product(additive_identity,additive_inverse(b),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_59]),c_0_44]),c_0_68]) ).
cnf(c_0_71,hypothesis,
( ~ sum(X2,additive_inverse(a),additive_inverse(a))
| ~ product(X2,additive_inverse(b),X1)
| sum(X1,d,d) ),
inference(spm,[status(thm)],[c_0_69,c_0_62]) ).
cnf(c_0_72,hypothesis,
product(additive_identity,additive_inverse(b),add(d,additive_inverse(c))),
inference(spm,[status(thm)],[c_0_70,c_0_22]) ).
cnf(c_0_73,hypothesis,
sum(add(d,additive_inverse(c)),d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_28])]) ).
cnf(c_0_74,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_47]),c_0_37]) ).
cnf(c_0_75,hypothesis,
add(d,add(d,additive_inverse(c))) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_73]),c_0_37]) ).
cnf(c_0_76,plain,
additive_inverse(add(X1,additive_inverse(X2))) = add(X2,additive_inverse(X1)),
inference(spm,[status(thm)],[c_0_74,c_0_43]) ).
cnf(c_0_77,negated_conjecture,
c != d,
inference(fof_simplification,[status(thm)],[prove_c_equals_d]) ).
cnf(c_0_78,hypothesis,
add(c,additive_inverse(d)) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_46]),c_0_76]) ).
cnf(c_0_79,negated_conjecture,
c != d,
c_0_77 ).
cnf(c_0_80,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_78]),c_0_44]),c_0_26]),c_0_79]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n009.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 04:10:12 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.39/0.57 % Version: 3.5.1
% 0.39/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.39/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.39/0.57 % Starting sh5l with 300s (1) cores
% 0.39/0.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 813695 completed with status 0
% 0.39/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.39/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/0.57 % No SInE strategy applied
% 0.39/0.57 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.39/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.39/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.39/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.39/0.58 % Starting new_bool_3 with 136s (1) cores
% 0.39/0.58 % Starting new_bool_1 with 136s (1) cores
% 0.39/0.58 % new_bool_3 with pid 813703 completed with status 0
% 0.39/0.58 % Result found by new_bool_3
% 0.39/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/0.58 % No SInE strategy applied
% 0.39/0.58 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.39/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.39/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.39/0.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.39/0.58 % Starting new_bool_3 with 136s (1) cores
% 0.39/0.58 % Preprocessing time : 0.001 s
% 0.39/0.58 % Presaturation interreduction done
% 0.39/0.58
% 0.39/0.58 % Proof found!
% 0.39/0.58 % SZS status Unsatisfiable
% 0.39/0.58 % SZS output start CNFRefutation
% See solution above
% 0.39/0.58 % Parsed axioms : 20
% 0.39/0.58 % Removed by relevancy pruning/SinE : 0
% 0.39/0.58 % Initial clauses : 20
% 0.39/0.58 % Removed in clause preprocessing : 0
% 0.39/0.58 % Initial clauses in saturation : 20
% 0.39/0.58 % Processed clauses : 1687
% 0.39/0.58 % ...of these trivial : 141
% 0.39/0.58 % ...subsumed : 961
% 0.39/0.58 % ...remaining for further processing : 585
% 0.39/0.58 % Other redundant clauses eliminated : 0
% 0.39/0.58 % Clauses deleted for lack of memory : 0
% 0.39/0.58 % Backward-subsumed : 2
% 0.39/0.58 % Backward-rewritten : 26
% 0.39/0.58 % Generated clauses : 7548
% 0.39/0.58 % ...of the previous two non-redundant : 4771
% 0.39/0.58 % ...aggressively subsumed : 0
% 0.39/0.58 % Contextual simplify-reflections : 0
% 0.39/0.58 % Paramodulations : 7548
% 0.39/0.58 % Factorizations : 0
% 0.39/0.58 % NegExts : 0
% 0.39/0.58 % Equation resolutions : 0
% 0.39/0.58 % Disequality decompositions : 0
% 0.39/0.58 % Total rewrite steps : 7120
% 0.39/0.58 % ...of those cached : 6769
% 0.39/0.58 % Propositional unsat checks : 0
% 0.39/0.58 % Propositional check models : 0
% 0.39/0.58 % Propositional check unsatisfiable : 0
% 0.39/0.58 % Propositional clauses : 0
% 0.39/0.58 % Propositional clauses after purity: 0
% 0.39/0.58 % Propositional unsat core size : 0
% 0.39/0.58 % Propositional preprocessing time : 0.000
% 0.39/0.58 % Propositional encoding time : 0.000
% 0.39/0.58 % Propositional solver time : 0.000
% 0.39/0.58 % Success case prop preproc time : 0.000
% 0.39/0.58 % Success case prop encoding time : 0.000
% 0.39/0.58 % Success case prop solver time : 0.000
% 0.39/0.58 % Current number of processed clauses : 537
% 0.39/0.58 % Positive orientable unit clauses : 84
% 0.39/0.58 % Positive unorientable unit clauses: 1
% 0.39/0.58 % Negative unit clauses : 1
% 0.39/0.58 % Non-unit-clauses : 451
% 0.39/0.58 % Current number of unprocessed clauses: 2932
% 0.39/0.58 % ...number of literals in the above : 5793
% 0.39/0.58 % Current number of archived formulas : 0
% 0.39/0.58 % Current number of archived clauses : 48
% 0.39/0.58 % Clause-clause subsumption calls (NU) : 72405
% 0.39/0.58 % Rec. Clause-clause subsumption calls : 55499
% 0.39/0.58 % Non-unit clause-clause subsumptions : 923
% 0.39/0.58 % Unit Clause-clause subsumption calls : 1
% 0.39/0.58 % Rewrite failures with RHS unbound : 0
% 0.39/0.58 % BW rewrite match attempts : 182
% 0.39/0.58 % BW rewrite match successes : 31
% 0.39/0.58 % Condensation attempts : 0
% 0.39/0.58 % Condensation successes : 0
% 0.39/0.58 % Termbank termtop insertions : 78484
% 0.39/0.58 % Search garbage collected termcells : 61
% 0.39/0.58
% 0.39/0.58 % -------------------------------------------------
% 0.39/0.58 % User time : 0.121 s
% 0.39/0.58 % System time : 0.009 s
% 0.39/0.58 % Total time : 0.130 s
% 0.39/0.58 % Maximum resident set size: 3648 pages
% 0.39/0.58
% 0.39/0.58 % -------------------------------------------------
% 0.39/0.58 % User time : 0.624 s
% 0.39/0.58 % System time : 0.034 s
% 0.39/0.58 % Total time : 0.658 s
% 0.39/0.58 % Maximum resident set size: 4864 pages
% 0.39/0.58 % E exiting
%------------------------------------------------------------------------------