%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP373-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 : n009.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:25 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.50s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 15
% Syntax : Number of clauses : 82 ( 16 unt; 50 nHn; 73 RR)
% Number of literals : 269 ( 268 equ; 146 neg)
% Maximal clause size : 16 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 85 ( 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_11,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c1,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c3) = sk_c11
| multiply(sk_c1,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c11,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c3) = sk_c11
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c11,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c4) = sk_c10
| inverse(sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_35,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| multiply(sk_c11,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_35) ).
cnf(prove_this_36,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c11,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_36) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| inverse(sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_61,negated_conjecture,
( multiply(X7,X6) != X8
| inverse(X8) != X6
| inverse(X7) != X8
| multiply(X6,sk_c10) != sk_c11
| inverse(X5) != X6
| multiply(X5,X6) != sk_c11
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| inverse(X2) != sk_c9
| multiply(X2,sk_c9) != sk_c10
| multiply(sk_c11,sk_c9) != sk_c10
| inverse(X1) != sk_c11
| multiply(X1,sk_c11) != sk_c10
| inverse(sk_c11) != sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_61) ).
cnf(c_0_15,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_16,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_17,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_18,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c1,sk_c11) = sk_c10 ),
prove_this_11 ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(inverse(sk_c3),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( inverse(sk_c3) = sk_c11
| multiply(sk_c1,sk_c11) = sk_c10 ),
prove_this_12 ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c1,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(inverse(sk_c1),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| inverse(sk_c1) = sk_c11 ),
prove_this_21 ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c11,sk_c9) = sk_c10 ),
prove_this_33 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(inverse(sk_c3),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( inverse(sk_c3) = sk_c11
| inverse(sk_c1) = sk_c11 ),
prove_this_22 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(inverse(sk_c4),sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c11,sk_c9) = sk_c10 ),
prove_this_34 ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c4) = sk_c10
| inverse(sk_c11) = sk_c10 ),
prove_this_4 ).
cnf(c_0_34,negated_conjecture,
multiply(sk_c11,sk_c10) = sk_c11,
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( identity = sk_c9
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_32]),c_0_16]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c11) = sk_c10
| multiply(sk_c10,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
identity = sk_c10,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_34]),c_0_16]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| inverse(sk_c1) = sk_c11 ),
prove_this_23 ).
cnf(c_0_39,negated_conjecture,
( identity = sk_c9
| multiply(inverse(sk_c11),sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c11) = sk_c10
| multiply(sk_c10,sk_c4) = sk_c10 ),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c11,sk_c1) = identity
| multiply(sk_c4,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_16,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( sk_c9 = sk_c10
| multiply(inverse(sk_c11),sk_c10) = sk_c9 ),
inference(rw,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( sk_c4 = sk_c10
| inverse(sk_c11) = sk_c10 ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c11,sk_c1) = sk_c10 ),
inference(rw,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_46,negated_conjecture,
( sk_c9 = sk_c10
| sk_c4 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_41])]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| multiply(sk_c11,sk_c9) = sk_c10 ),
prove_this_35 ).
cnf(c_0_48,negated_conjecture,
( sk_c9 = sk_c10
| multiply(sk_c11,sk_c1) = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_41])]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(inverse(sk_c5),sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_18,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c11,sk_c9) = sk_c10 ),
prove_this_36 ).
cnf(c_0_51,negated_conjecture,
( sk_c9 = sk_c10
| multiply(inverse(sk_c11),sk_c10) = sk_c1 ),
inference(spm,[status(thm)],[c_0_18,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| inverse(sk_c11) = sk_c10 ),
prove_this_3 ).
cnf(c_0_53,negated_conjecture,
( multiply(X7,X6) != X8
| inverse(X8) != X6
| inverse(X7) != X8
| multiply(X6,sk_c10) != sk_c11
| inverse(X5) != X6
| multiply(X5,X6) != sk_c11
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| inverse(X2) != sk_c9
| multiply(X2,sk_c9) != sk_c10
| multiply(sk_c11,sk_c9) != sk_c10
| inverse(X1) != sk_c11
| multiply(X1,sk_c11) != sk_c10
| inverse(sk_c11) != sk_c10 ),
inference(fof_simplification,[status(thm)],[prove_this_61]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c8,sk_c11) = sk_c8
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( sk_c1 = sk_c10
| sk_c9 = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_41]) ).
cnf(c_0_56,negated_conjecture,
( multiply(X7,X6) != X8
| inverse(X8) != X6
| inverse(X7) != X8
| multiply(X6,sk_c10) != sk_c11
| inverse(X5) != X6
| multiply(X5,X6) != sk_c11
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| inverse(X2) != sk_c9
| multiply(X2,sk_c9) != sk_c10
| multiply(sk_c11,sk_c9) != sk_c10
| inverse(X1) != sk_c11
| multiply(X1,sk_c11) != sk_c10
| inverse(sk_c11) != sk_c10 ),
c_0_53 ).
cnf(c_0_57,negated_conjecture,
( identity = sk_c11
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_54]),c_0_16]) ).
cnf(c_0_58,negated_conjecture,
( sk_c1 = sk_c9
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_43,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
( sk_c9 = sk_c10
| sk_c1 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_46]),c_0_41])]) ).
cnf(c_0_60,negated_conjecture,
( inverse(X6) != sk_c11
| inverse(X5) != sk_c9
| inverse(X4) != sk_c11
| inverse(X3) != sk_c10
| inverse(sk_c11) != sk_c10
| multiply(X6,sk_c11) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X4,sk_c11) != sk_c10
| multiply(X3,sk_c10) != sk_c9
| multiply(X2,inverse(X2)) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c11
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_56])]) ).
cnf(c_0_61,negated_conjecture,
( sk_c10 = sk_c11
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(rw,[status(thm)],[c_0_57,c_0_37]) ).
cnf(c_0_62,negated_conjecture,
sk_c9 = sk_c10,
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( sk_c9 != sk_c11
| inverse(X5) != sk_c11
| inverse(X4) != sk_c9
| inverse(X3) != sk_c11
| multiply(X5,sk_c11) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X3,sk_c11) != sk_c10
| multiply(X2,inverse(X2)) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c11
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| sk_c4 = sk_c10 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_44]),c_0_34]),c_0_44]) ).
cnf(c_0_64,negated_conjecture,
sk_c10 = sk_c11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_34])]) ).
cnf(c_0_65,negated_conjecture,
( inverse(X5) != sk_c11
| inverse(X4) != sk_c11
| inverse(X3) != 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)
| sk_c4 = sk_c11 ),
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(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_63,c_0_62]),c_0_34]),c_0_62]),c_0_62]),c_0_62])]),c_0_64]),c_0_64]),c_0_64]),c_0_64]),c_0_64]),c_0_64]),c_0_64]),c_0_64])]) ).
cnf(c_0_66,negated_conjecture,
( sk_c4 = sk_c11
| inverse(sk_c11) = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_64]),c_0_64]) ).
cnf(c_0_67,plain,
multiply(sk_c11,X1) = X1,
inference(rw,[status(thm)],[c_0_41,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
( inverse(X4) != sk_c11
| inverse(X3) != 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)
| sk_c4 = sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_69,negated_conjecture,
( inverse(X3) != 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)
| sk_c4 = sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_66]),c_0_67])]) ).
cnf(c_0_70,negated_conjecture,
( 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)
| sk_c4 = sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_66]),c_0_67])]) ).
cnf(c_0_71,negated_conjecture,
( inverse(X1) != multiply(X1,sk_c11)
| inverse(multiply(X1,sk_c11)) != sk_c11
| sk_c4 = sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_66]),c_0_67])]) ).
cnf(c_0_72,negated_conjecture,
( inverse(sk_c11) = sk_c11
| inverse(sk_c4) = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_64]),c_0_64]) ).
cnf(c_0_73,negated_conjecture,
sk_c4 = sk_c11,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_66]),c_0_67]),c_0_67])]),c_0_66]) ).
cnf(c_0_74,negated_conjecture,
inverse(sk_c11) = sk_c11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_75,negated_conjecture,
( inverse(X6) != sk_c11
| inverse(X5) != sk_c11
| inverse(X4) != sk_c11
| inverse(X3) != 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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_62]),c_0_34]),c_0_62]),c_0_62]),c_0_62]),c_0_64]),c_0_64]),c_0_64]),c_0_64]),c_0_64]),c_0_64]),c_0_64]),c_0_64]),c_0_74]),c_0_64]),c_0_64]),c_0_64])]) ).
cnf(c_0_76,negated_conjecture,
( inverse(X5) != sk_c11
| inverse(X4) != sk_c11
| inverse(X3) != 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(spm,[status(thm)],[c_0_75,c_0_74]),c_0_67])]) ).
cnf(c_0_77,negated_conjecture,
( inverse(X4) != sk_c11
| inverse(X3) != 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(spm,[status(thm)],[c_0_76,c_0_74]),c_0_67])]) ).
cnf(c_0_78,negated_conjecture,
( inverse(X3) != 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(spm,[status(thm)],[c_0_77,c_0_74]),c_0_67])]) ).
cnf(c_0_79,negated_conjecture,
( 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(spm,[status(thm)],[c_0_78,c_0_74]),c_0_67])]) ).
cnf(c_0_80,negated_conjecture,
( inverse(X1) != multiply(X1,sk_c11)
| inverse(multiply(X1,sk_c11)) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_74]),c_0_67])]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_74]),c_0_67]),c_0_74]),c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP373-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 : n009.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:10:42 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.42 Running first-order theorem proving
% 0.12/0.42 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
% 0.17/0.50 % Version: 3.5.1
% 0.17/0.50 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 % Starting sh5l with 300s (1) cores
% 0.17/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 4137375 completed with status 0
% 0.17/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.50 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.50 % No SInE strategy applied
% 0.17/0.50 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.50 % Starting new_bool_1 with 136s (1) cores
% 0.17/0.50 % new_bool_3 with pid 4137383 completed with status 0
% 0.17/0.50 % Result found by new_bool_3
% 0.17/0.50 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.50 % No SInE strategy applied
% 0.17/0.50 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.50 % Preprocessing time : 0.001 s
% 0.17/0.50 % Presaturation interreduction done
% 0.17/0.50
% 0.17/0.50 % Proof found!
% 0.17/0.50 % SZS status Unsatisfiable
% 0.17/0.50 % SZS output start CNFRefutation
% See solution above
% 0.17/0.50 % Parsed axioms : 64
% 0.17/0.50 % Removed by relevancy pruning/SinE : 0
% 0.17/0.50 % Initial clauses : 64
% 0.17/0.50 % Removed in clause preprocessing : 0
% 0.17/0.50 % Initial clauses in saturation : 64
% 0.17/0.50 % Processed clauses : 683
% 0.17/0.50 % ...of these trivial : 63
% 0.17/0.50 % ...subsumed : 203
% 0.17/0.50 % ...remaining for further processing : 417
% 0.17/0.50 % Other redundant clauses eliminated : 2
% 0.17/0.50 % Clauses deleted for lack of memory : 0
% 0.17/0.50 % Backward-subsumed : 51
% 0.17/0.50 % Backward-rewritten : 288
% 0.17/0.50 % Generated clauses : 2059
% 0.17/0.50 % ...of the previous two non-redundant : 2113
% 0.17/0.50 % ...aggressively subsumed : 0
% 0.17/0.50 % Contextual simplify-reflections : 11
% 0.17/0.50 % Paramodulations : 2058
% 0.17/0.50 % Factorizations : 0
% 0.17/0.50 % NegExts : 0
% 0.17/0.50 % Equation resolutions : 2
% 0.17/0.50 % Disequality decompositions : 0
% 0.17/0.50 % Total rewrite steps : 1151
% 0.17/0.50 % ...of those cached : 1111
% 0.17/0.50 % Propositional unsat checks : 0
% 0.17/0.50 % Propositional check models : 0
% 0.17/0.50 % Propositional check unsatisfiable : 0
% 0.17/0.50 % Propositional clauses : 0
% 0.17/0.50 % Propositional clauses after purity: 0
% 0.17/0.50 % Propositional unsat core size : 0
% 0.17/0.50 % Propositional preprocessing time : 0.000
% 0.17/0.50 % Propositional encoding time : 0.000
% 0.17/0.50 % Propositional solver time : 0.000
% 0.17/0.50 % Success case prop preproc time : 0.000
% 0.17/0.50 % Success case prop encoding time : 0.000
% 0.17/0.50 % Success case prop solver time : 0.000
% 0.17/0.50 % Current number of processed clauses : 13
% 0.17/0.50 % Positive orientable unit clauses : 11
% 0.17/0.50 % Positive unorientable unit clauses: 0
% 0.17/0.50 % Negative unit clauses : 0
% 0.17/0.50 % Non-unit-clauses : 2
% 0.17/0.50 % Current number of unprocessed clauses: 761
% 0.17/0.50 % ...number of literals in the above : 2624
% 0.17/0.50 % Current number of archived formulas : 0
% 0.17/0.50 % Current number of archived clauses : 403
% 0.17/0.50 % Clause-clause subsumption calls (NU) : 3146
% 0.17/0.50 % Rec. Clause-clause subsumption calls : 1559
% 0.17/0.50 % Non-unit clause-clause subsumptions : 239
% 0.17/0.50 % Unit Clause-clause subsumption calls : 411
% 0.17/0.50 % Rewrite failures with RHS unbound : 0
% 0.17/0.50 % BW rewrite match attempts : 16
% 0.17/0.50 % BW rewrite match successes : 14
% 0.17/0.50 % Condensation attempts : 0
% 0.17/0.50 % Condensation successes : 0
% 0.17/0.50 % Termbank termtop insertions : 47349
% 0.17/0.50 % Search garbage collected termcells : 45
% 0.17/0.50
% 0.17/0.50 % -------------------------------------------------
% 0.17/0.50 % User time : 0.036 s
% 0.17/0.50 % System time : 0.006 s
% 0.17/0.50 % Total time : 0.043 s
% 0.17/0.50 % Maximum resident set size: 3664 pages
% 0.17/0.50
% 0.17/0.50 % -------------------------------------------------
% 0.17/0.50 % User time : 0.225 s
% 0.17/0.50 % System time : 0.028 s
% 0.17/0.50 % Total time : 0.253 s
% 0.17/0.50 % Maximum resident set size: 4608 pages
% 0.17/0.50 % E exiting
%------------------------------------------------------------------------------