%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP276-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 : n013.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:03 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.62s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 18
% Syntax : Number of clauses : 91 ( 28 unt; 46 nHn; 75 RR)
% Number of literals : 226 ( 225 equ; 96 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 58 ( 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_2,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c3) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c6
| inverse(sk_c1) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c3) = sk_c7
| inverse(sk_c1) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_31,negated_conjecture,
( inverse(X4) != sk_c5
| multiply(X4,sk_c5) != sk_c6
| inverse(sk_c7) != sk_c5
| inverse(X3) != sk_c7
| multiply(X3,sk_c7) != sk_c6
| multiply(sk_c6,sk_c5) != sk_c7
| multiply(X2,sk_c6) != sk_c7
| inverse(X2) != sk_c7
| multiply(sk_c7,sk_c5) != sk_c6
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_31) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| inverse(sk_c2) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c7) = sk_c5
| multiply(sk_c1,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_13,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| multiply(sk_c7,sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_28,negated_conjecture,
( inverse(sk_c7) = sk_c5
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_28) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c6
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_27,negated_conjecture,
( inverse(sk_c3) = sk_c7
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_27) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c7) = sk_c5
| multiply(sk_c7,sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c7) = sk_c5
| inverse(sk_c2) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_22) ).
cnf(c_0_18,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_19,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_20,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_21,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
prove_this_2 ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(inverse(sk_c3),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( inverse(sk_c3) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c6 ),
prove_this_3 ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(inverse(sk_c1),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c6
| inverse(sk_c1) = sk_c7 ),
prove_this_8 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c3,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(inverse(sk_c3),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( inverse(sk_c3) = sk_c7
| inverse(sk_c1) = sk_c7 ),
prove_this_9 ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| multiply(sk_c2,sk_c6) = sk_c7 ),
prove_this_25 ).
cnf(c_0_33,negated_conjecture,
multiply(sk_c7,sk_c6) = sk_c7,
inference(spm,[status(thm)],[c_0_26,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( inverse(X4) != sk_c5
| multiply(X4,sk_c5) != sk_c6
| inverse(sk_c7) != sk_c5
| inverse(X3) != sk_c7
| multiply(X3,sk_c7) != sk_c6
| multiply(sk_c6,sk_c5) != sk_c7
| multiply(X2,sk_c6) != sk_c7
| inverse(X2) != sk_c7
| multiply(sk_c7,sk_c5) != sk_c6
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6 ),
inference(fof_simplification,[status(thm)],[prove_this_31]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| multiply(inverse(sk_c2),sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| inverse(sk_c2) = sk_c7 ),
prove_this_19 ).
cnf(c_0_37,negated_conjecture,
identity = sk_c6,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_33]),c_0_19]) ).
cnf(c_0_38,negated_conjecture,
( inverse(X4) != sk_c5
| multiply(X4,sk_c5) != sk_c6
| inverse(sk_c7) != sk_c5
| inverse(X3) != sk_c7
| multiply(X3,sk_c7) != sk_c6
| multiply(sk_c6,sk_c5) != sk_c7
| multiply(X2,sk_c6) != sk_c7
| inverse(X2) != sk_c7
| multiply(sk_c7,sk_c5) != sk_c6
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6 ),
c_0_34 ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c7) = sk_c5
| multiply(sk_c1,sk_c7) = sk_c6 ),
prove_this_4 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c6 ),
prove_this_1 ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c6
| multiply(sk_c6,sk_c5) = sk_c7 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
multiply(sk_c6,X1) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| multiply(sk_c7,sk_c5) = sk_c6 ),
prove_this_13 ).
cnf(c_0_44,negated_conjecture,
( inverse(X3) != sk_c7
| inverse(X2) != sk_c7
| inverse(X1) != sk_c7
| multiply(X3,sk_c7) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X1,sk_c7) != sk_c6
| multiply(sk_c7,sk_c5) != sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( inverse(sk_c7) = sk_c5
| multiply(sk_c2,sk_c6) = sk_c7 ),
prove_this_28 ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c6
| multiply(sk_c2,sk_c6) = sk_c7 ),
prove_this_26 ).
cnf(c_0_47,negated_conjecture,
( sk_c5 = sk_c7
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( sk_c5 = sk_c7
| multiply(sk_c7,sk_c5) = sk_c6 ),
inference(rw,[status(thm)],[c_0_43,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( inverse(X2) != sk_c7
| inverse(X1) != sk_c7
| multiply(X2,sk_c7) != sk_c6
| multiply(X1,sk_c6) != sk_c7
| multiply(sk_c7,sk_c5) != sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_24]),c_0_22]) ).
cnf(c_0_50,negated_conjecture,
( inverse(X3) != sk_c7
| inverse(X2) != sk_c7
| inverse(X1) != sk_c7
| multiply(X3,sk_c7) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X1,sk_c7) != sk_c6
| multiply(sk_c7,sk_c5) != sk_c6
| multiply(sk_c2,sk_c6) = sk_c7 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_45]),c_0_45]),c_0_32]) ).
cnf(c_0_51,negated_conjecture,
( inverse(sk_c3) = sk_c7
| multiply(sk_c2,sk_c6) = sk_c7 ),
prove_this_27 ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c7
| multiply(inverse(sk_c3),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_21,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( sk_c5 = sk_c7
| multiply(inverse(sk_c7),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_21,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( sk_c5 = sk_c7
| multiply(inverse(sk_c7),sk_c6) = sk_c5 ),
inference(spm,[status(thm)],[c_0_21,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
( sk_c5 != sk_c7
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6
| multiply(sk_c7,sk_c6) != sk_c7
| multiply(sk_c7,sk_c5) != sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_49,c_0_39]) ).
cnf(c_0_56,negated_conjecture,
( inverse(X2) != sk_c7
| inverse(X1) != sk_c7
| multiply(X2,sk_c7) != sk_c6
| multiply(X1,sk_c6) != sk_c7
| multiply(sk_c7,sk_c5) != sk_c6
| multiply(sk_c2,sk_c6) = sk_c7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_46]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c2,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c5,sk_c7) = identity
| multiply(sk_c2,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_45]) ).
cnf(c_0_59,negated_conjecture,
sk_c5 = sk_c7,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( sk_c5 != sk_c7
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6
| multiply(sk_c7,sk_c5) != sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_33])]) ).
cnf(c_0_61,negated_conjecture,
( inverse(sk_c7) = sk_c5
| multiply(sk_c7,sk_c5) = sk_c6 ),
prove_this_16 ).
cnf(c_0_62,negated_conjecture,
( sk_c5 != sk_c7
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6
| multiply(sk_c7,sk_c5) != sk_c6
| multiply(sk_c2,sk_c6) = sk_c7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_45]),c_0_57]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c7
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_37]),c_0_59]) ).
cnf(c_0_64,negated_conjecture,
( inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6
| multiply(sk_c7,sk_c7) != sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_59]),c_0_59])]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c5,sk_c7) = identity
| multiply(sk_c7,sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_19,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6
| multiply(sk_c2,sk_c6) = sk_c7 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_59]),c_0_59])]),c_0_63]) ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c7,sk_c7) != sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_24]),c_0_22]) ).
cnf(c_0_68,negated_conjecture,
multiply(sk_c7,sk_c7) = sk_c6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_37]),c_0_59]),c_0_59])]) ).
cnf(c_0_69,negated_conjecture,
multiply(sk_c2,sk_c6) = sk_c7,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_51]),c_0_46]) ).
cnf(c_0_70,negated_conjecture,
multiply(sk_c1,sk_c7) = sk_c6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_71,negated_conjecture,
multiply(sk_c2,X1) = multiply(sk_c7,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_69]),c_0_42]) ).
cnf(c_0_72,negated_conjecture,
multiply(sk_c1,multiply(sk_c7,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_70]),c_0_42]) ).
cnf(c_0_73,negated_conjecture,
multiply(inverse(sk_c2),multiply(sk_c7,X1)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
multiply(sk_c1,sk_c6) = sk_c7,
inference(spm,[status(thm)],[c_0_72,c_0_68]) ).
cnf(c_0_75,negated_conjecture,
multiply(inverse(sk_c2),sk_c6) = sk_c7,
inference(spm,[status(thm)],[c_0_73,c_0_68]) ).
cnf(c_0_76,negated_conjecture,
multiply(sk_c1,X1) = multiply(sk_c7,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_74]),c_0_42]) ).
cnf(c_0_77,negated_conjecture,
multiply(inverse(sk_c2),X1) = multiply(sk_c7,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_75]),c_0_42]) ).
cnf(c_0_78,plain,
multiply(inverse(X1),X1) = sk_c6,
inference(rw,[status(thm)],[c_0_19,c_0_37]) ).
cnf(c_0_79,negated_conjecture,
multiply(sk_c7,multiply(sk_c7,X1)) = X1,
inference(rw,[status(thm)],[c_0_72,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
( inverse(sk_c7) = sk_c5
| inverse(sk_c2) = sk_c7 ),
prove_this_22 ).
cnf(c_0_81,negated_conjecture,
multiply(sk_c7,sk_c2) = sk_c6,
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,negated_conjecture,
multiply(inverse(sk_c7),X1) = multiply(sk_c7,X1),
inference(spm,[status(thm)],[c_0_21,c_0_79]) ).
cnf(c_0_83,negated_conjecture,
( inverse(sk_c7) = sk_c7
| inverse(sk_c2) = sk_c7 ),
inference(rw,[status(thm)],[c_0_80,c_0_59]) ).
cnf(c_0_84,negated_conjecture,
sk_c2 = sk_c7,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_81]),c_0_82]),c_0_33]) ).
cnf(c_0_85,negated_conjecture,
inverse(sk_c7) = sk_c7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]) ).
cnf(c_0_86,negated_conjecture,
( inverse(X4) != sk_c7
| inverse(X3) != sk_c7
| inverse(X2) != sk_c7
| inverse(X1) != sk_c7
| multiply(X4,sk_c7) != sk_c6
| multiply(X3,sk_c6) != sk_c7
| multiply(X2,sk_c7) != sk_c6
| multiply(X1,sk_c7) != sk_c6 ),
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)],[c_0_38,c_0_42]),c_0_59]),c_0_68]),c_0_59]),c_0_59]),c_0_85]),c_0_59]),c_0_59])]) ).
cnf(c_0_87,negated_conjecture,
( inverse(X3) != sk_c7
| inverse(X2) != sk_c7
| inverse(X1) != sk_c7
| multiply(X3,sk_c7) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X1,sk_c7) != sk_c6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_85]),c_0_68])]) ).
cnf(c_0_88,negated_conjecture,
( inverse(X2) != sk_c7
| inverse(X1) != sk_c7
| multiply(X2,sk_c7) != sk_c6
| multiply(X1,sk_c6) != sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_85]),c_0_68])]) ).
cnf(c_0_89,negated_conjecture,
( inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_85]),c_0_33])]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_85]),c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP276-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.11/0.55 % Computer : n013.cluster.edu
% 0.11/0.55 % Model : x86_64 x86_64
% 0.11/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.55 % Memory : 8046.5625MB
% 0.11/0.55 % OS : Linux 6.8.0-71-generic
% 0.11/0.55 % CPULimit : 300
% 0.11/0.55 % WCLimit : 300
% 0.11/0.55 % DateTime : Sun Sep 20 20:07:37 UTC 2026
% 0.11/0.55 % CPUTime :
% 0.11/0.55 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.59 Running first-order theorem proving
% 0.13/0.59 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.13/0.62 % Version: 3.5.1
% 0.13/0.62 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.62 % Starting sh5l with 300s (1) cores
% 0.13/0.62 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3302899 completed with status 0
% 0.13/0.62 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.13/0.62 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.62 % No SInE strategy applied
% 0.13/0.62 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.13/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.62 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.62 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.62 % new_bool_1 with pid 3302907 completed with status 0
% 0.13/0.62 % Result found by new_bool_1
% 0.13/0.62 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.62 % No SInE strategy applied
% 0.13/0.62 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.13/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.62 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.62 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.62 % Preprocessing time : 0.001 s
% 0.13/0.62 % Presaturation interreduction done
% 0.13/0.62
% 0.13/0.62 % Proof found!
% 0.13/0.62 % SZS status Unsatisfiable
% 0.13/0.62 % SZS output start CNFRefutation
% See solution above
% 0.13/0.62 % Parsed axioms : 34
% 0.13/0.62 % Removed by relevancy pruning/SinE : 0
% 0.13/0.62 % Initial clauses : 34
% 0.13/0.62 % Removed in clause preprocessing : 0
% 0.13/0.62 % Initial clauses in saturation : 34
% 0.13/0.62 % Processed clauses : 362
% 0.13/0.62 % ...of these trivial : 51
% 0.13/0.62 % ...subsumed : 71
% 0.13/0.62 % ...remaining for further processing : 240
% 0.13/0.62 % Other redundant clauses eliminated : 0
% 0.13/0.62 % Clauses deleted for lack of memory : 0
% 0.13/0.62 % Backward-subsumed : 20
% 0.13/0.62 % Backward-rewritten : 166
% 0.13/0.62 % Generated clauses : 892
% 0.13/0.62 % ...of the previous two non-redundant : 843
% 0.13/0.62 % ...aggressively subsumed : 0
% 0.13/0.62 % Contextual simplify-reflections : 17
% 0.13/0.62 % Paramodulations : 892
% 0.13/0.62 % Factorizations : 0
% 0.13/0.62 % NegExts : 0
% 0.13/0.62 % Equation resolutions : 0
% 0.13/0.62 % Disequality decompositions : 0
% 0.13/0.62 % Total rewrite steps : 528
% 0.13/0.62 % ...of those cached : 468
% 0.13/0.62 % Propositional unsat checks : 0
% 0.13/0.62 % Propositional check models : 0
% 0.13/0.62 % Propositional check unsatisfiable : 0
% 0.13/0.62 % Propositional clauses : 0
% 0.13/0.62 % Propositional clauses after purity: 0
% 0.13/0.62 % Propositional unsat core size : 0
% 0.13/0.62 % Propositional preprocessing time : 0.000
% 0.13/0.62 % Propositional encoding time : 0.000
% 0.13/0.62 % Propositional solver time : 0.000
% 0.13/0.62 % Success case prop preproc time : 0.000
% 0.13/0.62 % Success case prop encoding time : 0.000
% 0.13/0.62 % Success case prop solver time : 0.000
% 0.13/0.62 % Current number of processed clauses : 20
% 0.13/0.62 % Positive orientable unit clauses : 19
% 0.13/0.62 % Positive unorientable unit clauses: 0
% 0.13/0.62 % Negative unit clauses : 0
% 0.13/0.62 % Non-unit-clauses : 1
% 0.13/0.62 % Current number of unprocessed clauses: 326
% 0.13/0.62 % ...number of literals in the above : 946
% 0.13/0.62 % Current number of archived formulas : 0
% 0.13/0.62 % Current number of archived clauses : 220
% 0.13/0.62 % Clause-clause subsumption calls (NU) : 604
% 0.13/0.62 % Rec. Clause-clause subsumption calls : 367
% 0.13/0.62 % Non-unit clause-clause subsumptions : 103
% 0.13/0.62 % Unit Clause-clause subsumption calls : 171
% 0.13/0.62 % Rewrite failures with RHS unbound : 0
% 0.13/0.62 % BW rewrite match attempts : 33
% 0.13/0.62 % BW rewrite match successes : 24
% 0.13/0.62 % Condensation attempts : 0
% 0.13/0.62 % Condensation successes : 0
% 0.13/0.62 % Termbank termtop insertions : 13954
% 0.13/0.62 % Search garbage collected termcells : 29
% 0.13/0.62
% 0.13/0.62 % -------------------------------------------------
% 0.13/0.63 % User time : 0.013 s
% 0.13/0.63 % System time : 0.002 s
% 0.13/0.63 % Total time : 0.016 s
% 0.13/0.63 % Maximum resident set size: 3648 pages
% 0.13/0.63
% 0.13/0.63 % -------------------------------------------------
% 0.13/0.63 % User time : 0.065 s
% 0.13/0.63 % System time : 0.013 s
% 0.13/0.63 % Total time : 0.078 s
% 0.13/0.63 % Maximum resident set size: 4864 pages
% 0.13/0.63 % E exiting
%------------------------------------------------------------------------------