%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP258-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:06 PM UTC 2026
% Result : Unsatisfiable 1.40s 0.66s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of clauses : 63 ( 19 unt; 37 nHn; 51 RR)
% Number of literals : 179 ( 178 equ; 86 neg)
% Maximal clause size : 17 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| multiply(sk_c2,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c5) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| multiply(sk_c1,sk_c12) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c4) = sk_c12
| multiply(sk_c1,sk_c12) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| inverse(sk_c2) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| inverse(sk_c1) = sk_c12 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_45,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| multiply(sk_c10,sk_c12) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_45) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c5) = sk_c11
| inverse(sk_c2) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_46,negated_conjecture,
( inverse(sk_c6) = sk_c9
| multiply(sk_c10,sk_c12) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_46) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c4) = sk_c12
| inverse(sk_c1) = sk_c12 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_71,negated_conjecture,
( multiply(X8,X7) != X9
| inverse(X9) != X7
| inverse(X8) != X9
| multiply(X7,sk_c11) != sk_c12
| inverse(X6) != X7
| multiply(X6,X7) != sk_c12
| inverse(X5) != sk_c11
| multiply(X5,sk_c11) != sk_c10
| inverse(X4) != sk_c12
| multiply(X4,sk_c12) != sk_c11
| inverse(X3) != sk_c10
| multiply(X3,sk_c10) != sk_c12
| multiply(sk_c10,sk_c12) != sk_c11
| inverse(X2) != sk_c11
| multiply(X2,sk_c11) != sk_c10
| inverse(X1) != sk_c12
| multiply(X1,sk_c12) != sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_71) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| multiply(sk_c2,sk_c11) = sk_c10 ),
prove_this_23 ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| multiply(inverse(sk_c5),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( inverse(sk_c5) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c10 ),
prove_this_24 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| multiply(sk_c1,sk_c12) = sk_c11 ),
prove_this_1 ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c1,sk_c12) = sk_c11
| multiply(inverse(sk_c4),sk_c11) = sk_c12 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( inverse(sk_c4) = sk_c12
| multiply(sk_c1,sk_c12) = sk_c11 ),
prove_this_2 ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(inverse(sk_c2),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| inverse(sk_c2) = sk_c11 ),
prove_this_33 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| multiply(sk_c1,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c5,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| multiply(inverse(sk_c1),sk_c11) = sk_c12 ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| inverse(sk_c1) = sk_c12 ),
prove_this_11 ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| multiply(sk_c10,sk_c12) = sk_c11 ),
prove_this_45 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(inverse(sk_c5),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c5) = sk_c11
| inverse(sk_c2) = sk_c11 ),
prove_this_34 ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| multiply(sk_c4,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c10,sk_c12) = sk_c11
| multiply(inverse(sk_c6),sk_c12) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c6) = sk_c9
| multiply(sk_c10,sk_c12) = sk_c11 ),
prove_this_46 ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c2) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| multiply(inverse(sk_c4),sk_c11) = sk_c12 ),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c4) = sk_c12
| inverse(sk_c1) = sk_c12 ),
prove_this_12 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c9,sk_c12) = sk_c9
| multiply(sk_c10,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
multiply(sk_c11,sk_c10) = sk_c11,
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c1) = sk_c12
| multiply(sk_c12,sk_c11) = sk_c12 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( identity = sk_c12
| multiply(sk_c10,sk_c12) = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_40]),c_0_15]) ).
cnf(c_0_44,negated_conjecture,
identity = sk_c10,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_41]),c_0_15]) ).
cnf(c_0_45,negated_conjecture,
multiply(sk_c12,sk_c11) = sk_c12,
inference(spm,[status(thm)],[c_0_29,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( sk_c10 = sk_c12
| multiply(sk_c10,sk_c12) = sk_c11 ),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
sk_c10 = sk_c11,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_45]),c_0_15]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( sk_c11 = sk_c12
| multiply(sk_c11,sk_c12) = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( multiply(X8,X7) != X9
| inverse(X9) != X7
| inverse(X8) != X9
| multiply(X7,sk_c11) != sk_c12
| inverse(X6) != X7
| multiply(X6,X7) != sk_c12
| inverse(X5) != sk_c11
| multiply(X5,sk_c11) != sk_c10
| inverse(X4) != sk_c12
| multiply(X4,sk_c12) != sk_c11
| inverse(X3) != sk_c10
| multiply(X3,sk_c10) != sk_c12
| multiply(sk_c10,sk_c12) != sk_c11
| inverse(X2) != sk_c11
| multiply(X2,sk_c11) != sk_c10
| inverse(X1) != sk_c12
| multiply(X1,sk_c12) != sk_c11 ),
inference(fof_simplification,[status(thm)],[prove_this_71]) ).
cnf(c_0_50,negated_conjecture,
sk_c11 = sk_c12,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_48]),c_0_15]),c_0_44]),c_0_47])]) ).
cnf(c_0_51,negated_conjecture,
( multiply(X8,X7) != X9
| inverse(X9) != X7
| inverse(X8) != X9
| multiply(X7,sk_c11) != sk_c12
| inverse(X6) != X7
| multiply(X6,X7) != sk_c12
| inverse(X5) != sk_c11
| multiply(X5,sk_c11) != sk_c10
| inverse(X4) != sk_c12
| multiply(X4,sk_c12) != sk_c11
| inverse(X3) != sk_c10
| multiply(X3,sk_c10) != sk_c12
| multiply(sk_c10,sk_c12) != sk_c11
| inverse(X2) != sk_c11
| multiply(X2,sk_c11) != sk_c10
| inverse(X1) != sk_c12
| multiply(X1,sk_c12) != sk_c11 ),
c_0_49 ).
cnf(c_0_52,plain,
multiply(sk_c12,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_44]),c_0_47]),c_0_50]) ).
cnf(c_0_53,plain,
multiply(inverse(X1),X1) = sk_c12,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_44]),c_0_47]),c_0_50]) ).
cnf(c_0_54,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_55,negated_conjecture,
( inverse(X7) != sk_c12
| inverse(X6) != sk_c11
| inverse(X5) != sk_c10
| inverse(X4) != sk_c12
| inverse(X3) != sk_c11
| multiply(X7,sk_c12) != sk_c11
| multiply(X6,sk_c11) != sk_c10
| multiply(X5,sk_c10) != sk_c12
| multiply(X4,sk_c12) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| multiply(X2,inverse(X2)) != sk_c12
| multiply(sk_c10,sk_c12) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c11) != sk_c12
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_51])]) ).
cnf(c_0_56,plain,
multiply(inverse(sk_c12),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_52]) ).
cnf(c_0_57,plain,
multiply(X1,sk_c12) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_53]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( inverse(X7) != sk_c12
| inverse(X6) != sk_c12
| inverse(X5) != sk_c12
| inverse(X4) != sk_c12
| inverse(X3) != sk_c12
| multiply(X7,sk_c12) != sk_c12
| multiply(X6,sk_c12) != sk_c12
| multiply(X5,sk_c12) != sk_c12
| multiply(X4,sk_c12) != sk_c12
| multiply(X3,sk_c12) != sk_c12
| multiply(X2,inverse(X2)) != sk_c12
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c12) != sk_c12
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(cn,[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(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(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_55,c_0_47]),c_0_47]),c_0_47]),c_0_47]),c_0_47]),c_0_50]),c_0_50]),c_0_52]),c_0_50]),c_0_50]),c_0_50]),c_0_50]),c_0_50]),c_0_50]),c_0_50]),c_0_50]),c_0_50]),c_0_50]),c_0_50])]) ).
cnf(c_0_59,plain,
inverse(sk_c12) = sk_c12,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( inverse(X2) != sk_c12
| multiply(X2,inverse(X2)) != sk_c12
| multiply(X1,inverse(X2)) != inverse(X1)
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[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)],[c_0_58,c_0_57]),c_0_57]),c_0_57]),c_0_57]),c_0_57]),c_0_57])])])])])]),c_0_59])]) ).
cnf(c_0_61,negated_conjecture,
( inverse(X1) != X1
| inverse(X1) != sk_c12 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_59]),c_0_57]),c_0_57]),c_0_52])]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_61,c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP258-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n020.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 20 20:08:47 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 1.40/0.66 % Version: 3.5.1
% 1.40/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.40/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.40/0.66 % Starting new_bool_3 with 300s (1) cores
% 1.40/0.66 % Starting new_bool_1 with 300s (1) cores
% 1.40/0.66 % Starting sh5l with 300s (1) cores
% 1.40/0.66 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1113647 completed with status 0
% 1.40/0.66 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.40/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.40/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.40/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.40/0.66 % No SInE strategy applied
% 1.40/0.66 % Search class: FGHPS-FFMM21-SFFFFFNN
% 1.40/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.40/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.40/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.40/0.66 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.40/0.66 % Starting new_bool_3 with 136s (1) cores
% 1.40/0.66 % Starting new_bool_1 with 136s (1) cores
% 1.40/0.66 % new_bool_3 with pid 1113655 completed with status 0
% 1.40/0.66 % Result found by new_bool_3
% 1.40/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.40/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.40/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.40/0.66 % No SInE strategy applied
% 1.40/0.66 % Search class: FGHPS-FFMM21-SFFFFFNN
% 1.40/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.40/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.40/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.40/0.66 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.40/0.66 % Starting new_bool_3 with 136s (1) cores
% 1.40/0.66 % Preprocessing time : 0.002 s
% 1.40/0.66 % Presaturation interreduction done
% 1.40/0.66
% 1.40/0.66 % Proof found!
% 1.40/0.66 % SZS status Unsatisfiable
% 1.40/0.66 % SZS output start CNFRefutation
% See solution above
% 1.40/0.66 % Parsed axioms : 74
% 1.40/0.66 % Removed by relevancy pruning/SinE : 0
% 1.40/0.66 % Initial clauses : 74
% 1.40/0.66 % Removed in clause preprocessing : 0
% 1.40/0.66 % Initial clauses in saturation : 74
% 1.40/0.66 % Processed clauses : 3011
% 1.40/0.66 % ...of these trivial : 61
% 1.40/0.66 % ...subsumed : 2064
% 1.40/0.66 % ...remaining for further processing : 886
% 1.40/0.66 % Other redundant clauses eliminated : 7
% 1.40/0.66 % Clauses deleted for lack of memory : 0
% 1.40/0.66 % Backward-subsumed : 176
% 1.40/0.66 % Backward-rewritten : 418
% 1.40/0.66 % Generated clauses : 8368
% 1.40/0.66 % ...of the previous two non-redundant : 7540
% 1.40/0.66 % ...aggressively subsumed : 0
% 1.40/0.66 % Contextual simplify-reflections : 13
% 1.40/0.66 % Paramodulations : 8358
% 1.40/0.66 % Factorizations : 0
% 1.40/0.66 % NegExts : 0
% 1.40/0.66 % Equation resolutions : 11
% 1.40/0.66 % Disequality decompositions : 0
% 1.40/0.66 % Total rewrite steps : 4557
% 1.40/0.66 % ...of those cached : 4410
% 1.40/0.66 % Propositional unsat checks : 0
% 1.40/0.66 % Propositional check models : 0
% 1.40/0.66 % Propositional check unsatisfiable : 0
% 1.40/0.66 % Propositional clauses : 0
% 1.40/0.66 % Propositional clauses after purity: 0
% 1.40/0.66 % Propositional unsat core size : 0
% 1.40/0.66 % Propositional preprocessing time : 0.000
% 1.40/0.66 % Propositional encoding time : 0.000
% 1.40/0.66 % Propositional solver time : 0.000
% 1.40/0.66 % Success case prop preproc time : 0.000
% 1.40/0.66 % Success case prop encoding time : 0.000
% 1.40/0.66 % Success case prop solver time : 0.000
% 1.40/0.66 % Current number of processed clauses : 217
% 1.40/0.66 % Positive orientable unit clauses : 15
% 1.40/0.66 % Positive unorientable unit clauses: 0
% 1.40/0.66 % Negative unit clauses : 0
% 1.40/0.66 % Non-unit-clauses : 202
% 1.40/0.66 % Current number of unprocessed clauses: 3164
% 1.40/0.66 % ...number of literals in the above : 10968
% 1.40/0.66 % Current number of archived formulas : 0
% 1.40/0.66 % Current number of archived clauses : 668
% 1.40/0.66 % Clause-clause subsumption calls (NU) : 25066
% 1.40/0.66 % Rec. Clause-clause subsumption calls : 14151
% 1.40/0.66 % Non-unit clause-clause subsumptions : 2207
% 1.40/0.66 % Unit Clause-clause subsumption calls : 706
% 1.40/0.66 % Rewrite failures with RHS unbound : 0
% 1.40/0.66 % BW rewrite match attempts : 52
% 1.40/0.66 % BW rewrite match successes : 43
% 1.40/0.66 % Condensation attempts : 0
% 1.40/0.66 % Condensation successes : 0
% 1.40/0.66 % Termbank termtop insertions : 94872
% 1.40/0.66 % Search garbage collected termcells : 49
% 1.40/0.66
% 1.40/0.66 % -------------------------------------------------
% 1.40/0.66 % User time : 0.150 s
% 1.40/0.66 % System time : 0.007 s
% 1.40/0.66 % Total time : 0.157 s
% 1.40/0.66 % Maximum resident set size: 3412 pages
% 1.40/0.66
% 1.40/0.66 % -------------------------------------------------
% 1.40/0.66 % User time : 0.810 s
% 1.40/0.66 % System time : 0.047 s
% 1.40/0.66 % Total time : 0.857 s
% 1.40/0.66 % Maximum resident set size: 4608 pages
% 1.40/0.66 % E exiting
%------------------------------------------------------------------------------