%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP267-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 : n008.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:43:02 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 12
% Syntax : Number of clauses : 65 ( 21 unt; 31 nHn; 52 RR)
% Number of literals : 173 ( 172 equ; 84 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 59 ( 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_1,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c7
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_5,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c6) = sk_c7
| multiply(sk_c3,sk_c7) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c6) != sk_c7
| inverse(X5) != sk_c8
| multiply(X5,sk_c8) != sk_c7
| inverse(X4) != sk_c7
| multiply(X4,sk_c7) != X3
| multiply(sk_c7,X3) != sk_c6
| inverse(X2) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c6) = sk_c7
| multiply(sk_c7,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c6) = sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c6) = sk_c7
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(c_0_12,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_13,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_14,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_15,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
prove_this_1 ).
cnf(c_0_17,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c7
| multiply(inverse(sk_c1),sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c7
| inverse(sk_c1) = sk_c8 ),
prove_this_4 ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| multiply(inverse(sk_c5),sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c7 ),
prove_this_2 ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| multiply(inverse(sk_c1),sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c1) = sk_c8 ),
prove_this_5 ).
cnf(c_0_25,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( inverse(sk_c6) = sk_c7
| multiply(sk_c3,sk_c7) = sk_c4 ),
prove_this_18 ).
cnf(c_0_27,negated_conjecture,
multiply(sk_c8,sk_c7) = sk_c8,
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( inverse(sk_c6) != sk_c7
| inverse(X5) != sk_c8
| multiply(X5,sk_c8) != sk_c7
| inverse(X4) != sk_c7
| multiply(X4,sk_c7) != X3
| multiply(sk_c7,X3) != sk_c6
| inverse(X2) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7 ),
inference(fof_simplification,[status(thm)],[prove_this_22]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c7,sk_c6) = identity
| multiply(sk_c3,sk_c7) = sk_c4 ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
identity = sk_c7,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_27]),c_0_13]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c6) != sk_c7
| inverse(X5) != sk_c8
| multiply(X5,sk_c8) != sk_c7
| inverse(X4) != sk_c7
| multiply(X4,sk_c7) != X3
| multiply(sk_c7,X3) != sk_c6
| inverse(X2) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7 ),
c_0_28 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c4
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
multiply(sk_c7,X1) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c6) = sk_c7
| multiply(sk_c7,sk_c4) = sk_c6 ),
prove_this_15 ).
cnf(c_0_35,negated_conjecture,
( inverse(X4) != sk_c8
| inverse(X3) != sk_c6
| inverse(X1) != sk_c7
| inverse(X2) != sk_c8
| inverse(sk_c6) != sk_c7
| multiply(X4,sk_c8) != sk_c7
| multiply(X3,sk_c6) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(sk_c7,multiply(X1,sk_c7)) != sk_c6 ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c6) = sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
prove_this_3 ).
cnf(c_0_37,negated_conjecture,
( sk_c6 = sk_c7
| multiply(sk_c3,sk_c7) = sk_c4 ),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c7,sk_c6) = identity
| multiply(sk_c7,sk_c4) = sk_c6 ),
inference(spm,[status(thm)],[c_0_13,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( inverse(X4) != sk_c8
| inverse(X3) != sk_c6
| inverse(X1) != sk_c7
| inverse(X2) != sk_c8
| multiply(X4,sk_c8) != sk_c7
| multiply(X3,sk_c6) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(sk_c7,multiply(X1,sk_c7)) != sk_c6
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( sk_c6 = sk_c7
| multiply(inverse(sk_c3),sk_c4) = sk_c7 ),
inference(spm,[status(thm)],[c_0_15,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( sk_c4 = sk_c6
| sk_c6 = sk_c7 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_30]),c_0_33]),c_0_33]) ).
cnf(c_0_42,negated_conjecture,
( inverse(X3) != sk_c8
| inverse(X2) != sk_c6
| inverse(X1) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| multiply(X2,sk_c6) != sk_c7
| multiply(sk_c7,multiply(X1,sk_c7)) != sk_c6
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_21]),c_0_16]) ).
cnf(c_0_43,negated_conjecture,
( sk_c6 = sk_c7
| multiply(inverse(sk_c3),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( inverse(sk_c6) = sk_c7
| inverse(sk_c3) = sk_c7 ),
prove_this_21 ).
cnf(c_0_45,negated_conjecture,
( inverse(X2) != sk_c8
| inverse(X1) != sk_c6
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(sk_c7,multiply(sk_c6,sk_c7)) != sk_c6
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_46,plain,
multiply(inverse(X1),X1) = sk_c7,
inference(rw,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_47,negated_conjecture,
( sk_c6 = sk_c7
| inverse(sk_c6) = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_33])]) ).
cnf(c_0_48,negated_conjecture,
( inverse(X2) != sk_c8
| inverse(X1) != sk_c6
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(sk_c6,sk_c7) != sk_c6
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(rw,[status(thm)],[c_0_45,c_0_33]) ).
cnf(c_0_49,negated_conjecture,
sk_c6 = sk_c7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_33])]) ).
cnf(c_0_50,negated_conjecture,
( inverse(X2) != sk_c8
| inverse(X1) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c7) != sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_33]),c_0_49]),c_0_49]),c_0_49])]) ).
cnf(c_0_51,negated_conjecture,
( inverse(sk_c7) = sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(rw,[status(thm)],[c_0_36,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_33])]) ).
cnf(c_0_53,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_54,negated_conjecture,
multiply(sk_c1,sk_c8) = sk_c7,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_21]),c_0_16]) ).
cnf(c_0_55,plain,
multiply(inverse(sk_c7),X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_56,plain,
multiply(X1,sk_c7) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_46]),c_0_53]) ).
cnf(c_0_57,negated_conjecture,
multiply(inverse(sk_c1),sk_c7) = sk_c8,
inference(spm,[status(thm)],[c_0_15,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( inverse(X4) != sk_c8
| inverse(X3) != sk_c7
| inverse(X1) != sk_c7
| inverse(X2) != sk_c8
| inverse(sk_c7) != sk_c7
| multiply(X4,sk_c8) != sk_c7
| multiply(X3,sk_c7) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c7) != sk_c7 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_33]),c_0_49]),c_0_49]),c_0_49]),c_0_49]) ).
cnf(c_0_59,plain,
inverse(sk_c7) = sk_c7,
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
multiply(inverse(sk_c1),X1) = multiply(sk_c8,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_57]),c_0_33]) ).
cnf(c_0_61,negated_conjecture,
( inverse(X2) != sk_c8
| inverse(X1) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c8) != sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_56]),c_0_56])])]),c_0_59])]) ).
cnf(c_0_62,negated_conjecture,
inverse(sk_c1) = sk_c8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_56]),c_0_56]) ).
cnf(c_0_63,negated_conjecture,
( inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_54])]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_62]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP267-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.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 20:08:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 0.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3497593 completed with status 0
% 0.10/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.10/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3497598 completed with status 0
% 0.10/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.10/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.10/0.45 % Preprocessing time : 0.001 s
% 0.10/0.45 % Presaturation interreduction done
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Unsatisfiable
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 25
% 0.10/0.45 % Removed by relevancy pruning/SinE : 0
% 0.10/0.45 % Initial clauses : 25
% 0.10/0.45 % Removed in clause preprocessing : 0
% 0.10/0.45 % Initial clauses in saturation : 25
% 0.10/0.45 % Processed clauses : 394
% 0.10/0.45 % ...of these trivial : 14
% 0.10/0.45 % ...subsumed : 137
% 0.10/0.45 % ...remaining for further processing : 243
% 0.10/0.45 % Other redundant clauses eliminated : 3
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 32
% 0.10/0.45 % Backward-rewritten : 144
% 0.10/0.45 % Generated clauses : 1044
% 0.10/0.45 % ...of the previous two non-redundant : 905
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 6
% 0.10/0.45 % Paramodulations : 1041
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 3
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 705
% 0.10/0.45 % ...of those cached : 597
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 41
% 0.10/0.45 % Positive orientable unit clauses : 17
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 0
% 0.10/0.45 % Non-unit-clauses : 24
% 0.10/0.45 % Current number of unprocessed clauses: 303
% 0.10/0.45 % ...number of literals in the above : 1070
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 201
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 608
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 526
% 0.10/0.45 % Non-unit clause-clause subsumptions : 158
% 0.10/0.45 % Unit Clause-clause subsumption calls : 165
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 46
% 0.10/0.45 % BW rewrite match successes : 38
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 13823
% 0.10/0.45 % Search garbage collected termcells : 28
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.023 s
% 0.10/0.45 % System time : 0.005 s
% 0.10/0.45 % Total time : 0.028 s
% 0.10/0.45 % Maximum resident set size: 3644 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.092 s
% 0.10/0.45 % System time : 0.020 s
% 0.10/0.45 % Total time : 0.112 s
% 0.10/0.45 % Maximum resident set size: 4864 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------