%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP688-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:40:46 PM UTC 2026
% Result : Unsatisfiable 3.43s 1.06s
% Output : CNFRefutation 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of clauses : 77 ( 77 unt; 0 nHn; 24 RR)
% Number of literals : 77 ( 76 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 94 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c08,axiom,
mult(i(X1),mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c09,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c11,axiom,
mult(op_d,mult(op_d,op_d)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(c10,axiom,
mult(op_c,mult(op_c,mult(op_c,op_c))) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(goals,negated_conjecture,
mult(op_c,op_d) != mult(op_d,op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_10,axiom,
mult(i(X1),mult(X1,X2)) = X2,
c08 ).
cnf(c_0_11,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_12,plain,
mult(i(X1),X1) = unit,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_12]),c_0_11]) ).
cnf(c_0_14,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_15,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_16,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
c09 ).
cnf(c_0_17,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
c07 ).
cnf(c_0_18,axiom,
mult(op_d,mult(op_d,op_d)) = unit,
c11 ).
cnf(c_0_19,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_20,plain,
rd(X1,mult(X2,X1)) = i(X2),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_21,axiom,
mult(op_c,mult(op_c,mult(op_c,op_c))) = unit,
c10 ).
cnf(c_0_22,plain,
rd(unit,X1) = i(X1),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_23,plain,
mult(X1,i(mult(X1,X2))) = i(X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
mult(op_d,mult(op_d,mult(op_d,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,plain,
rd(i(X1),i(mult(X2,X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_13]) ).
cnf(c_0_26,plain,
i(mult(op_c,mult(op_c,op_c))) = op_c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_21]),c_0_22]) ).
cnf(c_0_27,plain,
rd(mult(X1,mult(X2,mult(X1,X3))),X3) = mult(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_28,plain,
i(mult(op_d,mult(op_d,X1))) = mult(op_d,i(X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_30,plain,
rd(i(mult(op_c,op_c)),op_c) = op_c,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
mult(X1,mult(i(mult(X1,X2)),X1)) = rd(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_12]),c_0_11]) ).
cnf(c_0_32,plain,
mult(mult(op_d,i(X1)),mult(op_d,mult(op_d,X1))) = unit,
inference(spm,[status(thm)],[c_0_12,c_0_28]) ).
cnf(c_0_33,plain,
i(mult(op_c,op_c)) = mult(op_c,op_c),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
mult(i(unit),X1) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_35,plain,
rd(X1,mult(X2,mult(X3,mult(X2,X1)))) = i(mult(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_36,plain,
rd(i(X1),i(X2)) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_37,plain,
i(rd(X1,X2)) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_38,plain,
mult(X1,i(X1)) = unit,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_39,plain,
i(mult(i(X1),X2)) = mult(X1,i(X2)),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_40,plain,
rd(rd(X1,X2),mult(i(mult(X1,X2)),X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_31]) ).
cnf(c_0_41,plain,
mult(mult(op_d,mult(op_c,op_c)),mult(op_d,mult(op_d,mult(op_c,op_c)))) = unit,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_42,plain,
i(op_d) = mult(op_d,op_d),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_18]),c_0_11]) ).
cnf(c_0_43,plain,
i(unit) = unit,
inference(spm,[status(thm)],[c_0_11,c_0_34]) ).
cnf(c_0_44,plain,
rd(mult(op_d,op_d),mult(op_d,X1)) = i(mult(op_d,mult(X1,op_d))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_18]),c_0_11]) ).
cnf(c_0_45,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_19]) ).
cnf(c_0_46,plain,
rd(rd(X1,X2),i(X3)) = rd(X3,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,plain,
i(op_c) = mult(op_c,mult(op_c,op_c)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_21]),c_0_11]) ).
cnf(c_0_48,plain,
rd(X1,i(X2)) = rd(X2,i(X1)),
inference(spm,[status(thm)],[c_0_36,c_0_13]) ).
cnf(c_0_49,plain,
i(mult(X1,i(X2))) = mult(i(X1),X2),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_50,plain,
mult(mult(i(X1),X2),mult(X1,i(X2))) = unit,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_51,plain,
mult(op_d,mult(op_d,i(X1))) = i(mult(op_d,X1)),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_52,plain,
i(mult(op_d,mult(op_c,mult(op_c,op_d)))) = mult(op_d,mult(op_c,op_c)),
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_40,c_0_41]),c_0_20]),c_0_42]),c_0_43]),c_0_19]),c_0_44]),c_0_45]) ).
cnf(c_0_53,plain,
i(mult(op_c,mult(op_c,X1))) = mult(op_c,mult(op_c,i(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_33]),c_0_45]),c_0_45]) ).
cnf(c_0_54,plain,
rd(rd(X1,X2),mult(op_c,mult(op_c,op_c))) = rd(op_c,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,plain,
rd(rd(X1,i(X2)),mult(mult(i(X2),X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_48]),c_0_49]) ).
cnf(c_0_56,plain,
rd(mult(mult(i(X1),X2),X1),rd(X2,i(X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_16]),c_0_46]) ).
cnf(c_0_57,plain,
rd(X1,i(X2)) = mult(X1,mult(mult(i(X1),X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_50]),c_0_11]) ).
cnf(c_0_58,plain,
mult(i(X1),mult(op_d,op_d)) = i(mult(X1,op_d)),
inference(spm,[status(thm)],[c_0_16,c_0_42]) ).
cnf(c_0_59,plain,
mult(i(X1),mult(i(X2),mult(i(X1),X3))) = mult(i(mult(X1,mult(X2,X1))),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_16]) ).
cnf(c_0_60,plain,
mult(op_d,mult(op_c,mult(op_c,mult(op_d,op_d)))) = mult(op_c,op_c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_24]),c_0_28]),c_0_53]),c_0_42]) ).
cnf(c_0_61,plain,
rd(X1,mult(op_c,mult(op_c,op_c))) = mult(op_c,mult(mult(op_c,mult(op_c,mult(op_c,X1))),op_c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57]),c_0_47]),c_0_17]) ).
cnf(c_0_62,plain,
mult(op_c,mult(op_c,mult(op_c,mult(op_d,op_d)))) = i(mult(op_c,op_d)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_47]),c_0_17]) ).
cnf(c_0_63,plain,
i(mult(op_d,op_d)) = op_d,
inference(spm,[status(thm)],[c_0_13,c_0_42]) ).
cnf(c_0_64,plain,
mult(i(mult(X1,mult(X2,X1))),X1) = i(mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_38]),c_0_11]),c_0_16]),c_0_13]) ).
cnf(c_0_65,plain,
i(mult(op_c,mult(op_d,op_c))) = mult(op_c,mult(op_d,mult(op_d,op_c))),
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_60]),c_0_61]),c_0_62]),c_0_23]),c_0_42]),c_0_45]) ).
cnf(c_0_66,plain,
mult(mult(X1,mult(X2,mult(X2,X1))),X3) = mult(X1,mult(X2,mult(X2,mult(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_45]),c_0_45]) ).
cnf(c_0_67,plain,
mult(op_d,mult(op_c,op_c)) = mult(op_c,mult(op_c,op_d)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_60]),c_0_33]),c_0_53]),c_0_63]) ).
cnf(c_0_68,plain,
rd(mult(X1,mult(X1,X2)),X2) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_14,c_0_45]) ).
cnf(c_0_69,plain,
mult(op_c,mult(op_d,mult(op_c,mult(op_c,op_d)))) = i(mult(op_c,op_d)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67]) ).
cnf(c_0_70,plain,
rd(i(X1),X1) = i(mult(X1,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_12]),c_0_11]),c_0_16]) ).
cnf(c_0_71,plain,
i(mult(mult(op_c,op_d),mult(op_c,op_d))) = mult(op_c,mult(op_d,op_c)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_69]),c_0_70]) ).
cnf(c_0_72,negated_conjecture,
mult(op_c,op_d) != mult(op_d,op_c),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_73,plain,
mult(mult(op_c,op_d),mult(op_c,mult(op_d,op_c))) = i(mult(op_c,op_d)),
inference(spm,[status(thm)],[c_0_23,c_0_71]) ).
cnf(c_0_74,plain,
mult(op_c,mult(op_c,mult(op_c,mult(op_c,X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_26]),c_0_17]) ).
cnf(c_0_75,negated_conjecture,
mult(op_c,op_d) != mult(op_d,op_c),
c_0_72 ).
cnf(c_0_76,plain,
$false,
inference(sr,[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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_73]),c_0_17]),c_0_23]),c_0_42]),c_0_18]),c_0_11]),c_0_47]),c_0_17]),c_0_74]),c_0_17]),c_0_69]),c_0_13]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP688-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n014.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sun Sep 20 20:33:19 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 3.43/1.06 % Version: 3.5.1
% 3.43/1.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.43/1.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.43/1.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.43/1.06 % Starting new_bool_3 with 300s (1) cores
% 3.43/1.06 % Starting new_bool_1 with 300s (1) cores
% 3.43/1.06 % Starting sh5l with 300s (1) cores
% 3.43/1.06 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2310825 completed with status 0
% 3.43/1.06 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.43/1.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.43/1.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.43/1.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.43/1.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.43/1.06 % No SInE strategy applied
% 3.43/1.06 % Search class: FUUPM-FFSF21-MFFFFFNN
% 3.43/1.06 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 3.43/1.06 % Starting SubtermCWHack with 136s (1) cores
% 3.43/1.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.43/1.06 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 3.43/1.06 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 3.43/1.06 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 3.43/1.06 % SubtermCWHack with pid 2310830 completed with status 0
% 3.43/1.06 % Result found by SubtermCWHack
% 3.43/1.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.43/1.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.43/1.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.43/1.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.43/1.06 % No SInE strategy applied
% 3.43/1.06 % Search class: FUUPM-FFSF21-MFFFFFNN
% 3.43/1.06 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 3.43/1.06 % Starting SubtermCWHack with 136s (1) cores
% 3.43/1.06 % Preprocessing time : 0.001 s
% 3.43/1.06
% 3.43/1.06 % Proof found!
% 3.43/1.06 % SZS status Unsatisfiable
% 3.43/1.06 % SZS output start CNFRefutation
% See solution above
% 3.43/1.06 % Parsed axioms : 12
% 3.43/1.06 % Removed by relevancy pruning/SinE : 0
% 3.43/1.06 % Initial clauses : 12
% 3.43/1.06 % Removed in clause preprocessing : 0
% 3.43/1.06 % Initial clauses in saturation : 12
% 3.43/1.06 % Processed clauses : 1158
% 3.43/1.06 % ...of these trivial : 607
% 3.43/1.06 % ...subsumed : 218
% 3.43/1.06 % ...remaining for further processing : 333
% 3.43/1.06 % Other redundant clauses eliminated : 0
% 3.43/1.06 % Clauses deleted for lack of memory : 0
% 3.43/1.06 % Backward-subsumed : 0
% 3.43/1.06 % Backward-rewritten : 69
% 3.43/1.06 % Generated clauses : 28910
% 3.43/1.06 % ...of the previous two non-redundant : 18389
% 3.43/1.06 % ...aggressively subsumed : 0
% 3.43/1.06 % Contextual simplify-reflections : 0
% 3.43/1.06 % Paramodulations : 28910
% 3.43/1.06 % Factorizations : 0
% 3.43/1.06 % NegExts : 0
% 3.43/1.06 % Equation resolutions : 0
% 3.43/1.06 % Disequality decompositions : 0
% 3.43/1.06 % Total rewrite steps : 62842
% 3.43/1.06 % ...of those cached : 54942
% 3.43/1.06 % Propositional unsat checks : 0
% 3.43/1.06 % Propositional check models : 0
% 3.43/1.06 % Propositional check unsatisfiable : 0
% 3.43/1.06 % Propositional clauses : 0
% 3.43/1.06 % Propositional clauses after purity: 0
% 3.43/1.06 % Propositional unsat core size : 0
% 3.43/1.06 % Propositional preprocessing time : 0.000
% 3.43/1.06 % Propositional encoding time : 0.000
% 3.43/1.06 % Propositional solver time : 0.000
% 3.43/1.06 % Success case prop preproc time : 0.000
% 3.43/1.06 % Success case prop encoding time : 0.000
% 3.43/1.06 % Success case prop solver time : 0.000
% 3.43/1.06 % Current number of processed clauses : 264
% 3.43/1.06 % Positive orientable unit clauses : 258
% 3.43/1.06 % Positive unorientable unit clauses: 5
% 3.43/1.06 % Negative unit clauses : 1
% 3.43/1.06 % Non-unit-clauses : 0
% 3.43/1.06 % Current number of unprocessed clauses: 16912
% 3.43/1.06 % ...number of literals in the above : 16912
% 3.43/1.06 % Current number of archived formulas : 0
% 3.43/1.06 % Current number of archived clauses : 69
% 3.43/1.06 % Clause-clause subsumption calls (NU) : 0
% 3.43/1.06 % Rec. Clause-clause subsumption calls : 0
% 3.43/1.06 % Non-unit clause-clause subsumptions : 0
% 3.43/1.06 % Unit Clause-clause subsumption calls : 20
% 3.43/1.06 % Rewrite failures with RHS unbound : 0
% 3.43/1.06 % BW rewrite match attempts : 552
% 3.43/1.06 % BW rewrite match successes : 92
% 3.43/1.06 % Condensation attempts : 0
% 3.43/1.06 % Condensation successes : 0
% 3.43/1.06 % Termbank termtop insertions : 524264
% 3.43/1.06 % Search garbage collected termcells : 2
% 3.43/1.06
% 3.43/1.06 % -------------------------------------------------
% 3.43/1.06 % User time : 0.562 s
% 3.43/1.06 % System time : 0.032 s
% 3.43/1.06 % Total time : 0.594 s
% 3.43/1.06 % Maximum resident set size: 3584 pages
% 3.43/1.06
% 3.43/1.06 % -------------------------------------------------
% 3.43/1.06 % User time : 2.603 s
% 3.43/1.06 % System time : 0.143 s
% 3.43/1.06 % Total time : 2.746 s
% 3.43/1.06 % Maximum resident set size: 4864 pages
% 3.43/1.06 % E exiting
%------------------------------------------------------------------------------