↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GRP261-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 : n020.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.12s 0.46s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   31
%            Number of leaves      :   26
% Syntax   : Number of clauses     :  114 (  21 unt;  88 nHn;  96 RR)
%            Number of literals    :  273 ( 272 equ;  73 neg)
%            Maximal clause size   :   11 (   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   :   59 (   0 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_27,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c6
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_27) ).

cnf(prove_this_31,negated_conjecture,
    ( multiply(X5,sk_c8) != sk_c6
    | inverse(X5) != sk_c6
    | inverse(X4) != sk_c7
    | multiply(X4,sk_c7) != sk_c6
    | inverse(X3) != sk_c8
    | multiply(X3,sk_c8) != sk_c7
    | multiply(sk_c6,sk_c8) != sk_c7
    | inverse(X2) != sk_c7
    | multiply(X2,sk_c7) != sk_c6
    | inverse(X1) != sk_c8
    | multiply(X1,sk_c8) != sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_31) ).

cnf(prove_this_28,negated_conjecture,
    ( inverse(sk_c4) = sk_c7
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_28) ).

cnf(prove_this_11,negated_conjecture,
    ( inverse(sk_c5) = sk_c6
    | inverse(sk_c1) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).

cnf(prove_this_12,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c6
    | inverse(sk_c1) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).

cnf(prove_this_10,negated_conjecture,
    ( inverse(sk_c4) = sk_c7
    | inverse(sk_c1) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).

cnf(prove_this_9,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c6
    | inverse(sk_c1) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).

cnf(prove_this_8,negated_conjecture,
    ( inverse(sk_c3) = sk_c8
    | inverse(sk_c1) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).

cnf(prove_this_7,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c7
    | inverse(sk_c1) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).

cnf(prove_this_3,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c6
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).

cnf(prove_this_15,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c6
    | multiply(sk_c2,sk_c7) = sk_c6 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).

cnf(prove_this_4,negated_conjecture,
    ( inverse(sk_c4) = sk_c7
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).

cnf(prove_this_16,negated_conjecture,
    ( inverse(sk_c4) = sk_c7
    | multiply(sk_c2,sk_c7) = sk_c6 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).

cnf(prove_this_21,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c6
    | inverse(sk_c2) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).

cnf(prove_this_25,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c7
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).

cnf(prove_this_26,negated_conjecture,
    ( inverse(sk_c3) = sk_c8
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_26) ).

cnf(prove_this_22,negated_conjecture,
    ( inverse(sk_c4) = sk_c7
    | inverse(sk_c2) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).

cnf(prove_this_30,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c6
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_30) ).

cnf(prove_this_29,negated_conjecture,
    ( inverse(sk_c5) = sk_c6
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_29) ).

cnf(prove_this_6,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c6
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).

cnf(prove_this_1,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c7
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).

cnf(prove_this_5,negated_conjecture,
    ( inverse(sk_c5) = sk_c6
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).

cnf(prove_this_2,negated_conjecture,
    ( inverse(sk_c3) = sk_c8
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).

cnf(c_0_26,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    associativity ).

cnf(c_0_27,axiom,
    multiply(inverse(X1),X1) = identity,
    left_inverse ).

cnf(c_0_28,axiom,
    multiply(identity,X1) = X1,
    left_identity ).

cnf(c_0_29,plain,
    multiply(inverse(X1),multiply(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).

cnf(c_0_30,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c6
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    prove_this_27 ).

cnf(c_0_31,negated_conjecture,
    ( multiply(X5,sk_c8) != sk_c6
    | inverse(X5) != sk_c6
    | inverse(X4) != sk_c7
    | multiply(X4,sk_c7) != sk_c6
    | inverse(X3) != sk_c8
    | multiply(X3,sk_c8) != sk_c7
    | multiply(sk_c6,sk_c8) != sk_c7
    | inverse(X2) != sk_c7
    | multiply(X2,sk_c7) != sk_c6
    | inverse(X1) != sk_c8
    | multiply(X1,sk_c8) != sk_c7 ),
    inference(fof_simplification,[status(thm)],[prove_this_31]) ).

cnf(c_0_32,negated_conjecture,
    ( multiply(sk_c6,sk_c8) = sk_c7
    | multiply(inverse(sk_c4),sk_c6) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    ( inverse(sk_c4) = sk_c7
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    prove_this_28 ).

cnf(c_0_34,negated_conjecture,
    ( multiply(X5,sk_c8) != sk_c6
    | inverse(X5) != sk_c6
    | inverse(X4) != sk_c7
    | multiply(X4,sk_c7) != sk_c6
    | inverse(X3) != sk_c8
    | multiply(X3,sk_c8) != sk_c7
    | multiply(sk_c6,sk_c8) != sk_c7
    | inverse(X2) != sk_c7
    | multiply(X2,sk_c7) != sk_c6
    | inverse(X1) != sk_c8
    | multiply(X1,sk_c8) != sk_c7 ),
    c_0_31 ).

cnf(c_0_35,negated_conjecture,
    ( multiply(sk_c7,sk_c6) = sk_c7
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    ( inverse(X5) != sk_c8
    | inverse(X4) != sk_c7
    | inverse(X3) != sk_c8
    | inverse(X2) != sk_c7
    | inverse(X1) != sk_c6
    | multiply(X5,sk_c8) != sk_c7
    | multiply(X4,sk_c7) != sk_c6
    | multiply(X3,sk_c8) != sk_c7
    | multiply(X2,sk_c7) != sk_c6
    | multiply(X1,sk_c8) != sk_c6
    | multiply(sk_c7,sk_c6) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,negated_conjecture,
    ( inverse(sk_c5) = sk_c6
    | inverse(sk_c1) = sk_c8 ),
    prove_this_11 ).

cnf(c_0_38,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c6
    | inverse(sk_c1) = sk_c8 ),
    prove_this_12 ).

cnf(c_0_39,negated_conjecture,
    ( inverse(X4) != sk_c8
    | inverse(X3) != sk_c7
    | inverse(X2) != sk_c8
    | inverse(X1) != sk_c7
    | multiply(X4,sk_c8) != sk_c7
    | multiply(X3,sk_c7) != sk_c6
    | multiply(X2,sk_c8) != sk_c7
    | multiply(X1,sk_c7) != sk_c6
    | inverse(sk_c1) = sk_c8
    | multiply(sk_c7,sk_c6) = sk_c7 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).

cnf(c_0_40,negated_conjecture,
    ( inverse(sk_c4) = sk_c7
    | inverse(sk_c1) = sk_c8 ),
    prove_this_10 ).

cnf(c_0_41,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c6
    | inverse(sk_c1) = sk_c8 ),
    prove_this_9 ).

cnf(c_0_42,negated_conjecture,
    ( inverse(X3) != sk_c8
    | inverse(X2) != sk_c7
    | inverse(X1) != sk_c8
    | multiply(X3,sk_c8) != sk_c7
    | multiply(X2,sk_c7) != sk_c6
    | multiply(X1,sk_c8) != sk_c7
    | inverse(sk_c1) = sk_c8
    | multiply(sk_c7,sk_c6) = sk_c7 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).

cnf(c_0_43,negated_conjecture,
    ( inverse(sk_c3) = sk_c8
    | inverse(sk_c1) = sk_c8 ),
    prove_this_8 ).

cnf(c_0_44,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c7
    | inverse(sk_c1) = sk_c8 ),
    prove_this_7 ).

cnf(c_0_45,negated_conjecture,
    ( inverse(X2) != sk_c8
    | inverse(X1) != sk_c7
    | multiply(X2,sk_c8) != sk_c7
    | multiply(X1,sk_c7) != sk_c6
    | inverse(sk_c1) = sk_c8
    | multiply(sk_c7,sk_c6) = sk_c7 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).

cnf(c_0_46,negated_conjecture,
    ( inverse(X1) != sk_c8
    | multiply(X1,sk_c8) != sk_c7
    | inverse(sk_c1) = sk_c8
    | multiply(sk_c7,sk_c6) = sk_c7 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_40]),c_0_41]) ).

cnf(c_0_47,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c6
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    prove_this_3 ).

cnf(c_0_48,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c6
    | multiply(sk_c2,sk_c7) = sk_c6 ),
    prove_this_15 ).

cnf(c_0_49,negated_conjecture,
    ( inverse(sk_c1) = sk_c8
    | multiply(sk_c7,sk_c6) = sk_c7 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_43]),c_0_44]) ).

cnf(c_0_50,negated_conjecture,
    ( multiply(sk_c1,sk_c8) = sk_c7
    | multiply(inverse(sk_c4),sk_c6) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_29,c_0_47]) ).

cnf(c_0_51,negated_conjecture,
    ( inverse(sk_c4) = sk_c7
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    prove_this_4 ).

cnf(c_0_52,negated_conjecture,
    ( multiply(sk_c2,sk_c7) = sk_c6
    | multiply(inverse(sk_c4),sk_c6) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_29,c_0_48]) ).

cnf(c_0_53,negated_conjecture,
    ( inverse(sk_c4) = sk_c7
    | multiply(sk_c2,sk_c7) = sk_c6 ),
    prove_this_16 ).

cnf(c_0_54,negated_conjecture,
    ( multiply(sk_c7,sk_c6) = sk_c7
    | multiply(sk_c8,multiply(sk_c1,X1)) = X1 ),
    inference(spm,[status(thm)],[c_0_29,c_0_49]) ).

cnf(c_0_55,negated_conjecture,
    ( multiply(sk_c7,sk_c6) = sk_c7
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_56,negated_conjecture,
    ( multiply(sk_c7,sk_c6) = sk_c7
    | multiply(sk_c2,sk_c7) = sk_c6 ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_57,negated_conjecture,
    ( multiply(sk_c8,sk_c7) = sk_c8
    | multiply(sk_c7,sk_c6) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_58,negated_conjecture,
    ( multiply(sk_c7,sk_c6) = sk_c7
    | multiply(inverse(sk_c2),sk_c6) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_29,c_0_56]) ).

cnf(c_0_59,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c6
    | inverse(sk_c2) = sk_c7 ),
    prove_this_21 ).

cnf(c_0_60,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c7
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    prove_this_25 ).

cnf(c_0_61,negated_conjecture,
    ( identity = sk_c7
    | multiply(sk_c7,sk_c6) = sk_c7 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_57]),c_0_27]) ).

cnf(c_0_62,negated_conjecture,
    ( multiply(sk_c7,sk_c6) = sk_c7
    | multiply(sk_c4,sk_c7) = sk_c6 ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_63,negated_conjecture,
    ( multiply(sk_c6,sk_c8) = sk_c7
    | multiply(inverse(sk_c3),sk_c7) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_29,c_0_60]) ).

cnf(c_0_64,negated_conjecture,
    ( inverse(sk_c3) = sk_c8
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    prove_this_26 ).

cnf(c_0_65,negated_conjecture,
    ( identity = sk_c6
    | identity = sk_c7 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_61]),c_0_27]) ).

cnf(c_0_66,negated_conjecture,
    ( multiply(sk_c7,sk_c6) = sk_c7
    | multiply(inverse(sk_c4),sk_c6) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_29,c_0_62]) ).

cnf(c_0_67,negated_conjecture,
    ( inverse(sk_c4) = sk_c7
    | inverse(sk_c2) = sk_c7 ),
    prove_this_22 ).

cnf(c_0_68,negated_conjecture,
    ( multiply(sk_c8,sk_c7) = sk_c8
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_63,c_0_64]) ).

cnf(c_0_69,negated_conjecture,
    ( identity = sk_c7
    | multiply(sk_c6,X1) = X1 ),
    inference(spm,[status(thm)],[c_0_28,c_0_65]) ).

cnf(c_0_70,negated_conjecture,
    ( inverse(sk_c2) = sk_c7
    | multiply(sk_c7,sk_c6) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_71,negated_conjecture,
    ( sk_c8 = sk_c7
    | identity = sk_c7
    | multiply(sk_c8,sk_c7) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_72,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c6
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    prove_this_30 ).

cnf(c_0_73,negated_conjecture,
    multiply(sk_c7,sk_c6) = sk_c7,
    inference(spm,[status(thm)],[c_0_58,c_0_70]) ).

cnf(c_0_74,negated_conjecture,
    ( identity = sk_c7
    | sk_c8 = sk_c7 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_71]),c_0_27])]) ).

cnf(c_0_75,negated_conjecture,
    ( multiply(sk_c6,sk_c8) = sk_c7
    | multiply(inverse(sk_c5),sk_c6) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_29,c_0_72]) ).

cnf(c_0_76,negated_conjecture,
    ( inverse(sk_c5) = sk_c6
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    prove_this_29 ).

cnf(c_0_77,negated_conjecture,
    identity = sk_c6,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_73]),c_0_27]) ).

cnf(c_0_78,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c6
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    prove_this_6 ).

cnf(c_0_79,negated_conjecture,
    ( sk_c8 = sk_c7
    | multiply(sk_c7,X1) = X1 ),
    inference(spm,[status(thm)],[c_0_28,c_0_74]) ).

cnf(c_0_80,negated_conjecture,
    ( multiply(sk_c6,sk_c6) = sk_c8
    | multiply(sk_c6,sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_81,plain,
    multiply(sk_c6,X1) = X1,
    inference(rw,[status(thm)],[c_0_28,c_0_77]) ).

cnf(c_0_82,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c7
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    prove_this_1 ).

cnf(c_0_83,negated_conjecture,
    ( multiply(sk_c1,sk_c8) = sk_c7
    | multiply(inverse(sk_c5),sk_c6) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_29,c_0_78]) ).

cnf(c_0_84,negated_conjecture,
    ( inverse(sk_c5) = sk_c6
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    prove_this_5 ).

cnf(c_0_85,negated_conjecture,
    ( sk_c6 = sk_c7
    | sk_c8 = sk_c7 ),
    inference(spm,[status(thm)],[c_0_79,c_0_73]) ).

cnf(c_0_86,negated_conjecture,
    ( sk_c8 = sk_c7
    | sk_c6 = sk_c8 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_81]) ).

cnf(c_0_87,negated_conjecture,
    ( multiply(sk_c1,sk_c8) = sk_c7
    | multiply(inverse(sk_c3),sk_c7) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_29,c_0_82]) ).

cnf(c_0_88,negated_conjecture,
    ( inverse(sk_c3) = sk_c8
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    prove_this_2 ).

cnf(c_0_89,negated_conjecture,
    ( multiply(sk_c6,sk_c6) = sk_c8
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_90,negated_conjecture,
    sk_c8 = sk_c7,
    inference(spm,[status(thm)],[c_0_85,c_0_86]) ).

cnf(c_0_91,negated_conjecture,
    ( inverse(sk_c1) = sk_c8
    | multiply(sk_c6,sk_c5) = identity ),
    inference(spm,[status(thm)],[c_0_27,c_0_37]) ).

cnf(c_0_92,negated_conjecture,
    ( multiply(sk_c8,sk_c7) = sk_c8
    | multiply(sk_c1,sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_87,c_0_88]) ).

cnf(c_0_93,negated_conjecture,
    ( sk_c6 = sk_c7
    | multiply(sk_c1,sk_c7) = sk_c7 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_81]),c_0_90]),c_0_90]) ).

cnf(c_0_94,negated_conjecture,
    ( inverse(sk_c1) = sk_c8
    | multiply(sk_c6,sk_c5) = sk_c6 ),
    inference(rw,[status(thm)],[c_0_91,c_0_77]) ).

cnf(c_0_95,negated_conjecture,
    ( multiply(sk_c8,sk_c7) = sk_c8
    | multiply(inverse(sk_c1),sk_c7) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_29,c_0_92]) ).

cnf(c_0_96,negated_conjecture,
    ( sk_c6 = sk_c7
    | multiply(inverse(sk_c1),sk_c7) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_29,c_0_93]) ).

cnf(c_0_97,negated_conjecture,
    ( sk_c5 = sk_c6
    | inverse(sk_c1) = sk_c7 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_81]),c_0_90]) ).

cnf(c_0_98,negated_conjecture,
    ( multiply(sk_c8,sk_c7) = sk_c8
    | multiply(sk_c5,sk_c8) = sk_c6 ),
    inference(spm,[status(thm)],[c_0_95,c_0_38]) ).

cnf(c_0_99,negated_conjecture,
    ( sk_c6 = sk_c7
    | sk_c5 = sk_c6
    | multiply(sk_c7,sk_c7) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_96,c_0_97]) ).

cnf(c_0_100,negated_conjecture,
    ( multiply(sk_c5,sk_c7) = sk_c6
    | multiply(sk_c7,sk_c7) = sk_c7 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_90]),c_0_90]),c_0_90]) ).

cnf(c_0_101,negated_conjecture,
    ( sk_c6 = sk_c7
    | sk_c5 = sk_c6 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_99]),c_0_27]),c_0_77])]) ).

cnf(c_0_102,negated_conjecture,
    ( sk_c6 = sk_c7
    | multiply(sk_c7,sk_c7) = sk_c7 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_81])]) ).

cnf(c_0_103,negated_conjecture,
    sk_c6 = sk_c7,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_102]),c_0_27]),c_0_77])]) ).

cnf(c_0_104,plain,
    multiply(inverse(X1),X1) = sk_c7,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_77]),c_0_103]) ).

cnf(c_0_105,plain,
    multiply(sk_c7,X1) = X1,
    inference(rw,[status(thm)],[c_0_81,c_0_103]) ).

cnf(c_0_106,plain,
    multiply(inverse(inverse(X1)),sk_c7) = X1,
    inference(spm,[status(thm)],[c_0_29,c_0_104]) ).

cnf(c_0_107,plain,
    multiply(inverse(sk_c7),X1) = X1,
    inference(spm,[status(thm)],[c_0_29,c_0_105]) ).

cnf(c_0_108,plain,
    multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_106]),c_0_105]) ).

cnf(c_0_109,plain,
    multiply(inverse(inverse(sk_c7)),X1) = X1,
    inference(spm,[status(thm)],[c_0_29,c_0_107]) ).

cnf(c_0_110,negated_conjecture,
    ( inverse(X5) != sk_c7
    | inverse(X4) != sk_c7
    | inverse(X3) != sk_c7
    | inverse(X2) != sk_c7
    | inverse(X1) != sk_c7
    | multiply(X5,sk_c7) != sk_c7
    | multiply(X4,sk_c7) != sk_c7
    | multiply(X3,sk_c7) != sk_c7
    | multiply(X2,sk_c7) != sk_c7
    | multiply(X1,sk_c7) != sk_c7 ),
    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_34,c_0_81]),c_0_90]),c_0_90]),c_0_103]),c_0_103]),c_0_90]),c_0_103]),c_0_90]),c_0_103]),c_0_90]),c_0_90])]) ).

cnf(c_0_111,plain,
    multiply(X1,sk_c7) = X1,
    inference(rw,[status(thm)],[c_0_106,c_0_108]) ).

cnf(c_0_112,plain,
    inverse(sk_c7) = sk_c7,
    inference(spm,[status(thm)],[c_0_109,c_0_104]) ).

cnf(c_0_113,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_111]),c_0_111]),c_0_111]),c_0_111]),c_0_111])])])])])]),c_0_112])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP261-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.34  % Computer : n020.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Sun Sep 20 20:08:47 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  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.12/0.46  % Version: 3.5.1
% 0.12/0.46  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.12/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.12/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.46  % Starting sh5l with 300s (1) cores
% 0.12/0.46  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1113661 completed with status 0
% 0.12/0.46  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.12/0.46  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.12/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.12/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.46  % No SInE strategy applied
% 0.12/0.46  % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.12/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.12/0.46  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.46  % Starting new_bool_3 with 136s (1) cores
% 0.12/0.46  % Starting new_bool_1 with 136s (1) cores
% 0.12/0.46  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1113666 completed with status 0
% 0.12/0.46  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.12/0.46  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.12/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.12/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.46  % No SInE strategy applied
% 0.12/0.46  % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.12/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.12/0.46  % Preprocessing time       : 0.001 s
% 0.12/0.46  % Presaturation interreduction done
% 0.12/0.46  
% 0.12/0.46  % Proof found!
% 0.12/0.46  % SZS status Unsatisfiable
% 0.12/0.46  % SZS output start CNFRefutation
% See solution above
% 0.12/0.46  % Parsed axioms                        : 34
% 0.12/0.46  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.46  % Initial clauses                      : 34
% 0.12/0.46  % Removed in clause preprocessing      : 0
% 0.12/0.46  % Initial clauses in saturation        : 34
% 0.12/0.46  % Processed clauses                    : 472
% 0.12/0.46  % ...of these trivial                  : 26
% 0.12/0.46  % ...subsumed                          : 137
% 0.12/0.46  % ...remaining for further processing  : 309
% 0.12/0.46  % Other redundant clauses eliminated   : 13
% 0.12/0.46  % Clauses deleted for lack of memory   : 0
% 0.12/0.46  % Backward-subsumed                    : 32
% 0.12/0.46  % Backward-rewritten                   : 188
% 0.12/0.46  % Generated clauses                    : 1349
% 0.12/0.46  % ...of the previous two non-redundant : 1243
% 0.12/0.46  % ...aggressively subsumed             : 0
% 0.12/0.46  % Contextual simplify-reflections      : 8
% 0.12/0.46  % Paramodulations                      : 1334
% 0.12/0.46  % Factorizations                       : 2
% 0.12/0.46  % NegExts                              : 0
% 0.12/0.46  % Equation resolutions                 : 13
% 0.12/0.46  % Disequality decompositions           : 0
% 0.12/0.46  % Total rewrite steps                  : 1028
% 0.12/0.46  % ...of those cached                   : 964
% 0.12/0.46  % Propositional unsat checks           : 0
% 0.12/0.46  %    Propositional check models        : 0
% 0.12/0.46  %    Propositional check unsatisfiable : 0
% 0.12/0.46  %    Propositional clauses             : 0
% 0.12/0.46  %    Propositional clauses after purity: 0
% 0.12/0.46  %    Propositional unsat core size     : 0
% 0.12/0.46  %    Propositional preprocessing time  : 0.000
% 0.12/0.46  %    Propositional encoding time       : 0.000
% 0.12/0.46  %    Propositional solver time         : 0.000
% 0.12/0.46  %    Success case prop preproc time    : 0.000
% 0.12/0.46  %    Success case prop encoding time   : 0.000
% 0.12/0.46  %    Success case prop solver time     : 0.000
% 0.12/0.46  % Current number of processed clauses  : 55
% 0.12/0.46  %    Positive orientable unit clauses  : 10
% 0.12/0.46  %    Positive unorientable unit clauses: 0
% 0.12/0.46  %    Negative unit clauses             : 0
% 0.12/0.46  %    Non-unit-clauses                  : 45
% 0.12/0.46  % Current number of unprocessed clauses: 519
% 0.12/0.46  % ...number of literals in the above   : 3210
% 0.12/0.46  % Current number of archived formulas  : 0
% 0.12/0.46  % Current number of archived clauses   : 254
% 0.12/0.46  % Clause-clause subsumption calls (NU) : 1418
% 0.12/0.46  % Rec. Clause-clause subsumption calls : 1236
% 0.12/0.46  % Non-unit clause-clause subsumptions  : 175
% 0.12/0.46  % Unit Clause-clause subsumption calls : 212
% 0.12/0.46  % Rewrite failures with RHS unbound    : 0
% 0.12/0.46  % BW rewrite match attempts            : 34
% 0.12/0.46  % BW rewrite match successes           : 25
% 0.12/0.46  % Condensation attempts                : 0
% 0.12/0.46  % Condensation successes               : 0
% 0.12/0.46  % Termbank termtop insertions          : 19649
% 0.12/0.46  % Search garbage collected termcells   : 31
% 0.12/0.46  
% 0.12/0.46  % -------------------------------------------------
% 0.12/0.46  % User time                : 0.033 s
% 0.12/0.46  % System time              : 0.003 s
% 0.12/0.46  % Total time               : 0.036 s
% 0.12/0.46  % Maximum resident set size: 3648 pages
% 0.12/0.46  
% 0.12/0.46  % -------------------------------------------------
% 0.12/0.46  % User time                : 0.105 s
% 0.12/0.46  % System time              : 0.015 s
% 0.12/0.46  % Total time               : 0.120 s
% 0.12/0.46  % Maximum resident set size: 4608 pages
% 0.12/0.46  % E exiting
%------------------------------------------------------------------------------