%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP377-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 : n012.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:26 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.39s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 16
% Syntax : Number of clauses : 101 ( 30 unt; 56 nHn; 76 RR)
% Number of literals : 263 ( 262 equ; 113 neg)
% Maximal clause size : 14 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 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_11,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| multiply(sk_c1,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c2) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| inverse(sk_c1) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c2) = sk_c10
| inverse(sk_c1) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c3) = sk_c9
| inverse(sk_c1) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c3) = sk_c9
| inverse(sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| inverse(sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_41,negated_conjecture,
( multiply(X6,X5) != X7
| inverse(X7) != X5
| inverse(X6) != X7
| multiply(X5,sk_c9) != sk_c10
| inverse(X4) != X5
| multiply(X4,X5) != sk_c10
| inverse(X3) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != sk_c9
| multiply(sk_c8,sk_c9) != sk_c10
| inverse(X1) != sk_c10
| multiply(X1,sk_c10) != sk_c9
| inverse(sk_c10) != sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_41) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c3) = sk_c9
| multiply(sk_c8,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c3) = sk_c9
| multiply(sk_c1,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_35,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c10
| multiply(sk_c8,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_35) ).
cnf(prove_this_36,negated_conjecture,
( inverse(sk_c4) = sk_c7
| multiply(sk_c8,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_36) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| multiply(sk_c8,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_33) ).
cnf(c_0_16,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_17,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_18,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| multiply(sk_c1,sk_c10) = sk_c9 ),
prove_this_11 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(inverse(sk_c2),sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( inverse(sk_c2) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c9 ),
prove_this_12 ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(inverse(sk_c1),sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| inverse(sk_c1) = sk_c10 ),
prove_this_21 ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(sk_c2,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(inverse(sk_c2),sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( inverse(sk_c2) = sk_c10
| inverse(sk_c1) = sk_c10 ),
prove_this_22 ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
multiply(sk_c10,sk_c9) = sk_c10,
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c3) = sk_c9
| inverse(sk_c1) = sk_c10 ),
prove_this_24 ).
cnf(c_0_32,negated_conjecture,
( inverse(sk_c3) = sk_c9
| inverse(sk_c10) = sk_c9 ),
prove_this_4 ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| inverse(sk_c10) = sk_c9 ),
prove_this_3 ).
cnf(c_0_34,negated_conjecture,
identity = sk_c9,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
( multiply(X6,X5) != X7
| inverse(X7) != X5
| inverse(X6) != X7
| multiply(X5,sk_c9) != sk_c10
| inverse(X4) != X5
| multiply(X4,X5) != sk_c10
| inverse(X3) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != sk_c9
| multiply(sk_c8,sk_c9) != sk_c10
| inverse(X1) != sk_c10
| multiply(X1,sk_c10) != sk_c9
| inverse(sk_c10) != sk_c9 ),
inference(fof_simplification,[status(thm)],[prove_this_41]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c9,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_17,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c10) = sk_c9
| multiply(sk_c9,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( inverse(sk_c3) = sk_c9
| multiply(sk_c8,sk_c9) = sk_c10 ),
prove_this_34 ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c9,sk_c10) = identity
| multiply(sk_c3,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_40,plain,
multiply(sk_c9,X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( multiply(X6,X5) != X7
| inverse(X7) != X5
| inverse(X6) != X7
| multiply(X5,sk_c9) != sk_c10
| inverse(X4) != X5
| multiply(X4,X5) != sk_c10
| inverse(X3) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != sk_c9
| multiply(sk_c8,sk_c9) != sk_c10
| inverse(X1) != sk_c10
| multiply(X1,sk_c10) != sk_c9
| inverse(sk_c10) != sk_c9 ),
c_0_35 ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c9,sk_c3) = sk_c9 ),
inference(rw,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c10) = sk_c9
| multiply(sk_c9,sk_c3) = sk_c9 ),
inference(rw,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c9,sk_c3) = identity
| multiply(sk_c8,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( inverse(sk_c3) = sk_c9
| multiply(sk_c1,sk_c10) = sk_c9 ),
prove_this_14 ).
cnf(c_0_46,negated_conjecture,
( sk_c9 = sk_c10
| multiply(sk_c3,sk_c9) = sk_c8 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_34]),c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( inverse(X5) != sk_c10
| inverse(X4) != sk_c10
| inverse(X3) != sk_c9
| inverse(sk_c10) != sk_c9
| multiply(X5,sk_c10) != sk_c9
| multiply(X4,sk_c10) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| multiply(X2,inverse(X2)) != sk_c10
| multiply(sk_c8,sk_c9) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c9) != sk_c10
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_41])]) ).
cnf(c_0_48,negated_conjecture,
( sk_c3 = sk_c9
| inverse(sk_c1) = sk_c10 ),
inference(rw,[status(thm)],[c_0_42,c_0_40]) ).
cnf(c_0_49,negated_conjecture,
( sk_c3 = sk_c9
| inverse(sk_c10) = sk_c9 ),
inference(rw,[status(thm)],[c_0_43,c_0_40]) ).
cnf(c_0_50,negated_conjecture,
( sk_c3 = sk_c9
| multiply(sk_c8,sk_c9) = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_34]),c_0_40]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c9,sk_c3) = identity
| multiply(sk_c1,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c10
| multiply(sk_c8,sk_c9) = sk_c10 ),
prove_this_35 ).
cnf(c_0_53,negated_conjecture,
( sk_c9 = sk_c10
| multiply(inverse(sk_c3),sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_46]) ).
cnf(c_0_54,negated_conjecture,
( sk_c9 != sk_c10
| inverse(X4) != sk_c10
| inverse(X3) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| multiply(X3,sk_c10) != sk_c9
| multiply(sk_c1,sk_c9) != sk_c8
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c9) != sk_c10
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| sk_c3 = sk_c9 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( sk_c3 = sk_c9
| multiply(sk_c1,sk_c10) = sk_c9 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_34]),c_0_40]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c10
| multiply(inverse(sk_c4),sk_c10) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( inverse(sk_c4) = sk_c7
| multiply(sk_c8,sk_c9) = sk_c10 ),
prove_this_36 ).
cnf(c_0_58,plain,
multiply(inverse(X1),X1) = sk_c9,
inference(rw,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_59,negated_conjecture,
( sk_c8 = sk_c9
| sk_c9 = sk_c10
| inverse(sk_c10) = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_32]),c_0_40]) ).
cnf(c_0_60,negated_conjecture,
( sk_c9 != sk_c10
| inverse(X3) != sk_c10
| multiply(X3,sk_c10) != sk_c9
| multiply(sk_c1,sk_c9) != sk_c8
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c9) != sk_c10
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| sk_c3 = sk_c9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_48]),c_0_55]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c7,sk_c10) = sk_c7
| multiply(sk_c8,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( sk_c9 = sk_c10
| sk_c8 = sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_40])]) ).
cnf(c_0_63,negated_conjecture,
( sk_c9 != sk_c10
| multiply(sk_c1,sk_c9) != sk_c8
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c9) != sk_c10
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| sk_c3 = sk_c9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_48]),c_0_55]) ).
cnf(c_0_64,negated_conjecture,
( sk_c9 = sk_c10
| multiply(sk_c7,sk_c10) = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_40])]) ).
cnf(c_0_65,negated_conjecture,
( sk_c9 != sk_c10
| multiply(sk_c1,sk_c9) != sk_c8
| inverse(X1) != multiply(X1,sk_c9)
| inverse(multiply(X1,sk_c9)) != sk_c9
| sk_c3 = sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_49]),c_0_40]),c_0_30])]) ).
cnf(c_0_66,negated_conjecture,
( sk_c3 = sk_c9
| multiply(inverse(sk_c8),sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_50]) ).
cnf(c_0_67,negated_conjecture,
sk_c9 = sk_c10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_64]),c_0_58])]) ).
cnf(c_0_68,negated_conjecture,
( sk_c9 != sk_c10
| multiply(sk_c1,sk_c9) != sk_c8
| sk_c3 = sk_c9 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_49]),c_0_30]),c_0_30])]),c_0_49]) ).
cnf(c_0_69,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| multiply(sk_c8,sk_c9) = sk_c10 ),
prove_this_33 ).
cnf(c_0_70,negated_conjecture,
( sk_c3 = sk_c10
| multiply(inverse(sk_c8),sk_c10) = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_67]) ).
cnf(c_0_71,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[c_0_40,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( multiply(sk_c1,sk_c10) != sk_c8
| sk_c3 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_67]),c_0_67]),c_0_67])]) ).
cnf(c_0_73,negated_conjecture,
( sk_c3 = sk_c10
| multiply(sk_c1,sk_c10) = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_67]),c_0_67]) ).
cnf(c_0_74,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c10
| multiply(sk_c3,X1) = multiply(sk_c8,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_69]),c_0_40]) ).
cnf(c_0_75,plain,
multiply(inverse(X1),X1) = sk_c10,
inference(rw,[status(thm)],[c_0_58,c_0_67]) ).
cnf(c_0_76,negated_conjecture,
( sk_c3 = sk_c10
| multiply(inverse(sk_c8),X1) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_70]),c_0_71]),c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( sk_c8 != sk_c10
| sk_c3 = sk_c10 ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c10
| multiply(sk_c3,X1) = multiply(sk_c8,X1) ),
inference(rw,[status(thm)],[c_0_74,c_0_67]) ).
cnf(c_0_79,negated_conjecture,
sk_c3 = sk_c10,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_80,negated_conjecture,
( multiply(sk_c8,X1) = X1
| multiply(sk_c8,sk_c10) = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79]),c_0_71]) ).
cnf(c_0_81,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_82,negated_conjecture,
multiply(sk_c8,sk_c10) = sk_c10,
inference(ef,[status(thm)],[c_0_80]) ).
cnf(c_0_83,plain,
multiply(X1,sk_c10) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_75]),c_0_81]) ).
cnf(c_0_84,negated_conjecture,
multiply(inverse(sk_c8),sk_c10) = sk_c10,
inference(spm,[status(thm)],[c_0_19,c_0_82]) ).
cnf(c_0_85,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_83]),c_0_83]) ).
cnf(c_0_86,negated_conjecture,
multiply(inverse(sk_c8),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_84]),c_0_71]),c_0_71]) ).
cnf(c_0_87,negated_conjecture,
( inverse(sk_c10) = sk_c10
| inverse(sk_c3) = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_67]),c_0_67]) ).
cnf(c_0_88,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3,
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_89,plain,
multiply(X1,inverse(X1)) = sk_c10,
inference(spm,[status(thm)],[c_0_75,c_0_85]) ).
cnf(c_0_90,negated_conjecture,
sk_c8 = sk_c10,
inference(spm,[status(thm)],[c_0_75,c_0_86]) ).
cnf(c_0_91,negated_conjecture,
inverse(sk_c10) = sk_c10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_79])]) ).
cnf(c_0_92,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_83]) ).
cnf(c_0_93,negated_conjecture,
multiply(inverse(multiply(X1,sk_c10)),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_86]),c_0_90]),c_0_91]) ).
cnf(c_0_94,negated_conjecture,
( inverse(X5) != sk_c10
| inverse(X4) != sk_c10
| inverse(X3) != sk_c10
| inverse(sk_c10) != sk_c10
| multiply(X5,sk_c10) != sk_c10
| multiply(X4,sk_c10) != sk_c10
| multiply(X3,sk_c10) != sk_c8
| multiply(X2,inverse(X2)) != sk_c10
| multiply(sk_c8,sk_c10) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c10
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
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_47,c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]) ).
cnf(c_0_95,negated_conjecture,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_83]) ).
cnf(c_0_96,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_c8
| 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(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_91])]),c_0_82])]) ).
cnf(c_0_97,negated_conjecture,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_95,c_0_85]) ).
cnf(c_0_98,negated_conjecture,
( inverse(X1) != sk_c10
| multiply(X2,inverse(X1)) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1) ),
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)],[c_0_96,c_0_90]),c_0_97]),c_0_83]),c_0_89]),c_0_83]),c_0_83]),c_0_83])])])])]),c_0_91])]) ).
cnf(c_0_99,negated_conjecture,
( inverse(X1) != X1
| inverse(X1) != sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_91]),c_0_71]),c_0_83]) ).
cnf(c_0_100,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_99,c_0_91]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP377-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sun Sep 20 20:10:38 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.07/0.39 % Version: 3.5.1
% 0.07/0.39 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.39 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.39 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.39 % Starting sh5l with 300s (1) cores
% 0.07/0.39 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 770401 completed with status 0
% 0.07/0.39 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.07/0.39 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.39 % No SInE strategy applied
% 0.07/0.39 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.07/0.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.39 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.07/0.39 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.07/0.39 % Starting new_bool_3 with 136s (1) cores
% 0.07/0.39 % Starting new_bool_1 with 136s (1) cores
% 0.07/0.39 % new_bool_3 with pid 770410 completed with status 0
% 0.07/0.39 % Result found by new_bool_3
% 0.07/0.39 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.39 % No SInE strategy applied
% 0.07/0.39 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.07/0.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.39 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.07/0.39 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.07/0.39 % Starting new_bool_3 with 136s (1) cores
% 0.07/0.39 % Preprocessing time : 0.001 s
% 0.07/0.39 % Presaturation interreduction done
% 0.07/0.39
% 0.07/0.39 % Proof found!
% 0.07/0.39 % SZS status Unsatisfiable
% 0.07/0.39 % SZS output start CNFRefutation
% See solution above
% 0.07/0.39 % Parsed axioms : 44
% 0.07/0.39 % Removed by relevancy pruning/SinE : 0
% 0.07/0.39 % Initial clauses : 44
% 0.07/0.39 % Removed in clause preprocessing : 0
% 0.07/0.39 % Initial clauses in saturation : 44
% 0.07/0.39 % Processed clauses : 1395
% 0.07/0.39 % ...of these trivial : 51
% 0.07/0.39 % ...subsumed : 689
% 0.07/0.39 % ...remaining for further processing : 655
% 0.07/0.39 % Other redundant clauses eliminated : 26
% 0.07/0.39 % Clauses deleted for lack of memory : 0
% 0.07/0.39 % Backward-subsumed : 119
% 0.07/0.39 % Backward-rewritten : 452
% 0.07/0.39 % Generated clauses : 5213
% 0.07/0.39 % ...of the previous two non-redundant : 4650
% 0.07/0.39 % ...aggressively subsumed : 0
% 0.07/0.39 % Contextual simplify-reflections : 77
% 0.07/0.39 % Paramodulations : 5192
% 0.07/0.39 % Factorizations : 2
% 0.07/0.39 % NegExts : 0
% 0.07/0.39 % Equation resolutions : 28
% 0.07/0.39 % Disequality decompositions : 0
% 0.07/0.39 % Total rewrite steps : 3056
% 0.07/0.39 % ...of those cached : 2755
% 0.07/0.39 % Propositional unsat checks : 0
% 0.07/0.39 % Propositional check models : 0
% 0.07/0.39 % Propositional check unsatisfiable : 0
% 0.07/0.39 % Propositional clauses : 0
% 0.07/0.39 % Propositional clauses after purity: 0
% 0.07/0.39 % Propositional unsat core size : 0
% 0.07/0.39 % Propositional preprocessing time : 0.000
% 0.07/0.39 % Propositional encoding time : 0.000
% 0.07/0.39 % Propositional solver time : 0.000
% 0.07/0.39 % Success case prop preproc time : 0.000
% 0.07/0.39 % Success case prop encoding time : 0.000
% 0.07/0.39 % Success case prop solver time : 0.000
% 0.07/0.39 % Current number of processed clauses : 32
% 0.07/0.39 % Positive orientable unit clauses : 30
% 0.07/0.39 % Positive unorientable unit clauses: 0
% 0.07/0.39 % Negative unit clauses : 0
% 0.07/0.39 % Non-unit-clauses : 2
% 0.07/0.39 % Current number of unprocessed clauses: 309
% 0.07/0.39 % ...number of literals in the above : 1677
% 0.07/0.39 % Current number of archived formulas : 0
% 0.07/0.39 % Current number of archived clauses : 615
% 0.07/0.39 % Clause-clause subsumption calls (NU) : 10889
% 0.07/0.39 % Rec. Clause-clause subsumption calls : 7884
% 0.07/0.39 % Non-unit clause-clause subsumptions : 846
% 0.07/0.39 % Unit Clause-clause subsumption calls : 477
% 0.07/0.39 % Rewrite failures with RHS unbound : 0
% 0.07/0.39 % BW rewrite match attempts : 59
% 0.07/0.39 % BW rewrite match successes : 42
% 0.07/0.39 % Condensation attempts : 0
% 0.07/0.39 % Condensation successes : 0
% 0.07/0.39 % Termbank termtop insertions : 78885
% 0.07/0.39 % Search garbage collected termcells : 39
% 0.07/0.39
% 0.07/0.39 % -------------------------------------------------
% 0.07/0.39 % User time : 0.056 s
% 0.07/0.39 % System time : 0.003 s
% 0.07/0.39 % Total time : 0.059 s
% 0.07/0.39 % Maximum resident set size: 3400 pages
% 0.07/0.39
% 0.07/0.39 % -------------------------------------------------
% 0.07/0.39 % User time : 0.271 s
% 0.07/0.39 % System time : 0.025 s
% 0.07/0.39 % Total time : 0.296 s
% 0.07/0.39 % Maximum resident set size: 4608 pages
% 0.07/0.39 % E exiting
%------------------------------------------------------------------------------