TSTP Solution File: GRP228-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP228-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:22 EDT 2023
% Result : Unsatisfiable 1.42s 0.60s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 21
% Syntax : Number of clauses : 97 ( 19 unt; 70 nHn; 84 RR)
% Number of literals : 256 ( 255 equ; 94 neg)
% Maximal clause size : 14 ( 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 : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',left_identity) ).
cnf(prove_this_12,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_12) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_11) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_3) ).
cnf(prove_this_22,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_22) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_2) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_23) ).
cnf(prove_this_46,negated_conjecture,
( inverse(X1) != sk_c10
| multiply(X1,sk_c9) != sk_c10
| multiply(sk_c10,X2) != sk_c9
| multiply(X3,sk_c10) != X2
| inverse(X3) != sk_c10
| inverse(sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,X6) != sk_c10
| inverse(X5) != X6
| multiply(X6,sk_c9) != sk_c10
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_46) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c4,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_21) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| inverse(sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_19) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_20) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c8,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_24) ).
cnf(prove_this_27,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c7,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_27) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| inverse(sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_25) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| inverse(sk_c6) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_26) ).
cnf(prove_this_32,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c3
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_32) ).
cnf(prove_this_31,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c3
| multiply(sk_c5,sk_c8) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_31) ).
cnf(prove_this_41,negated_conjecture,
( inverse(sk_c2) = sk_c10
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_41) ).
cnf(prove_this_40,negated_conjecture,
( inverse(sk_c2) = sk_c10
| multiply(sk_c5,sk_c8) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.jRVzf99kzn/E---3.1_14901.p',prove_this_40) ).
cnf(c_0_21,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_22,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_23,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_24,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
prove_this_12 ).
cnf(c_0_26,negated_conjecture,
( multiply(inverse(sk_c4),sk_c10) = sk_c9
| multiply(sk_c1,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_11 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( multiply(inverse(sk_c1),sk_c10) = sk_c9
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
prove_this_3 ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c4,sk_c9) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c10 ),
prove_this_22 ).
cnf(c_0_33,negated_conjecture,
( multiply(inverse(sk_c4),sk_c10) = sk_c9
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_2 ).
cnf(c_0_35,negated_conjecture,
( multiply(inverse(sk_c5),sk_c10) = sk_c8
| multiply(sk_c10,sk_c3) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| inverse(sk_c5) = sk_c8 ),
prove_this_23 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| inverse(sk_c1) = sk_c10 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c5,multiply(sk_c8,X1)) = multiply(sk_c10,X1)
| multiply(sk_c10,sk_c3) = sk_c9 ),
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c8,sk_c10) = sk_c8 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
multiply(sk_c10,sk_c10) = sk_c9,
inference(spm,[status(thm)],[c_0_29,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( multiply(inverse(sk_c5),sk_c9) = sk_c8
| multiply(sk_c10,sk_c3) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
( inverse(X1) != sk_c10
| multiply(X1,sk_c9) != sk_c10
| multiply(sk_c10,X2) != sk_c9
| multiply(X3,sk_c10) != X2
| inverse(X3) != sk_c10
| inverse(sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,X6) != sk_c10
| inverse(X5) != X6
| multiply(X6,sk_c9) != sk_c10
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
prove_this_46 ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c4,sk_c9) = sk_c10 ),
prove_this_21 ).
cnf(c_0_45,negated_conjecture,
multiply(inverse(sk_c10),sk_c9) = sk_c10,
inference(spm,[status(thm)],[c_0_24,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| inverse(sk_c10) = sk_c9 ),
prove_this_19 ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c8,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9
| inverse(multiply(X2,inverse(X3))) != inverse(X3)
| multiply(inverse(X3),sk_c9) != sk_c10
| multiply(X2,inverse(X3)) != inverse(X2)
| multiply(X3,inverse(X3)) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| inverse(sk_c10) != sk_c9
| inverse(X4) != sk_c10
| inverse(X1) != sk_c10
| inverse(X5) != sk_c10 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_43])])]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c4,multiply(sk_c9,X1)) = multiply(sk_c10,X1)
| multiply(sk_c10,sk_c3) = sk_c9 ),
inference(spm,[status(thm)],[c_0_21,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c9,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c5,sk_c8) = multiply(sk_c10,sk_c9)
| multiply(sk_c10,sk_c3) = sk_c9 ),
inference(spm,[status(thm)],[c_0_38,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9
| inverse(multiply(X2,inverse(X3))) != inverse(X3)
| multiply(inverse(X3),sk_c9) != sk_c10
| multiply(X2,inverse(X3)) != inverse(X2)
| multiply(X3,inverse(X3)) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| inverse(X4) != sk_c10
| inverse(X1) != sk_c10
| inverse(X5) != sk_c10 ),
inference(spm,[status(thm)],[c_0_48,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c4,sk_c10) = multiply(sk_c10,sk_c9)
| multiply(sk_c10,sk_c3) = sk_c9 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| inverse(sk_c4) = sk_c10 ),
prove_this_20 ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(sk_c10,sk_c3) = sk_c9 ),
inference(spm,[status(thm)],[c_0_32,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c10,multiply(sk_c10,sk_c9)) != sk_c9
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c9) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| sk_c3 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_55]),c_0_45]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| sk_c3 = sk_c10
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c9) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_40])]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c8,sk_c9) = sk_c10 ),
prove_this_24 ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| sk_c3 = sk_c10
| inverse(multiply(X1,sk_c8)) != sk_c8
| inverse(X1) != multiply(X1,sk_c8)
| multiply(X2,sk_c9) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| inverse(X2) != sk_c10
| inverse(X3) != sk_c10 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_36]),c_0_32]),c_0_59]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| multiply(sk_c7,sk_c8) = sk_c6 ),
prove_this_27 ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| inverse(sk_c7) = sk_c6 ),
prove_this_25 ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| inverse(sk_c6) = sk_c8 ),
prove_this_26 ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| sk_c3 = sk_c10
| multiply(X1,sk_c9) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| inverse(X1) != sk_c10
| inverse(X2) != sk_c10 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_63]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| sk_c3 = sk_c10
| multiply(X1,sk_c9) != sk_c10
| inverse(X1) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_44]),c_0_54]) ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c3
| inverse(sk_c5) = sk_c8 ),
prove_this_32 ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c10,sk_c3) = sk_c9
| sk_c3 = sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_44]),c_0_54]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c3
| multiply(sk_c5,sk_c8) = sk_c10 ),
prove_this_31 ).
cnf(c_0_69,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c3
| multiply(sk_c8,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_22,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
sk_c3 = sk_c10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_67]),c_0_45])]) ).
cnf(c_0_71,negated_conjecture,
( multiply(inverse(sk_c5),sk_c10) = sk_c8
| multiply(sk_c2,sk_c10) = sk_c3 ),
inference(spm,[status(thm)],[c_0_24,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
( multiply(sk_c8,sk_c5) = identity
| multiply(sk_c2,sk_c10) = sk_c10 ),
inference(rw,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( inverse(sk_c2) = sk_c10
| inverse(sk_c5) = sk_c8 ),
prove_this_41 ).
cnf(c_0_74,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c3
| multiply(sk_c8,sk_c10) = sk_c8 ),
inference(spm,[status(thm)],[c_0_71,c_0_66]) ).
cnf(c_0_75,negated_conjecture,
( multiply(inverse(sk_c2),sk_c10) = sk_c10
| multiply(sk_c8,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_24,c_0_72]) ).
cnf(c_0_76,negated_conjecture,
( multiply(sk_c8,sk_c5) = identity
| inverse(sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_22,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
( multiply(inverse(sk_c2),sk_c3) = sk_c10
| multiply(sk_c8,sk_c10) = sk_c8 ),
inference(spm,[status(thm)],[c_0_24,c_0_74]) ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c8,sk_c5) = identity
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_40]) ).
cnf(c_0_79,negated_conjecture,
( multiply(inverse(sk_c2),sk_c10) = sk_c10
| multiply(sk_c8,sk_c10) = sk_c8 ),
inference(rw,[status(thm)],[c_0_77,c_0_70]) ).
cnf(c_0_80,negated_conjecture,
( inverse(sk_c2) = sk_c10
| multiply(sk_c5,sk_c8) = sk_c10 ),
prove_this_40 ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c8,multiply(sk_c5,X1)) = X1
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_78]),c_0_23]) ).
cnf(c_0_82,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c10
| multiply(sk_c8,sk_c10) = sk_c8
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_40]) ).
cnf(c_0_83,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c8
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_84,negated_conjecture,
( sk_c9 = sk_c10
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_83]),c_0_22]) ).
cnf(c_0_85,negated_conjecture,
sk_c10 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_84]),c_0_22])]) ).
cnf(c_0_86,negated_conjecture,
multiply(inverse(inverse(sk_c10)),sk_c10) = sk_c9,
inference(spm,[status(thm)],[c_0_24,c_0_45]) ).
cnf(c_0_87,negated_conjecture,
sk_c9 = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_85]),c_0_85]),c_0_23]) ).
cnf(c_0_88,negated_conjecture,
multiply(inverse(inverse(identity)),identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_85]),c_0_85]),c_0_87]) ).
cnf(c_0_89,negated_conjecture,
multiply(inverse(inverse(identity)),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_88]),c_0_23]),c_0_23]) ).
cnf(c_0_90,negated_conjecture,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_22,c_0_89]) ).
cnf(c_0_91,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_24]) ).
cnf(c_0_92,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),identity) != identity
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != identity
| multiply(X3,identity) != identity
| multiply(X4,identity) != identity
| multiply(X5,identity) != identity
| inverse(X4) != identity
| inverse(X3) != identity
| inverse(X5) != identity ),
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_85]),c_0_85]),c_0_23]),c_0_85]),c_0_85]),c_0_85]),c_0_85]),c_0_85]),c_0_85]),c_0_85]),c_0_85]),c_0_87]),c_0_87]),c_0_87]),c_0_87]),c_0_90]),c_0_87])]) ).
cnf(c_0_93,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_91]) ).
cnf(c_0_94,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != identity
| inverse(X2) != identity ),
inference(cn,[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)],[c_0_92,c_0_93]),c_0_93]),c_0_93]),c_0_93])])])]),c_0_90])]) ).
cnf(c_0_95,negated_conjecture,
( inverse(X1) != identity
| inverse(X1) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_90]),c_0_93]),c_0_93]),c_0_23])]) ).
cnf(c_0_96,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_95,c_0_90]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP228-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n029.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:53:37 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.jRVzf99kzn/E---3.1_14901.p
% 1.42/0.60 # Version: 3.1pre001
% 1.42/0.60 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.42/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.42/0.60 # Starting new_bool_3 with 300s (1) cores
% 1.42/0.60 # Starting new_bool_1 with 300s (1) cores
% 1.42/0.60 # Starting sh5l with 300s (1) cores
% 1.42/0.60 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 14979 completed with status 0
% 1.42/0.60 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.42/0.60 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.42/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.42/0.60 # No SInE strategy applied
% 1.42/0.60 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.42/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.42/0.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.42/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.42/0.60 # Starting new_bool_3 with 136s (1) cores
% 1.42/0.60 # Starting new_bool_1 with 136s (1) cores
% 1.42/0.60 # Starting sh5l with 136s (1) cores
% 1.42/0.60 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 14983 completed with status 0
% 1.42/0.60 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.42/0.60 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.42/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.42/0.60 # No SInE strategy applied
% 1.42/0.60 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.42/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.42/0.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.42/0.60 # Preprocessing time : 0.001 s
% 1.42/0.60 # Presaturation interreduction done
% 1.42/0.60
% 1.42/0.60 # Proof found!
% 1.42/0.60 # SZS status Unsatisfiable
% 1.42/0.60 # SZS output start CNFRefutation
% See solution above
% 1.42/0.60 # Parsed axioms : 49
% 1.42/0.60 # Removed by relevancy pruning/SinE : 0
% 1.42/0.60 # Initial clauses : 49
% 1.42/0.60 # Removed in clause preprocessing : 0
% 1.42/0.60 # Initial clauses in saturation : 49
% 1.42/0.60 # Processed clauses : 2472
% 1.42/0.60 # ...of these trivial : 63
% 1.42/0.60 # ...subsumed : 1539
% 1.42/0.60 # ...remaining for further processing : 870
% 1.42/0.60 # Other redundant clauses eliminated : 14
% 1.42/0.60 # Clauses deleted for lack of memory : 0
% 1.42/0.60 # Backward-subsumed : 98
% 1.42/0.60 # Backward-rewritten : 542
% 1.42/0.60 # Generated clauses : 7477
% 1.42/0.60 # ...of the previous two non-redundant : 7415
% 1.42/0.60 # ...aggressively subsumed : 0
% 1.42/0.60 # Contextual simplify-reflections : 10
% 1.42/0.60 # Paramodulations : 7465
% 1.42/0.60 # Factorizations : 0
% 1.42/0.60 # NegExts : 0
% 1.42/0.60 # Equation resolutions : 14
% 1.42/0.60 # Total rewrite steps : 4153
% 1.42/0.60 # Propositional unsat checks : 0
% 1.42/0.60 # Propositional check models : 0
% 1.42/0.60 # Propositional check unsatisfiable : 0
% 1.42/0.60 # Propositional clauses : 0
% 1.42/0.60 # Propositional clauses after purity: 0
% 1.42/0.60 # Propositional unsat core size : 0
% 1.42/0.60 # Propositional preprocessing time : 0.000
% 1.42/0.60 # Propositional encoding time : 0.000
% 1.42/0.60 # Propositional solver time : 0.000
% 1.42/0.60 # Success case prop preproc time : 0.000
% 1.42/0.60 # Success case prop encoding time : 0.000
% 1.42/0.60 # Success case prop solver time : 0.000
% 1.42/0.60 # Current number of processed clauses : 180
% 1.42/0.60 # Positive orientable unit clauses : 10
% 1.42/0.60 # Positive unorientable unit clauses: 0
% 1.42/0.60 # Negative unit clauses : 0
% 1.42/0.60 # Non-unit-clauses : 170
% 1.42/0.60 # Current number of unprocessed clauses: 4384
% 1.42/0.60 # ...number of literals in the above : 23553
% 1.42/0.60 # Current number of archived formulas : 0
% 1.42/0.60 # Current number of archived clauses : 689
% 1.42/0.60 # Clause-clause subsumption calls (NU) : 29594
% 1.42/0.60 # Rec. Clause-clause subsumption calls : 22909
% 1.42/0.60 # Non-unit clause-clause subsumptions : 1638
% 1.42/0.60 # Unit Clause-clause subsumption calls : 348
% 1.42/0.60 # Rewrite failures with RHS unbound : 0
% 1.42/0.60 # BW rewrite match attempts : 80
% 1.42/0.60 # BW rewrite match successes : 59
% 1.42/0.60 # Condensation attempts : 0
% 1.42/0.60 # Condensation successes : 0
% 1.42/0.60 # Termbank termtop insertions : 109868
% 1.42/0.60
% 1.42/0.60 # -------------------------------------------------
% 1.42/0.60 # User time : 0.144 s
% 1.42/0.60 # System time : 0.002 s
% 1.42/0.60 # Total time : 0.146 s
% 1.42/0.60 # Maximum resident set size: 1672 pages
% 1.42/0.60
% 1.42/0.60 # -------------------------------------------------
% 1.42/0.60 # User time : 0.702 s
% 1.42/0.60 # System time : 0.013 s
% 1.42/0.60 # Total time : 0.715 s
% 1.42/0.60 # Maximum resident set size: 1696 pages
% 1.42/0.60 % E---3.1 exiting
% 1.42/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------