%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO031-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:07:02 PM UTC 2026
% Result : Unsatisfiable 6.87s 1.52s
% Output : CNFRefutation 6.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of clauses : 79 ( 79 unt; 0 nHn; 7 RR)
% Number of literals : 79 ( 78 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 159 ( 41 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(property3,axiom,
multiply(add(X1,inverse(X1)),X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property3) ).
cnf(additive_inverse,axiom,
add(X1,inverse(X1)) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse) ).
cnf(multiplicative_inverse,axiom,
multiply(X1,inverse(X1)) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_inverse) ).
cnf(l4,axiom,
multiply(multiply(add(X1,X2),add(X2,X3)),X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4) ).
cnf(associativity_of_multiply,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_multiply) ).
cnf(property3_dual,axiom,
add(multiply(X1,inverse(X1)),X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property3_dual) ).
cnf(l3,axiom,
add(add(multiply(X1,X2),multiply(X2,X3)),X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_add) ).
cnf(l1,axiom,
add(X1,multiply(X2,multiply(X1,X3))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1) ).
cnf(l2,axiom,
multiply(X1,add(X2,add(X1,X3))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2) ).
cnf(distributivity,axiom,
add(multiply(X1,X2),add(multiply(X2,X3),multiply(X3,X1))) = multiply(add(X1,X2),multiply(add(X2,X3),add(X3,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distributivity) ).
cnf(prove_multiply_add_property,negated_conjecture,
multiply(a,add(b,c)) != add(multiply(b,a),multiply(c,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_multiply_add_property) ).
cnf(c_0_12,axiom,
multiply(add(X1,inverse(X1)),X2) = X2,
property3 ).
cnf(c_0_13,axiom,
add(X1,inverse(X1)) = n1,
additive_inverse ).
cnf(c_0_14,axiom,
multiply(X1,inverse(X1)) = n0,
multiplicative_inverse ).
cnf(c_0_15,plain,
multiply(n1,X1) = X1,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
multiply(multiply(add(X1,X2),add(X2,X3)),X2) = X2,
l4 ).
cnf(c_0_17,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity_of_multiply ).
cnf(c_0_18,plain,
inverse(n1) = n0,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
add(multiply(X1,inverse(X1)),X2) = X2,
property3_dual ).
cnf(c_0_20,plain,
multiply(add(X1,X2),multiply(add(X2,X3),X2)) = X2,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
add(n1,n0) = n1,
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_22,plain,
add(n0,X1) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_23,axiom,
add(add(multiply(X1,X2),multiply(X2,X3)),X2) = X2,
l3 ).
cnf(c_0_24,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_25,axiom,
add(X1,multiply(X2,multiply(X1,X3))) = X1,
l1 ).
cnf(c_0_26,plain,
multiply(X1,n0) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_15]) ).
cnf(c_0_27,plain,
add(multiply(X1,X2),add(multiply(X2,X3),X2)) = X2,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
add(X1,n0) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_26]) ).
cnf(c_0_29,axiom,
multiply(X1,add(X2,add(X1,X3))) = X1,
l2 ).
cnf(c_0_30,plain,
multiply(n0,X1) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]),c_0_22]) ).
cnf(c_0_31,plain,
add(X1,multiply(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_32,axiom,
add(multiply(X1,X2),add(multiply(X2,X3),multiply(X3,X1))) = multiply(add(X1,X2),multiply(add(X2,X3),add(X3,X1))),
distributivity ).
cnf(c_0_33,plain,
multiply(X1,add(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_34,plain,
add(multiply(X1,X2),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_14]),c_0_22]) ).
cnf(c_0_35,plain,
multiply(X1,add(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_36,plain,
add(X1,add(X2,X1)) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_24]) ).
cnf(c_0_37,plain,
add(multiply(X1,X2),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_30]),c_0_22]) ).
cnf(c_0_38,plain,
add(X1,multiply(X2,multiply(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_39,plain,
add(multiply(inverse(X1),X2),multiply(X2,X1)) = multiply(add(inverse(X1),X2),add(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_14]),c_0_22]),c_0_13]),c_0_15]) ).
cnf(c_0_40,plain,
multiply(X1,n1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_13]) ).
cnf(c_0_41,plain,
add(X1,X2) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_42,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_37]),c_0_34]),c_0_31]),c_0_37]),c_0_33]) ).
cnf(c_0_43,plain,
multiply(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_44,plain,
add(X1,multiply(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_45,plain,
add(X1,add(X2,multiply(X3,X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_33]),c_0_24]) ).
cnf(c_0_46,plain,
add(X1,inverse(inverse(X1))) = multiply(X1,inverse(inverse(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_14]),c_0_28]),c_0_13]),c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_47,plain,
multiply(X1,multiply(X1,X2)) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_43]) ).
cnf(c_0_48,plain,
add(X1,add(multiply(X2,X1),X3)) = add(X1,X3),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_49,plain,
multiply(X1,multiply(add(X1,X2),X3)) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_50,plain,
multiply(X1,multiply(X2,X1)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_44]),c_0_17]) ).
cnf(c_0_51,plain,
add(X1,multiply(add(X2,X1),X3)) = multiply(add(X1,X2),multiply(add(X2,add(X1,X3)),add(X3,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_35]),c_0_24]),c_0_45]),c_0_36]) ).
cnf(c_0_52,plain,
multiply(add(X1,X2),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_15]) ).
cnf(c_0_53,plain,
multiply(X1,inverse(inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_46]),c_0_47]) ).
cnf(c_0_54,plain,
multiply(X1,add(X2,add(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_24]) ).
cnf(c_0_55,plain,
multiply(add(X1,X2),add(multiply(X3,X1),X2)) = add(multiply(X3,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_48]),c_0_42]) ).
cnf(c_0_56,plain,
multiply(X1,multiply(X2,add(X1,X3))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_49]) ).
cnf(c_0_57,plain,
add(n1,X1) = n1,
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_58,plain,
add(X1,multiply(add(X2,X1),X3)) = multiply(add(X1,X2),add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_41]),c_0_52]) ).
cnf(c_0_59,plain,
add(multiply(X1,X2),multiply(inverse(X1),X2)) = multiply(add(inverse(X1),X2),add(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_42]),c_0_41]) ).
cnf(c_0_60,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_53]),c_0_41]),c_0_46]),c_0_53]) ).
cnf(c_0_61,plain,
multiply(X1,multiply(X2,add(X3,X1))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_44]),c_0_17]) ).
cnf(c_0_62,plain,
multiply(add(inverse(X1),X2),add(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_39]),c_0_44]),c_0_56]),c_0_35]) ).
cnf(c_0_63,plain,
add(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_15]) ).
cnf(c_0_64,plain,
add(X1,add(inverse(X1),X2)) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_13]),c_0_57]) ).
cnf(c_0_65,negated_conjecture,
multiply(a,add(b,c)) != add(multiply(b,a),multiply(c,a)),
inference(fof_simplification,[status(thm)],[prove_multiply_add_property]) ).
cnf(c_0_66,plain,
add(multiply(X1,X2),multiply(X2,X3)) = multiply(X2,add(multiply(X1,X2),X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_31]),c_0_41]),c_0_31]) ).
cnf(c_0_67,plain,
add(multiply(X1,X2),multiply(inverse(X1),X2)) = multiply(add(X1,X2),add(X2,inverse(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_41]) ).
cnf(c_0_68,plain,
multiply(X1,add(inverse(X1),X2)) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_69,plain,
add(X1,add(X1,X2)) = add(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_63]) ).
cnf(c_0_70,plain,
add(X1,add(X2,inverse(X1))) = n1,
inference(spm,[status(thm)],[c_0_64,c_0_41]) ).
cnf(c_0_71,negated_conjecture,
multiply(a,add(b,c)) != add(multiply(b,a),multiply(c,a)),
c_0_65 ).
cnf(c_0_72,plain,
add(multiply(X1,X2),multiply(X3,X2)) = multiply(X2,add(multiply(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_66,c_0_42]) ).
cnf(c_0_73,plain,
add(X1,multiply(inverse(X1),X2)) = add(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_60]),c_0_33]),c_0_60]),c_0_69]),c_0_60]),c_0_24]),c_0_70]),c_0_40]) ).
cnf(c_0_74,plain,
multiply(X1,multiply(add(inverse(X1),X2),X3)) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_68]),c_0_17]) ).
cnf(c_0_75,plain,
add(X1,multiply(add(X1,X2),X3)) = multiply(add(X1,X2),add(X1,X3)),
inference(spm,[status(thm)],[c_0_58,c_0_41]) ).
cnf(c_0_76,negated_conjecture,
multiply(a,add(c,multiply(b,a))) != multiply(a,add(b,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72]),c_0_41]) ).
cnf(c_0_77,plain,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_73]),c_0_60]),c_0_75]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_41]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : BOO031-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n001.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 13:54:45 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.50 Running first-order theorem proving
% 0.16/0.50 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
% 6.87/1.52 % Version: 3.5.1
% 6.87/1.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.87/1.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.87/1.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.87/1.52 % Starting new_bool_3 with 300s (1) cores
% 6.87/1.52 % Starting new_bool_1 with 300s (1) cores
% 6.87/1.52 % Starting sh5l with 300s (1) cores
% 6.87/1.52 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3292462 completed with status 0
% 6.87/1.52 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.87/1.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.87/1.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.87/1.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.87/1.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.87/1.52 % No SInE strategy applied
% 6.87/1.52 % Search class: FUUPM-FFSF21-MFFFFFNN
% 6.87/1.52 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 6.87/1.52 % Starting SubtermCWHack with 136s (1) cores
% 6.87/1.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.87/1.52 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 6.87/1.52 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 6.87/1.52 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 6.87/1.52 % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 3292470 completed with status 0
% 6.87/1.52 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 6.87/1.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.87/1.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.87/1.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.87/1.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.87/1.52 % No SInE strategy applied
% 6.87/1.52 % Search class: FUUPM-FFSF21-MFFFFFNN
% 6.87/1.52 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 6.87/1.52 % Starting SubtermCWHack with 136s (1) cores
% 6.87/1.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.87/1.52 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 6.87/1.52 % Preprocessing time : 0.002 s
% 6.87/1.52
% 6.87/1.52 % Proof found!
% 6.87/1.52 % SZS status Unsatisfiable
% 6.87/1.52 % SZS output start CNFRefutation
% See solution above
% 6.87/1.52 % Parsed axioms : 12
% 6.87/1.52 % Removed by relevancy pruning/SinE : 0
% 6.87/1.52 % Initial clauses : 12
% 6.87/1.52 % Removed in clause preprocessing : 0
% 6.87/1.52 % Initial clauses in saturation : 12
% 6.87/1.52 % Processed clauses : 1795
% 6.87/1.52 % ...of these trivial : 641
% 6.87/1.52 % ...subsumed : 898
% 6.87/1.52 % ...remaining for further processing : 256
% 6.87/1.52 % Other redundant clauses eliminated : 0
% 6.87/1.52 % Clauses deleted for lack of memory : 0
% 6.87/1.52 % Backward-subsumed : 0
% 6.87/1.52 % Backward-rewritten : 142
% 6.87/1.52 % Generated clauses : 43597
% 6.87/1.52 % ...of the previous two non-redundant : 26440
% 6.87/1.52 % ...aggressively subsumed : 0
% 6.87/1.52 % Contextual simplify-reflections : 0
% 6.87/1.52 % Paramodulations : 43597
% 6.87/1.52 % Factorizations : 0
% 6.87/1.52 % NegExts : 0
% 6.87/1.52 % Equation resolutions : 0
% 6.87/1.52 % Disequality decompositions : 0
% 6.87/1.52 % Total rewrite steps : 92630
% 6.87/1.52 % ...of those cached : 74538
% 6.87/1.52 % Propositional unsat checks : 0
% 6.87/1.52 % Propositional check models : 0
% 6.87/1.52 % Propositional check unsatisfiable : 0
% 6.87/1.52 % Propositional clauses : 0
% 6.87/1.52 % Propositional clauses after purity: 0
% 6.87/1.52 % Propositional unsat core size : 0
% 6.87/1.52 % Propositional preprocessing time : 0.000
% 6.87/1.52 % Propositional encoding time : 0.000
% 6.87/1.52 % Propositional solver time : 0.000
% 6.87/1.52 % Success case prop preproc time : 0.000
% 6.87/1.52 % Success case prop encoding time : 0.000
% 6.87/1.52 % Success case prop solver time : 0.000
% 6.87/1.52 % Current number of processed clauses : 114
% 6.87/1.52 % Positive orientable unit clauses : 106
% 6.87/1.52 % Positive unorientable unit clauses: 8
% 6.87/1.52 % Negative unit clauses : 0
% 6.87/1.52 % Non-unit-clauses : 0
% 6.87/1.52 % Current number of unprocessed clauses: 24246
% 6.87/1.52 % ...number of literals in the above : 24246
% 6.87/1.52 % Current number of archived formulas : 0
% 6.87/1.52 % Current number of archived clauses : 142
% 6.87/1.52 % Clause-clause subsumption calls (NU) : 0
% 6.87/1.52 % Rec. Clause-clause subsumption calls : 0
% 6.87/1.52 % Non-unit clause-clause subsumptions : 0
% 6.87/1.52 % Unit Clause-clause subsumption calls : 145
% 6.87/1.52 % Rewrite failures with RHS unbound : 0
% 6.87/1.52 % BW rewrite match attempts : 1530
% 6.87/1.52 % BW rewrite match successes : 747
% 6.87/1.52 % Condensation attempts : 0
% 6.87/1.52 % Condensation successes : 0
% 6.87/1.52 % Termbank termtop insertions : 551855
% 6.87/1.52 % Search garbage collected termcells : 2
% 6.87/1.52
% 6.87/1.52 % -------------------------------------------------
% 6.87/1.52 % User time : 0.912 s
% 6.87/1.52 % System time : 0.042 s
% 6.87/1.52 % Total time : 0.954 s
% 6.87/1.52 % Maximum resident set size: 3380 pages
% 6.87/1.52
% 6.87/1.52 % -------------------------------------------------
% 6.87/1.52 % User time : 4.473 s
% 6.87/1.52 % System time : 0.216 s
% 6.87/1.52 % Total time : 4.689 s
% 6.87/1.52 % Maximum resident set size: 4608 pages
% 6.87/1.52 % E exiting
%------------------------------------------------------------------------------