TSTP Solution File: GRP340-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP340-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:47:07 EDT 2023
% Result : Unsatisfiable 3.09s 0.78s
% Output : CNFRefutation 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 22
% Syntax : Number of clauses : 112 ( 25 unt; 78 nHn; 91 RR)
% Number of literals : 276 ( 275 equ; 95 neg)
% Maximal clause size : 15 ( 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 : 80 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',left_identity) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_5) ).
cnf(prove_this_36,negated_conjecture,
( inverse(sk_c2) = sk_c10
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_36) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_6) ).
cnf(prove_this_35,negated_conjecture,
( inverse(sk_c2) = sk_c10
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_35) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_4) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_26) ).
cnf(prove_this_46,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_46) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_1) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_2) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_25) ).
cnf(prove_this_45,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_45) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_16) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_14) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_15) ).
cnf(prove_this_51,negated_conjecture,
( multiply(sk_c10,sk_c11) != sk_c9
| inverse(X1) != sk_c11
| multiply(X1,sk_c10) != sk_c11
| inverse(X2) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_51) ).
cnf(prove_this_13,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_13) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_3) ).
cnf(prove_this_22,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_22) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p',prove_this_21) ).
cnf(c_0_22,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_23,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_24,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_25,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_27,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_25]) ).
cnf(c_0_28,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_5 ).
cnf(c_0_31,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( inverse(sk_c2) = sk_c10
| inverse(sk_c5) = sk_c8 ),
prove_this_36 ).
cnf(c_0_33,negated_conjecture,
( multiply(inverse(sk_c5),sk_c11) = sk_c8
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c5) = sk_c8 ),
prove_this_6 ).
cnf(c_0_35,negated_conjecture,
( inverse(sk_c2) = sk_c10
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_35 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c5,sk_c8) = identity
| inverse(sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c8,sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| multiply(sk_c10,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c5,sk_c8) = identity
| multiply(sk_c10,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c4) = sk_c10 ),
prove_this_4 ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| inverse(sk_c5) = sk_c8 ),
prove_this_26 ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| inverse(sk_c5) = sk_c8 ),
prove_this_46 ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| sk_c11 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_37]),c_0_23]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c10,sk_c2) = identity
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c10,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_1 ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c3) = sk_c11 ),
prove_this_2 ).
cnf(c_0_48,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3,
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_25 ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c5,sk_c8) = identity ),
inference(spm,[status(thm)],[c_0_31,c_0_41]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_45 ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| multiply(sk_c5,sk_c8) = identity ),
inference(spm,[status(thm)],[c_0_31,c_0_42]) ).
cnf(c_0_53,negated_conjecture,
( multiply(inverse(sk_c10),sk_c9) = sk_c11
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_25,c_0_43]) ).
cnf(c_0_54,negated_conjecture,
( inverse(sk_c10) = sk_c2
| sk_c11 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_44]),c_0_28]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c10) = sk_c4 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_45]),c_0_28]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c3,multiply(sk_c11,X1)) = multiply(sk_c10,X1)
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_22,c_0_46]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c11,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_47]) ).
cnf(c_0_58,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c5) = sk_c8 ),
prove_this_16 ).
cnf(c_0_59,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_31]),c_0_28]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c11
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_63,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c4) = sk_c10 ),
prove_this_14 ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c4,multiply(sk_c10,X1)) = X1
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_25,c_0_55]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c10,sk_c3) = sk_c3 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_28]) ).
cnf(c_0_66,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_15 ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c5,sk_c8) = identity
| inverse(sk_c1) = sk_c11 ),
inference(spm,[status(thm)],[c_0_31,c_0_58]) ).
cnf(c_0_68,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_59]),c_0_29]) ).
cnf(c_0_69,negated_conjecture,
( multiply(inverse(sk_c1),sk_c11) = sk_c10
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_25,c_0_60]) ).
cnf(c_0_70,negated_conjecture,
( sk_c11 = identity
| sk_c11 = sk_c10 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c10,sk_c11) != sk_c9
| inverse(X1) != sk_c11
| multiply(X1,sk_c10) != sk_c11
| inverse(X2) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
prove_this_51 ).
cnf(c_0_72,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_13 ).
cnf(c_0_73,negated_conjecture,
( multiply(sk_c4,sk_c10) = identity
| inverse(sk_c1) = sk_c11 ),
inference(spm,[status(thm)],[c_0_31,c_0_63]) ).
cnf(c_0_74,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_3 ).
cnf(c_0_76,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c4,sk_c3) = sk_c3 ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| multiply(sk_c11,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_66]) ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c5,sk_c8) = identity
| multiply(sk_c11,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_67]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c11,inverse(sk_c10)) = sk_c1
| sk_c11 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_29]) ).
cnf(c_0_80,negated_conjecture,
( sk_c11 = identity
| sk_c10 != identity ),
inference(ef,[status(thm)],[c_0_70]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| inverse(sk_c3) = sk_c11 ),
prove_this_22 ).
cnf(c_0_82,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c10,sk_c11) != sk_c9
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c10) != sk_c9
| multiply(X4,sk_c11) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| inverse(X3) != sk_c10
| inverse(X4) != sk_c11
| inverse(X5) != sk_c10
| inverse(X6) != sk_c11 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_71])]) ).
cnf(c_0_83,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_84,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c11,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_72]) ).
cnf(c_0_85,negated_conjecture,
( multiply(sk_c4,sk_c10) = identity
| multiply(sk_c11,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_73]) ).
cnf(c_0_86,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_74]) ).
cnf(c_0_87,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c10
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_25,c_0_75]) ).
cnf(c_0_88,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c4) = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_76]),c_0_31]) ).
cnf(c_0_89,negated_conjecture,
( multiply(sk_c11,sk_c1) = identity
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_90,negated_conjecture,
( sk_c11 = identity
| sk_c1 = identity ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_70]),c_0_31]),c_0_80]) ).
cnf(c_0_91,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_21 ).
cnf(c_0_92,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c3,sk_c11) = identity ),
inference(spm,[status(thm)],[c_0_31,c_0_81]) ).
cnf(c_0_93,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c10,sk_c11) != sk_c9
| multiply(X3,sk_c10) != sk_c9
| multiply(X4,sk_c11) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| inverse(X3) != sk_c10
| inverse(X4) != sk_c11
| inverse(X5) != sk_c10
| inverse(X6) != sk_c11
| sk_c11 != identity ),
inference(rw,[status(thm)],[c_0_82,c_0_31]) ).
cnf(c_0_94,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_83,c_0_68]) ).
cnf(c_0_95,negated_conjecture,
( multiply(sk_c11,sk_c1) = identity
| sk_c9 = identity ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_96,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_23,c_0_86]) ).
cnf(c_0_97,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_24]) ).
cnf(c_0_98,negated_conjecture,
sk_c11 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_28])]) ).
cnf(c_0_99,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| sk_c10 = identity ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_100,negated_conjecture,
( multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X1),sk_c10) != sk_c11
| multiply(X2,inverse(X1)) != inverse(X2)
| multiply(sk_c10,sk_c11) != sk_c9
| multiply(X3,sk_c10) != sk_c9
| multiply(X4,sk_c11) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| inverse(X3) != sk_c10
| inverse(X4) != sk_c11
| inverse(X5) != sk_c10
| inverse(X6) != sk_c11
| sk_c11 != identity ),
inference(rw,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_101,negated_conjecture,
( inverse(sk_c1) = sk_c11
| sk_c9 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_95]),c_0_96]),c_0_24]) ).
cnf(c_0_102,negated_conjecture,
sk_c9 = sk_c10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_98]),c_0_28])]) ).
cnf(c_0_103,negated_conjecture,
( multiply(inverse(sk_c1),sk_c11) = sk_c10
| sk_c10 = identity ),
inference(spm,[status(thm)],[c_0_25,c_0_99]) ).
cnf(c_0_104,negated_conjecture,
( multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X1),sk_c10) != identity
| multiply(X2,inverse(X1)) != inverse(X2)
| multiply(X3,sk_c10) != sk_c9
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,sk_c10) != identity
| inverse(sk_c10) != identity
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != identity
| sk_c9 != sk_c10 ),
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)],[c_0_100,c_0_98]),c_0_98]),c_0_28]),c_0_98]),c_0_28]),c_0_98]),c_0_98]),c_0_98]),c_0_98])])]) ).
cnf(c_0_105,negated_conjecture,
( inverse(sk_c1) = identity
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_98]),c_0_102]) ).
cnf(c_0_106,negated_conjecture,
( inverse(sk_c1) = sk_c10
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_98]),c_0_28]) ).
cnf(c_0_107,negated_conjecture,
( multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X1),sk_c10) != identity
| multiply(X2,inverse(X1)) != inverse(X2)
| multiply(X3,sk_c10) != sk_c10
| multiply(X4,sk_c10) != sk_c10
| multiply(X5,sk_c10) != identity
| inverse(sk_c10) != identity
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_102]),c_0_102]),c_0_102])]) ).
cnf(c_0_108,negated_conjecture,
sk_c10 = identity,
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_109,negated_conjecture,
( multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X1)) != inverse(X2)
| inverse(X1) != identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_107,c_0_108]),c_0_28]),c_0_108]),c_0_28]),c_0_108]),c_0_108]),c_0_28]),c_0_108]),c_0_108]),c_0_28]),c_0_108]),c_0_96]),c_0_108]),c_0_108])])])])]),c_0_96])]) ).
cnf(c_0_110,negated_conjecture,
inverse(X1) != identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_23]),c_0_29]),c_0_29]),c_0_31])]) ).
cnf(c_0_111,plain,
$false,
inference(sr,[status(thm)],[c_0_96,c_0_110]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP340-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n026.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 03:20:29 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ebcRoXEfRQ/E---3.1_27566.p
% 3.09/0.78 # Version: 3.1pre001
% 3.09/0.78 # Preprocessing class: FSMSSMSMSSSNFFN.
% 3.09/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.09/0.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.09/0.78 # Starting new_bool_3 with 300s (1) cores
% 3.09/0.78 # Starting new_bool_1 with 300s (1) cores
% 3.09/0.78 # Starting sh5l with 300s (1) cores
% 3.09/0.78 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 27643 completed with status 0
% 3.09/0.78 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 3.09/0.78 # Preprocessing class: FSMSSMSMSSSNFFN.
% 3.09/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.09/0.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.09/0.78 # No SInE strategy applied
% 3.09/0.78 # Search class: FGHPS-FFMM21-SFFFFFNN
% 3.09/0.78 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.09/0.78 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.09/0.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 3.09/0.78 # Starting new_bool_3 with 136s (1) cores
% 3.09/0.78 # Starting new_bool_1 with 136s (1) cores
% 3.09/0.78 # Starting sh5l with 136s (1) cores
% 3.09/0.78 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 27647 completed with status 0
% 3.09/0.78 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 3.09/0.78 # Preprocessing class: FSMSSMSMSSSNFFN.
% 3.09/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.09/0.78 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.09/0.78 # No SInE strategy applied
% 3.09/0.78 # Search class: FGHPS-FFMM21-SFFFFFNN
% 3.09/0.78 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.09/0.78 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.09/0.78 # Preprocessing time : 0.001 s
% 3.09/0.78 # Presaturation interreduction done
% 3.09/0.78
% 3.09/0.78 # Proof found!
% 3.09/0.78 # SZS status Unsatisfiable
% 3.09/0.78 # SZS output start CNFRefutation
% See solution above
% 3.09/0.78 # Parsed axioms : 54
% 3.09/0.78 # Removed by relevancy pruning/SinE : 0
% 3.09/0.78 # Initial clauses : 54
% 3.09/0.78 # Removed in clause preprocessing : 0
% 3.09/0.78 # Initial clauses in saturation : 54
% 3.09/0.78 # Processed clauses : 6721
% 3.09/0.78 # ...of these trivial : 234
% 3.09/0.78 # ...subsumed : 4962
% 3.09/0.78 # ...remaining for further processing : 1525
% 3.09/0.78 # Other redundant clauses eliminated : 16
% 3.09/0.78 # Clauses deleted for lack of memory : 0
% 3.09/0.78 # Backward-subsumed : 171
% 3.09/0.78 # Backward-rewritten : 1190
% 3.09/0.78 # Generated clauses : 36020
% 3.09/0.78 # ...of the previous two non-redundant : 35995
% 3.09/0.78 # ...aggressively subsumed : 0
% 3.09/0.78 # Contextual simplify-reflections : 5
% 3.09/0.78 # Paramodulations : 35995
% 3.09/0.78 # Factorizations : 3
% 3.09/0.78 # NegExts : 0
% 3.09/0.78 # Equation resolutions : 16
% 3.09/0.78 # Total rewrite steps : 11818
% 3.09/0.78 # Propositional unsat checks : 0
% 3.09/0.78 # Propositional check models : 0
% 3.09/0.78 # Propositional check unsatisfiable : 0
% 3.09/0.78 # Propositional clauses : 0
% 3.09/0.78 # Propositional clauses after purity: 0
% 3.09/0.78 # Propositional unsat core size : 0
% 3.09/0.78 # Propositional preprocessing time : 0.000
% 3.09/0.78 # Propositional encoding time : 0.000
% 3.09/0.78 # Propositional solver time : 0.000
% 3.09/0.78 # Success case prop preproc time : 0.000
% 3.09/0.78 # Success case prop encoding time : 0.000
% 3.09/0.78 # Success case prop solver time : 0.000
% 3.09/0.78 # Current number of processed clauses : 102
% 3.09/0.78 # Positive orientable unit clauses : 18
% 3.09/0.78 # Positive unorientable unit clauses: 0
% 3.09/0.78 # Negative unit clauses : 1
% 3.09/0.78 # Non-unit-clauses : 83
% 3.09/0.78 # Current number of unprocessed clauses: 29057
% 3.09/0.78 # ...number of literals in the above : 81892
% 3.09/0.78 # Current number of archived formulas : 0
% 3.09/0.78 # Current number of archived clauses : 1422
% 3.09/0.78 # Clause-clause subsumption calls (NU) : 94845
% 3.09/0.78 # Rec. Clause-clause subsumption calls : 75559
% 3.09/0.78 # Non-unit clause-clause subsumptions : 5129
% 3.09/0.78 # Unit Clause-clause subsumption calls : 340
% 3.09/0.78 # Rewrite failures with RHS unbound : 0
% 3.09/0.78 # BW rewrite match attempts : 13
% 3.09/0.78 # BW rewrite match successes : 10
% 3.09/0.78 # Condensation attempts : 0
% 3.09/0.78 # Condensation successes : 0
% 3.09/0.78 # Termbank termtop insertions : 316928
% 3.09/0.78
% 3.09/0.78 # -------------------------------------------------
% 3.09/0.78 # User time : 0.361 s
% 3.09/0.78 # System time : 0.018 s
% 3.09/0.78 # Total time : 0.379 s
% 3.09/0.78 # Maximum resident set size: 1684 pages
% 3.09/0.78
% 3.09/0.78 # -------------------------------------------------
% 3.09/0.78 # User time : 1.839 s
% 3.09/0.78 # System time : 0.037 s
% 3.09/0.78 # Total time : 1.876 s
% 3.09/0.78 # Maximum resident set size: 1724 pages
% 3.09/0.78 % E---3.1 exiting
%------------------------------------------------------------------------------