TSTP Solution File: GRP258-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP258-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:27 EDT 2023
% Result : Unsatisfiable 1.11s 0.62s
% Output : CNFRefutation 1.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 18
% Syntax : Number of clauses : 93 ( 20 unt; 60 nHn; 74 RR)
% Number of literals : 237 ( 236 equ; 92 neg)
% Maximal clause size : 17 ( 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 : 68 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',left_identity) ).
cnf(prove_this_66,negated_conjecture,
( inverse(sk_c3) = sk_c10
| inverse(sk_c6) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_66) ).
cnf(prove_this_56,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c12
| inverse(sk_c6) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_56) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| multiply(sk_c5,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_23) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c1) = sk_c12
| inverse(sk_c4) = sk_c12 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_12) ).
cnf(prove_this_35,negated_conjecture,
( inverse(sk_c2) = sk_c11
| multiply(sk_c6,sk_c9) = sk_c12 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_35) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| inverse(sk_c5) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_24) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c1,sk_c12) = sk_c11
| multiply(sk_c4,sk_c12) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_1) ).
cnf(prove_this_45,negated_conjecture,
( multiply(sk_c10,sk_c12) = sk_c11
| multiply(sk_c6,sk_c9) = sk_c12 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_45) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c12
| multiply(sk_c6,sk_c9) = sk_c12 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_15) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c1,sk_c12) = sk_c11
| inverse(sk_c4) = sk_c12 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_2) ).
cnf(prove_this_46,negated_conjecture,
( multiply(sk_c10,sk_c12) = sk_c11
| inverse(sk_c6) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_46) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c1) = sk_c12
| multiply(sk_c4,sk_c12) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_11) ).
cnf(prove_this_71,negated_conjecture,
( multiply(X1,sk_c12) != sk_c11
| inverse(X1) != sk_c12
| multiply(X2,sk_c11) != sk_c10
| inverse(X2) != sk_c11
| multiply(sk_c10,sk_c12) != sk_c11
| multiply(X3,sk_c10) != sk_c12
| inverse(X3) != sk_c10
| multiply(X4,sk_c12) != sk_c11
| inverse(X4) != sk_c12
| multiply(X5,sk_c11) != sk_c10
| inverse(X5) != sk_c11
| multiply(X6,X7) != sk_c12
| inverse(X6) != X7
| multiply(X7,sk_c11) != sk_c12
| inverse(X8) != X9
| inverse(X9) != X7
| multiply(X8,X7) != X9 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_71) ).
cnf(prove_this_33,negated_conjecture,
( inverse(sk_c2) = sk_c11
| multiply(sk_c5,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_33) ).
cnf(prove_this_44,negated_conjecture,
( multiply(sk_c10,sk_c12) = sk_c11
| inverse(sk_c5) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.HFnBtH0ItR/E---3.1_18694.p',prove_this_44) ).
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,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_23,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_21]) ).
cnf(c_0_24,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( inverse(sk_c3) = sk_c10
| inverse(sk_c6) = sk_c9 ),
prove_this_66 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c12
| inverse(sk_c6) = sk_c9 ),
prove_this_56 ).
cnf(c_0_28,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c9,sk_c6) = identity
| inverse(sk_c3) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| multiply(sk_c5,sk_c11) = sk_c10 ),
prove_this_23 ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c12
| multiply(sk_c9,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c9,sk_c6) = identity
| multiply(sk_c3,sk_c10) = identity ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c1) = sk_c12
| inverse(sk_c4) = sk_c12 ),
prove_this_12 ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c2) = sk_c11
| multiply(sk_c6,sk_c9) = sk_c12 ),
prove_this_35 ).
cnf(c_0_35,negated_conjecture,
( multiply(inverse(sk_c5),sk_c10) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_21,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| inverse(sk_c5) = sk_c11 ),
prove_this_24 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c9,sk_c6) = identity
| sk_c12 = identity ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c1,sk_c12) = sk_c11
| multiply(sk_c4,sk_c12) = sk_c11 ),
prove_this_1 ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c1) = sk_c12
| inverse(sk_c12) = sk_c4 ),
inference(spm,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c10,sk_c12) = sk_c11
| multiply(sk_c6,sk_c9) = sk_c12 ),
prove_this_45 ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c11,multiply(sk_c2,X1)) = X1
| multiply(sk_c6,sk_c9) = sk_c12 ),
inference(spm,[status(thm)],[c_0_21,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c9) = sk_c6
| sk_c12 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_37]),c_0_24]) ).
cnf(c_0_44,negated_conjecture,
( inverse(sk_c1) = sk_c12
| multiply(sk_c6,sk_c9) = sk_c12 ),
prove_this_15 ).
cnf(c_0_45,negated_conjecture,
( multiply(inverse(sk_c4),sk_c11) = sk_c12
| multiply(sk_c1,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_21,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c1,sk_c12) = sk_c11
| inverse(sk_c4) = sk_c12 ),
prove_this_2 ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c12) = sk_c4
| inverse(sk_c12) = sk_c1 ),
inference(spm,[status(thm)],[c_0_25,c_0_39]) ).
cnf(c_0_48,negated_conjecture,
( multiply(inverse(sk_c6),sk_c12) = sk_c9
| multiply(sk_c10,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_21,c_0_40]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c10,sk_c12) = sk_c11
| inverse(sk_c6) = sk_c9 ),
prove_this_46 ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c6,sk_c9) = identity
| sk_c12 = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_43]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c12,multiply(sk_c1,X1)) = X1
| multiply(sk_c6,sk_c9) = sk_c12 ),
inference(spm,[status(thm)],[c_0_21,c_0_44]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c1,sk_c12) = sk_c11
| multiply(sk_c12,sk_c11) = sk_c12 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_54,negated_conjecture,
( inverse(sk_c12) = sk_c1
| sk_c4 != sk_c1 ),
inference(ef,[status(thm)],[c_0_47]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c10,sk_c12) = sk_c11
| multiply(sk_c9,sk_c12) = sk_c9 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| sk_c12 = identity ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| multiply(sk_c12,sk_c11) = sk_c12 ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( inverse(sk_c1) = sk_c12
| sk_c4 != sk_c1 ),
inference(spm,[status(thm)],[c_0_25,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( inverse(sk_c1) = sk_c12
| multiply(sk_c4,sk_c12) = sk_c11 ),
prove_this_11 ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c10,sk_c12) = sk_c11
| sk_c12 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_55]),c_0_19]) ).
cnf(c_0_61,negated_conjecture,
( sk_c12 = identity
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_56]),c_0_19]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| sk_c12 = identity ),
inference(spm,[status(thm)],[c_0_57,c_0_51]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c12,multiply(sk_c1,X1)) = X1
| sk_c4 != sk_c1 ),
inference(spm,[status(thm)],[c_0_21,c_0_58]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c12,multiply(sk_c1,X1)) = X1
| multiply(sk_c4,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_21,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
( sk_c12 = identity
| sk_c11 = sk_c12 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_20]) ).
cnf(c_0_66,negated_conjecture,
( sk_c12 = identity
| sk_c11 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_62]),c_0_19]) ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| sk_c4 != sk_c1 ),
inference(spm,[status(thm)],[c_0_63,c_0_53]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| multiply(sk_c12,sk_c11) = sk_c12 ),
inference(spm,[status(thm)],[c_0_64,c_0_53]) ).
cnf(c_0_69,negated_conjecture,
sk_c12 = identity,
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
( multiply(X1,sk_c12) != sk_c11
| inverse(X1) != sk_c12
| multiply(X2,sk_c11) != sk_c10
| inverse(X2) != sk_c11
| multiply(sk_c10,sk_c12) != sk_c11
| multiply(X3,sk_c10) != sk_c12
| inverse(X3) != sk_c10
| multiply(X4,sk_c12) != sk_c11
| inverse(X4) != sk_c12
| multiply(X5,sk_c11) != sk_c10
| inverse(X5) != sk_c11
| multiply(X6,X7) != sk_c12
| inverse(X6) != X7
| multiply(X7,sk_c11) != sk_c12
| inverse(X8) != X9
| inverse(X9) != X7
| multiply(X8,X7) != X9 ),
prove_this_71 ).
cnf(c_0_71,negated_conjecture,
( sk_c11 = identity
| sk_c4 != sk_c1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_67]),c_0_19]) ).
cnf(c_0_72,negated_conjecture,
( sk_c11 = identity
| sk_c4 = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_24]),c_0_69]),c_0_20]),c_0_69]) ).
cnf(c_0_73,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_74,negated_conjecture,
( inverse(sk_c2) = sk_c11
| multiply(sk_c5,sk_c11) = sk_c10 ),
prove_this_33 ).
cnf(c_0_75,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c11) != sk_c12
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c10,sk_c12) != sk_c11
| multiply(X2,inverse(X2)) != sk_c12
| multiply(X3,sk_c11) != sk_c10
| multiply(X4,sk_c12) != sk_c11
| multiply(X5,sk_c10) != sk_c12
| multiply(X6,sk_c11) != sk_c10
| multiply(X7,sk_c12) != sk_c11
| inverse(X3) != sk_c11
| inverse(X4) != sk_c12
| inverse(X5) != sk_c10
| inverse(X6) != sk_c11
| inverse(X7) != sk_c12 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_70])]) ).
cnf(c_0_76,negated_conjecture,
( multiply(sk_c10,sk_c12) = sk_c11
| inverse(sk_c5) = sk_c11 ),
prove_this_44 ).
cnf(c_0_77,negated_conjecture,
( sk_c11 = identity
| sk_c1 != sk_c11 ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_78,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c11,multiply(sk_c2,X1)) = X1
| multiply(sk_c5,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_21,c_0_74]) ).
cnf(c_0_80,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c11) != sk_c12
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c10,sk_c12) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| multiply(X4,sk_c12) != sk_c11
| multiply(X5,sk_c10) != sk_c12
| multiply(X6,sk_c11) != sk_c10
| multiply(X7,sk_c12) != sk_c11
| inverse(X3) != sk_c11
| inverse(X4) != sk_c12
| inverse(X5) != sk_c10
| inverse(X6) != sk_c11
| inverse(X7) != sk_c12
| sk_c12 != identity ),
inference(rw,[status(thm)],[c_0_75,c_0_28]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c10,sk_c12) = sk_c11
| inverse(sk_c11) = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_76]) ).
cnf(c_0_82,negated_conjecture,
sk_c11 = identity,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_69]),c_0_24]),c_0_69]),c_0_20]),c_0_69]),c_0_77]) ).
cnf(c_0_83,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_19,c_0_78]) ).
cnf(c_0_84,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_79,c_0_42]) ).
cnf(c_0_85,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c11) != identity
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X3,sk_c11) != sk_c10
| multiply(X4,sk_c10) != identity
| multiply(X5,sk_c11) != sk_c10
| inverse(sk_c11) != identity
| inverse(X3) != sk_c11
| inverse(X4) != sk_c10
| inverse(X5) != sk_c11
| sk_c10 != sk_c11 ),
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)],[c_0_80,c_0_69]),c_0_69]),c_0_24]),c_0_69]),c_0_24]),c_0_69]),c_0_69]),c_0_24]),c_0_69]),c_0_69]),c_0_69])])])]) ).
cnf(c_0_86,negated_conjecture,
( sk_c5 = identity
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_69]),c_0_24]),c_0_82]),c_0_82]),c_0_83]) ).
cnf(c_0_87,negated_conjecture,
( sk_c10 = identity
| sk_c5 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_82]),c_0_24]),c_0_82]),c_0_20]),c_0_82]) ).
cnf(c_0_88,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X3,sk_c10) != identity
| inverse(sk_c10) != identity
| inverse(X2) != identity
| inverse(X3) != sk_c10
| sk_c10 != identity ),
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)],[c_0_85,c_0_82]),c_0_24]),c_0_82]),c_0_24]),c_0_82]),c_0_24]),c_0_82]),c_0_83]),c_0_82]),c_0_82]),c_0_82])])])]) ).
cnf(c_0_89,negated_conjecture,
sk_c10 = identity,
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| inverse(X2) != identity ),
inference(cn,[status(thm)],[inference(rw,[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)],[c_0_88,c_0_89]),c_0_24]),c_0_89]),c_0_83]),c_0_89]),c_0_89])])]),c_0_83])]) ).
cnf(c_0_91,negated_conjecture,
inverse(X1) != identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_19]),c_0_83]),c_0_25])]) ).
cnf(c_0_92,plain,
$false,
inference(sr,[status(thm)],[c_0_83,c_0_91]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : GRP258-1 : TPTP v8.1.2. Released v2.5.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n001.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 03:09:37 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.HFnBtH0ItR/E---3.1_18694.p
% 1.11/0.62 # Version: 3.1pre001
% 1.11/0.62 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.11/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.11/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.11/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.11/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.11/0.62 # Starting sh5l with 300s (1) cores
% 1.11/0.62 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 18773 completed with status 0
% 1.11/0.62 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.11/0.62 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.11/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.11/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.11/0.62 # No SInE strategy applied
% 1.11/0.62 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.11/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.11/0.62 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.11/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.11/0.62 # Starting new_bool_3 with 136s (1) cores
% 1.11/0.62 # Starting new_bool_1 with 136s (1) cores
% 1.11/0.62 # Starting sh5l with 136s (1) cores
% 1.11/0.62 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 18777 completed with status 0
% 1.11/0.62 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.11/0.62 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.11/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.11/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.11/0.62 # No SInE strategy applied
% 1.11/0.62 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.11/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.11/0.62 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.11/0.62 # Preprocessing time : 0.001 s
% 1.11/0.62 # Presaturation interreduction done
% 1.11/0.62
% 1.11/0.62 # Proof found!
% 1.11/0.62 # SZS status Unsatisfiable
% 1.11/0.62 # SZS output start CNFRefutation
% See solution above
% 1.11/0.62 # Parsed axioms : 74
% 1.11/0.62 # Removed by relevancy pruning/SinE : 0
% 1.11/0.62 # Initial clauses : 74
% 1.11/0.62 # Removed in clause preprocessing : 0
% 1.11/0.62 # Initial clauses in saturation : 74
% 1.11/0.62 # Processed clauses : 2825
% 1.11/0.62 # ...of these trivial : 10
% 1.11/0.62 # ...subsumed : 1767
% 1.11/0.62 # ...remaining for further processing : 1048
% 1.11/0.62 # Other redundant clauses eliminated : 8
% 1.11/0.62 # Clauses deleted for lack of memory : 0
% 1.11/0.62 # Backward-subsumed : 56
% 1.11/0.62 # Backward-rewritten : 835
% 1.11/0.62 # Generated clauses : 13976
% 1.11/0.62 # ...of the previous two non-redundant : 14055
% 1.11/0.62 # ...aggressively subsumed : 0
% 1.11/0.62 # Contextual simplify-reflections : 1
% 1.11/0.62 # Paramodulations : 13959
% 1.11/0.62 # Factorizations : 2
% 1.11/0.62 # NegExts : 0
% 1.11/0.62 # Equation resolutions : 8
% 1.11/0.62 # Total rewrite steps : 4578
% 1.11/0.62 # Propositional unsat checks : 0
% 1.11/0.62 # Propositional check models : 0
% 1.11/0.62 # Propositional check unsatisfiable : 0
% 1.11/0.62 # Propositional clauses : 0
% 1.11/0.62 # Propositional clauses after purity: 0
% 1.11/0.62 # Propositional unsat core size : 0
% 1.11/0.62 # Propositional preprocessing time : 0.000
% 1.11/0.62 # Propositional encoding time : 0.000
% 1.11/0.62 # Propositional solver time : 0.000
% 1.11/0.62 # Success case prop preproc time : 0.000
% 1.11/0.62 # Success case prop encoding time : 0.000
% 1.11/0.62 # Success case prop solver time : 0.000
% 1.11/0.62 # Current number of processed clauses : 74
% 1.11/0.62 # Positive orientable unit clauses : 13
% 1.11/0.62 # Positive unorientable unit clauses: 0
% 1.11/0.62 # Negative unit clauses : 1
% 1.11/0.62 # Non-unit-clauses : 60
% 1.11/0.62 # Current number of unprocessed clauses: 11202
% 1.11/0.62 # ...number of literals in the above : 30082
% 1.11/0.62 # Current number of archived formulas : 0
% 1.11/0.62 # Current number of archived clauses : 973
% 1.11/0.62 # Clause-clause subsumption calls (NU) : 41394
% 1.11/0.62 # Rec. Clause-clause subsumption calls : 31092
% 1.11/0.62 # Non-unit clause-clause subsumptions : 1823
% 1.11/0.62 # Unit Clause-clause subsumption calls : 269
% 1.11/0.62 # Rewrite failures with RHS unbound : 0
% 1.11/0.62 # BW rewrite match attempts : 10
% 1.11/0.62 # BW rewrite match successes : 8
% 1.11/0.62 # Condensation attempts : 0
% 1.11/0.62 # Condensation successes : 0
% 1.11/0.62 # Termbank termtop insertions : 128264
% 1.11/0.62
% 1.11/0.62 # -------------------------------------------------
% 1.11/0.62 # User time : 0.189 s
% 1.11/0.62 # System time : 0.005 s
% 1.11/0.62 # Total time : 0.194 s
% 1.11/0.62 # Maximum resident set size: 1672 pages
% 1.11/0.62
% 1.11/0.62 # -------------------------------------------------
% 1.11/0.62 # User time : 0.959 s
% 1.11/0.62 # System time : 0.014 s
% 1.11/0.62 # Total time : 0.973 s
% 1.11/0.62 # Maximum resident set size: 1728 pages
% 1.11/0.62 % E---3.1 exiting
% 1.11/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------