TSTP Solution File: GRP248-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GRP248-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 17:39:25 EDT 2023

% Result   : Unsatisfiable 0.17s 0.55s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   32
%            Number of leaves      :   18
% Syntax   : Number of clauses     :  103 (  26 unt;  62 nHn;  88 RR)
%            Number of literals    :  268 ( 267 equ; 110 neg)
%            Maximal clause size   :   13 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  11 con; 0-2 aty)
%            Number of variables   :   74 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',associativity) ).

cnf(left_inverse,axiom,
    multiply(inverse(X1),X1) = identity,
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',left_inverse) ).

cnf(left_identity,axiom,
    multiply(identity,X1) = X1,
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',left_identity) ).

cnf(prove_this_5,negated_conjecture,
    ( multiply(sk_c1,sk_c10) = sk_c9
    | multiply(sk_c6,sk_c7) = sk_c9 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_5) ).

cnf(prove_this_6,negated_conjecture,
    ( multiply(sk_c1,sk_c10) = sk_c9
    | inverse(sk_c6) = sk_c7 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_6) ).

cnf(prove_this_13,negated_conjecture,
    ( inverse(sk_c1) = sk_c10
    | inverse(sk_c6) = sk_c7 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_13) ).

cnf(prove_this_12,negated_conjecture,
    ( inverse(sk_c1) = sk_c10
    | multiply(sk_c6,sk_c7) = sk_c9 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_12) ).

cnf(prove_this_24,negated_conjecture,
    ( inverse(sk_c2) = sk_c9
    | inverse(sk_c5) = sk_c9 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_24) ).

cnf(prove_this_25,negated_conjecture,
    ( inverse(sk_c2) = sk_c9
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_25) ).

cnf(prove_this_18,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c8
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_18) ).

cnf(prove_this_43,negated_conjecture,
    ( multiply(X1,sk_c10) != sk_c9
    | inverse(X1) != sk_c10
    | multiply(X2,sk_c9) != sk_c8
    | inverse(X2) != sk_c9
    | inverse(X3) != sk_c10
    | multiply(X3,sk_c8) != sk_c10
    | inverse(X4) != sk_c10
    | multiply(X4,sk_c9) != sk_c10
    | inverse(X5) != sk_c9
    | multiply(X5,sk_c8) != sk_c9
    | multiply(X6,X7) != sk_c9
    | inverse(X6) != X7
    | multiply(X7,sk_c8) != sk_c9 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_43) ).

cnf(prove_this_17,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c8
    | inverse(sk_c5) = sk_c9 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_17) ).

cnf(prove_this_31,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | inverse(sk_c5) = sk_c9 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_31) ).

cnf(prove_this_32,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_32) ).

cnf(prove_this_29,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | inverse(sk_c4) = sk_c10 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_29) ).

cnf(prove_this_30,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(sk_c4,sk_c9) = sk_c10 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_30) ).

cnf(prove_this_37,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c10
    | multiply(sk_c4,sk_c9) = sk_c10 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_37) ).

cnf(prove_this_36,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c10
    | inverse(sk_c4) = sk_c10 ),
    file('/export/starexec/sandbox/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p',prove_this_36) ).

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

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

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

cnf(c_0_21,plain,
    multiply(inverse(X1),multiply(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_22,negated_conjecture,
    ( multiply(sk_c1,sk_c10) = sk_c9
    | multiply(sk_c6,sk_c7) = sk_c9 ),
    prove_this_5 ).

cnf(c_0_23,negated_conjecture,
    ( multiply(inverse(sk_c6),sk_c9) = sk_c7
    | multiply(sk_c1,sk_c10) = sk_c9 ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,negated_conjecture,
    ( multiply(inverse(inverse(sk_c6)),sk_c7) = sk_c9
    | multiply(sk_c1,sk_c10) = sk_c9 ),
    inference(spm,[status(thm)],[c_0_21,c_0_23]) ).

cnf(c_0_25,negated_conjecture,
    ( multiply(sk_c1,sk_c10) = sk_c9
    | inverse(sk_c6) = sk_c7 ),
    prove_this_6 ).

cnf(c_0_26,negated_conjecture,
    ( multiply(sk_c1,sk_c10) = sk_c9
    | identity = sk_c9 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19]) ).

cnf(c_0_27,negated_conjecture,
    ( multiply(inverse(sk_c1),sk_c9) = sk_c10
    | identity = sk_c9 ),
    inference(spm,[status(thm)],[c_0_21,c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    ( inverse(sk_c1) = sk_c10
    | inverse(sk_c6) = sk_c7 ),
    prove_this_13 ).

cnf(c_0_29,negated_conjecture,
    ( multiply(inverse(inverse(sk_c1)),sk_c10) = sk_c9
    | identity = sk_c9 ),
    inference(spm,[status(thm)],[c_0_21,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ( multiply(sk_c7,sk_c6) = identity
    | inverse(sk_c1) = sk_c10 ),
    inference(spm,[status(thm)],[c_0_19,c_0_28]) ).

cnf(c_0_31,plain,
    multiply(inverse(inverse(X1)),identity) = X1,
    inference(spm,[status(thm)],[c_0_21,c_0_19]) ).

cnf(c_0_32,plain,
    multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
    inference(spm,[status(thm)],[c_0_21,c_0_21]) ).

cnf(c_0_33,negated_conjecture,
    ( multiply(sk_c7,sk_c6) = identity
    | identity = sk_c9 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_19])]) ).

cnf(c_0_34,negated_conjecture,
    ( inverse(sk_c1) = sk_c10
    | multiply(sk_c6,sk_c7) = sk_c9 ),
    prove_this_12 ).

cnf(c_0_35,plain,
    multiply(X1,identity) = X1,
    inference(rw,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    ( multiply(inverse(sk_c7),identity) = sk_c6
    | identity = sk_c9 ),
    inference(spm,[status(thm)],[c_0_21,c_0_33]) ).

cnf(c_0_37,negated_conjecture,
    ( multiply(sk_c6,sk_c7) = sk_c9
    | identity = sk_c9 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_34]),c_0_19])]) ).

cnf(c_0_38,plain,
    inverse(inverse(X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_35]),c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    ( inverse(sk_c7) = sk_c6
    | identity = sk_c9 ),
    inference(rw,[status(thm)],[c_0_36,c_0_35]) ).

cnf(c_0_40,plain,
    multiply(inverse(identity),X1) = X1,
    inference(spm,[status(thm)],[c_0_21,c_0_20]) ).

cnf(c_0_41,negated_conjecture,
    ( multiply(inverse(sk_c6),sk_c9) = sk_c7
    | identity = sk_c9 ),
    inference(spm,[status(thm)],[c_0_21,c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    ( inverse(sk_c6) = sk_c7
    | identity = sk_c9 ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    ( inverse(sk_c2) = sk_c9
    | inverse(sk_c5) = sk_c9 ),
    prove_this_24 ).

cnf(c_0_44,plain,
    multiply(inverse(inverse(identity)),X1) = X1,
    inference(spm,[status(thm)],[c_0_21,c_0_40]) ).

cnf(c_0_45,negated_conjecture,
    ( multiply(sk_c7,sk_c9) = sk_c7
    | identity = sk_c9 ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_46,negated_conjecture,
    ( inverse(sk_c2) = sk_c9
    | inverse(sk_c9) = sk_c5 ),
    inference(spm,[status(thm)],[c_0_38,c_0_43]) ).

cnf(c_0_47,plain,
    inverse(identity) = identity,
    inference(spm,[status(thm)],[c_0_19,c_0_44]) ).

cnf(c_0_48,negated_conjecture,
    identity = sk_c9,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_45]),c_0_19])]) ).

cnf(c_0_49,negated_conjecture,
    ( inverse(sk_c2) = sk_c9
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    prove_this_25 ).

cnf(c_0_50,negated_conjecture,
    ( inverse(sk_c9) = sk_c5
    | inverse(sk_c9) = sk_c2 ),
    inference(spm,[status(thm)],[c_0_38,c_0_46]) ).

cnf(c_0_51,plain,
    inverse(sk_c9) = sk_c9,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_48]) ).

cnf(c_0_52,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c9
    | inverse(sk_c9) = sk_c2 ),
    inference(spm,[status(thm)],[c_0_38,c_0_49]) ).

cnf(c_0_53,negated_conjecture,
    ( inverse(sk_c9) = sk_c5
    | sk_c2 = sk_c9 ),
    inference(rw,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_54,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c8
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    prove_this_18 ).

cnf(c_0_55,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c9
    | sk_c2 = sk_c9 ),
    inference(spm,[status(thm)],[c_0_52,c_0_51]) ).

cnf(c_0_56,negated_conjecture,
    ( sk_c2 = sk_c9
    | sk_c5 = sk_c9 ),
    inference(spm,[status(thm)],[c_0_51,c_0_53]) ).

cnf(c_0_57,negated_conjecture,
    ( multiply(X1,sk_c10) != sk_c9
    | inverse(X1) != sk_c10
    | multiply(X2,sk_c9) != sk_c8
    | inverse(X2) != sk_c9
    | inverse(X3) != sk_c10
    | multiply(X3,sk_c8) != sk_c10
    | inverse(X4) != sk_c10
    | multiply(X4,sk_c9) != sk_c10
    | inverse(X5) != sk_c9
    | multiply(X5,sk_c8) != sk_c9
    | multiply(X6,X7) != sk_c9
    | inverse(X6) != X7
    | multiply(X7,sk_c8) != sk_c9 ),
    prove_this_43 ).

cnf(c_0_58,negated_conjecture,
    ( multiply(inverse(sk_c5),sk_c9) = sk_c8
    | multiply(sk_c2,sk_c9) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_21,c_0_54]) ).

cnf(c_0_59,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c8
    | inverse(sk_c5) = sk_c9 ),
    prove_this_17 ).

cnf(c_0_60,negated_conjecture,
    ( multiply(sk_c9,sk_c8) = sk_c9
    | sk_c2 = sk_c9 ),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_61,negated_conjecture,
    ( multiply(inverse(X1),sk_c8) != sk_c9
    | multiply(X1,inverse(X1)) != sk_c9
    | multiply(X2,sk_c8) != sk_c9
    | multiply(X3,sk_c9) != sk_c10
    | multiply(X4,sk_c8) != sk_c10
    | multiply(X5,sk_c9) != sk_c8
    | multiply(X6,sk_c10) != sk_c9
    | inverse(X2) != sk_c9
    | inverse(X3) != sk_c10
    | inverse(X4) != sk_c10
    | inverse(X5) != sk_c9
    | inverse(X6) != sk_c10 ),
    inference(er,[status(thm)],[c_0_57]) ).

cnf(c_0_62,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | inverse(sk_c5) = sk_c9 ),
    prove_this_31 ).

cnf(c_0_63,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    prove_this_32 ).

cnf(c_0_64,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c8
    | multiply(sk_c9,sk_c9) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_65,negated_conjecture,
    ( sk_c2 = sk_c9
    | sk_c8 = sk_c9 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_60]),c_0_19]),c_0_48]) ).

cnf(c_0_66,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(inverse(X1),sk_c8) != sk_c9
    | multiply(X1,inverse(X1)) != sk_c9
    | multiply(X2,sk_c9) != sk_c10
    | multiply(X3,sk_c8) != sk_c10
    | multiply(X4,sk_c9) != sk_c8
    | multiply(X5,sk_c10) != sk_c9
    | inverse(X2) != sk_c10
    | inverse(X3) != sk_c10
    | inverse(X4) != sk_c9
    | inverse(X5) != sk_c10 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).

cnf(c_0_67,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | inverse(sk_c4) = sk_c10 ),
    prove_this_29 ).

cnf(c_0_68,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(sk_c4,sk_c9) = sk_c10 ),
    prove_this_30 ).

cnf(c_0_69,negated_conjecture,
    ( multiply(sk_c9,sk_c9) = sk_c8
    | sk_c8 = sk_c9 ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_70,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(inverse(X1),sk_c8) != sk_c9
    | multiply(X1,inverse(X1)) != sk_c9
    | multiply(X2,sk_c8) != sk_c10
    | multiply(X3,sk_c9) != sk_c8
    | multiply(X4,sk_c10) != sk_c9
    | inverse(X2) != sk_c10
    | inverse(X3) != sk_c9
    | inverse(X4) != sk_c10 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).

cnf(c_0_71,negated_conjecture,
    ( multiply(sk_c9,sk_c8) = sk_c9
    | sk_c8 = sk_c9 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_69]),c_0_51]) ).

cnf(c_0_72,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(inverse(X1),sk_c8) != sk_c9
    | multiply(X1,inverse(X1)) != sk_c9
    | multiply(sk_c4,sk_c8) != sk_c10
    | multiply(X2,sk_c9) != sk_c8
    | multiply(X3,sk_c10) != sk_c9
    | inverse(X2) != sk_c9
    | inverse(X3) != sk_c10 ),
    inference(spm,[status(thm)],[c_0_70,c_0_67]) ).

cnf(c_0_73,negated_conjecture,
    sk_c8 = sk_c9,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_71]),c_0_19]),c_0_48])]) ).

cnf(c_0_74,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c10
    | multiply(sk_c4,sk_c9) = sk_c10 ),
    prove_this_37 ).

cnf(c_0_75,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(inverse(X1),sk_c9) != sk_c9
    | multiply(X1,inverse(X1)) != sk_c9
    | multiply(X2,sk_c9) != sk_c9
    | multiply(X3,sk_c10) != sk_c9
    | inverse(X2) != sk_c9
    | inverse(X3) != sk_c10 ),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_73]),c_0_73]),c_0_68]) ).

cnf(c_0_76,negated_conjecture,
    ( multiply(inverse(sk_c4),sk_c10) = sk_c9
    | multiply(sk_c3,sk_c8) = sk_c10 ),
    inference(spm,[status(thm)],[c_0_21,c_0_74]) ).

cnf(c_0_77,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c10
    | inverse(sk_c4) = sk_c10 ),
    prove_this_36 ).

cnf(c_0_78,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(inverse(X1),sk_c9) != sk_c9
    | multiply(X1,inverse(X1)) != sk_c9
    | multiply(X2,sk_c10) != sk_c9
    | inverse(X2) != sk_c10 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_38])]),c_0_19]),c_0_48])]) ).

cnf(c_0_79,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c10
    | multiply(sk_c10,sk_c10) = sk_c9 ),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_80,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(inverse(X1),sk_c9) != sk_c9
    | multiply(X1,inverse(X1)) != sk_c9 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_38])]),c_0_19]),c_0_48])]) ).

cnf(c_0_81,negated_conjecture,
    ( multiply(inverse(sk_c3),sk_c10) = sk_c8
    | multiply(sk_c10,sk_c10) = sk_c9 ),
    inference(spm,[status(thm)],[c_0_21,c_0_79]) ).

cnf(c_0_82,negated_conjecture,
    ( inverse(sk_c3) = sk_c10
    | multiply(sk_c9,sk_c9) != sk_c9 ),
    inference(spm,[status(thm)],[c_0_80,c_0_51]) ).

cnf(c_0_83,plain,
    multiply(X1,sk_c9) = X1,
    inference(rw,[status(thm)],[c_0_35,c_0_48]) ).

cnf(c_0_84,negated_conjecture,
    ( multiply(sk_c3,sk_c8) = sk_c10
    | inverse(sk_c10) = sk_c4 ),
    inference(spm,[status(thm)],[c_0_38,c_0_77]) ).

cnf(c_0_85,negated_conjecture,
    ( multiply(sk_c4,sk_c9) = sk_c10
    | multiply(sk_c10,sk_c10) = sk_c9
    | multiply(sk_c10,sk_c10) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_81,c_0_68]) ).

cnf(c_0_86,negated_conjecture,
    inverse(sk_c3) = sk_c10,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]) ).

cnf(c_0_87,negated_conjecture,
    ( multiply(inverse(X1),sk_c8) != sk_c9
    | multiply(X1,inverse(X1)) != sk_c9
    | multiply(X2,sk_c9) != sk_c10
    | multiply(X3,sk_c8) != sk_c10
    | multiply(X4,sk_c9) != sk_c8
    | multiply(X5,sk_c10) != sk_c9
    | inverse(X2) != sk_c10
    | inverse(X3) != sk_c10
    | inverse(X4) != sk_c9
    | inverse(X5) != sk_c10
    | sk_c8 != sk_c9
    | identity != sk_c9 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_47]),c_0_20]) ).

cnf(c_0_88,negated_conjecture,
    ( inverse(sk_c10) = sk_c4
    | sk_c3 = sk_c10 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_73]),c_0_83]) ).

cnf(c_0_89,negated_conjecture,
    ( multiply(sk_c10,sk_c10) = sk_c9
    | sk_c4 = sk_c10 ),
    inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_73])]),c_0_83]) ).

cnf(c_0_90,negated_conjecture,
    inverse(sk_c10) = sk_c3,
    inference(spm,[status(thm)],[c_0_38,c_0_86]) ).

cnf(c_0_91,negated_conjecture,
    ( multiply(inverse(X1),sk_c8) != sk_c9
    | multiply(X1,inverse(X1)) != sk_c9
    | multiply(X2,sk_c9) != sk_c10
    | multiply(X3,sk_c8) != sk_c10
    | multiply(X4,sk_c9) != sk_c8
    | multiply(X5,sk_c10) != sk_c9
    | inverse(X2) != sk_c10
    | inverse(X3) != sk_c10
    | inverse(X4) != sk_c9
    | inverse(X5) != sk_c10
    | sk_c8 != sk_c9 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_48])]) ).

cnf(c_0_92,negated_conjecture,
    ( inverse(sk_c4) = sk_c10
    | sk_c3 = sk_c10 ),
    inference(spm,[status(thm)],[c_0_38,c_0_88]) ).

cnf(c_0_93,negated_conjecture,
    ( sk_c4 = sk_c10
    | sk_c3 = sk_c10 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_89]),c_0_83]),c_0_90]) ).

cnf(c_0_94,negated_conjecture,
    ( multiply(X1,inverse(X1)) != sk_c9
    | multiply(X2,sk_c10) != sk_c9
    | inverse(X1) != sk_c9
    | inverse(X2) != sk_c10
    | sk_c3 != sk_c10 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_73]),c_0_73]),c_0_73]),c_0_73])]),c_0_83]),c_0_83]),c_0_83]),c_0_83])])])]),c_0_90]),c_0_51])]) ).

cnf(c_0_95,negated_conjecture,
    sk_c3 = sk_c10,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_90])]) ).

cnf(c_0_96,negated_conjecture,
    multiply(sk_c10,multiply(sk_c3,X1)) = X1,
    inference(spm,[status(thm)],[c_0_21,c_0_86]) ).

cnf(c_0_97,negated_conjecture,
    ( multiply(X1,inverse(X1)) != sk_c9
    | multiply(X2,sk_c10) != sk_c9
    | inverse(X1) != sk_c9
    | inverse(X2) != sk_c10 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95])]) ).

cnf(c_0_98,negated_conjecture,
    multiply(sk_c10,sk_c3) = sk_c9,
    inference(spm,[status(thm)],[c_0_96,c_0_83]) ).

cnf(c_0_99,negated_conjecture,
    ( multiply(X1,sk_c10) != sk_c9
    | inverse(X1) != sk_c10 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_51]),c_0_83])]) ).

cnf(c_0_100,negated_conjecture,
    inverse(sk_c10) = sk_c10,
    inference(rw,[status(thm)],[c_0_90,c_0_95]) ).

cnf(c_0_101,negated_conjecture,
    multiply(sk_c10,sk_c10) = sk_c9,
    inference(rw,[status(thm)],[c_0_98,c_0_95]) ).

cnf(c_0_102,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_101])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : GRP248-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n025.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Oct  3 02:30:51 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.17/0.43  Running first-order theorem proving
% 0.17/0.43  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/tmp/tmp.zZFzzvS1WK/E---3.1_14143.p
% 0.17/0.55  # Version: 3.1pre001
% 0.17/0.55  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.55  # Starting sh5l with 300s (1) cores
% 0.17/0.55  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 14241 completed with status 0
% 0.17/0.55  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.55  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.55  # No SInE strategy applied
% 0.17/0.55  # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.55  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.55  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.55  # Starting new_bool_3 with 136s (1) cores
% 0.17/0.55  # Starting new_bool_1 with 136s (1) cores
% 0.17/0.55  # Starting sh5l with 136s (1) cores
% 0.17/0.55  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 14253 completed with status 0
% 0.17/0.55  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.55  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.55  # No SInE strategy applied
% 0.17/0.55  # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.55  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.55  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.55  # Preprocessing time       : 0.001 s
% 0.17/0.55  # Presaturation interreduction done
% 0.17/0.55  
% 0.17/0.55  # Proof found!
% 0.17/0.55  # SZS status Unsatisfiable
% 0.17/0.55  # SZS output start CNFRefutation
% See solution above
% 0.17/0.55  # Parsed axioms                        : 46
% 0.17/0.55  # Removed by relevancy pruning/SinE    : 0
% 0.17/0.55  # Initial clauses                      : 46
% 0.17/0.55  # Removed in clause preprocessing      : 0
% 0.17/0.55  # Initial clauses in saturation        : 46
% 0.17/0.55  # Processed clauses                    : 1880
% 0.17/0.55  # ...of these trivial                  : 38
% 0.17/0.55  # ...subsumed                          : 1116
% 0.17/0.55  # ...remaining for further processing  : 726
% 0.17/0.55  # Other redundant clauses eliminated   : 56
% 0.17/0.55  # Clauses deleted for lack of memory   : 0
% 0.17/0.55  # Backward-subsumed                    : 32
% 0.17/0.55  # Backward-rewritten                   : 543
% 0.17/0.55  # Generated clauses                    : 4703
% 0.17/0.55  # ...of the previous two non-redundant : 4724
% 0.17/0.55  # ...aggressively subsumed             : 0
% 0.17/0.55  # Contextual simplify-reflections      : 16
% 0.17/0.55  # Paramodulations                      : 4662
% 0.17/0.55  # Factorizations                       : 5
% 0.17/0.55  # NegExts                              : 0
% 0.17/0.55  # Equation resolutions                 : 56
% 0.17/0.55  # Total rewrite steps                  : 2217
% 0.17/0.55  # Propositional unsat checks           : 0
% 0.17/0.55  #    Propositional check models        : 0
% 0.17/0.55  #    Propositional check unsatisfiable : 0
% 0.17/0.55  #    Propositional clauses             : 0
% 0.17/0.55  #    Propositional clauses after purity: 0
% 0.17/0.55  #    Propositional unsat core size     : 0
% 0.17/0.55  #    Propositional preprocessing time  : 0.000
% 0.17/0.55  #    Propositional encoding time       : 0.000
% 0.17/0.55  #    Propositional solver time         : 0.000
% 0.17/0.55  #    Success case prop preproc time    : 0.000
% 0.17/0.55  #    Success case prop encoding time   : 0.000
% 0.17/0.55  #    Success case prop solver time     : 0.000
% 0.17/0.55  # Current number of processed clauses  : 87
% 0.17/0.55  #    Positive orientable unit clauses  : 14
% 0.17/0.55  #    Positive unorientable unit clauses: 0
% 0.17/0.55  #    Negative unit clauses             : 0
% 0.17/0.55  #    Non-unit-clauses                  : 73
% 0.17/0.55  # Current number of unprocessed clauses: 2366
% 0.17/0.55  # ...number of literals in the above   : 10600
% 0.17/0.55  # Current number of archived formulas  : 0
% 0.17/0.55  # Current number of archived clauses   : 621
% 0.17/0.55  # Clause-clause subsumption calls (NU) : 16252
% 0.17/0.55  # Rec. Clause-clause subsumption calls : 6635
% 0.17/0.55  # Non-unit clause-clause subsumptions  : 1152
% 0.17/0.55  # Unit Clause-clause subsumption calls : 874
% 0.17/0.55  # Rewrite failures with RHS unbound    : 0
% 0.17/0.55  # BW rewrite match attempts            : 64
% 0.17/0.55  # BW rewrite match successes           : 45
% 0.17/0.55  # Condensation attempts                : 0
% 0.17/0.55  # Condensation successes               : 0
% 0.17/0.55  # Termbank termtop insertions          : 74304
% 0.17/0.55  
% 0.17/0.55  # -------------------------------------------------
% 0.17/0.55  # User time                : 0.116 s
% 0.17/0.55  # System time              : 0.003 s
% 0.17/0.56  # Total time               : 0.119 s
% 0.17/0.56  # Maximum resident set size: 1612 pages
% 0.17/0.56  
% 0.17/0.56  # -------------------------------------------------
% 0.17/0.56  # User time                : 0.585 s
% 0.17/0.56  # System time              : 0.010 s
% 0.17/0.56  # Total time               : 0.595 s
% 0.17/0.56  # Maximum resident set size: 1688 pages
% 0.17/0.56  % E---3.1 exiting
% 0.17/0.56  % E---3.1 exiting
%------------------------------------------------------------------------------