%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP265-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:43:02 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.47s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 19
% Syntax : Number of clauses : 97 ( 25 unt; 56 nHn; 82 RR)
% Number of literals : 259 ( 258 equ; 116 neg)
% Maximal clause size : 11 ( 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 : 78 ( 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_1,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c3) = sk_c9
| multiply(sk_c1,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| inverse(sk_c1) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c3) = sk_c9
| inverse(sk_c1) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_27,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| inverse(sk_c2) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_27) ).
cnf(prove_this_29,negated_conjecture,
( inverse(X6) != sk_c7
| multiply(X6,sk_c7) != X5
| multiply(sk_c7,X5) != sk_c8
| inverse(X4) != sk_c7
| multiply(X4,sk_c7) != sk_c8
| inverse(X3) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| inverse(X2) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| inverse(X1) != sk_c9
| multiply(X1,sk_c9) != sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_29) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| inverse(sk_c2) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_28,negated_conjecture,
( inverse(sk_c5) = sk_c7
| inverse(sk_c2) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_28) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c2,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| multiply(sk_c2,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| multiply(sk_c1,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c5) = sk_c7
| multiply(sk_c1,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c5) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c4) = sk_c7
| multiply(sk_c1,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(c_0_19,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_20,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_21,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_22,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
prove_this_1 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(inverse(sk_c3),sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( inverse(sk_c3) = sk_c9
| multiply(sk_c1,sk_c9) = sk_c8 ),
prove_this_2 ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| multiply(inverse(sk_c1),sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| inverse(sk_c1) = sk_c9 ),
prove_this_8 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| multiply(sk_c3,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| multiply(inverse(sk_c3),sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c3) = sk_c9
| inverse(sk_c1) = sk_c9 ),
prove_this_9 ).
cnf(c_0_32,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| inverse(sk_c2) = sk_c8 ),
prove_this_27 ).
cnf(c_0_34,negated_conjecture,
multiply(sk_c9,sk_c8) = sk_c9,
inference(spm,[status(thm)],[c_0_27,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c8,sk_c2) = identity
| multiply(sk_c5,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
identity = sk_c8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_34]),c_0_20]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| multiply(sk_c8,sk_c2) = sk_c8 ),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
multiply(sk_c8,X1) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( sk_c2 = sk_c8
| multiply(sk_c5,sk_c7) = sk_c6 ),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
( inverse(X6) != sk_c7
| multiply(X6,sk_c7) != X5
| multiply(sk_c7,X5) != sk_c8
| inverse(X4) != sk_c7
| multiply(X4,sk_c7) != sk_c8
| inverse(X3) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| inverse(X2) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| inverse(X1) != sk_c9
| multiply(X1,sk_c9) != sk_c8 ),
inference(fof_simplification,[status(thm)],[prove_this_29]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| inverse(sk_c2) = sk_c8 ),
prove_this_26 ).
cnf(c_0_42,negated_conjecture,
( sk_c2 = sk_c8
| multiply(inverse(sk_c5),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c5) = sk_c7
| inverse(sk_c2) = sk_c8 ),
prove_this_28 ).
cnf(c_0_44,negated_conjecture,
( inverse(X6) != sk_c7
| multiply(X6,sk_c7) != X5
| multiply(sk_c7,X5) != sk_c8
| inverse(X4) != sk_c7
| multiply(X4,sk_c7) != sk_c8
| inverse(X3) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| inverse(X2) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| inverse(X1) != sk_c9
| multiply(X1,sk_c9) != sk_c8 ),
c_0_40 ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c2,sk_c8) = sk_c7 ),
prove_this_19 ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| multiply(sk_c2,sk_c8) = sk_c7 ),
prove_this_20 ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c8,sk_c2) = identity
| multiply(sk_c7,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_20,c_0_41]) ).
cnf(c_0_48,plain,
multiply(inverse(X1),X1) = sk_c8,
inference(rw,[status(thm)],[c_0_20,c_0_36]) ).
cnf(c_0_49,negated_conjecture,
( sk_c2 = sk_c8
| inverse(sk_c2) = sk_c8
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( inverse(X5) != sk_c9
| inverse(X4) != sk_c8
| inverse(X3) != sk_c9
| inverse(X2) != sk_c7
| inverse(X1) != sk_c7
| multiply(X5,sk_c9) != sk_c8
| multiply(X4,sk_c8) != sk_c7
| multiply(X3,sk_c9) != sk_c8
| multiply(X2,sk_c7) != sk_c8
| multiply(sk_c7,multiply(X1,sk_c7)) != sk_c8 ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| multiply(sk_c1,sk_c9) = sk_c8 ),
prove_this_6 ).
cnf(c_0_52,negated_conjecture,
( inverse(sk_c5) = sk_c7
| multiply(sk_c1,sk_c9) = sk_c8 ),
prove_this_7 ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
prove_this_5 ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(inverse(sk_c2),sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(inverse(sk_c5),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_22,c_0_46]) ).
cnf(c_0_56,negated_conjecture,
( inverse(sk_c5) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c7 ),
prove_this_21 ).
cnf(c_0_57,negated_conjecture,
( sk_c2 = sk_c8
| multiply(sk_c7,sk_c6) = sk_c8 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_36]),c_0_38]) ).
cnf(c_0_58,negated_conjecture,
( sk_c2 = sk_c8
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_38])]) ).
cnf(c_0_59,negated_conjecture,
( inverse(X4) != sk_c9
| inverse(X3) != sk_c8
| inverse(X2) != sk_c9
| inverse(X1) != sk_c7
| multiply(X4,sk_c9) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| multiply(X2,sk_c9) != sk_c8
| multiply(X1,sk_c7) != sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
prove_this_3 ).
cnf(c_0_61,negated_conjecture,
( inverse(sk_c4) = sk_c7
| multiply(sk_c1,sk_c9) = sk_c8 ),
prove_this_4 ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| multiply(sk_c7,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_54,c_0_41]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( sk_c7 = sk_c8
| sk_c2 = sk_c8 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,negated_conjecture,
( inverse(X3) != sk_c9
| inverse(X2) != sk_c8
| inverse(X1) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c9) != sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( sk_c7 = sk_c8
| multiply(sk_c7,sk_c6) = sk_c8 ),
inference(rw,[status(thm)],[c_0_62,c_0_38]) ).
cnf(c_0_67,negated_conjecture,
( sk_c7 = sk_c8
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_38])]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(inverse(sk_c5),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_22,c_0_51]) ).
cnf(c_0_69,negated_conjecture,
( inverse(X2) != sk_c9
| inverse(X1) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_23]),c_0_25]) ).
cnf(c_0_70,negated_conjecture,
sk_c7 = sk_c8,
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_68,c_0_52]) ).
cnf(c_0_72,negated_conjecture,
( inverse(X2) != sk_c9
| inverse(X1) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X1,sk_c8) != sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(rw,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
inference(rw,[status(thm)],[c_0_51,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( sk_c6 = sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_70]),c_0_38]),c_0_70]) ).
cnf(c_0_75,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(rw,[status(thm)],[c_0_52,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
( inverse(X1) != sk_c9
| multiply(X1,sk_c9) != sk_c8
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_75]) ).
cnf(c_0_77,negated_conjecture,
multiply(sk_c1,sk_c9) = sk_c8,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_25]),c_0_23]) ).
cnf(c_0_78,negated_conjecture,
multiply(inverse(sk_c1),sk_c8) = sk_c9,
inference(spm,[status(thm)],[c_0_22,c_0_77]) ).
cnf(c_0_79,negated_conjecture,
( inverse(X4) != sk_c9
| inverse(X3) != sk_c8
| inverse(X2) != sk_c9
| inverse(X1) != sk_c7
| inverse(identity) != sk_c7
| multiply(X4,sk_c9) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| multiply(X2,sk_c9) != sk_c8
| multiply(X1,sk_c7) != sk_c8
| multiply(sk_c7,sk_c7) != sk_c8 ),
inference(spm,[status(thm)],[c_0_50,c_0_21]) ).
cnf(c_0_80,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_22]) ).
cnf(c_0_81,negated_conjecture,
multiply(inverse(inverse(sk_c1)),sk_c9) = sk_c8,
inference(spm,[status(thm)],[c_0_22,c_0_78]) ).
cnf(c_0_82,negated_conjecture,
multiply(inverse(sk_c1),X1) = multiply(sk_c9,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_78]),c_0_38]) ).
cnf(c_0_83,negated_conjecture,
( inverse(X4) != sk_c9
| inverse(X3) != sk_c8
| inverse(X2) != sk_c9
| inverse(X1) != sk_c7
| inverse(sk_c8) != sk_c7
| multiply(X4,sk_c9) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| multiply(X2,sk_c9) != sk_c8
| multiply(X1,sk_c7) != sk_c8
| multiply(sk_c7,sk_c7) != sk_c8 ),
inference(rw,[status(thm)],[c_0_79,c_0_36]) ).
cnf(c_0_84,plain,
multiply(X1,inverse(X1)) = sk_c8,
inference(spm,[status(thm)],[c_0_48,c_0_80]) ).
cnf(c_0_85,negated_conjecture,
multiply(inverse(inverse(sk_c1)),multiply(sk_c9,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_81]),c_0_38]) ).
cnf(c_0_86,negated_conjecture,
multiply(sk_c9,multiply(sk_c1,X1)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_82]) ).
cnf(c_0_87,negated_conjecture,
( inverse(X4) != sk_c9
| inverse(X3) != sk_c8
| inverse(X2) != sk_c9
| inverse(X1) != sk_c8
| inverse(sk_c8) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| multiply(X3,sk_c8) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X1,sk_c8) != sk_c8 ),
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)],[c_0_83,c_0_70]),c_0_70]),c_0_38]),c_0_70]),c_0_70]),c_0_70]),c_0_70])]) ).
cnf(c_0_88,plain,
inverse(sk_c8) = sk_c8,
inference(spm,[status(thm)],[c_0_38,c_0_84]) ).
cnf(c_0_89,negated_conjecture,
multiply(inverse(inverse(sk_c1)),X1) = multiply(sk_c1,X1),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,negated_conjecture,
( inverse(X4) != sk_c9
| inverse(X3) != sk_c8
| inverse(X2) != sk_c9
| inverse(X1) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| multiply(X3,sk_c8) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X1,sk_c8) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_91,negated_conjecture,
multiply(sk_c1,inverse(sk_c1)) = sk_c8,
inference(spm,[status(thm)],[c_0_48,c_0_89]) ).
cnf(c_0_92,negated_conjecture,
( inverse(X3) != sk_c9
| inverse(X2) != sk_c8
| inverse(X1) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| multiply(X2,sk_c8) != sk_c8
| multiply(X1,sk_c9) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_38]),c_0_88])]) ).
cnf(c_0_93,negated_conjecture,
inverse(sk_c1) = sk_c9,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_91]),c_0_82]),c_0_34]) ).
cnf(c_0_94,negated_conjecture,
( inverse(X2) != sk_c9
| inverse(X1) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X1,sk_c8) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_77]),c_0_93])]) ).
cnf(c_0_95,negated_conjecture,
( inverse(X1) != sk_c9
| multiply(X1,sk_c9) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_38]),c_0_88])]) ).
cnf(c_0_96,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_93]),c_0_77])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP265-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.10/0.36 % Computer : n009.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:07:57 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.47 % Version: 3.5.1
% 0.10/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.47 % Starting sh5l with 300s (1) cores
% 0.10/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 4128362 completed with status 0
% 0.10/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.10/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.47 % No SInE strategy applied
% 0.10/0.47 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.10/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.10/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.47 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 4128369 completed with status 0
% 0.10/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.47 % No SInE strategy applied
% 0.10/0.47 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.10/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.10/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.47 % Preprocessing time : 0.001 s
% 0.10/0.47 % Presaturation interreduction done
% 0.10/0.47
% 0.10/0.47 % Proof found!
% 0.10/0.47 % SZS status Unsatisfiable
% 0.10/0.47 % SZS output start CNFRefutation
% See solution above
% 0.10/0.47 % Parsed axioms : 32
% 0.10/0.47 % Removed by relevancy pruning/SinE : 0
% 0.10/0.47 % Initial clauses : 32
% 0.10/0.47 % Removed in clause preprocessing : 0
% 0.10/0.47 % Initial clauses in saturation : 32
% 0.10/0.47 % Processed clauses : 746
% 0.10/0.47 % ...of these trivial : 12
% 0.10/0.47 % ...subsumed : 328
% 0.10/0.47 % ...remaining for further processing : 406
% 0.10/0.47 % Other redundant clauses eliminated : 1
% 0.10/0.47 % Clauses deleted for lack of memory : 0
% 0.10/0.47 % Backward-subsumed : 83
% 0.10/0.47 % Backward-rewritten : 204
% 0.10/0.47 % Generated clauses : 2460
% 0.10/0.47 % ...of the previous two non-redundant : 2190
% 0.10/0.47 % ...aggressively subsumed : 0
% 0.10/0.47 % Contextual simplify-reflections : 10
% 0.10/0.47 % Paramodulations : 2459
% 0.10/0.47 % Factorizations : 0
% 0.10/0.47 % NegExts : 0
% 0.10/0.47 % Equation resolutions : 1
% 0.10/0.47 % Disequality decompositions : 0
% 0.10/0.47 % Total rewrite steps : 1481
% 0.10/0.47 % ...of those cached : 1336
% 0.10/0.47 % Propositional unsat checks : 0
% 0.10/0.47 % Propositional check models : 0
% 0.10/0.47 % Propositional check unsatisfiable : 0
% 0.10/0.47 % Propositional clauses : 0
% 0.10/0.47 % Propositional clauses after purity: 0
% 0.10/0.47 % Propositional unsat core size : 0
% 0.10/0.47 % Propositional preprocessing time : 0.000
% 0.10/0.47 % Propositional encoding time : 0.000
% 0.10/0.47 % Propositional solver time : 0.000
% 0.10/0.47 % Success case prop preproc time : 0.000
% 0.10/0.47 % Success case prop encoding time : 0.000
% 0.10/0.47 % Success case prop solver time : 0.000
% 0.10/0.47 % Current number of processed clauses : 86
% 0.10/0.47 % Positive orientable unit clauses : 18
% 0.10/0.47 % Positive unorientable unit clauses: 0
% 0.10/0.47 % Negative unit clauses : 0
% 0.10/0.47 % Non-unit-clauses : 68
% 0.10/0.47 % Current number of unprocessed clauses: 759
% 0.10/0.47 % ...number of literals in the above : 4641
% 0.10/0.47 % Current number of archived formulas : 0
% 0.10/0.47 % Current number of archived clauses : 319
% 0.10/0.47 % Clause-clause subsumption calls (NU) : 3389
% 0.10/0.47 % Rec. Clause-clause subsumption calls : 2496
% 0.10/0.47 % Non-unit clause-clause subsumptions : 379
% 0.10/0.47 % Unit Clause-clause subsumption calls : 365
% 0.10/0.47 % Rewrite failures with RHS unbound : 0
% 0.10/0.47 % BW rewrite match attempts : 88
% 0.10/0.47 % BW rewrite match successes : 46
% 0.10/0.47 % Condensation attempts : 0
% 0.10/0.47 % Condensation successes : 0
% 0.10/0.47 % Termbank termtop insertions : 35703
% 0.10/0.47 % Search garbage collected termcells : 32
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.037 s
% 0.10/0.47 % System time : 0.003 s
% 0.10/0.47 % Total time : 0.040 s
% 0.10/0.47 % Maximum resident set size: 3648 pages
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.162 s
% 0.10/0.47 % System time : 0.015 s
% 0.10/0.47 % Total time : 0.177 s
% 0.10/0.47 % Maximum resident set size: 4608 pages
% 0.10/0.47 % E exiting
%------------------------------------------------------------------------------