%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP667-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:44:41 PM UTC 2026
% Result : Unsatisfiable 71.99s 26.17s
% Output : CNFRefutation 71.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of clauses : 71 ( 71 unt; 0 nHn; 5 RR)
% Number of literals : 71 ( 70 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 : 9 ( 9 usr; 4 con; 0-4 aty)
% Number of variables : 138 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f08,axiom,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(f05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(f07,axiom,
mult(mult(X1,X2),mult(mult(X3,X2),X3)) = mult(mult(X1,mult(mult(X2,X3),X2)),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
cnf(f12,axiom,
ifeq(mult(mult(X1,X2),mult(X3,X1)),mult(X1,mult(mult(X2,X3),X1)),mult(X1,mult(X2,mult(X1,X3))),mult(mult(mult(X1,X2),X1),X3)) = mult(mult(mult(X1,X2),X1),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f12) ).
cnf(f10,axiom,
ifeq(mult(X1,mult(X2,mult(X3,X2))),mult(mult(mult(X1,X2),X3),X2),mult(X2,mult(X1,mult(X2,X3))),mult(mult(mult(X2,X1),X2),X3)) = mult(mult(mult(X2,X1),X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f10) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(f09,axiom,
mult(f(X1),f(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_13,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_14,axiom,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
f08 ).
cnf(c_0_15,plain,
ld(mult(X1,X2),mult(X1,mult(X2,X1))) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_17,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_18,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_19,plain,
ld(mult(X1,rd(X2,X1)),mult(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
mult(X1,unit) = X1,
f05 ).
cnf(c_0_21,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_22,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
ld(mult(X1,rd(unit,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
rd(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_25,axiom,
mult(mult(X1,X2),mult(mult(X3,X2),X3)) = mult(mult(X1,mult(mult(X2,X3),X2)),X3),
f07 ).
cnf(c_0_26,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
mult(mult(X1,mult(X2,mult(X3,X2))),X3) = mult(mult(X1,X2),mult(X3,mult(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_14]),c_0_14]) ).
cnf(c_0_28,plain,
rd(unit,X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_29,plain,
rd(mult(X1,mult(X2,X1)),X1) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_30,axiom,
ifeq(mult(mult(X1,X2),mult(X3,X1)),mult(X1,mult(mult(X2,X3),X1)),mult(X1,mult(X2,mult(X1,X3))),mult(mult(mult(X1,X2),X1),X3)) = mult(mult(mult(X1,X2),X1),X3),
f12 ).
cnf(c_0_31,plain,
rd(mult(mult(X1,X2),mult(X3,mult(X2,X3))),X3) = mult(X1,mult(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_32,plain,
mult(ld(X1,unit),X1) = unit,
inference(spm,[status(thm)],[c_0_16,c_0_28]) ).
cnf(c_0_33,plain,
rd(mult(X1,X2),X1) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_34,axiom,
ifeq(mult(X1,mult(X2,mult(X3,X2))),mult(mult(mult(X1,X2),X3),X2),mult(X2,mult(X1,mult(X2,X3))),mult(mult(mult(X2,X1),X2),X3)) = mult(mult(mult(X2,X1),X2),X3),
f10 ).
cnf(c_0_35,plain,
mult(mult(X1,mult(X2,X1)),X2) = mult(X1,mult(X2,mult(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_21]) ).
cnf(c_0_36,plain,
ifeq(mult(mult(X1,X2),mult(X3,X1)),mult(X1,mult(mult(X2,X3),X1)),mult(X1,mult(X2,mult(X1,X3))),mult(mult(X1,mult(X2,X1)),X3)) = mult(mult(X1,mult(X2,X1)),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_14]),c_0_14]) ).
cnf(c_0_37,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_38,plain,
mult(ld(X1,unit),mult(X1,mult(X2,X1))) = mult(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_21]),c_0_33]),c_0_17]) ).
cnf(c_0_39,plain,
ifeq(mult(X1,mult(X2,mult(X3,X2))),mult(mult(mult(X1,X2),X3),X2),mult(X2,mult(X1,mult(X2,X3))),mult(mult(X2,mult(X1,X2)),X3)) = mult(mult(X2,mult(X1,X2)),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_14]),c_0_14]) ).
cnf(c_0_40,plain,
mult(mult(X1,X2),mult(X1,mult(X2,X1))) = mult(X1,mult(X2,mult(X1,mult(X2,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_27]),c_0_35]) ).
cnf(c_0_41,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_21]),c_0_20]),c_0_21]),c_0_21]),c_0_37]) ).
cnf(c_0_42,plain,
mult(X1,mult(ld(X1,X2),X1)) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_43,plain,
mult(ld(X1,unit),mult(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_38,c_0_16]) ).
cnf(c_0_44,plain,
mult(X1,mult(mult(X1,X2),mult(X1,X2))) = mult(X1,mult(X1,mult(X2,mult(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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_14]),c_0_35]),c_0_14]),c_0_35]),c_0_14]),c_0_27]),c_0_41]),c_0_37]),c_0_14]),c_0_27]),c_0_41]) ).
cnf(c_0_45,plain,
ld(X1,mult(X2,X1)) = mult(ld(X1,X2),X1),
inference(spm,[status(thm)],[c_0_13,c_0_42]) ).
cnf(c_0_46,plain,
ld(ld(X1,unit),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_43]) ).
cnf(c_0_47,plain,
mult(mult(X1,X2),mult(X1,X2)) = mult(X1,mult(X2,mult(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_44]),c_0_13]) ).
cnf(c_0_48,plain,
mult(mult(X1,X2),ld(X1,unit)) = mult(X1,mult(X2,ld(X1,unit))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).
cnf(c_0_49,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_43,c_0_18]) ).
cnf(c_0_50,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_20]),c_0_21]),c_0_21]) ).
cnf(c_0_51,plain,
mult(rd(X1,X2),mult(X2,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_47,c_0_16]) ).
cnf(c_0_52,plain,
mult(mult(X1,ld(X2,unit)),mult(X2,X1)) = mult(X1,X1),
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_35,c_0_48]),c_0_49]),c_0_13]),c_0_49]),c_0_13]),c_0_50]),c_0_43]) ).
cnf(c_0_53,plain,
rd(mult(X1,X1),mult(X2,X1)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_51]) ).
cnf(c_0_54,plain,
mult(X1,ld(X2,unit)) = rd(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_52]),c_0_53]) ).
cnf(c_0_55,plain,
mult(X1,mult(ld(X1,X2),X2)) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_47,c_0_18]) ).
cnf(c_0_56,axiom,
mult(f(X1),f(X1)) = X1,
f09 ).
cnf(c_0_57,plain,
ld(X1,rd(X1,X2)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_13,c_0_54]) ).
cnf(c_0_58,plain,
ld(X1,mult(X2,X2)) = mult(ld(X1,X2),X2),
inference(spm,[status(thm)],[c_0_13,c_0_55]) ).
cnf(c_0_59,plain,
mult(mult(X1,mult(X2,X3)),ld(X3,X2)) = mult(mult(X1,X3),mult(ld(X3,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_42]),c_0_18]) ).
cnf(c_0_60,plain,
mult(f(X1),mult(f(X1),X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_41,c_0_56]) ).
cnf(c_0_61,plain,
ld(mult(X1,X2),X1) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_57,c_0_17]) ).
cnf(c_0_62,plain,
mult(ld(X1,f(X2)),f(X2)) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_58,c_0_56]) ).
cnf(c_0_63,plain,
rd(mult(X1,mult(X2,X3)),X3) = mult(mult(X1,X3),ld(X3,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(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_54]),c_0_61]),c_0_49]),c_0_59]),c_0_62]) ).
cnf(c_0_64,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_65,plain,
mult(mult(mult(X1,X2),ld(X2,X3)),X2) = mult(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
c_0_64 ).
cnf(c_0_67,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(X2,mult(X3,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_13]),c_0_14]) ).
cnf(c_0_68,negated_conjecture,
mult(mult(a,mult(b,a)),c) != mult(a,mult(b,mult(a,c))),
inference(rw,[status(thm)],[c_0_66,c_0_14]) ).
cnf(c_0_69,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_67]),c_0_37]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP667-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/15.61 % Computer : n026.cluster.edu
% 0.13/15.61 % Model : x86_64 x86_64
% 0.13/15.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/15.61 % Memory : 8046.5625MB
% 0.13/15.61 % OS : Linux 6.8.0-71-generic
% 0.13/15.61 % CPULimit : 300
% 0.13/15.61 % WCLimit : 300
% 0.13/15.61 % DateTime : Sun Sep 20 20:34:08 UTC 2026
% 0.13/15.62 % CPUTime :
% 0.13/15.62 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/15.66 Running first-order theorem proving
% 0.13/15.66 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
% 71.99/26.17 % Version: 3.5.1
% 71.99/26.17 % Preprocessing class: FSMSSMSSSSSNFFN.
% 71.99/26.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.99/26.17 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 71.99/26.17 % Starting new_bool_3 with 300s (1) cores
% 71.99/26.17 % Starting new_bool_1 with 300s (1) cores
% 71.99/26.17 % Starting sh5l with 300s (1) cores
% 71.99/26.17 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 549105 completed with status 0
% 71.99/26.17 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 71.99/26.17 % Preprocessing class: FSMSSMSSSSSNFFN.
% 71.99/26.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.99/26.17 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 71.99/26.17 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 71.99/26.17 % No SInE strategy applied
% 71.99/26.17 % Search class: FUUPM-FFMF32-MFFFFFNN
% 71.99/26.17 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 71.99/26.17 % Starting SubtermCWHack with 136s (1) cores
% 71.99/26.17 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 71.99/26.17 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 437s (1) cores
% 71.99/26.17 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 71.99/26.17 % Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 71.99/26.17 % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 549112 completed with status 0
% 71.99/26.17 % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 71.99/26.17 % Preprocessing class: FSMSSMSSSSSNFFN.
% 71.99/26.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.99/26.17 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 71.99/26.17 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 71.99/26.17 % No SInE strategy applied
% 71.99/26.17 % Search class: FUUPM-FFMF32-MFFFFFNN
% 71.99/26.17 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 71.99/26.17 % Starting SubtermCWHack with 136s (1) cores
% 71.99/26.17 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 71.99/26.17 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 437s (1) cores
% 71.99/26.17 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 71.99/26.17 % Preprocessing time : 0.001 s
% 71.99/26.17 % Presaturation interreduction done
% 71.99/26.17
% 71.99/26.17 % Proof found!
% 71.99/26.17 % SZS status Unsatisfiable
% 71.99/26.17 % SZS output start CNFRefutation
% See solution above
% 71.99/26.17 % Parsed axioms : 14
% 71.99/26.17 % Removed by relevancy pruning/SinE : 0
% 71.99/26.17 % Initial clauses : 14
% 71.99/26.17 % Removed in clause preprocessing : 0
% 71.99/26.17 % Initial clauses in saturation : 14
% 71.99/26.17 % Processed clauses : 2249
% 71.99/26.17 % ...of these trivial : 1187
% 71.99/26.17 % ...subsumed : 301
% 71.99/26.17 % ...remaining for further processing : 761
% 71.99/26.17 % Other redundant clauses eliminated : 0
% 71.99/26.17 % Clauses deleted for lack of memory : 0
% 71.99/26.17 % Backward-subsumed : 0
% 71.99/26.17 % Backward-rewritten : 262
% 71.99/26.17 % Generated clauses : 280136
% 71.99/26.17 % ...of the previous two non-redundant : 243191
% 71.99/26.17 % ...aggressively subsumed : 0
% 71.99/26.17 % Contextual simplify-reflections : 0
% 71.99/26.17 % Paramodulations : 280136
% 71.99/26.17 % Factorizations : 0
% 71.99/26.17 % NegExts : 0
% 71.99/26.17 % Equation resolutions : 0
% 71.99/26.17 % Disequality decompositions : 0
% 71.99/26.17 % Total rewrite steps : 1027236
% 71.99/26.17 % ...of those cached : 969605
% 71.99/26.17 % Propositional unsat checks : 0
% 71.99/26.17 % Propositional check models : 0
% 71.99/26.17 % Propositional check unsatisfiable : 0
% 71.99/26.17 % Propositional clauses : 0
% 71.99/26.17 % Propositional clauses after purity: 0
% 71.99/26.17 % Propositional unsat core size : 0
% 71.99/26.17 % Propositional preprocessing time : 0.000
% 71.99/26.17 % Propositional encoding time : 0.000
% 71.99/26.17 % Propositional solver time : 0.000
% 71.99/26.17 % Success case prop preproc time : 0.000
% 71.99/26.17 % Success case prop encoding time : 0.000
% 71.99/26.17 % Success case prop solver time : 0.000
% 71.99/26.17 % Current number of processed clauses : 486
% 71.99/26.17 % Positive orientable unit clauses : 478
% 71.99/26.17 % Positive unorientable unit clauses: 8
% 71.99/26.17 % Negative unit clauses : 0
% 71.99/26.17 % Non-unit-clauses : 0
% 71.99/26.17 % Current number of unprocessed clauses: 239922
% 71.99/26.17 % ...number of literals in the above : 239922
% 71.99/26.17 % Current number of archived formulas : 0
% 71.99/26.17 % Current number of archived clauses : 275
% 71.99/26.17 % Clause-clause subsumption calls (NU) : 0
% 71.99/26.17 % Rec. Clause-clause subsumption calls : 0
% 71.99/26.17 % Non-unit clause-clause subsumptions : 0
% 71.99/26.17 % Unit Clause-clause subsumption calls : 30
% 71.99/26.17 % Rewrite failures with RHS unbound : 0
% 71.99/26.17 % BW rewrite match attempts : 6883
% 71.99/26.17 % BW rewrite match successes : 268
% 71.99/26.17 % Condensation attempts : 0
% 71.99/26.17 % Condensation successes : 0
% 71.99/26.17 % Termbank termtop insertions : 10608635
% 71.99/26.17 % Search garbage collected termcells : 2
% 71.99/26.17
% 71.99/26.17 % -------------------------------------------------
% 71.99/26.17 % User time : 9.683 s
% 71.99/26.17 % System time : 0.372 s
% 71.99/26.17 % Total time : 10.055 s
% 71.99/26.17 % Maximum resident set size: 3640 pages
% 71.99/26.17
% 71.99/26.17 % -------------------------------------------------
% 71.99/26.17 % User time : 49.488 s
% 71.99/26.17 % System time : 1.781 s
% 71.99/26.17 % Total time : 51.269 s
% 71.99/26.17 % Maximum resident set size: 4608 pages
% 71.99/26.17 % E exiting
%------------------------------------------------------------------------------