%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP312-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:39:15 PM UTC 2026
% Result : Unsatisfiable 1.28s 0.59s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of clauses : 62 ( 19 unt; 36 nHn; 50 RR)
% Number of literals : 177 ( 176 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/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| multiply(sk_c2,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| multiply(sk_c1,sk_c12) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c5) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c4) = sk_c12
| multiply(sk_c1,sk_c12) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_43,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| inverse(sk_c2) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_43) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| inverse(sk_c1) = sk_c12 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_44,negated_conjecture,
( inverse(sk_c5) = sk_c11
| inverse(sk_c2) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_44) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| multiply(sk_c11,sk_c12) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c4) = sk_c12
| inverse(sk_c1) = sk_c12 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_6,negated_conjecture,
( inverse(sk_c6) = sk_c9
| multiply(sk_c11,sk_c12) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
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_c11
| multiply(X3,sk_c11) != sk_c12
| inverse(X2) != sk_c11
| multiply(X2,sk_c11) != sk_c10
| inverse(X1) != sk_c12
| multiply(X1,sk_c12) != sk_c11
| multiply(sk_c11,sk_c12) != sk_c10 ),
file('/export/starexec/sandbox2/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_33 ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| multiply(sk_c1,sk_c12) = sk_c11 ),
prove_this_11 ).
cnf(c_0_20,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_21,negated_conjecture,
( inverse(sk_c5) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c10 ),
prove_this_34 ).
cnf(c_0_22,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_19]) ).
cnf(c_0_23,negated_conjecture,
( inverse(sk_c4) = sk_c12
| multiply(sk_c1,sk_c12) = sk_c11 ),
prove_this_12 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| multiply(sk_c1,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,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_24]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| inverse(sk_c2) = sk_c11 ),
prove_this_43 ).
cnf(c_0_28,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_25]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| inverse(sk_c1) = sk_c12 ),
prove_this_21 ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c5,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| multiply(sk_c4,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
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_30]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c5) = sk_c11
| inverse(sk_c2) = sk_c11 ),
prove_this_44 ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| multiply(sk_c11,sk_c12) = sk_c10 ),
prove_this_5 ).
cnf(c_0_35,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_31]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c4) = sk_c12
| inverse(sk_c1) = sk_c12 ),
prove_this_22 ).
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_c11,sk_c12) = sk_c10
| multiply(inverse(sk_c6),sk_c12) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c6) = sk_c9
| multiply(sk_c11,sk_c12) = sk_c10 ),
prove_this_6 ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c1) = sk_c12
| multiply(sk_c12,sk_c11) = sk_c12 ),
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_26,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c9,sk_c12) = sk_c9
| multiply(sk_c11,sk_c12) = sk_c10 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
multiply(sk_c12,sk_c11) = sk_c12,
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
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(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_c11
| multiply(X3,sk_c11) != sk_c12
| inverse(X2) != sk_c11
| multiply(X2,sk_c11) != sk_c10
| inverse(X1) != sk_c12
| multiply(X1,sk_c12) != sk_c11
| multiply(sk_c11,sk_c12) != sk_c10 ),
inference(fof_simplification,[status(thm)],[prove_this_71]) ).
cnf(c_0_46,negated_conjecture,
( identity = sk_c12
| multiply(sk_c11,sk_c12) = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_42]),c_0_15]) ).
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_43]),c_0_15]),c_0_44]) ).
cnf(c_0_48,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_c11
| multiply(X3,sk_c11) != sk_c12
| inverse(X2) != sk_c11
| multiply(X2,sk_c11) != sk_c10
| inverse(X1) != sk_c12
| multiply(X1,sk_c12) != sk_c11
| multiply(sk_c11,sk_c12) != sk_c10 ),
c_0_45 ).
cnf(c_0_49,negated_conjecture,
( sk_c12 = sk_c11
| multiply(sk_c11,sk_c12) = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_44]),c_0_47]),c_0_47]) ).
cnf(c_0_50,plain,
multiply(sk_c11,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_44]),c_0_47]) ).
cnf(c_0_51,plain,
multiply(inverse(X1),X1) = sk_c11,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_44]),c_0_47]) ).
cnf(c_0_52,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_53,negated_conjecture,
( inverse(X7) != sk_c12
| inverse(X6) != sk_c11
| inverse(X5) != sk_c11
| inverse(X4) != sk_c12
| inverse(X3) != sk_c11
| multiply(X7,sk_c12) != sk_c11
| multiply(X6,sk_c11) != sk_c10
| multiply(X5,sk_c11) != sk_c12
| multiply(X4,sk_c12) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| multiply(X2,inverse(X2)) != sk_c12
| multiply(sk_c11,sk_c12) != sk_c10
| 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_48])]) ).
cnf(c_0_54,negated_conjecture,
sk_c12 = sk_c11,
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_49]),c_0_15]),c_0_44]),c_0_47])]) ).
cnf(c_0_55,plain,
multiply(inverse(sk_c11),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_50]) ).
cnf(c_0_56,plain,
multiply(X1,sk_c11) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_51]),c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( inverse(X7) != sk_c11
| inverse(X6) != sk_c11
| inverse(X5) != sk_c11
| inverse(X4) != sk_c11
| inverse(X3) != sk_c11
| multiply(X7,sk_c11) != sk_c11
| multiply(X6,sk_c11) != sk_c11
| multiply(X5,sk_c11) != sk_c11
| multiply(X4,sk_c11) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c11) != sk_c11
| 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)],[c_0_53,c_0_47]),c_0_47]),c_0_47]),c_0_54]),c_0_54]),c_0_50]),c_0_54]),c_0_54]),c_0_54]),c_0_54]),c_0_54]),c_0_54])]) ).
cnf(c_0_58,plain,
inverse(sk_c11) = sk_c11,
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
( inverse(X2) != sk_c11
| multiply(X2,inverse(X2)) != sk_c11
| 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_57,c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56])])])])])]),c_0_58])]) ).
cnf(c_0_60,negated_conjecture,
( inverse(X1) != X1
| inverse(X1) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_58]),c_0_56]),c_0_56]),c_0_50])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_60,c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP312-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n006.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 20:08:59 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.28/0.59 % Version: 3.5.1
% 1.28/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.28/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.28/0.59 % Starting new_bool_3 with 300s (1) cores
% 1.28/0.59 % Starting new_bool_1 with 300s (1) cores
% 1.28/0.59 % Starting sh5l with 300s (1) cores
% 1.28/0.59 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1155660 completed with status 0
% 1.28/0.59 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.28/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.28/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.28/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.28/0.59 % No SInE strategy applied
% 1.28/0.59 % Search class: FGHPS-FFMM21-SFFFFFNN
% 1.28/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.28/0.59 % Starting SubtermCWHack with 136s (1) cores
% 1.28/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.28/0.59 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.28/0.59 % Starting new_bool_3 with 136s (1) cores
% 1.28/0.59 % Starting new_bool_1 with 136s (1) cores
% 1.28/0.59 % new_bool_3 with pid 1155668 completed with status 0
% 1.28/0.59 % Result found by new_bool_3
% 1.28/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.28/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.28/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.28/0.59 % No SInE strategy applied
% 1.28/0.59 % Search class: FGHPS-FFMM21-SFFFFFNN
% 1.28/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.28/0.59 % Starting SubtermCWHack with 136s (1) cores
% 1.28/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.28/0.59 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.28/0.59 % Starting new_bool_3 with 136s (1) cores
% 1.28/0.59 % Preprocessing time : 0.002 s
% 1.28/0.59 % Presaturation interreduction done
% 1.28/0.59
% 1.28/0.59 % Proof found!
% 1.28/0.59 % SZS status Unsatisfiable
% 1.28/0.59 % SZS output start CNFRefutation
% See solution above
% 1.28/0.59 % Parsed axioms : 74
% 1.28/0.59 % Removed by relevancy pruning/SinE : 0
% 1.28/0.59 % Initial clauses : 74
% 1.28/0.59 % Removed in clause preprocessing : 0
% 1.28/0.59 % Initial clauses in saturation : 74
% 1.28/0.59 % Processed clauses : 2505
% 1.28/0.59 % ...of these trivial : 61
% 1.28/0.59 % ...subsumed : 1611
% 1.28/0.59 % ...remaining for further processing : 833
% 1.28/0.59 % Other redundant clauses eliminated : 8
% 1.28/0.59 % Clauses deleted for lack of memory : 0
% 1.28/0.59 % Backward-subsumed : 174
% 1.28/0.59 % Backward-rewritten : 391
% 1.28/0.59 % Generated clauses : 7455
% 1.28/0.59 % ...of the previous two non-redundant : 6638
% 1.28/0.59 % ...aggressively subsumed : 0
% 1.28/0.59 % Contextual simplify-reflections : 17
% 1.28/0.59 % Paramodulations : 7444
% 1.28/0.59 % Factorizations : 0
% 1.28/0.59 % NegExts : 0
% 1.28/0.59 % Equation resolutions : 12
% 1.28/0.59 % Disequality decompositions : 0
% 1.28/0.59 % Total rewrite steps : 3837
% 1.28/0.59 % ...of those cached : 3722
% 1.28/0.59 % Propositional unsat checks : 0
% 1.28/0.59 % Propositional check models : 0
% 1.28/0.59 % Propositional check unsatisfiable : 0
% 1.28/0.59 % Propositional clauses : 0
% 1.28/0.59 % Propositional clauses after purity: 0
% 1.28/0.59 % Propositional unsat core size : 0
% 1.28/0.59 % Propositional preprocessing time : 0.000
% 1.28/0.59 % Propositional encoding time : 0.000
% 1.28/0.59 % Propositional solver time : 0.000
% 1.28/0.59 % Success case prop preproc time : 0.000
% 1.28/0.59 % Success case prop encoding time : 0.000
% 1.28/0.59 % Success case prop solver time : 0.000
% 1.28/0.59 % Current number of processed clauses : 193
% 1.28/0.59 % Positive orientable unit clauses : 17
% 1.28/0.59 % Positive unorientable unit clauses: 0
% 1.28/0.59 % Negative unit clauses : 0
% 1.28/0.59 % Non-unit-clauses : 176
% 1.28/0.59 % Current number of unprocessed clauses: 3029
% 1.28/0.59 % ...number of literals in the above : 10678
% 1.28/0.59 % Current number of archived formulas : 0
% 1.28/0.59 % Current number of archived clauses : 639
% 1.28/0.59 % Clause-clause subsumption calls (NU) : 19245
% 1.28/0.59 % Rec. Clause-clause subsumption calls : 11982
% 1.28/0.59 % Non-unit clause-clause subsumptions : 1750
% 1.28/0.59 % Unit Clause-clause subsumption calls : 672
% 1.28/0.59 % Rewrite failures with RHS unbound : 0
% 1.28/0.59 % BW rewrite match attempts : 50
% 1.28/0.59 % BW rewrite match successes : 45
% 1.28/0.59 % Condensation attempts : 0
% 1.28/0.59 % Condensation successes : 0
% 1.28/0.59 % Termbank termtop insertions : 86981
% 1.28/0.59 % Search garbage collected termcells : 49
% 1.28/0.59
% 1.28/0.59 % -------------------------------------------------
% 1.28/0.59 % User time : 0.130 s
% 1.28/0.59 % System time : 0.007 s
% 1.28/0.59 % Total time : 0.137 s
% 1.28/0.59 % Maximum resident set size: 3668 pages
% 1.28/0.59
% 1.28/0.59 % -------------------------------------------------
% 1.28/0.59 % User time : 0.654 s
% 1.28/0.59 % System time : 0.040 s
% 1.28/0.59 % Total time : 0.694 s
% 1.28/0.59 % Maximum resident set size: 4608 pages
% 1.28/0.59 % E exiting
%------------------------------------------------------------------------------