%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP238-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:42:58 PM UTC 2026
% Result : Unsatisfiable 0.64s 0.58s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 20
% Syntax : Number of clauses : 99 ( 20 unt; 68 nHn; 86 RR)
% Number of literals : 271 ( 270 equ; 113 neg)
% Maximal clause size : 16 ( 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 : 79 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c6,sk_c10) = sk_c11
| multiply(sk_c1,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c6) = sk_c11
| multiply(sk_c1,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c6,sk_c10) = sk_c11
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_36,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c10
| multiply(sk_c11,sk_c3) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_36) ).
cnf(prove_this_41,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_41) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c6) = sk_c11
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_37,negated_conjecture,
( inverse(sk_c7) = sk_c8
| multiply(sk_c11,sk_c3) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_37) ).
cnf(prove_this_31,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c11
| multiply(sk_c11,sk_c3) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_31) ).
cnf(prove_this_42,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c2,sk_c11) = sk_c3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_42) ).
cnf(prove_this_32,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c11,sk_c3) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_32) ).
cnf(prove_this_51,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c11
| inverse(sk_c2) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_51) ).
cnf(prove_this_56,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c10
| inverse(sk_c2) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_56) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c9,sk_c11) = sk_c10
| inverse(sk_c11) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_52,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c2) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_52) ).
cnf(prove_this_57,negated_conjecture,
( inverse(sk_c7) = sk_c8
| inverse(sk_c2) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_57) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c9) = sk_c10
| inverse(sk_c11) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_61,negated_conjecture,
( multiply(X9,sk_c11) != sk_c10
| inverse(X9) != sk_c10
| multiply(X8,sk_c11) != sk_c10
| inverse(X7) != X8
| multiply(X7,X8) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| inverse(X6) != sk_c11
| multiply(X5,sk_c10) != sk_c11
| inverse(X4) != X5
| multiply(X4,X5) != sk_c11
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != X2
| multiply(sk_c11,X2) != sk_c10
| multiply(X1,sk_c10) != sk_c11
| inverse(X1) != sk_c11
| inverse(sk_c11) != sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_61) ).
cnf(c_0_20,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_21,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_22,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_23,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c6,sk_c10) = sk_c11
| multiply(sk_c1,sk_c10) = sk_c11 ),
prove_this_25 ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(inverse(sk_c6),sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( inverse(sk_c6) = sk_c11
| multiply(sk_c1,sk_c10) = sk_c11 ),
prove_this_24 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c11,sk_c11) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c11,sk_c11) = sk_c10
| multiply(inverse(sk_c1),sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c6,sk_c10) = sk_c11
| inverse(sk_c1) = sk_c11 ),
prove_this_15 ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c11,sk_c11) = sk_c10
| multiply(sk_c6,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c10
| multiply(sk_c11,sk_c3) = sk_c10 ),
prove_this_36 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c3 ),
prove_this_41 ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c11,sk_c11) = sk_c10
| multiply(inverse(sk_c6),sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c6) = sk_c11
| inverse(sk_c1) = sk_c11 ),
prove_this_14 ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c11,sk_c3) = sk_c10
| multiply(inverse(sk_c7),sk_c10) = sk_c8 ),
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c7) = sk_c8
| multiply(sk_c11,sk_c3) = sk_c10 ),
prove_this_37 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c11
| multiply(sk_c11,sk_c3) = sk_c10 ),
prove_this_31 ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c3
| multiply(inverse(sk_c4),sk_c11) = sk_c5 ),
inference(spm,[status(thm)],[c_0_23,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c2,sk_c11) = sk_c3 ),
prove_this_42 ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c11,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c8
| multiply(sk_c11,sk_c3) = sk_c10 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c11,sk_c3) = sk_c10
| multiply(inverse(sk_c4),sk_c11) = sk_c5 ),
inference(spm,[status(thm)],[c_0_23,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c11,sk_c3) = sk_c10 ),
prove_this_32 ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c3
| multiply(sk_c4,multiply(sk_c5,X1)) = multiply(sk_c11,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_32]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c5
| multiply(sk_c2,sk_c11) = sk_c3 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
multiply(sk_c11,sk_c11) = sk_c10,
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( identity = sk_c10
| multiply(sk_c11,sk_c3) = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_41]),c_0_21]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c5
| multiply(sk_c11,sk_c3) = sk_c10 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c10
| multiply(sk_c2,sk_c11) = sk_c3 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( identity = sk_c10
| multiply(inverse(sk_c11),sk_c10) = sk_c3 ),
inference(spm,[status(thm)],[c_0_23,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
multiply(inverse(sk_c11),sk_c10) = sk_c11,
inference(spm,[status(thm)],[c_0_23,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( identity = sk_c11
| multiply(sk_c11,sk_c3) = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_48]),c_0_21]) ).
cnf(c_0_53,negated_conjecture,
( sk_c10 = sk_c11
| multiply(sk_c2,sk_c11) = sk_c3 ),
inference(spm,[status(thm)],[c_0_32,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( sk_c3 = sk_c11
| identity = sk_c10 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( sk_c3 = sk_c11
| identity = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_52]),c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( sk_c10 = sk_c11
| multiply(inverse(sk_c2),sk_c3) = sk_c11 ),
inference(spm,[status(thm)],[c_0_23,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( sk_c10 = sk_c11
| sk_c3 = sk_c11 ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( sk_c10 = sk_c11
| multiply(inverse(sk_c2),sk_c11) = sk_c11 ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c11
| inverse(sk_c2) = sk_c11 ),
prove_this_51 ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c10
| inverse(sk_c2) = sk_c11 ),
prove_this_56 ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c9,sk_c11) = sk_c10
| inverse(sk_c11) = sk_c10 ),
prove_this_10 ).
cnf(c_0_62,negated_conjecture,
( sk_c10 = sk_c11
| multiply(sk_c4,sk_c5) = sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_46])]) ).
cnf(c_0_63,negated_conjecture,
( sk_c10 = sk_c11
| multiply(sk_c7,sk_c8) = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_60]),c_0_46])]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c11
| multiply(sk_c9,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_51,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( sk_c10 = sk_c11
| multiply(inverse(sk_c4),sk_c11) = sk_c5 ),
inference(spm,[status(thm)],[c_0_23,c_0_62]) ).
cnf(c_0_66,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c2) = sk_c11 ),
prove_this_52 ).
cnf(c_0_67,negated_conjecture,
( sk_c10 = sk_c11
| multiply(inverse(sk_c7),sk_c10) = sk_c8 ),
inference(spm,[status(thm)],[c_0_23,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( inverse(sk_c7) = sk_c8
| inverse(sk_c2) = sk_c11 ),
prove_this_57 ).
cnf(c_0_69,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c11
| multiply(inverse(sk_c9),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_23,c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( inverse(sk_c9) = sk_c10
| inverse(sk_c11) = sk_c10 ),
prove_this_9 ).
cnf(c_0_71,negated_conjecture,
( sk_c10 = sk_c11
| inverse(sk_c2) = sk_c11
| multiply(sk_c5,sk_c11) = sk_c5 ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_72,negated_conjecture,
( sk_c10 = sk_c11
| inverse(sk_c2) = sk_c11
| multiply(sk_c8,sk_c10) = sk_c8 ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_73,negated_conjecture,
( inverse(sk_c11) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( sk_c10 = sk_c11
| multiply(sk_c5,sk_c11) = sk_c5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_71]),c_0_46])]) ).
cnf(c_0_75,negated_conjecture,
( sk_c10 = sk_c11
| multiply(sk_c8,sk_c10) = sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_72]),c_0_46])]) ).
cnf(c_0_76,negated_conjecture,
multiply(sk_c10,sk_c10) = sk_c11,
inference(spm,[status(thm)],[c_0_51,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
( identity = sk_c11
| sk_c10 = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_74]),c_0_21]) ).
cnf(c_0_78,negated_conjecture,
( identity = sk_c10
| sk_c10 = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_75]),c_0_21]) ).
cnf(c_0_79,negated_conjecture,
multiply(inverse(sk_c10),sk_c11) = sk_c10,
inference(spm,[status(thm)],[c_0_23,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
sk_c10 = sk_c11,
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
( multiply(X9,sk_c11) != sk_c10
| inverse(X9) != sk_c10
| multiply(X8,sk_c11) != sk_c10
| inverse(X7) != X8
| multiply(X7,X8) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| inverse(X6) != sk_c11
| multiply(X5,sk_c10) != sk_c11
| inverse(X4) != X5
| multiply(X4,X5) != sk_c11
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != X2
| multiply(sk_c11,X2) != sk_c10
| multiply(X1,sk_c10) != sk_c11
| inverse(X1) != sk_c11
| inverse(sk_c11) != sk_c10 ),
inference(fof_simplification,[status(thm)],[prove_this_61]) ).
cnf(c_0_82,negated_conjecture,
identity = sk_c11,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80]),c_0_21]),c_0_80]) ).
cnf(c_0_83,negated_conjecture,
( multiply(X9,sk_c11) != sk_c10
| inverse(X9) != sk_c10
| multiply(X8,sk_c11) != sk_c10
| inverse(X7) != X8
| multiply(X7,X8) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| inverse(X6) != sk_c11
| multiply(X5,sk_c10) != sk_c11
| inverse(X4) != X5
| multiply(X4,X5) != sk_c11
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != X2
| multiply(sk_c11,X2) != sk_c10
| multiply(X1,sk_c10) != sk_c11
| inverse(X1) != sk_c11
| inverse(sk_c11) != sk_c10 ),
c_0_81 ).
cnf(c_0_84,plain,
multiply(inverse(X1),X1) = sk_c11,
inference(rw,[status(thm)],[c_0_21,c_0_82]) ).
cnf(c_0_85,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_86,negated_conjecture,
( inverse(X6) != sk_c11
| inverse(X1) != sk_c11
| inverse(X5) != sk_c11
| inverse(X4) != sk_c10
| inverse(sk_c11) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| multiply(X5,sk_c10) != sk_c11
| multiply(X4,sk_c11) != sk_c10
| multiply(X3,inverse(X3)) != sk_c11
| multiply(X2,inverse(X2)) != sk_c10
| multiply(inverse(X3),sk_c10) != sk_c11
| multiply(inverse(X2),sk_c11) != sk_c10
| multiply(sk_c11,multiply(X1,sk_c11)) != sk_c10 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_83])])]) ).
cnf(c_0_87,plain,
multiply(sk_c11,X1) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_82]) ).
cnf(c_0_88,plain,
multiply(X1,inverse(X1)) = sk_c11,
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_89,negated_conjecture,
( inverse(X6) != sk_c11
| inverse(X3) != sk_c11
| inverse(X5) != sk_c11
| inverse(X4) != sk_c11
| inverse(sk_c11) != sk_c11
| multiply(X6,sk_c11) != sk_c11
| multiply(X5,sk_c11) != sk_c11
| multiply(X4,sk_c11) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X1,inverse(X1)) != sk_c11
| multiply(inverse(X2),sk_c11) != sk_c11
| multiply(inverse(X1),sk_c11) != sk_c11 ),
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_86,c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_87]) ).
cnf(c_0_90,plain,
multiply(inverse(X1),sk_c11) = inverse(X1),
inference(spm,[status(thm)],[c_0_23,c_0_88]) ).
cnf(c_0_91,plain,
inverse(sk_c11) = sk_c11,
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_92,negated_conjecture,
( inverse(X4) != sk_c11
| inverse(X1) != sk_c11
| inverse(X3) != sk_c11
| inverse(X2) != sk_c11
| inverse(X6) != sk_c11
| inverse(X5) != sk_c11
| multiply(X4,sk_c11) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X2,sk_c11) != sk_c11
| multiply(X1,sk_c11) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_88]),c_0_88])]),c_0_90]),c_0_90]),c_0_91])]) ).
cnf(c_0_93,negated_conjecture,
( inverse(X4) != sk_c11
| inverse(X1) != sk_c11
| inverse(X3) != sk_c11
| inverse(X2) != sk_c11
| inverse(X5) != sk_c11
| multiply(X4,sk_c11) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X2,sk_c11) != sk_c11
| multiply(X1,sk_c11) != sk_c11 ),
inference(spm,[status(thm)],[c_0_92,c_0_91]) ).
cnf(c_0_94,negated_conjecture,
( inverse(X4) != sk_c11
| inverse(X1) != sk_c11
| inverse(X3) != sk_c11
| inverse(X2) != sk_c11
| multiply(X4,sk_c11) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X2,sk_c11) != sk_c11
| multiply(X1,sk_c11) != sk_c11 ),
inference(spm,[status(thm)],[c_0_93,c_0_91]) ).
cnf(c_0_95,negated_conjecture,
( inverse(X3) != sk_c11
| inverse(X1) != sk_c11
| inverse(X2) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X2,sk_c11) != sk_c11
| multiply(X1,sk_c11) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_91]),c_0_87])]) ).
cnf(c_0_96,negated_conjecture,
( inverse(X2) != sk_c11
| inverse(X1) != sk_c11
| multiply(X2,sk_c11) != sk_c11
| multiply(X1,sk_c11) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_91]),c_0_87])]) ).
cnf(c_0_97,negated_conjecture,
( inverse(X1) != sk_c11
| multiply(X1,sk_c11) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_91]),c_0_87])]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_91]),c_0_87])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP238-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n009.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:07:12 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.64/0.58 % Version: 3.5.1
% 0.64/0.58 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.64/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.64/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.64/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.64/0.58 % Starting sh5l with 300s (1) cores
% 0.64/0.58 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 4125940 completed with status 0
% 0.64/0.58 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.64/0.58 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.64/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.64/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.58 % No SInE strategy applied
% 0.64/0.58 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.64/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.64/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.64/0.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.64/0.58 % Starting new_bool_3 with 136s (1) cores
% 0.64/0.58 % Starting new_bool_1 with 136s (1) cores
% 0.64/0.58 % new_bool_3 with pid 4125947 completed with status 0
% 0.64/0.58 % Result found by new_bool_3
% 0.64/0.58 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.64/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.64/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.58 % No SInE strategy applied
% 0.64/0.58 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.64/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.64/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.64/0.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.64/0.58 % Starting new_bool_3 with 136s (1) cores
% 0.64/0.58 % Preprocessing time : 0.001 s
% 0.64/0.58 % Presaturation interreduction done
% 0.64/0.58
% 0.64/0.58 % Proof found!
% 0.64/0.58 % SZS status Unsatisfiable
% 0.64/0.58 % SZS output start CNFRefutation
% See solution above
% 0.64/0.58 % Parsed axioms : 64
% 0.64/0.58 % Removed by relevancy pruning/SinE : 0
% 0.64/0.58 % Initial clauses : 64
% 0.64/0.58 % Removed in clause preprocessing : 0
% 0.64/0.58 % Initial clauses in saturation : 64
% 0.64/0.58 % Processed clauses : 3961
% 0.64/0.58 % ...of these trivial : 64
% 0.64/0.58 % ...subsumed : 2907
% 0.64/0.58 % ...remaining for further processing : 990
% 0.64/0.58 % Other redundant clauses eliminated : 3
% 0.64/0.58 % Clauses deleted for lack of memory : 0
% 0.64/0.58 % Backward-subsumed : 202
% 0.64/0.58 % Backward-rewritten : 707
% 0.64/0.58 % Generated clauses : 11970
% 0.64/0.58 % ...of the previous two non-redundant : 10681
% 0.64/0.58 % ...aggressively subsumed : 0
% 0.64/0.58 % Contextual simplify-reflections : 41
% 0.64/0.58 % Paramodulations : 11969
% 0.64/0.58 % Factorizations : 0
% 0.64/0.58 % NegExts : 0
% 0.64/0.58 % Equation resolutions : 3
% 0.64/0.58 % Disequality decompositions : 0
% 0.64/0.58 % Total rewrite steps : 5441
% 0.64/0.58 % ...of those cached : 5255
% 0.64/0.58 % Propositional unsat checks : 0
% 0.64/0.58 % Propositional check models : 0
% 0.64/0.58 % Propositional check unsatisfiable : 0
% 0.64/0.58 % Propositional clauses : 0
% 0.64/0.58 % Propositional clauses after purity: 0
% 0.64/0.58 % Propositional unsat core size : 0
% 0.64/0.58 % Propositional preprocessing time : 0.000
% 0.64/0.58 % Propositional encoding time : 0.000
% 0.64/0.58 % Propositional solver time : 0.000
% 0.64/0.58 % Success case prop preproc time : 0.000
% 0.64/0.58 % Success case prop encoding time : 0.000
% 0.64/0.58 % Success case prop solver time : 0.000
% 0.64/0.58 % Current number of processed clauses : 16
% 0.64/0.58 % Positive orientable unit clauses : 15
% 0.64/0.58 % Positive unorientable unit clauses: 0
% 0.64/0.58 % Negative unit clauses : 0
% 0.64/0.58 % Non-unit-clauses : 1
% 0.64/0.58 % Current number of unprocessed clauses: 2321
% 0.64/0.58 % ...number of literals in the above : 16096
% 0.64/0.58 % Current number of archived formulas : 0
% 0.64/0.58 % Current number of archived clauses : 973
% 0.64/0.58 % Clause-clause subsumption calls (NU) : 59864
% 0.64/0.58 % Rec. Clause-clause subsumption calls : 23017
% 0.64/0.58 % Non-unit clause-clause subsumptions : 3095
% 0.64/0.58 % Unit Clause-clause subsumption calls : 833
% 0.64/0.58 % Rewrite failures with RHS unbound : 0
% 0.64/0.58 % BW rewrite match attempts : 106
% 0.64/0.58 % BW rewrite match successes : 56
% 0.64/0.58 % Condensation attempts : 0
% 0.64/0.58 % Condensation successes : 0
% 0.64/0.58 % Termbank termtop insertions : 176994
% 0.64/0.58 % Search garbage collected termcells : 46
% 0.64/0.58
% 0.64/0.58 % -------------------------------------------------
% 0.64/0.58 % User time : 0.135 s
% 0.64/0.58 % System time : 0.004 s
% 0.64/0.58 % Total time : 0.139 s
% 0.64/0.58 % Maximum resident set size: 3612 pages
% 0.64/0.58
% 0.64/0.58 % -------------------------------------------------
% 0.64/0.58 % User time : 0.603 s
% 0.64/0.58 % System time : 0.038 s
% 0.64/0.58 % Total time : 0.640 s
% 0.64/0.58 % Maximum resident set size: 4608 pages
% 0.64/0.58 % E exiting
%------------------------------------------------------------------------------