%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP060-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:37:46 PM UTC 2026
% Result : Unsatisfiable 4.41s 11.39s
% Output : CNFRefutation 4.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 2
% Syntax : Number of clauses : 59 ( 55 unt; 0 nHn; 6 RR)
% Number of literals : 66 ( 65 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 187 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X1))))) = X4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X1))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),inverse(X5))),multiply(X5,multiply(X3,X1))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(X3,inverse(X4))),multiply(X4,multiply(X5,X1))))) = multiply(X6,multiply(multiply(inverse(X6),inverse(multiply(X3,X5))),inverse(X2))),
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(X1),inverse(multiply(X2,multiply(X3,inverse(multiply(multiply(X1,multiply(X4,inverse(X5))),multiply(X5,multiply(X2,X3)))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X3,multiply(X1,multiply(X4,inverse(X2)))))),X3))) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_2]) ).
cnf(c_0_7,plain,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(X4,X1))))) = multiply(inverse(X5),inverse(multiply(X2,multiply(X3,multiply(X4,inverse(X5)))))),
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),X3))),inverse(X2))) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(multiply(inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X5)))),multiply(X6,multiply(multiply(inverse(X6),inverse(X4)),X1))))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_10,plain,
multiply(inverse(X1),inverse(multiply(multiply(X2,inverse(multiply(X3,multiply(X1,multiply(X4,X2))))),X3))) = X4,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(X2)),inverse(X3))) = multiply(X4,multiply(multiply(inverse(X4),inverse(X2)),inverse(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_2]) ).
cnf(c_0_12,plain,
multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X3,multiply(X4,multiply(multiply(inverse(X4),inverse(X5)),inverse(X2)))))),X3))) = multiply(inverse(X1),inverse(X5)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(X4,X1))))) = multiply(X5,inverse(multiply(X2,multiply(X3,multiply(X4,X5))))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_14,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(multiply(inverse(X2),inverse(X3)),inverse(X4))),multiply(X4,multiply(X5,X1))))) = inverse(multiply(multiply(X6,multiply(multiply(inverse(X6),inverse(multiply(X7,X3))),inverse(X8))),multiply(X8,multiply(X7,X5)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_15,plain,
inverse(multiply(multiply(inverse(X1),inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(X4)),inverse(X1)))))),X2)) = inverse(X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_12]),c_0_3]) ).
cnf(c_0_16,plain,
multiply(X1,multiply(X2,inverse(multiply(multiply(X3,multiply(multiply(inverse(X3),inverse(X4)),inverse(X5))),multiply(X5,multiply(X1,X2)))))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_3]) ).
cnf(c_0_17,plain,
inverse(multiply(multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(X4)),X1))))),X2)) = inverse(X4),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_18,plain,
multiply(multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(X4)),X1))))),X2) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_16]) ).
cnf(c_0_19,plain,
inverse(multiply(multiply(inverse(X1),inverse(multiply(X2,X3))),X2)) = inverse(multiply(multiply(inverse(X1),inverse(multiply(X4,X3))),X4)),
inference(spm,[status(thm)],[c_0_17,c_0_8]) ).
cnf(c_0_20,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(multiply(inverse(X2),inverse(X3)),inverse(X4))),multiply(X4,X3)))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_18]) ).
cnf(c_0_21,plain,
inverse(multiply(multiply(inverse(X1),inverse(X2)),X2)) = inverse(multiply(multiply(inverse(X1),inverse(X3)),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(inverse(X1),inverse(X2))) = multiply(X3,multiply(inverse(X3),inverse(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_20]),c_0_20]) ).
cnf(c_0_23,plain,
multiply(multiply(inverse(X1),inverse(X2)),X2) = multiply(multiply(inverse(X1),inverse(X3)),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_16]) ).
cnf(c_0_24,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_20]) ).
cnf(c_0_25,plain,
multiply(multiply(inverse(X1),inverse(X2)),X2) = multiply(multiply(X3,inverse(X3)),inverse(X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
multiply(X1,inverse(X1)) = multiply(multiply(inverse(multiply(X2,inverse(X2))),inverse(X3)),X3),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
multiply(multiply(X1,X2),inverse(multiply(X2,multiply(multiply(X3,inverse(X3)),multiply(X4,inverse(X4)))))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_26]) ).
cnf(c_0_28,plain,
multiply(X1,inverse(X1)) = multiply(multiply(X2,inverse(X2)),multiply(X3,inverse(X3))),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_29,plain,
multiply(multiply(X1,X2),inverse(multiply(X2,multiply(X3,inverse(X3))))) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
multiply(multiply(X1,multiply(X2,inverse(X2))),inverse(multiply(X3,inverse(X3)))) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_31,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_20]),c_0_20]) ).
cnf(c_0_32,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_33,plain,
multiply(inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(X3,X1))),X4)))),inverse(multiply(multiply(X5,multiply(multiply(inverse(X5),inverse(multiply(X4,X6))),inverse(X7))),multiply(X7,X3)))) = X6,
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_34,plain,
multiply(X1,inverse(inverse(X2))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_32]),c_0_31]),c_0_31]) ).
cnf(c_0_35,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(multiply(X3,X4),X1))),X3)))) = X4,
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_36,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_34]),c_0_9]) ).
cnf(c_0_37,plain,
multiply(multiply(X1,inverse(X2)),X2) = multiply(multiply(X1,inverse(X3)),X3),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_38,plain,
multiply(X1,multiply(inverse(X1),X2)) = multiply(X3,multiply(inverse(X3),X2)),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_39,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_36]) ).
cnf(c_0_40,plain,
multiply(multiply(X1,inverse(X2)),X2) = multiply(multiply(X3,inverse(X3)),X1),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
cnf(c_0_41,plain,
multiply(multiply(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_32]) ).
cnf(c_0_42,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
multiply(multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(X4,inverse(X4)),X1))))),X2) = inverse(X3),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_44,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
inverse(multiply(multiply(X1,X2),multiply(X3,multiply(inverse(X3),X4)))) = multiply(multiply(inverse(X4),inverse(X2)),inverse(X1)),
inference(spm,[status(thm)],[c_0_35,c_0_20]) ).
cnf(c_0_46,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_47,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_44]),c_0_31]) ).
cnf(c_0_48,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_49,plain,
inverse(multiply(X1,multiply(inverse(X1),multiply(inverse(inverse(multiply(X2,X3))),X4)))) = multiply(multiply(inverse(X4),inverse(X3)),inverse(X2)),
inference(spm,[status(thm)],[c_0_45,c_0_38]) ).
cnf(c_0_50,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
c_0_48 ).
cnf(c_0_52,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(spm,[status(thm)],[c_0_44,c_0_36]) ).
cnf(c_0_53,plain,
inverse(multiply(multiply(X1,X2),X3)) = inverse(multiply(X1,multiply(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_42]),c_0_36]),c_0_50]),c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_55,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_53]),c_0_36]) ).
cnf(c_0_56,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_57,plain,
multiply(X1,inverse(X1)) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_24,c_0_36]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP060-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.64 % Computer : n008.cluster.edu
% 0.14/10.64 % Model : x86_64 x86_64
% 0.14/10.64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.64 % Memory : 8046.5625MB
% 0.14/10.64 % OS : Linux 6.8.0-71-generic
% 0.14/10.64 % CPULimit : 300
% 0.14/10.64 % WCLimit : 300
% 0.14/10.64 % DateTime : Sun Sep 20 19:57:08 UTC 2026
% 0.14/10.64 % CPUTime :
% 0.14/10.64 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/10.71 Running first-order theorem proving
% 0.19/10.71 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
% 4.41/11.39 % Version: 3.5.1
% 4.41/11.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 4.41/11.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.41/11.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.41/11.39 % Starting new_bool_3 with 300s (1) cores
% 4.41/11.39 % Starting new_bool_1 with 300s (1) cores
% 4.41/11.39 % Starting sh5l with 300s (1) cores
% 4.41/11.39 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3476039 completed with status 0
% 4.41/11.39 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 4.41/11.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 4.41/11.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.41/11.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.41/11.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.41/11.39 % No SInE strategy applied
% 4.41/11.39 % Search class: FUHPF-FFSF21-DFFFFFNN
% 4.41/11.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.41/11.39 % Starting SubtermCWHack with 136s (1) cores
% 4.41/11.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 4.41/11.39 % Starting G-E--_208_C18_F1_SE_CS_SSP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.41/11.39 % Starting new_bool_3 with 136s (1) cores
% 4.41/11.39 % Starting new_bool_1 with 136s (1) cores
% 4.41/11.39 % new_bool_1 with pid 3476048 completed with status 0
% 4.41/11.39 % Result found by new_bool_1
% 4.41/11.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 4.41/11.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.41/11.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.41/11.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.41/11.39 % No SInE strategy applied
% 4.41/11.39 % Search class: FUHPF-FFSF21-DFFFFFNN
% 4.41/11.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.41/11.39 % Starting SubtermCWHack with 136s (1) cores
% 4.41/11.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 4.41/11.39 % Starting G-E--_208_C18_F1_SE_CS_SSP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.41/11.39 % Starting new_bool_3 with 136s (1) cores
% 4.41/11.39 % Starting new_bool_1 with 136s (1) cores
% 4.41/11.39 % Preprocessing time : 0.002 s
% 4.41/11.39 % Presaturation interreduction done
% 4.41/11.39
% 4.41/11.39 % Proof found!
% 4.41/11.39 % SZS status Unsatisfiable
% 4.41/11.39 % SZS output start CNFRefutation
% See solution above
% 4.41/11.39 % Parsed axioms : 2
% 4.41/11.39 % Removed by relevancy pruning/SinE : 0
% 4.41/11.39 % Initial clauses : 2
% 4.41/11.39 % Removed in clause preprocessing : 0
% 4.41/11.39 % Initial clauses in saturation : 2
% 4.41/11.39 % Processed clauses : 378
% 4.41/11.39 % ...of these trivial : 65
% 4.41/11.39 % ...subsumed : 220
% 4.41/11.39 % ...remaining for further processing : 93
% 4.41/11.39 % Other redundant clauses eliminated : 0
% 4.41/11.39 % Clauses deleted for lack of memory : 0
% 4.41/11.39 % Backward-subsumed : 5
% 4.41/11.39 % Backward-rewritten : 67
% 4.41/11.39 % Generated clauses : 24139
% 4.41/11.39 % ...of the previous two non-redundant : 23463
% 4.41/11.39 % ...aggressively subsumed : 0
% 4.41/11.39 % Contextual simplify-reflections : 0
% 4.41/11.39 % Paramodulations : 24139
% 4.41/11.39 % Factorizations : 0
% 4.41/11.39 % NegExts : 0
% 4.41/11.39 % Equation resolutions : 0
% 4.41/11.39 % Disequality decompositions : 0
% 4.41/11.39 % Total rewrite steps : 3840
% 4.41/11.39 % ...of those cached : 2077
% 4.41/11.39 % Propositional unsat checks : 0
% 4.41/11.39 % Propositional check models : 0
% 4.41/11.39 % Propositional check unsatisfiable : 0
% 4.41/11.39 % Propositional clauses : 0
% 4.41/11.39 % Propositional clauses after purity: 0
% 4.41/11.39 % Propositional unsat core size : 0
% 4.41/11.39 % Propositional preprocessing time : 0.000
% 4.41/11.39 % Propositional encoding time : 0.000
% 4.41/11.39 % Propositional solver time : 0.000
% 4.41/11.39 % Success case prop preproc time : 0.000
% 4.41/11.39 % Success case prop encoding time : 0.000
% 4.41/11.39 % Success case prop solver time : 0.000
% 4.41/11.39 % Current number of processed clauses : 19
% 4.41/11.39 % Positive orientable unit clauses : 15
% 4.41/11.39 % Positive unorientable unit clauses: 3
% 4.41/11.39 % Negative unit clauses : 1
% 4.41/11.39 % Non-unit-clauses : 0
% 4.41/11.39 % Current number of unprocessed clauses: 22970
% 4.41/11.39 % ...number of literals in the above : 22970
% 4.41/11.39 % Current number of archived formulas : 0
% 4.41/11.39 % Current number of archived clauses : 74
% 4.41/11.39 % Clause-clause subsumption calls (NU) : 0
% 4.41/11.39 % Rec. Clause-clause subsumption calls : 0
% 4.41/11.39 % Non-unit clause-clause subsumptions : 0
% 4.41/11.39 % Unit Clause-clause subsumption calls : 433
% 4.41/11.39 % Rewrite failures with RHS unbound : 1058
% 4.41/11.39 % BW rewrite match attempts : 1291
% 4.41/11.39 % BW rewrite match successes : 152
% 4.41/11.39 % Condensation attempts : 0
% 4.41/11.39 % Condensation successes : 0
% 4.41/11.39 % Termbank termtop insertions : 669453
% 4.41/11.39 % Search garbage collected termcells : 8
% 4.41/11.39
% 4.41/11.39 % -------------------------------------------------
% 4.41/11.39 % User time : 0.577 s
% 4.41/11.39 % System time : 0.042 s
% 4.41/11.39 % Total time : 0.619 s
% 4.41/11.39 % Maximum resident set size: 3636 pages
% 4.41/11.39
% 4.41/11.39 % -------------------------------------------------
% 4.41/11.39 % User time : 2.714 s
% 4.41/11.39 % System time : 0.175 s
% 4.41/11.39 % Total time : 2.889 s
% 4.41/11.39 % Maximum resident set size: 4608 pages
% 4.41/11.39 % E exiting
%------------------------------------------------------------------------------