%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP057-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 : n011.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:45 PM UTC 2026
% Result : Unsatisfiable 7.11s 6.65s
% Output : CNFRefutation 7.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 2
% Syntax : Number of clauses : 63 ( 59 unt; 0 nHn; 6 RR)
% Number of literals : 70 ( 69 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 17 ( 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 : 178 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(inverse(X1),X3))),X4),inverse(multiply(X2,X4))))) = X3,
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(multiply(inverse(multiply(inverse(X2),multiply(inverse(X1),X3))),X4),inverse(multiply(X2,X4))))) = X3,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),X3)),X4),inverse(multiply(X2,X4))))) = inverse(multiply(multiply(inverse(multiply(inverse(X5),multiply(inverse(inverse(X1)),X3))),X6),inverse(multiply(X5,X6)))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(X1),multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),X3)),X4),inverse(multiply(X2,X4)))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(multiply(inverse(multiply(inverse(X1),multiply(inverse(inverse(X2)),multiply(inverse(X2),X3)))),X4),inverse(multiply(X1,X4)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
multiply(inverse(X1),multiply(X1,X2)) = multiply(inverse(inverse(X3)),multiply(inverse(X3),X2)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
multiply(inverse(X1),multiply(X1,X2)) = multiply(inverse(X3),multiply(X3,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X4),inverse(multiply(inverse(X1),X4))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),multiply(X1,X4)),inverse(multiply(inverse(X5),multiply(X5,X4)))))) = X3,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
multiply(inverse(X1),multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X4),inverse(multiply(X5,X4)))))) = multiply(X5,X3),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_11,plain,
multiply(multiply(inverse(X1),multiply(X1,X2)),inverse(multiply(X3,inverse(X3)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_4]),c_0_4]) ).
cnf(c_0_12,plain,
multiply(inverse(multiply(inverse(X1),multiply(X1,X2))),X2) = multiply(inverse(multiply(inverse(X3),multiply(X3,X4))),X4),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
multiply(inverse(X1),multiply(X1,multiply(X2,inverse(multiply(multiply(inverse(multiply(inverse(X3),X4)),X5),inverse(multiply(X3,X5))))))) = multiply(inverse(inverse(X2)),X4),
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_14,plain,
multiply(inverse(inverse(X1)),multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X3)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_12]),c_0_4]) ).
cnf(c_0_15,plain,
multiply(inverse(inverse(inverse(X1))),X1) = multiply(inverse(inverse(inverse(X2))),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_4]) ).
cnf(c_0_16,plain,
multiply(inverse(X1),multiply(X1,multiply(X2,inverse(multiply(multiply(inverse(X3),X4),inverse(multiply(inverse(X3),X4))))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_17,plain,
multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(multiply(inverse(multiply(inverse(X4),multiply(inverse(inverse(multiply(inverse(X3),multiply(inverse(X1),X5)))),X2))),X6),inverse(multiply(X4,X6))))))))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_18,plain,
multiply(inverse(inverse(X1)),multiply(inverse(multiply(inverse(inverse(inverse(inverse(X2)))),multiply(inverse(inverse(inverse(X3))),X3))),X2)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,multiply(X2,inverse(multiply(X3,inverse(X3)))))) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_16]) ).
cnf(c_0_20,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),X3)),X4),inverse(multiply(X2,X4))))) = inverse(multiply(X5,inverse(multiply(X6,inverse(multiply(multiply(inverse(multiply(inverse(X7),multiply(inverse(inverse(multiply(inverse(X6),multiply(inverse(inverse(X1)),X3)))),X5))),X8),inverse(multiply(X7,X8)))))))),
inference(spm,[status(thm)],[c_0_2,c_0_17]) ).
cnf(c_0_21,plain,
multiply(inverse(inverse(X1)),multiply(inverse(X2),multiply(X2,inverse(multiply(X3,inverse(X3)))))) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
inverse(multiply(X1,inverse(X1))) = inverse(multiply(X2,inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_2]),c_0_2]) ).
cnf(c_0_23,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_14]) ).
cnf(c_0_24,plain,
multiply(X1,inverse(multiply(multiply(inverse(X2),multiply(X2,X3)),inverse(multiply(X4,multiply(multiply(inverse(X4),multiply(inverse(X1),X5)),X3)))))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_25,plain,
multiply(multiply(inverse(X1),multiply(X2,inverse(X2))),inverse(multiply(X3,inverse(X3)))) = inverse(X1),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_26,plain,
multiply(X1,inverse(inverse(multiply(X2,inverse(X2))))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_11]) ).
cnf(c_0_27,plain,
multiply(inverse(inverse(X1)),inverse(inverse(inverse(multiply(inverse(X2),inverse(inverse(X2))))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_26]),c_0_26]) ).
cnf(c_0_28,plain,
multiply(X1,inverse(X1)) = inverse(inverse(inverse(multiply(X2,inverse(X2))))),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_29,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(inverse(X1),X3))),inverse(multiply(multiply(inverse(multiply(inverse(X4),multiply(inverse(X2),X5))),X6),inverse(multiply(X4,X6))))),inverse(X5)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_30,plain,
multiply(inverse(inverse(X1)),multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_2]) ).
cnf(c_0_32,plain,
multiply(inverse(X1),multiply(X1,inverse(inverse(X2)))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_30]) ).
cnf(c_0_33,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_31]),c_0_32]),c_0_31]) ).
cnf(c_0_34,plain,
multiply(inverse(inverse(X1)),multiply(inverse(X2),multiply(X2,X3))) = multiply(inverse(X4),multiply(X4,multiply(X1,X3))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_35,plain,
multiply(inverse(X1),multiply(X1,X2)) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
multiply(inverse(inverse(X1)),inverse(inverse(X2))) = inverse(inverse(multiply(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35]) ).
cnf(c_0_37,plain,
inverse(multiply(multiply(inverse(multiply(inverse(X1),multiply(inverse(X2),multiply(X2,X3)))),X4),inverse(multiply(X1,X4)))) = X3,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_38,plain,
inverse(inverse(multiply(inverse(inverse(X1)),X2))) = multiply(X1,inverse(inverse(X2))),
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_39,plain,
inverse(multiply(multiply(inverse(multiply(inverse(X1),multiply(X1,multiply(X2,X3)))),X4),inverse(multiply(inverse(X2),X4)))) = X3,
inference(spm,[status(thm)],[c_0_37,c_0_7]) ).
cnf(c_0_40,plain,
inverse(multiply(X1,inverse(X1))) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_41,plain,
multiply(X1,inverse(inverse(multiply(inverse(X1),X2)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_35]),c_0_33]) ).
cnf(c_0_42,plain,
inverse(multiply(inverse(multiply(X1,X2)),X1)) = X2,
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_35]),c_0_36]),c_0_26]),c_0_33]) ).
cnf(c_0_43,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X3),inverse(multiply(inverse(X1),X4))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_12]) ).
cnf(c_0_44,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_35]),c_0_33]) ).
cnf(c_0_46,plain,
inverse(multiply(multiply(inverse(multiply(inverse(X1),multiply(X1,X2))),X2),inverse(multiply(inverse(X3),multiply(X3,X4))))) = X4,
inference(spm,[status(thm)],[c_0_37,c_0_12]) ).
cnf(c_0_47,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_42,c_0_45]) ).
cnf(c_0_48,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_44]),c_0_35]),c_0_35]),c_0_33]) ).
cnf(c_0_49,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,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_51,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_48]),c_0_35]),c_0_48]) ).
cnf(c_0_52,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_49,c_0_48]) ).
cnf(c_0_53,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_50 ).
cnf(c_0_54,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_51]),c_0_48]),c_0_47]) ).
cnf(c_0_55,plain,
multiply(multiply(X1,X2),multiply(inverse(X2),X3)) = multiply(X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_35]),c_0_35]),c_0_48]),c_0_52]),c_0_47]),c_0_48]) ).
cnf(c_0_56,plain,
multiply(inverse(inverse(inverse(X1))),X1) = inverse(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X3)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_57,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_53,c_0_54])]) ).
cnf(c_0_58,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_45]),c_0_48]) ).
cnf(c_0_59,plain,
multiply(inverse(inverse(inverse(X1))),X1) = inverse(multiply(inverse(multiply(inverse(inverse(inverse(inverse(X2)))),multiply(inverse(inverse(inverse(X3))),X3))),X2)),
inference(spm,[status(thm)],[c_0_56,c_0_15]) ).
cnf(c_0_60,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_61,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_48]),c_0_33]),c_0_48]),c_0_42]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_60,c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP057-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.46 % Computer : n011.cluster.edu
% 0.17/5.46 % Model : x86_64 x86_64
% 0.17/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.46 % Memory : 8046.5625MB
% 0.17/5.46 % OS : Linux 6.8.0-71-generic
% 0.17/5.46 % CPULimit : 300
% 0.17/5.46 % WCLimit : 300
% 0.17/5.46 % DateTime : Sun Sep 20 19:56:30 UTC 2026
% 0.17/5.46 % CPUTime :
% 0.17/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/5.51 Running first-order theorem proving
% 0.23/5.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
% 7.11/6.65 % Version: 3.5.1
% 7.11/6.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.11/6.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.11/6.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.11/6.65 % Starting new_bool_3 with 300s (1) cores
% 7.11/6.65 % Starting new_bool_1 with 300s (1) cores
% 7.11/6.65 % Starting sh5l with 300s (1) cores
% 7.11/6.65 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30503 completed with status 0
% 7.11/6.65 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 7.11/6.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.11/6.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.11/6.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.11/6.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.11/6.65 % No SInE strategy applied
% 7.11/6.65 % Search class: FUHPF-FFSF21-DFFFFFNN
% 7.11/6.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.11/6.65 % Starting SubtermCWHack with 136s (1) cores
% 7.11/6.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.11/6.65 % Starting G-E--_208_C18_F1_SE_CS_SSP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.11/6.65 % Starting new_bool_3 with 136s (1) cores
% 7.11/6.65 % Starting new_bool_1 with 136s (1) cores
% 7.11/6.65 % new_bool_3 with pid 30510 completed with status 0
% 7.11/6.65 % Result found by new_bool_3
% 7.11/6.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.11/6.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.11/6.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.11/6.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.11/6.65 % No SInE strategy applied
% 7.11/6.65 % Search class: FUHPF-FFSF21-DFFFFFNN
% 7.11/6.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.11/6.65 % Starting SubtermCWHack with 136s (1) cores
% 7.11/6.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.11/6.65 % Starting G-E--_208_C18_F1_SE_CS_SSP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.11/6.65 % Starting new_bool_3 with 136s (1) cores
% 7.11/6.65 % Preprocessing time : 0.001 s
% 7.11/6.65 % Presaturation interreduction done
% 7.11/6.65
% 7.11/6.65 % Proof found!
% 7.11/6.65 % SZS status Unsatisfiable
% 7.11/6.65 % SZS output start CNFRefutation
% See solution above
% 7.11/6.65 % Parsed axioms : 2
% 7.11/6.65 % Removed by relevancy pruning/SinE : 0
% 7.11/6.65 % Initial clauses : 2
% 7.11/6.65 % Removed in clause preprocessing : 0
% 7.11/6.65 % Initial clauses in saturation : 2
% 7.11/6.65 % Processed clauses : 318
% 7.11/6.65 % ...of these trivial : 79
% 7.11/6.65 % ...subsumed : 142
% 7.11/6.65 % ...remaining for further processing : 97
% 7.11/6.65 % Other redundant clauses eliminated : 0
% 7.11/6.65 % Clauses deleted for lack of memory : 0
% 7.11/6.65 % Backward-subsumed : 2
% 7.11/6.65 % Backward-rewritten : 78
% 7.11/6.65 % Generated clauses : 25106
% 7.11/6.65 % ...of the previous two non-redundant : 24281
% 7.11/6.65 % ...aggressively subsumed : 0
% 7.11/6.65 % Contextual simplify-reflections : 0
% 7.11/6.65 % Paramodulations : 25105
% 7.11/6.65 % Factorizations : 0
% 7.11/6.65 % NegExts : 0
% 7.11/6.65 % Equation resolutions : 0
% 7.11/6.65 % Disequality decompositions : 0
% 7.11/6.65 % Total rewrite steps : 15983
% 7.11/6.65 % ...of those cached : 11833
% 7.11/6.65 % Propositional unsat checks : 0
% 7.11/6.65 % Propositional check models : 0
% 7.11/6.65 % Propositional check unsatisfiable : 0
% 7.11/6.65 % Propositional clauses : 0
% 7.11/6.65 % Propositional clauses after purity: 0
% 7.11/6.65 % Propositional unsat core size : 0
% 7.11/6.65 % Propositional preprocessing time : 0.000
% 7.11/6.65 % Propositional encoding time : 0.000
% 7.11/6.65 % Propositional solver time : 0.000
% 7.11/6.65 % Success case prop preproc time : 0.000
% 7.11/6.65 % Success case prop encoding time : 0.000
% 7.11/6.65 % Success case prop solver time : 0.000
% 7.11/6.65 % Current number of processed clauses : 14
% 7.11/6.65 % Positive orientable unit clauses : 12
% 7.11/6.65 % Positive unorientable unit clauses: 2
% 7.11/6.65 % Negative unit clauses : 0
% 7.11/6.65 % Non-unit-clauses : 0
% 7.11/6.65 % Current number of unprocessed clauses: 23852
% 7.11/6.65 % ...number of literals in the above : 23852
% 7.11/6.65 % Current number of archived formulas : 0
% 7.11/6.65 % Current number of archived clauses : 83
% 7.11/6.65 % Clause-clause subsumption calls (NU) : 0
% 7.11/6.65 % Rec. Clause-clause subsumption calls : 0
% 7.11/6.65 % Non-unit clause-clause subsumptions : 0
% 7.11/6.65 % Unit Clause-clause subsumption calls : 334
% 7.11/6.65 % Rewrite failures with RHS unbound : 694
% 7.11/6.65 % BW rewrite match attempts : 1146
% 7.11/6.65 % BW rewrite match successes : 137
% 7.11/6.65 % Condensation attempts : 0
% 7.11/6.65 % Condensation successes : 0
% 7.11/6.65 % Termbank termtop insertions : 999729
% 7.11/6.65 % Search garbage collected termcells : 8
% 7.11/6.65
% 7.11/6.65 % -------------------------------------------------
% 7.11/6.65 % User time : 0.951 s
% 7.11/6.65 % System time : 0.055 s
% 7.11/6.65 % Total time : 1.006 s
% 7.11/6.65 % Maximum resident set size: 3636 pages
% 7.11/6.65
% 7.11/6.65 % -------------------------------------------------
% 7.11/6.65 % User time : 4.611 s
% 7.11/6.65 % System time : 0.276 s
% 7.11/6.65 % Total time : 4.887 s
% 7.11/6.65 % Maximum resident set size: 4608 pages
% 7.11/6.65 % E exiting
%------------------------------------------------------------------------------