%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP423-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:39:46 PM UTC 2026
% Result : Unsatisfiable 1.98s 0.77s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 2
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 5 RR)
% Number of literals : 55 ( 54 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 136 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))) = multiply(inverse(X3),inverse(multiply(inverse(X2),multiply(inverse(inverse(multiply(inverse(X3),X3))),inverse(multiply(inverse(inverse(multiply(inverse(X3),X3))),inverse(multiply(inverse(X3),X3)))))))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))) = inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,X3))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(inverse(multiply(X1,inverse(multiply(X2,multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),multiply(inverse(X5),inverse(multiply(inverse(X5),X5))))))),multiply(X4,X5)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_6,plain,
inverse(multiply(inverse(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3)))),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_4]),c_0_2]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(inverse(X2)),multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))))),multiply(X1,X3)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_3]),c_0_6]) ).
cnf(c_0_9,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(multiply(X4,X2)),multiply(X4,X5))) = multiply(inverse(multiply(X6,X3)),multiply(X6,multiply(X1,X5))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))),multiply(inverse(multiply(X4,X2)),X5)) = multiply(inverse(multiply(X6,multiply(X4,X3))),multiply(X6,X5)),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_11,plain,
multiply(X1,multiply(inverse(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,X3)))),X4)) = multiply(inverse(multiply(X5,multiply(inverse(X3),inverse(multiply(inverse(X3),X3))))),multiply(X5,X4)),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_12,plain,
multiply(inverse(inverse(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,X3)))),multiply(inverse(X3),inverse(multiply(inverse(X3),X3)))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_3]) ).
cnf(c_0_13,plain,
multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,multiply(X2,X4))) = multiply(inverse(multiply(X5,multiply(X6,X3))),multiply(X5,multiply(X6,X4))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
multiply(inverse(X1),X1) = multiply(inverse(multiply(a3,multiply(a3,inverse(multiply(inverse(X2),X2))))),multiply(a3,multiply(a3,inverse(multiply(inverse(X2),X2))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_16,plain,
inverse(multiply(inverse(inverse(multiply(inverse(X1),X1))),multiply(inverse(X2),inverse(multiply(inverse(X2),X2))))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(inverse(multiply(inverse(X1),X1))),multiply(inverse(X2),inverse(multiply(inverse(X3),X3))))) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_18,plain,
inverse(multiply(inverse(inverse(multiply(inverse(X1),X1))),multiply(inverse(X2),X2))) = inverse(multiply(inverse(X3),X3)),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_19,plain,
multiply(inverse(multiply(X1,X2)),inverse(multiply(inverse(X3),multiply(inverse(a3),a3)))) = inverse(multiply(inverse(multiply(a3,X3)),multiply(a3,multiply(X1,X2)))),
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_3,c_0_7]),c_0_9]),c_0_15]),c_0_15]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_20,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(inverse(X2)),multiply(inverse(multiply(X3,X4)),inverse(multiply(inverse(multiply(X5,X4)),multiply(X5,X4)))))))),multiply(X1,multiply(X3,X4))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_21,plain,
multiply(inverse(inverse(multiply(inverse(X1),X1))),multiply(inverse(X2),X2)) = multiply(inverse(X3),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_18]),c_0_8]) ).
cnf(c_0_22,plain,
multiply(inverse(X1),inverse(multiply(inverse(X2),multiply(inverse(a3),a3)))) = inverse(multiply(inverse(multiply(a3,X2)),multiply(a3,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(X4),X4)) = multiply(inverse(multiply(a3,X3)),multiply(a3,multiply(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_15]),c_0_9]) ).
cnf(c_0_24,plain,
inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,inverse(multiply(inverse(X4),X4))))))),multiply(X1,X4))) = multiply(inverse(X4),X3),
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_25,plain,
inverse(multiply(inverse(multiply(a3,X1)),multiply(a3,inverse(multiply(inverse(X1),multiply(inverse(a3),a3)))))) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_21]) ).
cnf(c_0_26,plain,
multiply(inverse(multiply(inverse(X1),X2)),multiply(inverse(X3),X3)) = multiply(inverse(multiply(a3,X2)),multiply(a3,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_27,plain,
inverse(multiply(inverse(a3),a3)) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_15]),c_0_15]) ).
cnf(c_0_28,plain,
inverse(multiply(inverse(X1),X1)) = multiply(inverse(X1),X1),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_29,plain,
multiply(multiply(inverse(a3),a3),multiply(inverse(multiply(X1,X2)),X3)) = multiply(inverse(multiply(a3,multiply(X1,X2))),multiply(a3,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_28]),c_0_10]),c_0_15]) ).
cnf(c_0_30,plain,
inverse(multiply(multiply(inverse(X1),X1),multiply(inverse(X2),multiply(inverse(X3),X3)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_28]),c_0_28]) ).
cnf(c_0_31,plain,
multiply(multiply(inverse(a3),a3),multiply(inverse(X1),X2)) = multiply(inverse(multiply(a3,X1)),multiply(a3,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_32,plain,
inverse(multiply(inverse(multiply(a3,X1)),multiply(a3,multiply(inverse(X2),X2)))) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
multiply(multiply(inverse(X1),X1),multiply(inverse(X1),X1)) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_28]),c_0_21]) ).
cnf(c_0_34,plain,
multiply(multiply(inverse(X1),X1),multiply(inverse(X2),X2)) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_28]),c_0_15]) ).
cnf(c_0_35,plain,
multiply(inverse(inverse(X1)),multiply(inverse(a3),a3)) = X1,
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_12,c_0_32]),c_0_28]),c_0_28]),c_0_33]),c_0_28]),c_0_34]) ).
cnf(c_0_36,plain,
inverse(multiply(inverse(X1),multiply(inverse(a3),a3))) = X1,
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_6,c_0_32]),c_0_28]),c_0_28]),c_0_33]),c_0_28]),c_0_34]) ).
cnf(c_0_37,plain,
inverse(multiply(multiply(inverse(X1),X1),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_30,c_0_35]) ).
cnf(c_0_38,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_36]) ).
cnf(c_0_39,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
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_3,c_0_38]),c_0_38]),c_0_28]),c_0_28]),c_0_15]),c_0_28]),c_0_34]),c_0_36]) ).
cnf(c_0_40,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
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_17,c_0_39]),c_0_28]),c_0_39]),c_0_28]),c_0_38]),c_0_39]) ).
cnf(c_0_41,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_42,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(spm,[status(thm)],[c_0_38,c_0_41]) ).
cnf(c_0_43,plain,
multiply(multiply(X1,inverse(X2)),X2) = X1,
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_8,c_0_42]),c_0_41]),c_0_28]),c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_44,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_41]) ).
cnf(c_0_45,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_39,c_0_41]) ).
cnf(c_0_46,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_41]) ).
cnf(c_0_47,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_46]),c_0_41]) ).
cnf(c_0_48,plain,
multiply(inverse(multiply(a3,X1)),multiply(a3,X2)) = multiply(inverse(X1),X2),
inference(rw,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_49,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_50,plain,
multiply(multiply(a3,X1),multiply(inverse(X1),X2)) = multiply(a3,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_41]) ).
cnf(c_0_51,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_47,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_49 ).
cnf(c_0_53,plain,
multiply(multiply(a3,X1),X2) = multiply(a3,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_41]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP423-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.34 % Computer : n018.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Sun Sep 20 20:15:12 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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
% 1.98/0.77 % Version: 3.5.1
% 1.98/0.77 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.98/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/0.77 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.98/0.77 % Starting new_bool_3 with 300s (1) cores
% 1.98/0.77 % Starting new_bool_1 with 300s (1) cores
% 1.98/0.77 % Starting sh5l with 300s (1) cores
% 1.98/0.77 % new_bool_3 with pid 93043 completed with status 9
% 1.98/0.77 % new_bool_1 with pid 93044 completed with status 9
% 1.98/0.77 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 93042 completed with status 0
% 1.98/0.77 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.98/0.77 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.98/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/0.77 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.98/0.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.98/0.77 % No SInE strategy applied
% 1.98/0.77 % Search class: FUUPF-FFSF21-DFFFFFNN
% 1.98/0.77 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.98/0.77 % Starting SubtermCWHack with 136s (1) cores
% 1.98/0.77 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.98/0.77 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.98/0.77 % Starting new_bool_3 with 136s (1) cores
% 1.98/0.77 % Starting new_bool_1 with 136s (1) cores
% 1.98/0.77 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 93049 completed with status 0
% 1.98/0.77 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 1.98/0.77 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.98/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/0.77 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.98/0.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.98/0.77 % No SInE strategy applied
% 1.98/0.77 % Search class: FUUPF-FFSF21-DFFFFFNN
% 1.98/0.77 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.98/0.77 % Starting SubtermCWHack with 136s (1) cores
% 1.98/0.77 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.98/0.77 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.98/0.77 % Preprocessing time : 0.001 s
% 1.98/0.77 % Presaturation interreduction done
% 1.98/0.77
% 1.98/0.77 % Proof found!
% 1.98/0.77 % SZS status Unsatisfiable
% 1.98/0.77 % SZS output start CNFRefutation
% See solution above
% 1.98/0.77 % Parsed axioms : 2
% 1.98/0.77 % Removed by relevancy pruning/SinE : 0
% 1.98/0.77 % Initial clauses : 2
% 1.98/0.77 % Removed in clause preprocessing : 0
% 1.98/0.77 % Initial clauses in saturation : 2
% 1.98/0.77 % Processed clauses : 402
% 1.98/0.77 % ...of these trivial : 83
% 1.98/0.77 % ...subsumed : 221
% 1.98/0.77 % ...remaining for further processing : 98
% 1.98/0.77 % Other redundant clauses eliminated : 0
% 1.98/0.77 % Clauses deleted for lack of memory : 0
% 1.98/0.77 % Backward-subsumed : 2
% 1.98/0.77 % Backward-rewritten : 66
% 1.98/0.77 % Generated clauses : 10786
% 1.98/0.77 % ...of the previous two non-redundant : 9898
% 1.98/0.77 % ...aggressively subsumed : 0
% 1.98/0.77 % Contextual simplify-reflections : 0
% 1.98/0.77 % Paramodulations : 10786
% 1.98/0.77 % Factorizations : 0
% 1.98/0.77 % NegExts : 0
% 1.98/0.77 % Equation resolutions : 0
% 1.98/0.77 % Disequality decompositions : 0
% 1.98/0.77 % Total rewrite steps : 10905
% 1.98/0.77 % ...of those cached : 8445
% 1.98/0.77 % Propositional unsat checks : 0
% 1.98/0.77 % Propositional check models : 0
% 1.98/0.77 % Propositional check unsatisfiable : 0
% 1.98/0.77 % Propositional clauses : 0
% 1.98/0.77 % Propositional clauses after purity: 0
% 1.98/0.77 % Propositional unsat core size : 0
% 1.98/0.77 % Propositional preprocessing time : 0.000
% 1.98/0.77 % Propositional encoding time : 0.000
% 1.98/0.77 % Propositional solver time : 0.000
% 1.98/0.77 % Success case prop preproc time : 0.000
% 1.98/0.77 % Success case prop encoding time : 0.000
% 1.98/0.77 % Success case prop solver time : 0.000
% 1.98/0.77 % Current number of processed clauses : 28
% 1.98/0.77 % Positive orientable unit clauses : 22
% 1.98/0.77 % Positive unorientable unit clauses: 6
% 1.98/0.77 % Negative unit clauses : 0
% 1.98/0.77 % Non-unit-clauses : 0
% 1.98/0.77 % Current number of unprocessed clauses: 9055
% 1.98/0.77 % ...number of literals in the above : 9055
% 1.98/0.77 % Current number of archived formulas : 0
% 1.98/0.77 % Current number of archived clauses : 70
% 1.98/0.77 % Clause-clause subsumption calls (NU) : 0
% 1.98/0.77 % Rec. Clause-clause subsumption calls : 0
% 1.98/0.77 % Non-unit clause-clause subsumptions : 0
% 1.98/0.77 % Unit Clause-clause subsumption calls : 112
% 1.98/0.77 % Rewrite failures with RHS unbound : 0
% 1.98/0.77 % BW rewrite match attempts : 678
% 1.98/0.77 % BW rewrite match successes : 118
% 1.98/0.77 % Condensation attempts : 0
% 1.98/0.77 % Condensation successes : 0
% 1.98/0.77 % Termbank termtop insertions : 336177
% 1.98/0.77 % Search garbage collected termcells : 2
% 1.98/0.77
% 1.98/0.77 % -------------------------------------------------
% 1.98/0.77 % User time : 0.338 s
% 1.98/0.77 % System time : 0.011 s
% 1.98/0.77 % Total time : 0.349 s
% 1.98/0.77 % Maximum resident set size: 3636 pages
% 1.98/0.77
% 1.98/0.77 % -------------------------------------------------
% 1.98/0.77 % User time : 1.713 s
% 1.98/0.77 % System time : 0.092 s
% 1.98/0.77 % Total time : 1.805 s
% 1.98/0.77 % Maximum resident set size: 4864 pages
% 1.98/0.77 % E exiting
%------------------------------------------------------------------------------