%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP237-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 : n014.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:03 PM UTC 2026
% Result : Unsatisfiable 5.31s 1.50s
% Output : CNFRefutation 5.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 22
% Syntax : Number of clauses : 117 ( 22 unt; 89 nHn; 94 RR)
% Number of literals : 249 ( 248 equ; 48 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 5 ( 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 : 54 ( 2 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_32,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c2) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_32) ).
cnf(prove_this_26,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c2,sk_c9) = sk_c3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_31,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| inverse(sk_c2) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_31) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c1) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| multiply(sk_c2,sk_c9) = sk_c3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c9,sk_c3) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| multiply(sk_c9,sk_c3) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| inverse(sk_c1) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| inverse(sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c6) = sk_c9
| inverse(sk_c1) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_6,negated_conjecture,
( inverse(sk_c6) = sk_c9
| inverse(sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c9,sk_c7) = sk_c8
| inverse(sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c7
| inverse(sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c1,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c7
| inverse(sk_c1) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c9,sk_c7) = sk_c8
| inverse(sk_c1) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_13,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| multiply(sk_c1,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_37,negated_conjecture,
( inverse(X7) != sk_c9
| multiply(X7,sk_c9) != X6
| multiply(sk_c9,X6) != sk_c8
| multiply(X5,sk_c8) != sk_c9
| inverse(X4) != X5
| multiply(X4,X5) != sk_c9
| inverse(X3) != sk_c9
| multiply(X3,sk_c9) != X2
| multiply(sk_c9,X2) != sk_c8
| multiply(X1,sk_c8) != sk_c9
| inverse(X1) != sk_c9
| inverse(sk_c9) != sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_37) ).
cnf(c_0_22,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_23,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_24,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_25,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_27,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_27]),c_0_26]) ).
cnf(c_0_29,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c2) = sk_c9 ),
prove_this_32 ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c2,sk_c9) = sk_c3 ),
prove_this_26 ).
cnf(c_0_32,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c2,sk_c9) = identity ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c5,sk_c4) = identity
| multiply(sk_c2,sk_c9) = sk_c3 ),
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c5,sk_c4) = identity
| multiply(sk_c2,sk_c9) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| inverse(sk_c2) = sk_c9 ),
prove_this_31 ).
cnf(c_0_36,negated_conjecture,
( identity = sk_c3
| multiply(sk_c5,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_38,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c1) = sk_c9 ),
prove_this_8 ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| multiply(sk_c2,sk_c9) = sk_c3 ),
prove_this_25 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c2,sk_c9) = identity
| multiply(sk_c4,sk_c5) = sk_c9 ),
inference(spm,[status(thm)],[c_0_29,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( identity = sk_c3
| inverse(sk_c5) = sk_c4 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_36]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c9) = sk_c8 ),
prove_this_2 ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c9) = sk_c1
| inverse(sk_c4) = sk_c5 ),
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c9,sk_c3) = sk_c8 ),
prove_this_20 ).
cnf(c_0_45,negated_conjecture,
( identity = sk_c3
| multiply(sk_c4,sk_c5) = sk_c9 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( identity = sk_c3
| multiply(sk_c4,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c9) = sk_c8
| multiply(sk_c5,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( inverse(sk_c9) = sk_c1
| multiply(sk_c5,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_43]) ).
cnf(c_0_49,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| multiply(sk_c9,sk_c3) = sk_c8 ),
prove_this_19 ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c4,sk_c5) = identity
| multiply(sk_c9,sk_c3) = sk_c8 ),
inference(spm,[status(thm)],[c_0_29,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
( identity = sk_c9
| identity = sk_c3 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| inverse(sk_c1) = sk_c9 ),
prove_this_7 ).
cnf(c_0_54,negated_conjecture,
( sk_c1 = sk_c8
| multiply(sk_c5,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( identity = sk_c9
| multiply(sk_c9,sk_c3) = sk_c8 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( identity = sk_c9
| multiply(X1,sk_c3) = X1 ),
inference(spm,[status(thm)],[c_0_37,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| inverse(sk_c9) = sk_c8 ),
prove_this_1 ).
cnf(c_0_59,negated_conjecture,
( inverse(sk_c9) = sk_c1
| multiply(sk_c4,sk_c5) = sk_c9 ),
inference(spm,[status(thm)],[c_0_28,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( sk_c1 = sk_c8
| inverse(sk_c5) = sk_c4 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_54]),c_0_37]) ).
cnf(c_0_61,negated_conjecture,
( inverse(sk_c6) = sk_c9
| inverse(sk_c1) = sk_c9 ),
prove_this_12 ).
cnf(c_0_62,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_23,c_0_55]) ).
cnf(c_0_63,negated_conjecture,
( sk_c8 = sk_c9
| identity = sk_c9 ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( inverse(sk_c6) = sk_c9
| inverse(sk_c9) = sk_c8 ),
prove_this_6 ).
cnf(c_0_65,negated_conjecture,
( sk_c1 = sk_c8
| multiply(sk_c4,sk_c5) = sk_c9 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
( sk_c1 = sk_c8
| multiply(sk_c4,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( inverse(sk_c9) = sk_c1
| inverse(sk_c6) = sk_c9 ),
inference(spm,[status(thm)],[c_0_28,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c9,sk_c7) = sk_c8
| inverse(sk_c9) = sk_c8 ),
prove_this_4 ).
cnf(c_0_69,negated_conjecture,
( sk_c8 = sk_c9
| inverse(sk_c9) = sk_c9 ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c7
| inverse(sk_c9) = sk_c8 ),
prove_this_5 ).
cnf(c_0_71,negated_conjecture,
( inverse(sk_c9) = sk_c6
| inverse(sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_28,c_0_64]) ).
cnf(c_0_72,negated_conjecture,
( identity = sk_c9
| sk_c1 = sk_c8 ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_73,negated_conjecture,
( inverse(sk_c9) = sk_c8
| multiply(sk_c9,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_64]) ).
cnf(c_0_74,negated_conjecture,
( inverse(sk_c9) = sk_c1
| multiply(sk_c9,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_67]) ).
cnf(c_0_75,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c1,sk_c8) = sk_c9 ),
prove_this_14 ).
cnf(c_0_76,negated_conjecture,
( sk_c8 = sk_c9
| multiply(sk_c9,X1) = X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_63]) ).
cnf(c_0_77,negated_conjecture,
( sk_c8 = sk_c9
| multiply(sk_c9,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_78,negated_conjecture,
( sk_c8 = sk_c9
| multiply(X1,sk_c9) = X1 ),
inference(spm,[status(thm)],[c_0_37,c_0_63]) ).
cnf(c_0_79,negated_conjecture,
( sk_c8 = sk_c9
| multiply(sk_c6,sk_c9) = sk_c7 ),
inference(spm,[status(thm)],[c_0_70,c_0_69]) ).
cnf(c_0_80,negated_conjecture,
( sk_c6 != sk_c8
| inverse(sk_c9) = sk_c8 ),
inference(ef,[status(thm)],[c_0_71]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c7
| inverse(sk_c1) = sk_c9 ),
prove_this_11 ).
cnf(c_0_82,negated_conjecture,
( sk_c1 = sk_c8
| multiply(sk_c9,X1) = X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_72]) ).
cnf(c_0_83,negated_conjecture,
( sk_c1 = sk_c8
| multiply(sk_c9,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_84,negated_conjecture,
( multiply(sk_c5,sk_c4) = identity
| multiply(sk_c1,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_23,c_0_75]) ).
cnf(c_0_85,negated_conjecture,
( sk_c7 = sk_c8
| sk_c8 = sk_c9 ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_86,negated_conjecture,
( sk_c7 = sk_c6
| sk_c8 = sk_c9 ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_87,negated_conjecture,
( sk_c6 != sk_c8
| sk_c8 = sk_c9 ),
inference(spm,[status(thm)],[c_0_80,c_0_69]) ).
cnf(c_0_88,negated_conjecture,
( multiply(sk_c9,sk_c7) = sk_c8
| inverse(sk_c1) = sk_c9 ),
prove_this_10 ).
cnf(c_0_89,negated_conjecture,
( inverse(sk_c9) = sk_c1
| multiply(sk_c6,sk_c9) = sk_c7 ),
inference(spm,[status(thm)],[c_0_28,c_0_81]) ).
cnf(c_0_90,negated_conjecture,
( identity = sk_c6
| sk_c1 = sk_c8 ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_91,negated_conjecture,
( multiply(sk_c5,sk_c4) = identity
| multiply(sk_c1,multiply(sk_c8,X1)) = multiply(sk_c9,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_84]) ).
cnf(c_0_92,negated_conjecture,
sk_c8 = sk_c9,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]) ).
cnf(c_0_93,negated_conjecture,
( inverse(sk_c9) = sk_c1
| multiply(sk_c9,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_28,c_0_88]) ).
cnf(c_0_94,negated_conjecture,
( sk_c1 = sk_c8
| multiply(sk_c6,sk_c9) = sk_c7 ),
inference(spm,[status(thm)],[c_0_70,c_0_89]) ).
cnf(c_0_95,negated_conjecture,
( sk_c1 = sk_c8
| multiply(sk_c6,X1) = X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_90]) ).
cnf(c_0_96,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| multiply(sk_c1,sk_c8) = sk_c9 ),
prove_this_13 ).
cnf(c_0_97,negated_conjecture,
( identity = sk_c1
| multiply(sk_c5,sk_c4) = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_29]),c_0_37]),c_0_92]),c_0_29]) ).
cnf(c_0_98,negated_conjecture,
( sk_c1 = sk_c8
| multiply(sk_c9,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_68,c_0_93]) ).
cnf(c_0_99,negated_conjecture,
( sk_c7 = sk_c9
| sk_c1 = sk_c8 ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_100,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c9
| multiply(sk_c1,multiply(sk_c8,X1)) = multiply(sk_c9,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_96]) ).
cnf(c_0_101,negated_conjecture,
( identity = sk_c1
| inverse(sk_c5) = sk_c4 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_97]),c_0_37]) ).
cnf(c_0_102,negated_conjecture,
( sk_c1 = sk_c8
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_103,negated_conjecture,
( identity = sk_c1
| multiply(sk_c4,sk_c5) = sk_c9 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_29]),c_0_37]),c_0_92]),c_0_29]) ).
cnf(c_0_104,negated_conjecture,
( identity = sk_c1
| multiply(sk_c4,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_101]) ).
cnf(c_0_105,negated_conjecture,
( sk_c1 = sk_c8
| multiply(inverse(sk_c9),sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_25,c_0_102]) ).
cnf(c_0_106,negated_conjecture,
( inverse(X7) != sk_c9
| multiply(X7,sk_c9) != X6
| multiply(sk_c9,X6) != sk_c8
| multiply(X5,sk_c8) != sk_c9
| inverse(X4) != X5
| multiply(X4,X5) != sk_c9
| inverse(X3) != sk_c9
| multiply(X3,sk_c9) != X2
| multiply(sk_c9,X2) != sk_c8
| multiply(X1,sk_c8) != sk_c9
| inverse(X1) != sk_c9
| inverse(sk_c9) != sk_c8 ),
inference(fof_simplification,[status(thm)],[prove_this_37]) ).
cnf(c_0_107,negated_conjecture,
( identity = sk_c9
| identity = sk_c1 ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_108,negated_conjecture,
( identity = sk_c9
| sk_c1 = sk_c9 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_92]),c_0_23]),c_0_92]) ).
cnf(c_0_109,negated_conjecture,
( inverse(X7) != sk_c9
| multiply(X7,sk_c9) != X6
| multiply(sk_c9,X6) != sk_c8
| multiply(X5,sk_c8) != sk_c9
| inverse(X4) != X5
| multiply(X4,X5) != sk_c9
| inverse(X3) != sk_c9
| multiply(X3,sk_c9) != X2
| multiply(sk_c9,X2) != sk_c8
| multiply(X1,sk_c8) != sk_c9
| inverse(X1) != sk_c9
| inverse(sk_c9) != sk_c8 ),
c_0_106 ).
cnf(c_0_110,negated_conjecture,
identity = sk_c9,
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_107]),c_0_108]) ).
cnf(c_0_111,negated_conjecture,
( identity != sk_c9
| inverse(X4) != sk_c9
| inverse(X2) != sk_c9
| inverse(X1) != sk_c9
| inverse(sk_c9) != sk_c8
| multiply(X4,sk_c8) != sk_c9
| multiply(inverse(X3),sk_c8) != sk_c9
| multiply(sk_c9,multiply(X2,sk_c9)) != sk_c8
| multiply(sk_c9,multiply(X1,sk_c9)) != sk_c8 ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_109])])]),c_0_29]) ).
cnf(c_0_112,plain,
multiply(X1,sk_c9) = X1,
inference(rw,[status(thm)],[c_0_37,c_0_110]) ).
cnf(c_0_113,plain,
multiply(sk_c9,X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_110]) ).
cnf(c_0_114,plain,
inverse(sk_c9) = sk_c9,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_110]),c_0_110]) ).
cnf(c_0_115,negated_conjecture,
inverse(X1) != sk_c9,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[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)],[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_111,c_0_92]),c_0_92]),c_0_92]),c_0_92]),c_0_92]),c_0_112]),c_0_113]),c_0_112]),c_0_113]),c_0_112]),c_0_112]),c_0_114]),c_0_110])])])])]),c_0_114])]) ).
cnf(c_0_116,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_61,c_0_115]),c_0_115]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP237-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.09/0.77 % Computer : n014.cluster.edu
% 0.09/0.77 % Model : x86_64 x86_64
% 0.09/0.77 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.77 % Memory : 8046.5625MB
% 0.09/0.77 % OS : Linux 6.8.0-71-generic
% 0.09/0.77 % CPULimit : 300
% 0.09/0.77 % WCLimit : 300
% 0.09/0.77 % DateTime : Sun Sep 20 20:07:05 UTC 2026
% 0.09/0.78 % CPUTime :
% 0.09/0.78 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.82 Running first-order theorem proving
% 0.14/0.82 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
% 5.31/1.50 % Version: 3.5.1
% 5.31/1.50 % Preprocessing class: FSMSSMSMSSSNFFN.
% 5.31/1.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.31/1.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 5.31/1.50 % Starting new_bool_3 with 300s (1) cores
% 5.31/1.50 % Starting new_bool_1 with 300s (1) cores
% 5.31/1.50 % Starting sh5l with 300s (1) cores
% 5.31/1.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2237802 completed with status 0
% 5.31/1.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 5.31/1.50 % Preprocessing class: FSMSSMSMSSSNFFN.
% 5.31/1.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.31/1.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 5.31/1.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.31/1.50 % No SInE strategy applied
% 5.31/1.50 % Search class: FGHPS-FFMM21-SFFFFFNN
% 5.31/1.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.31/1.50 % Starting SubtermCWHack with 136s (1) cores
% 5.31/1.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 5.31/1.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.31/1.50 % Starting new_bool_3 with 136s (1) cores
% 5.31/1.50 % Starting new_bool_1 with 136s (1) cores
% 5.31/1.50 % SubtermCWHack with pid 2237806 completed with status 0
% 5.31/1.50 % Result found by SubtermCWHack
% 5.31/1.50 % Preprocessing class: FSMSSMSMSSSNFFN.
% 5.31/1.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.31/1.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 5.31/1.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.31/1.50 % No SInE strategy applied
% 5.31/1.50 % Search class: FGHPS-FFMM21-SFFFFFNN
% 5.31/1.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.31/1.50 % Starting SubtermCWHack with 136s (1) cores
% 5.31/1.50 % Preprocessing time : 0.001 s
% 5.31/1.50
% 5.31/1.50 % Proof found!
% 5.31/1.50 % SZS status Unsatisfiable
% 5.31/1.50 % SZS output start CNFRefutation
% See solution above
% 5.31/1.50 % Parsed axioms : 40
% 5.31/1.50 % Removed by relevancy pruning/SinE : 0
% 5.31/1.50 % Initial clauses : 40
% 5.31/1.50 % Removed in clause preprocessing : 0
% 5.31/1.50 % Initial clauses in saturation : 40
% 5.31/1.50 % Processed clauses : 11958
% 5.31/1.50 % ...of these trivial : 80
% 5.31/1.50 % ...subsumed : 10149
% 5.31/1.50 % ...remaining for further processing : 1729
% 5.31/1.50 % Other redundant clauses eliminated : 6
% 5.31/1.50 % Clauses deleted for lack of memory : 0
% 5.31/1.50 % Backward-subsumed : 51
% 5.31/1.50 % Backward-rewritten : 1129
% 5.31/1.50 % Generated clauses : 76276
% 5.31/1.50 % ...of the previous two non-redundant : 74714
% 5.31/1.50 % ...aggressively subsumed : 0
% 5.31/1.50 % Contextual simplify-reflections : 2
% 5.31/1.50 % Paramodulations : 76223
% 5.31/1.50 % Factorizations : 8
% 5.31/1.50 % NegExts : 0
% 5.31/1.50 % Equation resolutions : 6
% 5.31/1.50 % Disequality decompositions : 0
% 5.31/1.50 % Total rewrite steps : 21451
% 5.31/1.50 % ...of those cached : 20617
% 5.31/1.50 % Propositional unsat checks : 0
% 5.31/1.50 % Propositional check models : 0
% 5.31/1.50 % Propositional check unsatisfiable : 0
% 5.31/1.50 % Propositional clauses : 0
% 5.31/1.50 % Propositional clauses after purity: 0
% 5.31/1.50 % Propositional unsat core size : 0
% 5.31/1.50 % Propositional preprocessing time : 0.000
% 5.31/1.50 % Propositional encoding time : 0.000
% 5.31/1.50 % Propositional solver time : 0.000
% 5.31/1.50 % Success case prop preproc time : 0.000
% 5.31/1.50 % Success case prop encoding time : 0.000
% 5.31/1.50 % Success case prop solver time : 0.000
% 5.31/1.50 % Current number of processed clauses : 504
% 5.31/1.50 % Positive orientable unit clauses : 17
% 5.31/1.50 % Positive unorientable unit clauses: 0
% 5.31/1.50 % Negative unit clauses : 1
% 5.31/1.50 % Non-unit-clauses : 486
% 5.31/1.50 % Current number of unprocessed clauses: 27751
% 5.31/1.50 % ...number of literals in the above : 76160
% 5.31/1.50 % Current number of archived formulas : 0
% 5.31/1.50 % Current number of archived clauses : 1223
% 5.31/1.50 % Clause-clause subsumption calls (NU) : 91675
% 5.31/1.50 % Rec. Clause-clause subsumption calls : 76355
% 5.31/1.50 % Non-unit clause-clause subsumptions : 10185
% 5.31/1.50 % Unit Clause-clause subsumption calls : 771
% 5.31/1.50 % Rewrite failures with RHS unbound : 0
% 5.31/1.50 % BW rewrite match attempts : 76
% 5.31/1.50 % BW rewrite match successes : 40
% 5.31/1.50 % Condensation attempts : 0
% 5.31/1.50 % Condensation successes : 0
% 5.31/1.50 % Termbank termtop insertions : 550312
% 5.31/1.50 % Search garbage collected termcells : 34
% 5.31/1.50
% 5.31/1.50 % -------------------------------------------------
% 5.31/1.50 % User time : 0.606 s
% 5.31/1.50 % System time : 0.030 s
% 5.31/1.50 % Total time : 0.636 s
% 5.31/1.50 % Maximum resident set size: 3652 pages
% 5.31/1.50
% 5.31/1.50 % -------------------------------------------------
% 5.31/1.50 % User time : 3.016 s
% 5.31/1.50 % System time : 0.158 s
% 5.31/1.50 % Total time : 3.175 s
% 5.31/1.50 % Maximum resident set size: 4864 pages
% 5.31/1.50 % E exiting
%------------------------------------------------------------------------------