%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP052-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:44 PM UTC 2026
% Result : Unsatisfiable 8.66s 1.71s
% Output : CNFRefutation 8.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 2
% Syntax : Number of clauses : 57 ( 52 unt; 0 nHn; 7 RR)
% Number of literals : 65 ( 64 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 15 ( 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 : 164 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(multiply(X1,inverse(X2))),X3))),X2))) = X3,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(multiply(X1,inverse(X2))),X3))),X2))) = X3,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(X3)),X2))) = inverse(multiply(multiply(multiply(inverse(X4),X4),inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),inverse(X4))),X3))),X4)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(inverse(multiply(X2,inverse(X3))),inverse(X1))),multiply(inverse(multiply(X2,inverse(X3))),X4)))),X1)) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(X3)),X2)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(X2,inverse(X1))),multiply(X2,X3)))),X1)) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,X3)) = multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),multiply(X3,inverse(multiply(multiply(multiply(inverse(X4),X4),inverse(X5)),X4)))),X2))) = inverse(multiply(multiply(multiply(inverse(X6),X6),inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),inverse(X6))),multiply(multiply(multiply(inverse(X7),X7),inverse(multiply(inverse(multiply(inverse(multiply(X3,inverse(X4))),inverse(X7))),X5))),X7)))),X6)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(X4,multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(multiply(X5,inverse(X2))),multiply(X5,X4)))),X3)),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_11,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,X3)))),X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_2]),c_0_2]) ).
cnf(c_0_12,plain,
multiply(multiply(multiply(inverse(inverse(X1)),inverse(X1)),inverse(multiply(inverse(multiply(inverse(multiply(X2,inverse(X3))),inverse(inverse(X1)))),X4))),inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(multiply(X2,inverse(multiply(multiply(multiply(inverse(X3),X3),inverse(X4)),X3))),X5))),X1))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_13,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(X2),X2))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(X2),X2))),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_5]) ).
cnf(c_0_15,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X2)) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_16,plain,
multiply(inverse(inverse(X1)),inverse(X1)) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_14]),c_0_15]) ).
cnf(c_0_17,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_16,c_0_16]) ).
cnf(c_0_18,plain,
multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(X2),X2))),X3) = X3,
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_19,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_18]),c_0_18]) ).
cnf(c_0_20,plain,
multiply(X1,multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(inverse(X2)),X1))),X3)) = multiply(inverse(X2),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_19]),c_0_19]) ).
cnf(c_0_21,plain,
multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(X2),X3)) = multiply(inverse(X2),X3),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_22,plain,
multiply(inverse(inverse(X1)),inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(X2)),X1))) = X2,
inference(rw,[status(thm)],[c_0_5,c_0_19]) ).
cnf(c_0_23,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(inverse(X1)),X2))),X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_18]),c_0_18]) ).
cnf(c_0_24,plain,
multiply(X1,multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(X3),X1))),X4)) = multiply(X3,X4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_6]),c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
multiply(inverse(multiply(inverse(X1),X1)),X2) = X2,
inference(spm,[status(thm)],[c_0_21,c_0_2]) ).
cnf(c_0_26,plain,
multiply(inverse(inverse(X1)),inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(X3)),X1))) = X3,
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_27,plain,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),X3),X2))) = inverse(multiply(multiply(multiply(inverse(X4),X4),inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),inverse(X4))),multiply(multiply(multiply(inverse(X5),X5),inverse(multiply(inverse(inverse(X5)),X3))),X5)))),X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_6]),c_0_19]) ).
cnf(c_0_28,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(inverse(X2)),X3))),X2)) = X3,
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_29,plain,
multiply(X1,multiply(multiply(multiply(inverse(X2),X2),inverse(X1)),X3)) = multiply(multiply(inverse(X4),X4),X3),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(inverse(X1)),inverse(X2)))),X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]),c_0_28]) ).
cnf(c_0_31,plain,
multiply(multiply(inverse(inverse(X1)),inverse(X2)),X2) = multiply(multiply(inverse(X3),X3),X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
multiply(multiply(inverse(inverse(X1)),inverse(X2)),X2) = multiply(multiply(inverse(inverse(X1)),inverse(X3)),X3),
inference(spm,[status(thm)],[c_0_31,c_0_31]) ).
cnf(c_0_33,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X1,X2)),multiply(X1,X2)),inverse(multiply(inverse(multiply(X3,inverse(multiply(X4,X2)))),multiply(X3,X5)))),multiply(X4,X2))) = X5,
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_34,plain,
multiply(multiply(inverse(X1),inverse(X2)),X2) = multiply(multiply(inverse(X1),inverse(X3)),X3),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X3,X4))) = multiply(inverse(multiply(inverse(multiply(X3,X5)),X2)),multiply(inverse(multiply(X6,X5)),multiply(X6,X4))),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_36,plain,
multiply(multiply(X1,multiply(multiply(multiply(inverse(X2),X2),inverse(X1)),inverse(multiply(inverse(X3),X3)))),X4) = X4,
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_37,plain,
multiply(multiply(X1,inverse(X2)),X2) = multiply(multiply(X1,inverse(X3)),X3),
inference(spm,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_38,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(X2),X4)) = multiply(inverse(X3),multiply(X1,X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_19]),c_0_19]) ).
cnf(c_0_39,plain,
multiply(multiply(multiply(multiply(inverse(X1),X1),inverse(X2)),X2),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_25]) ).
cnf(c_0_40,plain,
multiply(multiply(multiply(inverse(inverse(inverse(multiply(inverse(X1),X1)))),inverse(X2)),X2),X3) = X3,
inference(spm,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_41,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_42,plain,
multiply(inverse(multiply(inverse(multiply(X1,multiply(inverse(X2),X2))),X3)),X4) = multiply(inverse(X3),multiply(X1,X4)),
inference(spm,[status(thm)],[c_0_38,c_0_25]) ).
cnf(c_0_43,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,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_41 ).
cnf(c_0_45,plain,
multiply(X1,multiply(inverse(multiply(X1,multiply(inverse(X2),X2))),X3)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_42]),c_0_28]) ).
cnf(c_0_46,plain,
multiply(inverse(multiply(inverse(X1),X2)),multiply(inverse(X3),X3)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_47,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_43]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(sr,[status(thm)],[c_0_44,c_0_17]) ).
cnf(c_0_49,plain,
multiply(inverse(X1),multiply(X2,multiply(inverse(multiply(inverse(X1),multiply(X2,multiply(inverse(X3),X3)))),X4))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_45]),c_0_46]) ).
cnf(c_0_50,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_47,c_0_17]) ).
cnf(c_0_51,negated_conjecture,
( multiply(multiply(inverse(X1),X1),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(spm,[status(thm)],[c_0_48,c_0_17]) ).
cnf(c_0_52,plain,
multiply(X1,multiply(X2,multiply(inverse(multiply(X1,multiply(X2,multiply(inverse(X3),X3)))),X4))) = X4,
inference(spm,[status(thm)],[c_0_49,c_0_33]) ).
cnf(c_0_53,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_50]),c_0_25]) ).
cnf(c_0_54,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_43])]) ).
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_52,c_0_53]),c_0_50]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP052-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 19:55:42 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 8.66/1.71 % Version: 3.5.1
% 8.66/1.71 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.66/1.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.66/1.71 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.66/1.71 % Starting new_bool_3 with 300s (1) cores
% 8.66/1.71 % Starting new_bool_1 with 300s (1) cores
% 8.66/1.71 % Starting sh5l with 300s (1) cores
% 8.66/1.71 % new_bool_1 with pid 1127784 completed with status 0
% 8.66/1.71 % Result found by new_bool_1
% 8.66/1.71 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.66/1.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.66/1.71 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.66/1.71 % Starting new_bool_3 with 300s (1) cores
% 8.66/1.71 % Starting new_bool_1 with 300s (1) cores
% 8.66/1.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 8.66/1.71 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.66/1.71 % Search class: FUHPF-FFSF21-DFFFFFNN
% 8.66/1.71 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.66/1.71 % Starting SubtermCWHack with 31s (1) cores
% 8.66/1.71 % SubtermCWHack with pid 1127790 completed with status 0
% 8.66/1.71 % Result found by SubtermCWHack
% 8.66/1.71 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.66/1.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.66/1.71 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.66/1.71 % Starting new_bool_3 with 300s (1) cores
% 8.66/1.71 % Starting new_bool_1 with 300s (1) cores
% 8.66/1.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 8.66/1.71 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.66/1.71 % Search class: FUHPF-FFSF21-DFFFFFNN
% 8.66/1.71 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.66/1.71 % Starting SubtermCWHack with 31s (1) cores
% 8.66/1.71 % Preprocessing time : 0.001 s
% 8.66/1.71
% 8.66/1.71 % Proof found!
% 8.66/1.71 % SZS status Unsatisfiable
% 8.66/1.71 % SZS output start CNFRefutation
% See solution above
% 8.66/1.71 % Parsed axioms : 2
% 8.66/1.71 % Removed by relevancy pruning/SinE : 0
% 8.66/1.71 % Initial clauses : 2
% 8.66/1.71 % Removed in clause preprocessing : 0
% 8.66/1.71 % Initial clauses in saturation : 2
% 8.66/1.71 % Processed clauses : 707
% 8.66/1.71 % ...of these trivial : 214
% 8.66/1.71 % ...subsumed : 363
% 8.66/1.71 % ...remaining for further processing : 130
% 8.66/1.71 % Other redundant clauses eliminated : 0
% 8.66/1.71 % Clauses deleted for lack of memory : 0
% 8.66/1.71 % Backward-subsumed : 6
% 8.66/1.71 % Backward-rewritten : 89
% 8.66/1.71 % Generated clauses : 45861
% 8.66/1.71 % ...of the previous two non-redundant : 42956
% 8.66/1.71 % ...aggressively subsumed : 0
% 8.66/1.71 % Contextual simplify-reflections : 0
% 8.66/1.71 % Paramodulations : 45860
% 8.66/1.71 % Factorizations : 0
% 8.66/1.71 % NegExts : 0
% 8.66/1.71 % Equation resolutions : 0
% 8.66/1.71 % Disequality decompositions : 0
% 8.66/1.71 % Total rewrite steps : 209980
% 8.66/1.71 % ...of those cached : 186209
% 8.66/1.72 % Propositional unsat checks : 0
% 8.66/1.72 % Propositional check models : 0
% 8.66/1.72 % Propositional check unsatisfiable : 0
% 8.66/1.72 % Propositional clauses : 0
% 8.66/1.72 % Propositional clauses after purity: 0
% 8.66/1.72 % Propositional unsat core size : 0
% 8.66/1.72 % Propositional preprocessing time : 0.000
% 8.66/1.72 % Propositional encoding time : 0.000
% 8.66/1.72 % Propositional solver time : 0.000
% 8.66/1.72 % Success case prop preproc time : 0.000
% 8.66/1.72 % Success case prop encoding time : 0.000
% 8.66/1.72 % Success case prop solver time : 0.000
% 8.66/1.72 % Current number of processed clauses : 34
% 8.66/1.72 % Positive orientable unit clauses : 31
% 8.66/1.72 % Positive unorientable unit clauses: 3
% 8.66/1.72 % Negative unit clauses : 0
% 8.66/1.72 % Non-unit-clauses : 0
% 8.66/1.72 % Current number of unprocessed clauses: 41879
% 8.66/1.72 % ...number of literals in the above : 41931
% 8.66/1.72 % Current number of archived formulas : 0
% 8.66/1.72 % Current number of archived clauses : 96
% 8.66/1.72 % Clause-clause subsumption calls (NU) : 6
% 8.66/1.72 % Rec. Clause-clause subsumption calls : 6
% 8.66/1.72 % Non-unit clause-clause subsumptions : 6
% 8.66/1.72 % Unit Clause-clause subsumption calls : 628
% 8.66/1.72 % Rewrite failures with RHS unbound : 1092
% 8.66/1.72 % BW rewrite match attempts : 1885
% 8.66/1.72 % BW rewrite match successes : 276
% 8.66/1.72 % Condensation attempts : 0
% 8.66/1.72 % Condensation successes : 0
% 8.66/1.72 % Termbank termtop insertions : 3172631
% 8.66/1.72 % Search garbage collected termcells : 8
% 8.66/1.72
% 8.66/1.72 % -------------------------------------------------
% 8.66/1.72 % User time : 1.105 s
% 8.66/1.72 % System time : 0.054 s
% 8.66/1.72 % Total time : 1.159 s
% 8.66/1.72 % Maximum resident set size: 3640 pages
% 8.66/1.72
% 8.66/1.72 % -------------------------------------------------
% 8.66/1.72 % User time : 1.107 s
% 8.66/1.72 % System time : 0.058 s
% 8.66/1.72 % Total time : 1.165 s
% 8.66/1.72 % Maximum resident set size: 4608 pages
% 8.66/1.72 % E exiting
%------------------------------------------------------------------------------