%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP263-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 : n016.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:07 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 23
% Syntax : Number of clauses : 96 ( 22 unt; 58 nHn; 81 RR)
% Number of literals : 282 ( 281 equ; 138 neg)
% Maximal clause size : 15 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 86 ( 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_23,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c2,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_1,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_1) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c2,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_51,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
| multiply(sk_c9,sk_c10) != sk_c11
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != sk_c9
| inverse(X1) != sk_c11
| multiply(X1,sk_c11) != sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_51) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c3) = sk_c11
| multiply(sk_c1,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| inverse(sk_c2) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c4) = sk_c10
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_13,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c3) = sk_c11
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c4) = sk_c10
| inverse(sk_c2) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_45,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| multiply(sk_c9,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_45) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c11
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_46,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c9,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_46) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c7) = sk_c6
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c6
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c6
| multiply(sk_c1,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c6) = sk_c8
| multiply(sk_c1,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_9) ).
cnf(c_0_23,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_24,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_25,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_26,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c2,sk_c10) = sk_c9 ),
prove_this_23 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c1,sk_c11) = sk_c10 ),
prove_this_1 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| multiply(inverse(sk_c4),sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c2,sk_c10) = sk_c9 ),
prove_this_24 ).
cnf(c_0_31,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
| multiply(sk_c9,sk_c10) != sk_c11
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != sk_c9
| inverse(X1) != sk_c11
| multiply(X1,sk_c11) != sk_c10 ),
inference(fof_simplification,[status(thm)],[prove_this_51]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(inverse(sk_c3),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c3) = sk_c11
| multiply(sk_c1,sk_c11) = sk_c10 ),
prove_this_2 ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(sk_c2,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,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
| multiply(sk_c9,sk_c10) != sk_c11
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != sk_c9
| inverse(X1) != sk_c11
| multiply(X1,sk_c11) != sk_c10 ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c1,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(inverse(sk_c2),sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_26,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| inverse(sk_c2) = sk_c10 ),
prove_this_33 ).
cnf(c_0_39,negated_conjecture,
( inverse(X6) != sk_c11
| inverse(X5) != sk_c10
| inverse(X4) != sk_c11
| inverse(X3) != sk_c10
| multiply(X6,sk_c11) != sk_c10
| multiply(X5,sk_c10) != sk_c9
| multiply(X4,sk_c11) != sk_c10
| multiply(X3,sk_c10) != sk_c9
| multiply(X2,inverse(X2)) != sk_c11
| multiply(sk_c9,sk_c10) != sk_c11
| 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_35])]) ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c4) = sk_c10
| inverse(sk_c1) = sk_c11 ),
prove_this_14 ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| inverse(sk_c1) = sk_c11 ),
prove_this_13 ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(inverse(sk_c1),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_26,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| inverse(sk_c1) = sk_c11 ),
prove_this_11 ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( inverse(X5) != sk_c11
| inverse(X4) != sk_c10
| inverse(X3) != sk_c11
| multiply(X5,sk_c11) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| multiply(X3,sk_c11) != sk_c10
| multiply(X2,inverse(X2)) != sk_c11
| multiply(sk_c9,sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c11
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| inverse(sk_c1) = sk_c11 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( inverse(sk_c3) = sk_c11
| inverse(sk_c1) = sk_c11 ),
prove_this_12 ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(inverse(sk_c4),sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_26,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( inverse(sk_c4) = sk_c10
| inverse(sk_c2) = sk_c10 ),
prove_this_34 ).
cnf(c_0_50,negated_conjecture,
( inverse(X4) != sk_c11
| inverse(X3) != sk_c10
| multiply(X4,sk_c11) != sk_c10
| multiply(X3,sk_c10) != sk_c9
| multiply(X2,inverse(X2)) != sk_c11
| multiply(sk_c9,sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c11
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| inverse(sk_c1) = sk_c11 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(inverse(sk_c3),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_26,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( inverse(sk_c2) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( inverse(X3) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| multiply(X2,inverse(X2)) != sk_c11
| multiply(sk_c9,sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c11
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| inverse(sk_c1) = sk_c11 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_40]),c_0_41]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| multiply(sk_c9,sk_c10) = sk_c11 ),
prove_this_45 ).
cnf(c_0_55,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_51,c_0_46]) ).
cnf(c_0_56,negated_conjecture,
multiply(sk_c10,sk_c9) = sk_c10,
inference(spm,[status(thm)],[c_0_37,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( multiply(X2,inverse(X2)) != sk_c11
| multiply(sk_c9,sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c11
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| inverse(sk_c1) = sk_c11 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_43]) ).
cnf(c_0_58,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c1) = sk_c11 ),
prove_this_16 ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| inverse(sk_c1) = sk_c11 ),
prove_this_15 ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c11
| inverse(sk_c1) = sk_c11 ),
prove_this_17 ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c9,sk_c10) = sk_c11
| multiply(inverse(sk_c5),sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_26,c_0_54]) ).
cnf(c_0_62,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c9,sk_c10) = sk_c11 ),
prove_this_46 ).
cnf(c_0_63,negated_conjecture,
multiply(sk_c11,sk_c10) = sk_c11,
inference(spm,[status(thm)],[c_0_42,c_0_55]) ).
cnf(c_0_64,negated_conjecture,
identity = sk_c9,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_56]),c_0_24]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c9,sk_c10) != sk_c11
| inverse(X1) != multiply(X1,sk_c8)
| inverse(multiply(X1,sk_c8)) != sk_c8
| inverse(sk_c1) = sk_c11 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( inverse(sk_c7) = sk_c6
| inverse(sk_c1) = sk_c11 ),
prove_this_18 ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c6
| inverse(sk_c1) = sk_c11 ),
prove_this_20 ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c8,sk_c11) = sk_c8
| multiply(sk_c9,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_69,negated_conjecture,
sk_c9 = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_63]),c_0_24]),c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c9,sk_c10) != sk_c11
| inverse(multiply(sk_c7,sk_c8)) != sk_c8
| inverse(sk_c1) = sk_c11 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c6
| multiply(sk_c1,sk_c11) = sk_c10 ),
prove_this_10 ).
cnf(c_0_72,negated_conjecture,
( inverse(sk_c6) = sk_c8
| multiply(sk_c1,sk_c11) = sk_c10 ),
prove_this_9 ).
cnf(c_0_73,negated_conjecture,
( identity = sk_c11
| multiply(sk_c9,sk_c10) = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_68]),c_0_24]) ).
cnf(c_0_74,negated_conjecture,
multiply(sk_c10,sk_c10) = sk_c10,
inference(rw,[status(thm)],[c_0_56,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c9,sk_c10) != sk_c11
| inverse(sk_c1) = sk_c11
| multiply(sk_c1,sk_c11) = sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_76,negated_conjecture,
sk_c11 = sk_c10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_64]),c_0_69]),c_0_74]),c_0_69])]) ).
cnf(c_0_77,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c10 ),
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_75,c_0_69]),c_0_76]),c_0_76]),c_0_74]),c_0_76])]) ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c10
| multiply(sk_c10,multiply(sk_c1,X1)) = X1 ),
inference(spm,[status(thm)],[c_0_26,c_0_77]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c10
| multiply(inverse(sk_c10),X1) = multiply(sk_c1,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_78]) ).
cnf(c_0_80,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c10
| multiply(sk_c1,multiply(sk_c10,X1)) = X1 ),
inference(spm,[status(thm)],[c_0_26,c_0_79]) ).
cnf(c_0_81,negated_conjecture,
multiply(sk_c1,sk_c10) = sk_c10,
inference(spm,[status(thm)],[c_0_80,c_0_74]) ).
cnf(c_0_82,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_64]),c_0_69]) ).
cnf(c_0_83,negated_conjecture,
multiply(sk_c1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_81]),c_0_82]),c_0_82]) ).
cnf(c_0_84,negated_conjecture,
multiply(inverse(sk_c1),X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_83]) ).
cnf(c_0_85,plain,
multiply(inverse(X1),X1) = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_64]),c_0_69]) ).
cnf(c_0_86,negated_conjecture,
multiply(inverse(inverse(sk_c1)),X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_84]) ).
cnf(c_0_87,negated_conjecture,
sk_c1 = sk_c10,
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_88,negated_conjecture,
( inverse(X6) != sk_c10
| inverse(X5) != sk_c10
| inverse(X4) != sk_c10
| inverse(X3) != sk_c10
| multiply(X6,sk_c10) != sk_c10
| multiply(X5,sk_c10) != sk_c10
| multiply(X4,sk_c10) != sk_c10
| multiply(X3,sk_c10) != sk_c10
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c10
| 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)],[c_0_39,c_0_69]),c_0_69]),c_0_69]),c_0_76]),c_0_82]),c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_76])]) ).
cnf(c_0_89,negated_conjecture,
inverse(sk_c10) = sk_c10,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_85]),c_0_87]) ).
cnf(c_0_90,negated_conjecture,
( inverse(X5) != sk_c10
| inverse(X4) != sk_c10
| inverse(X3) != sk_c10
| multiply(X5,sk_c10) != sk_c10
| multiply(X4,sk_c10) != sk_c10
| multiply(X3,sk_c10) != sk_c10
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c10
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_82])]) ).
cnf(c_0_91,negated_conjecture,
( inverse(X4) != sk_c10
| inverse(X3) != sk_c10
| multiply(X4,sk_c10) != sk_c10
| multiply(X3,sk_c10) != sk_c10
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c10
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_89]),c_0_82])]) ).
cnf(c_0_92,negated_conjecture,
( inverse(X3) != sk_c10
| multiply(X3,sk_c10) != sk_c10
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c10
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_89]),c_0_82])]) ).
cnf(c_0_93,negated_conjecture,
( multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c10
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_89]),c_0_82])]) ).
cnf(c_0_94,negated_conjecture,
( inverse(X1) != multiply(X1,sk_c10)
| inverse(multiply(X1,sk_c10)) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_89]),c_0_82])]) ).
cnf(c_0_95,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_94,c_0_89]),c_0_82]),c_0_89]),c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP263-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.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:12:36 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.15/0.47 % Version: 3.5.1
% 0.15/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % Starting sh5l with 300s (1) cores
% 0.15/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 691998 completed with status 0
% 0.15/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.15/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.47 % new_bool_3 with pid 692007 completed with status 0
% 0.15/0.47 % Result found by new_bool_3
% 0.15/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.15/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.47 % Preprocessing time : 0.002 s
% 0.15/0.47 % Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 % Proof found!
% 0.15/0.47 % SZS status Unsatisfiable
% 0.15/0.47 % SZS output start CNFRefutation
% See solution above
% 0.15/0.48 % Parsed axioms : 54
% 0.15/0.48 % Removed by relevancy pruning/SinE : 0
% 0.15/0.48 % Initial clauses : 54
% 0.15/0.48 % Removed in clause preprocessing : 0
% 0.15/0.48 % Initial clauses in saturation : 54
% 0.15/0.48 % Processed clauses : 595
% 0.15/0.48 % ...of these trivial : 69
% 0.15/0.48 % ...subsumed : 107
% 0.15/0.48 % ...remaining for further processing : 419
% 0.15/0.48 % Other redundant clauses eliminated : 2
% 0.15/0.48 % Clauses deleted for lack of memory : 0
% 0.15/0.48 % Backward-subsumed : 25
% 0.15/0.48 % Backward-rewritten : 261
% 0.15/0.48 % Generated clauses : 1839
% 0.15/0.48 % ...of the previous two non-redundant : 1774
% 0.15/0.48 % ...aggressively subsumed : 0
% 0.15/0.48 % Contextual simplify-reflections : 15
% 0.15/0.48 % Paramodulations : 1836
% 0.15/0.48 % Factorizations : 2
% 0.15/0.48 % NegExts : 0
% 0.15/0.48 % Equation resolutions : 2
% 0.15/0.48 % Disequality decompositions : 0
% 0.15/0.48 % Total rewrite steps : 1108
% 0.15/0.48 % ...of those cached : 1053
% 0.15/0.48 % Propositional unsat checks : 0
% 0.15/0.48 % Propositional check models : 0
% 0.15/0.48 % Propositional check unsatisfiable : 0
% 0.15/0.48 % Propositional clauses : 0
% 0.15/0.48 % Propositional clauses after purity: 0
% 0.15/0.48 % Propositional unsat core size : 0
% 0.15/0.48 % Propositional preprocessing time : 0.000
% 0.15/0.48 % Propositional encoding time : 0.000
% 0.15/0.48 % Propositional solver time : 0.000
% 0.15/0.48 % Success case prop preproc time : 0.000
% 0.15/0.48 % Success case prop encoding time : 0.000
% 0.15/0.48 % Success case prop solver time : 0.000
% 0.15/0.48 % Current number of processed clauses : 78
% 0.15/0.48 % Positive orientable unit clauses : 12
% 0.15/0.48 % Positive unorientable unit clauses: 0
% 0.15/0.48 % Negative unit clauses : 0
% 0.15/0.48 % Non-unit-clauses : 66
% 0.15/0.48 % Current number of unprocessed clauses: 794
% 0.15/0.48 % ...number of literals in the above : 3475
% 0.15/0.48 % Current number of archived formulas : 0
% 0.15/0.48 % Current number of archived clauses : 340
% 0.15/0.48 % Clause-clause subsumption calls (NU) : 3522
% 0.15/0.48 % Rec. Clause-clause subsumption calls : 2834
% 0.15/0.48 % Non-unit clause-clause subsumptions : 142
% 0.15/0.48 % Unit Clause-clause subsumption calls : 275
% 0.15/0.48 % Rewrite failures with RHS unbound : 0
% 0.15/0.48 % BW rewrite match attempts : 35
% 0.15/0.48 % BW rewrite match successes : 22
% 0.15/0.48 % Condensation attempts : 0
% 0.15/0.48 % Condensation successes : 0
% 0.15/0.48 % Termbank termtop insertions : 29931
% 0.15/0.48 % Search garbage collected termcells : 43
% 0.15/0.48
% 0.15/0.48 % -------------------------------------------------
% 0.15/0.48 % User time : 0.042 s
% 0.15/0.48 % System time : 0.005 s
% 0.15/0.48 % Total time : 0.047 s
% 0.15/0.48 % Maximum resident set size: 3404 pages
% 0.15/0.48
% 0.15/0.48 % -------------------------------------------------
% 0.15/0.48 % User time : 0.210 s
% 0.15/0.48 % System time : 0.017 s
% 0.15/0.48 % Total time : 0.227 s
% 0.15/0.48 % Maximum resident set size: 4608 pages
% 0.15/0.48 % E exiting
%------------------------------------------------------------------------------