TSTP Solution File: GRP239-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : GRP239-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n010.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 : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 20:47:06 EDT 2024

% Result   : Unsatisfiable 36.63s 5.00s
% Output   : CNFRefutation 36.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   20
% Syntax   : Number of clauses     :  111 (  28 unt;  78 nHn;  92 RR)
%            Number of literals    :  236 ( 235 equ;  52 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    :   12 (  12 usr;  10 con; 0-2 aty)
%            Number of variables   :   54 (   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_16,negated_conjecture,
    ( multiply(sk_c1,sk_c8) = sk_c9
    | multiply(sk_c4,sk_c8) = sk_c9 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).

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

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

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

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

cnf(prove_this_39,negated_conjecture,
    ( inverse(sk_c2) = sk_c9
    | inverse(sk_c5) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_39) ).

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

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

cnf(prove_this_38,negated_conjecture,
    ( inverse(sk_c2) = sk_c9
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_38) ).

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

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

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

cnf(prove_this_31,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c3
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_31) ).

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

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

cnf(prove_this_32,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c3
    | inverse(sk_c5) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_32) ).

cnf(prove_this_43,negated_conjecture,
    ( inverse(sk_c9) != sk_c8
    | inverse(X1) != sk_c9
    | multiply(X1,sk_c8) != sk_c9
    | multiply(sk_c9,X2) != sk_c8
    | multiply(X3,sk_c9) != X2
    | inverse(X3) != sk_c9
    | inverse(X4) != sk_c9
    | multiply(X4,sk_c8) != sk_c9
    | multiply(X5,sk_c8) != sk_c9
    | inverse(X5) != sk_c8
    | multiply(X6,X7) != sk_c8
    | inverse(X6) != X7
    | multiply(X7,sk_c9) != sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_43) ).

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_c1,sk_c8) = sk_c9
    | multiply(sk_c4,sk_c8) = sk_c9 ),
    prove_this_16 ).

cnf(c_0_25,negated_conjecture,
    ( multiply(inverse(sk_c4),sk_c9) = sk_c8
    | multiply(sk_c1,sk_c8) = sk_c9 ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_26,negated_conjecture,
    ( multiply(sk_c1,sk_c8) = sk_c9
    | inverse(sk_c4) = sk_c9 ),
    prove_this_15 ).

cnf(c_0_27,negated_conjecture,
    ( multiply(sk_c1,sk_c8) = sk_c9
    | multiply(sk_c9,sk_c9) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    ( multiply(inverse(sk_c1),sk_c9) = sk_c8
    | multiply(sk_c9,sk_c9) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_23,c_0_27]) ).

cnf(c_0_29,negated_conjecture,
    ( inverse(sk_c1) = sk_c9
    | multiply(sk_c4,sk_c8) = sk_c9 ),
    prove_this_9 ).

cnf(c_0_30,negated_conjecture,
    ( multiply(sk_c4,sk_c8) = sk_c9
    | multiply(sk_c9,sk_c9) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_31,negated_conjecture,
    ( multiply(inverse(sk_c4),sk_c9) = sk_c8
    | multiply(sk_c9,sk_c9) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_23,c_0_30]) ).

cnf(c_0_32,negated_conjecture,
    ( inverse(sk_c1) = sk_c9
    | inverse(sk_c4) = sk_c9 ),
    prove_this_8 ).

cnf(c_0_33,negated_conjecture,
    ( multiply(sk_c9,sk_c9) = sk_c8
    | inverse(sk_c1) = sk_c9 ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

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

cnf(c_0_35,plain,
    multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3,
    inference(spm,[status(thm)],[c_0_23,c_0_20]) ).

cnf(c_0_36,negated_conjecture,
    multiply(sk_c9,sk_c9) = sk_c8,
    inference(spm,[status(thm)],[c_0_28,c_0_33]) ).

cnf(c_0_37,plain,
    multiply(X1,identity) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_34]) ).

cnf(c_0_38,negated_conjecture,
    ( inverse(sk_c1) = sk_c9
    | inverse(sk_c5) = sk_c8 ),
    prove_this_11 ).

cnf(c_0_39,negated_conjecture,
    ( inverse(sk_c2) = sk_c9
    | inverse(sk_c5) = sk_c8 ),
    prove_this_39 ).

cnf(c_0_40,negated_conjecture,
    multiply(inverse(multiply(X1,sk_c9)),multiply(X1,sk_c8)) = sk_c9,
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_41,negated_conjecture,
    ( inverse(sk_c9) = sk_c8
    | inverse(sk_c5) = sk_c8 ),
    prove_this_4 ).

cnf(c_0_42,plain,
    inverse(inverse(X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_37]),c_0_37]) ).

cnf(c_0_43,negated_conjecture,
    ( multiply(sk_c8,sk_c5) = identity
    | inverse(sk_c1) = sk_c9 ),
    inference(spm,[status(thm)],[c_0_21,c_0_38]) ).

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

cnf(c_0_45,negated_conjecture,
    inverse(multiply(inverse(sk_c8),sk_c9)) = sk_c9,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_21]),c_0_37]) ).

cnf(c_0_46,negated_conjecture,
    ( inverse(sk_c1) = sk_c9
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    prove_this_10 ).

cnf(c_0_47,negated_conjecture,
    ( multiply(sk_c8,sk_c5) = identity
    | inverse(sk_c9) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_21,c_0_41]) ).

cnf(c_0_48,negated_conjecture,
    ( multiply(sk_c8,sk_c5) = identity
    | inverse(sk_c9) = sk_c1 ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

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

cnf(c_0_50,negated_conjecture,
    ( multiply(sk_c8,sk_c5) = identity
    | inverse(sk_c9) = sk_c2 ),
    inference(spm,[status(thm)],[c_0_42,c_0_44]) ).

cnf(c_0_51,negated_conjecture,
    ( multiply(sk_c1,sk_c8) = sk_c9
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    prove_this_17 ).

cnf(c_0_52,negated_conjecture,
    multiply(inverse(sk_c9),sk_c8) = sk_c9,
    inference(spm,[status(thm)],[c_0_23,c_0_36]) ).

cnf(c_0_53,negated_conjecture,
    multiply(inverse(sk_c8),sk_c9) = inverse(sk_c9),
    inference(spm,[status(thm)],[c_0_42,c_0_45]) ).

cnf(c_0_54,negated_conjecture,
    ( inverse(sk_c9) = sk_c8
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    prove_this_3 ).

cnf(c_0_55,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c9
    | inverse(sk_c9) = sk_c1 ),
    inference(spm,[status(thm)],[c_0_42,c_0_46]) ).

cnf(c_0_56,negated_conjecture,
    ( multiply(sk_c8,sk_c5) = identity
    | sk_c1 = sk_c8 ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_57,negated_conjecture,
    ( multiply(sk_c9,sk_c3) = sk_c8
    | multiply(sk_c6,sk_c7) = sk_c8 ),
    prove_this_26 ).

cnf(c_0_58,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c3
    | multiply(sk_c5,sk_c8) = sk_c9 ),
    prove_this_31 ).

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

cnf(c_0_60,negated_conjecture,
    ( multiply(sk_c8,sk_c5) = identity
    | sk_c2 = sk_c8 ),
    inference(spm,[status(thm)],[c_0_47,c_0_50]) ).

cnf(c_0_61,negated_conjecture,
    ( multiply(inverse(sk_c5),sk_c9) = sk_c8
    | multiply(sk_c1,sk_c8) = sk_c9 ),
    inference(spm,[status(thm)],[c_0_23,c_0_51]) ).

cnf(c_0_62,negated_conjecture,
    multiply(inverse(sk_c9),multiply(sk_c8,X1)) = multiply(sk_c9,X1),
    inference(spm,[status(thm)],[c_0_20,c_0_52]) ).

cnf(c_0_63,negated_conjecture,
    multiply(sk_c8,inverse(sk_c9)) = sk_c9,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_53]),c_0_42]) ).

cnf(c_0_64,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c9
    | sk_c1 = sk_c8 ),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_65,negated_conjecture,
    ( inverse(sk_c8) = sk_c5
    | sk_c1 = sk_c8 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_56]),c_0_37]) ).

cnf(c_0_66,negated_conjecture,
    multiply(sk_c9,multiply(sk_c9,X1)) = multiply(sk_c8,X1),
    inference(spm,[status(thm)],[c_0_20,c_0_36]) ).

cnf(c_0_67,negated_conjecture,
    ( multiply(inverse(sk_c6),sk_c8) = sk_c7
    | multiply(sk_c9,sk_c3) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_23,c_0_57]) ).

cnf(c_0_68,negated_conjecture,
    ( multiply(sk_c9,sk_c3) = sk_c8
    | inverse(sk_c6) = sk_c7 ),
    prove_this_27 ).

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

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

cnf(c_0_71,negated_conjecture,
    ( inverse(sk_c8) = sk_c5
    | sk_c2 = sk_c8 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_60]),c_0_37]) ).

cnf(c_0_72,negated_conjecture,
    ( multiply(inverse(sk_c5),multiply(sk_c9,X1)) = multiply(sk_c8,X1)
    | multiply(sk_c1,sk_c8) = sk_c9 ),
    inference(spm,[status(thm)],[c_0_20,c_0_61]) ).

cnf(c_0_73,negated_conjecture,
    multiply(sk_c9,inverse(sk_c9)) = identity,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_21]) ).

cnf(c_0_74,negated_conjecture,
    ( multiply(inverse(sk_c5),sk_c9) = sk_c8
    | sk_c1 = sk_c8 ),
    inference(spm,[status(thm)],[c_0_23,c_0_64]) ).

cnf(c_0_75,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | sk_c1 = sk_c8 ),
    inference(spm,[status(thm)],[c_0_42,c_0_65]) ).

cnf(c_0_76,negated_conjecture,
    multiply(sk_c8,sk_c9) = multiply(sk_c9,sk_c8),
    inference(spm,[status(thm)],[c_0_66,c_0_36]) ).

cnf(c_0_77,negated_conjecture,
    ( multiply(sk_c9,sk_c3) = sk_c8
    | multiply(sk_c7,sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_78,negated_conjecture,
    ( multiply(inverse(sk_c5),multiply(sk_c9,X1)) = multiply(sk_c8,X1)
    | multiply(sk_c2,sk_c9) = sk_c3 ),
    inference(spm,[status(thm)],[c_0_20,c_0_69]) ).

cnf(c_0_79,negated_conjecture,
    ( multiply(inverse(sk_c5),sk_c9) = sk_c8
    | sk_c2 = sk_c8 ),
    inference(spm,[status(thm)],[c_0_23,c_0_70]) ).

cnf(c_0_80,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | sk_c2 = sk_c8 ),
    inference(spm,[status(thm)],[c_0_42,c_0_71]) ).

cnf(c_0_81,negated_conjecture,
    ( multiply(sk_c1,sk_c8) = sk_c9
    | inverse(sk_c5) = sk_c8 ),
    prove_this_18 ).

cnf(c_0_82,negated_conjecture,
    ( multiply(sk_c1,sk_c8) = sk_c9
    | inverse(sk_c5) = sk_c9 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_37]),c_0_63]) ).

cnf(c_0_83,negated_conjecture,
    ( multiply(sk_c9,sk_c8) = sk_c8
    | sk_c1 = sk_c8 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).

cnf(c_0_84,negated_conjecture,
    ( multiply(sk_c9,sk_c3) = sk_c8
    | identity = sk_c8 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_77]),c_0_21]) ).

cnf(c_0_85,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c3
    | inverse(sk_c5) = sk_c8 ),
    prove_this_32 ).

cnf(c_0_86,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c3
    | inverse(sk_c5) = sk_c9 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_73]),c_0_37]),c_0_63]) ).

cnf(c_0_87,negated_conjecture,
    ( multiply(sk_c9,sk_c8) = sk_c8
    | sk_c2 = sk_c8 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_76]) ).

cnf(c_0_88,negated_conjecture,
    ( multiply(sk_c1,sk_c8) = sk_c9
    | sk_c8 = sk_c9 ),
    inference(spm,[status(thm)],[c_0_81,c_0_82]) ).

cnf(c_0_89,negated_conjecture,
    ( sk_c1 = sk_c8
    | sk_c8 = sk_c9 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_83]),c_0_52]) ).

cnf(c_0_90,negated_conjecture,
    ( multiply(inverse(sk_c9),sk_c8) = sk_c3
    | identity = sk_c8 ),
    inference(spm,[status(thm)],[c_0_23,c_0_84]) ).

cnf(c_0_91,negated_conjecture,
    ( multiply(sk_c2,sk_c9) = sk_c3
    | sk_c8 = sk_c9 ),
    inference(spm,[status(thm)],[c_0_85,c_0_86]) ).

cnf(c_0_92,negated_conjecture,
    ( sk_c2 = sk_c8
    | sk_c8 = sk_c9 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_87]),c_0_52]) ).

cnf(c_0_93,negated_conjecture,
    ( multiply(sk_c8,sk_c8) = sk_c9
    | sk_c8 = sk_c9 ),
    inference(spm,[status(thm)],[c_0_88,c_0_89]) ).

cnf(c_0_94,negated_conjecture,
    ( multiply(inverse(sk_c3),multiply(sk_c9,X1)) = X1
    | identity = sk_c8 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_90]),c_0_62]) ).

cnf(c_0_95,negated_conjecture,
    ( multiply(sk_c9,sk_c8) = sk_c3
    | sk_c8 = sk_c9 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_76]) ).

cnf(c_0_96,negated_conjecture,
    ( inverse(sk_c9) = sk_c8
    | sk_c8 = sk_c9 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_93]),c_0_53]) ).

cnf(c_0_97,plain,
    inverse(identity) = identity,
    inference(spm,[status(thm)],[c_0_21,c_0_37]) ).

cnf(c_0_98,negated_conjecture,
    ( sk_c8 = sk_c9
    | identity = sk_c8 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_21])]) ).

cnf(c_0_99,negated_conjecture,
    ( inverse(sk_c8) = sk_c9
    | sk_c8 = sk_c9 ),
    inference(spm,[status(thm)],[c_0_42,c_0_96]) ).

cnf(c_0_100,negated_conjecture,
    ( inverse(sk_c8) = sk_c8
    | sk_c8 = sk_c9 ),
    inference(spm,[status(thm)],[c_0_97,c_0_98]) ).

cnf(c_0_101,negated_conjecture,
    ( inverse(sk_c9) != sk_c8
    | inverse(X1) != sk_c9
    | multiply(X1,sk_c8) != sk_c9
    | multiply(sk_c9,X2) != sk_c8
    | multiply(X3,sk_c9) != X2
    | inverse(X3) != sk_c9
    | inverse(X4) != sk_c9
    | multiply(X4,sk_c8) != sk_c9
    | multiply(X5,sk_c8) != sk_c9
    | inverse(X5) != sk_c8
    | multiply(X6,X7) != sk_c8
    | inverse(X6) != X7
    | multiply(X7,sk_c9) != sk_c8 ),
    inference(fof_simplification,[status(thm)],[prove_this_43]) ).

cnf(c_0_102,negated_conjecture,
    sk_c8 = sk_c9,
    inference(spm,[status(thm)],[c_0_99,c_0_100]) ).

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

cnf(c_0_104,negated_conjecture,
    identity = sk_c9,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_102]),c_0_73]) ).

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

cnf(c_0_106,plain,
    multiply(X1,sk_c9) = X1,
    inference(rw,[status(thm)],[c_0_37,c_0_104]) ).

cnf(c_0_107,plain,
    multiply(sk_c9,X1) = X1,
    inference(rw,[status(thm)],[c_0_22,c_0_104]) ).

cnf(c_0_108,plain,
    inverse(sk_c9) = sk_c9,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_104]),c_0_104]) ).

cnf(c_0_109,negated_conjecture,
    ( multiply(X1,inverse(X1)) != sk_c9
    | inverse(X1) != sk_c9 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_102]),c_0_102]),c_0_102]),c_0_102]),c_0_102]),c_0_102]),c_0_102]),c_0_102]),c_0_106]),c_0_107]),c_0_106]),c_0_106]),c_0_106]),c_0_106]),c_0_108])])])])])]),c_0_108])]) ).

cnf(c_0_110,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_108]),c_0_106])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : GRP239-1 : TPTP v8.2.0. Released v2.5.0.
% 0.09/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n010.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Sun May 19 06:09:07 EDT 2024
% 0.09/0.30  % CPUTime    : 
% 0.15/0.39  Running first-order theorem proving
% 0.15/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
% 36.63/5.00  # Version: 3.1.0
% 36.63/5.00  # Preprocessing class: FSMSSMSMSSSNFFN.
% 36.63/5.00  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.63/5.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 36.63/5.00  # Starting new_bool_3 with 300s (1) cores
% 36.63/5.00  # Starting new_bool_1 with 300s (1) cores
% 36.63/5.00  # Starting sh5l with 300s (1) cores
% 36.63/5.00  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 16169 completed with status 0
% 36.63/5.00  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 36.63/5.00  # Preprocessing class: FSMSSMSMSSSNFFN.
% 36.63/5.00  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.63/5.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 36.63/5.00  # No SInE strategy applied
% 36.63/5.00  # Search class: FGHPS-FFMM21-SFFFFFNN
% 36.63/5.00  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 36.63/5.00  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 36.63/5.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 36.63/5.00  # Starting new_bool_3 with 136s (1) cores
% 36.63/5.00  # Starting new_bool_1 with 136s (1) cores
% 36.63/5.00  # Starting sh5l with 136s (1) cores
% 36.63/5.00  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 16176 completed with status 0
% 36.63/5.00  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 36.63/5.00  # Preprocessing class: FSMSSMSMSSSNFFN.
% 36.63/5.00  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.63/5.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 36.63/5.00  # No SInE strategy applied
% 36.63/5.00  # Search class: FGHPS-FFMM21-SFFFFFNN
% 36.63/5.00  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 36.63/5.00  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 36.63/5.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 36.63/5.00  # Preprocessing time       : 0.001 s
% 36.63/5.00  # Presaturation interreduction done
% 36.63/5.00  
% 36.63/5.00  # Proof found!
% 36.63/5.00  # SZS status Unsatisfiable
% 36.63/5.00  # SZS output start CNFRefutation
% See solution above
% 36.63/5.00  # Parsed axioms                        : 46
% 36.63/5.00  # Removed by relevancy pruning/SinE    : 0
% 36.63/5.00  # Initial clauses                      : 46
% 36.63/5.00  # Removed in clause preprocessing      : 0
% 36.63/5.00  # Initial clauses in saturation        : 46
% 36.63/5.00  # Processed clauses                    : 33816
% 36.63/5.00  # ...of these trivial                  : 821
% 36.63/5.00  # ...subsumed                          : 29473
% 36.63/5.00  # ...remaining for further processing  : 3522
% 36.63/5.00  # Other redundant clauses eliminated   : 67
% 36.63/5.00  # Clauses deleted for lack of memory   : 0
% 36.63/5.00  # Backward-subsumed                    : 785
% 36.63/5.00  # Backward-rewritten                   : 2638
% 36.63/5.00  # Generated clauses                    : 490796
% 36.63/5.00  # ...of the previous two non-redundant : 485636
% 36.63/5.00  # ...aggressively subsumed             : 0
% 36.63/5.00  # Contextual simplify-reflections      : 32
% 36.63/5.00  # Paramodulations                      : 490738
% 36.63/5.00  # Factorizations                       : 17
% 36.63/5.00  # NegExts                              : 0
% 36.63/5.00  # Equation resolutions                 : 67
% 36.63/5.00  # Disequality decompositions           : 0
% 36.63/5.00  # Total rewrite steps                  : 210308
% 36.63/5.00  # ...of those cached                   : 204785
% 36.63/5.00  # Propositional unsat checks           : 0
% 36.63/5.00  #    Propositional check models        : 0
% 36.63/5.00  #    Propositional check unsatisfiable : 0
% 36.63/5.00  #    Propositional clauses             : 0
% 36.63/5.00  #    Propositional clauses after purity: 0
% 36.63/5.00  #    Propositional unsat core size     : 0
% 36.63/5.00  #    Propositional preprocessing time  : 0.000
% 36.63/5.00  #    Propositional encoding time       : 0.000
% 36.63/5.00  #    Propositional solver time         : 0.000
% 36.63/5.00  #    Success case prop preproc time    : 0.000
% 36.63/5.00  #    Success case prop encoding time   : 0.000
% 36.63/5.00  #    Success case prop solver time     : 0.000
% 36.63/5.00  # Current number of processed clauses  : 38
% 36.63/5.00  #    Positive orientable unit clauses  : 19
% 36.63/5.00  #    Positive unorientable unit clauses: 0
% 36.63/5.00  #    Negative unit clauses             : 0
% 36.63/5.00  #    Non-unit-clauses                  : 19
% 36.63/5.00  # Current number of unprocessed clauses: 79885
% 36.63/5.00  # ...number of literals in the above   : 267836
% 36.63/5.00  # Current number of archived formulas  : 0
% 36.63/5.00  # Current number of archived clauses   : 3469
% 36.63/5.00  # Clause-clause subsumption calls (NU) : 437100
% 36.63/5.00  # Rec. Clause-clause subsumption calls : 317342
% 36.63/5.00  # Non-unit clause-clause subsumptions  : 30262
% 36.63/5.00  # Unit Clause-clause subsumption calls : 4110
% 36.63/5.00  # Rewrite failures with RHS unbound    : 0
% 36.63/5.00  # BW rewrite match attempts            : 188
% 36.63/5.00  # BW rewrite match successes           : 92
% 36.63/5.00  # Condensation attempts                : 0
% 36.63/5.00  # Condensation successes               : 0
% 36.63/5.00  # Termbank termtop insertions          : 5588881
% 36.63/5.00  # Search garbage collected termcells   : 37
% 36.63/5.00  
% 36.63/5.00  # -------------------------------------------------
% 36.63/5.00  # User time                : 4.319 s
% 36.63/5.00  # System time              : 0.250 s
% 36.63/5.00  # Total time               : 4.569 s
% 36.63/5.00  # Maximum resident set size: 1648 pages
% 36.63/5.00  
% 36.63/5.00  # -------------------------------------------------
% 36.63/5.00  # User time                : 22.440 s
% 36.63/5.00  # System time              : 0.449 s
% 36.63/5.00  # Total time               : 22.890 s
% 36.63/5.00  # Maximum resident set size: 1716 pages
% 36.63/5.00  % E---3.1 exiting
% 36.63/5.00  % E exiting
%------------------------------------------------------------------------------