%------------------------------------------------------------------------------
% File : E-SAT---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 : n004.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:45 PM UTC 2026
% Result : Unsatisfiable 2.95s 1.00s
% Output : CNFRefutation 2.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 10
% Syntax : Number of clauses : 75 ( 75 unt; 0 nHn; 33 RR)
% Number of literals : 75 ( 74 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 : 75 ( 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(c10,axiom,
mult(op_c,mult(op_c,mult(op_c,op_c))) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
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(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(c11,axiom,
mult(op_d,mult(op_d,op_d)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
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,axiom,
mult(op_c,mult(op_c,mult(op_c,op_c))) = unit,
c10 ).
cnf(c_0_14,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_15,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
c09 ).
cnf(c_0_16,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_17,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_13]),c_0_11]) ).
cnf(c_0_18,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
c07 ).
cnf(c_0_19,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_20,axiom,
mult(op_d,mult(op_d,op_d)) = unit,
c11 ).
cnf(c_0_21,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_22,plain,
rd(i(mult(X1,X2)),i(X2)) = i(X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
i(mult(op_c,mult(op_c,op_c))) = op_c,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_25,plain,
i(op_d) = mult(op_d,op_d),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_20]),c_0_11]) ).
cnf(c_0_26,plain,
mult(i(rd(X1,X2)),X1) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_21]) ).
cnf(c_0_27,plain,
rd(op_c,i(mult(op_c,op_c))) = mult(op_c,mult(op_c,op_c)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]) ).
cnf(c_0_28,plain,
rd(mult(X1,mult(X1,X2)),X2) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_29,plain,
mult(X1,i(X1)) = unit,
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_30,plain,
mult(op_d,mult(op_d,i(X1))) = i(mult(op_d,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_24]) ).
cnf(c_0_31,plain,
i(mult(op_c,op_c)) = mult(op_c,op_c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23]) ).
cnf(c_0_32,plain,
rd(X1,i(X1)) = mult(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_11]) ).
cnf(c_0_33,plain,
i(mult(op_d,mult(op_c,op_c))) = mult(op_d,mult(op_d,mult(op_c,op_c))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
rd(X1,mult(X2,X1)) = i(X2),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_35,plain,
rd(mult(X1,mult(X2,mult(X1,X3))),X3) = mult(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_36,plain,
mult(mult(op_d,mult(op_c,op_c)),mult(op_d,mult(op_c,op_c))) = mult(op_d,op_d),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_25]) ).
cnf(c_0_37,plain,
rd(unit,X1) = i(X1),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_38,plain,
mult(op_d,mult(mult(op_d,mult(op_c,op_c)),op_d)) = mult(op_c,op_c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20]),c_0_37]),c_0_31]) ).
cnf(c_0_39,plain,
mult(mult(X1,X2),mult(i(X1),mult(mult(X1,X2),X3))) = mult(mult(mult(X1,X2),X2),X3),
inference(spm,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_40,plain,
mult(mult(op_d,mult(op_c,op_c)),op_d) = mult(op_d,mult(op_d,mult(op_c,op_c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_38]),c_0_25]),c_0_24]) ).
cnf(c_0_41,plain,
mult(op_d,mult(op_d,mult(op_d,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_19]) ).
cnf(c_0_42,plain,
mult(mult(mult(op_d,mult(op_c,op_c)),mult(op_c,op_c)),op_d) = mult(op_d,op_d),
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_25]),c_0_24]),c_0_41]),c_0_36]) ).
cnf(c_0_43,plain,
mult(X1,mult(rd(X2,X1),mult(X1,X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_44,plain,
mult(mult(op_d,mult(op_c,op_c)),mult(op_c,op_c)) = op_d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_42]),c_0_14]) ).
cnf(c_0_45,plain,
mult(op_d,rd(X1,op_d)) = mult(mult(op_d,X1),mult(op_d,op_d)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_20]),c_0_11]) ).
cnf(c_0_46,plain,
rd(mult(op_c,op_c),op_d) = mult(op_d,mult(op_d,mult(op_c,op_c))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_44]),c_0_33]) ).
cnf(c_0_47,plain,
mult(i(mult(X1,mult(X2,X1))),mult(X1,mult(X2,mult(X1,X3)))) = X3,
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_48,plain,
mult(mult(op_d,mult(op_c,op_c)),mult(op_d,op_d)) = mult(op_c,op_c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_41]) ).
cnf(c_0_49,plain,
mult(mult(X1,mult(X2,mult(X3,mult(X2,X1)))),X4) = mult(X1,mult(X2,mult(X3,mult(X2,mult(X1,X4))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_18]),c_0_18]) ).
cnf(c_0_50,plain,
mult(op_c,mult(op_c,mult(op_d,mult(op_c,op_c)))) = op_d,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_40]),c_0_41]),c_0_31]),c_0_24]) ).
cnf(c_0_51,plain,
mult(i(X1),mult(op_d,op_d)) = i(mult(X1,op_d)),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_52,plain,
mult(op_c,mult(op_c,mult(op_d,mult(op_c,mult(op_c,X1))))) = mult(op_d,X1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
rd(i(mult(op_d,X1)),mult(op_d,i(X1))) = op_d,
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_54,plain,
mult(op_d,mult(op_c,op_c)) = mult(op_c,mult(op_c,op_d)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_50]),c_0_23]) ).
cnf(c_0_55,plain,
i(mult(op_c,mult(op_c,op_d))) = mult(op_c,mult(op_c,mult(op_d,op_d))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_31]),c_0_24]),c_0_24]) ).
cnf(c_0_56,plain,
mult(op_d,mult(op_d,mult(op_c,mult(op_c,op_c)))) = i(mult(op_d,op_c)),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_57,plain,
mult(op_d,mult(op_c,mult(op_c,op_c))) = mult(op_c,mult(op_c,mult(op_d,op_c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_29]),c_0_11]),c_0_17]) ).
cnf(c_0_58,plain,
mult(op_d,mult(op_c,mult(op_c,X1))) = mult(op_c,mult(op_c,mult(op_d,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_52]),c_0_23]) ).
cnf(c_0_59,plain,
mult(X1,mult(rd(X2,mult(X1,X3)),X1)) = rd(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_60,plain,
rd(mult(op_c,mult(op_c,mult(op_d,op_d))),mult(op_c,mult(op_c,op_d))) = op_d,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_31]),c_0_54]),c_0_55]),c_0_54]) ).
cnf(c_0_61,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_51,c_0_17]),c_0_18]) ).
cnf(c_0_62,plain,
rd(i(X1),X1) = i(mult(X1,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_12]),c_0_11]),c_0_15]) ).
cnf(c_0_63,plain,
mult(op_c,mult(op_c,mult(op_d,mult(op_d,op_c)))) = i(mult(op_d,op_c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_64,plain,
mult(op_c,mult(op_c,mult(op_c,i(X1)))) = i(mult(op_c,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_18]) ).
cnf(c_0_65,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62]) ).
cnf(c_0_66,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(spm,[status(thm)],[c_0_10,c_0_63]),c_0_17]),c_0_18]),c_0_64]) ).
cnf(c_0_67,plain,
mult(mult(op_c,op_d),mult(op_c,op_d)) = mult(op_c,mult(op_d,mult(op_d,op_c))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_65]),c_0_66]) ).
cnf(c_0_68,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_18,c_0_24]),c_0_24]) ).
cnf(c_0_69,plain,
mult(i(mult(X1,mult(X2,X1))),mult(X1,X2)) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_29]),c_0_11]) ).
cnf(c_0_70,plain,
mult(mult(op_c,op_d),mult(mult(op_c,op_d),X1)) = mult(op_c,mult(op_d,mult(op_d,mult(op_c,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_67]),c_0_68]) ).
cnf(c_0_71,negated_conjecture,
mult(op_c,op_d) != mult(op_d,op_c),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_72,plain,
i(mult(op_d,op_c)) = i(mult(op_c,op_d)),
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_69,c_0_70]),c_0_58]),c_0_58]),c_0_20]),c_0_11]),c_0_23]),c_0_67]),c_0_63]) ).
cnf(c_0_73,negated_conjecture,
mult(op_c,op_d) != mult(op_d,op_c),
c_0_71 ).
cnf(c_0_74,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_72]),c_0_16]),c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP688-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n004.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Sun Sep 20 20:33:19 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.51 Running first-order theorem proving
% 0.27/0.51 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
% 2.95/1.00 % Version: 3.5.1
% 2.95/1.00 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.95/1.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.95/1.00 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.95/1.00 % Starting new_bool_3 with 300s (1) cores
% 2.95/1.00 % Starting new_bool_1 with 300s (1) cores
% 2.95/1.00 % Starting sh5l with 300s (1) cores
% 2.95/1.00 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1441396 completed with status 0
% 2.95/1.00 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.95/1.00 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.95/1.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.95/1.00 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.95/1.00 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.95/1.00 % No SInE strategy applied
% 2.95/1.00 % Search class: FUUPM-FFSF21-MFFFFFNN
% 2.95/1.00 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 2.95/1.00 % Starting SubtermCWHack with 136s (1) cores
% 2.95/1.00 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.95/1.00 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 2.95/1.00 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 2.95/1.00 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 2.95/1.00 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1441401 completed with status 0
% 2.95/1.00 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.95/1.00 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.95/1.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.95/1.00 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.95/1.00 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.95/1.00 % No SInE strategy applied
% 2.95/1.00 % Search class: FUUPM-FFSF21-MFFFFFNN
% 2.95/1.00 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 2.95/1.00 % Starting SubtermCWHack with 136s (1) cores
% 2.95/1.00 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.95/1.00 % Preprocessing time : 0.001 s
% 2.95/1.00
% 2.95/1.00 % Proof found!
% 2.95/1.00 % SZS status Unsatisfiable
% 2.95/1.00 % SZS output start CNFRefutation
% See solution above
% 2.95/1.00 % Parsed axioms : 12
% 2.95/1.00 % Removed by relevancy pruning/SinE : 0
% 2.95/1.00 % Initial clauses : 12
% 2.95/1.00 % Removed in clause preprocessing : 0
% 2.95/1.00 % Initial clauses in saturation : 12
% 2.95/1.00 % Processed clauses : 579
% 2.95/1.00 % ...of these trivial : 231
% 2.95/1.00 % ...subsumed : 13
% 2.95/1.00 % ...remaining for further processing : 335
% 2.95/1.00 % Other redundant clauses eliminated : 0
% 2.95/1.00 % Clauses deleted for lack of memory : 0
% 2.95/1.00 % Backward-subsumed : 0
% 2.95/1.00 % Backward-rewritten : 134
% 2.95/1.00 % Generated clauses : 22879
% 2.95/1.00 % ...of the previous two non-redundant : 17263
% 2.95/1.00 % ...aggressively subsumed : 0
% 2.95/1.00 % Contextual simplify-reflections : 0
% 2.95/1.00 % Paramodulations : 22879
% 2.95/1.00 % Factorizations : 0
% 2.95/1.00 % NegExts : 0
% 2.95/1.00 % Equation resolutions : 0
% 2.95/1.00 % Disequality decompositions : 0
% 2.95/1.00 % Total rewrite steps : 44740
% 2.95/1.00 % ...of those cached : 37156
% 2.95/1.00 % Propositional unsat checks : 0
% 2.95/1.00 % Propositional check models : 0
% 2.95/1.00 % Propositional check unsatisfiable : 0
% 2.95/1.00 % Propositional clauses : 0
% 2.95/1.00 % Propositional clauses after purity: 0
% 2.95/1.00 % Propositional unsat core size : 0
% 2.95/1.00 % Propositional preprocessing time : 0.000
% 2.95/1.00 % Propositional encoding time : 0.000
% 2.95/1.00 % Propositional solver time : 0.000
% 2.95/1.00 % Success case prop preproc time : 0.000
% 2.95/1.00 % Success case prop encoding time : 0.000
% 2.95/1.00 % Success case prop solver time : 0.000
% 2.95/1.00 % Current number of processed clauses : 201
% 2.95/1.00 % Positive orientable unit clauses : 196
% 2.95/1.00 % Positive unorientable unit clauses: 4
% 2.95/1.00 % Negative unit clauses : 1
% 2.95/1.00 % Non-unit-clauses : 0
% 2.95/1.00 % Current number of unprocessed clauses: 16322
% 2.95/1.00 % ...number of literals in the above : 16322
% 2.95/1.00 % Current number of archived formulas : 0
% 2.95/1.00 % Current number of archived clauses : 134
% 2.95/1.00 % Clause-clause subsumption calls (NU) : 0
% 2.95/1.00 % Rec. Clause-clause subsumption calls : 0
% 2.95/1.00 % Non-unit clause-clause subsumptions : 0
% 2.95/1.00 % Unit Clause-clause subsumption calls : 3
% 2.95/1.00 % Rewrite failures with RHS unbound : 0
% 2.95/1.00 % BW rewrite match attempts : 1265
% 2.95/1.00 % BW rewrite match successes : 158
% 2.95/1.00 % Condensation attempts : 0
% 2.95/1.00 % Condensation successes : 0
% 2.95/1.00 % Termbank termtop insertions : 548762
% 2.95/1.00 % Search garbage collected termcells : 2
% 2.95/1.00
% 2.95/1.00 % -------------------------------------------------
% 2.95/1.00 % User time : 0.430 s
% 2.95/1.00 % System time : 0.022 s
% 2.95/1.00 % Total time : 0.451 s
% 2.95/1.00 % Maximum resident set size: 3584 pages
% 2.95/1.00
% 2.95/1.00 % -------------------------------------------------
% 2.95/1.00 % User time : 2.156 s
% 2.95/1.00 % System time : 0.127 s
% 2.95/1.00 % Total time : 2.284 s
% 2.95/1.00 % Maximum resident set size: 4608 pages
% 2.95/1.00 % E exiting
%------------------------------------------------------------------------------