TSTP Solution File: GRP279-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP279-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:32 EDT 2023
% Result : Unsatisfiable 1.69s 0.74s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 19
% Syntax : Number of clauses : 103 ( 23 unt; 74 nHn; 84 RR)
% Number of literals : 222 ( 221 equ; 51 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 51 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',left_identity) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_15) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_20) ).
cnf(prove_this_25,negated_conjecture,
( inverse(sk_c2) = sk_c3
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_25) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| multiply(sk_c7,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_1) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| inverse(sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_4) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_10) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_5) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c2) = sk_c3
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_22) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_14) ).
cnf(prove_this_23,negated_conjecture,
( inverse(sk_c2) = sk_c3
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_23) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_17) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_18) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_9) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c2) = sk_c3
| inverse(sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_24) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| inverse(sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_19) ).
cnf(prove_this_31,negated_conjecture,
( multiply(sk_c8,sk_c7) != sk_c6
| multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| multiply(X2,X3) != sk_c8
| inverse(X2) != X3
| multiply(X3,sk_c7) != sk_c8
| multiply(sk_c7,sk_c8) != sk_c6
| inverse(X4) != sk_c8
| multiply(X4,sk_c7) != sk_c8
| inverse(X5) != sk_c7
| multiply(X5,sk_c6) != sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p',prove_this_31) ).
cnf(c_0_19,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_20,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_21,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_22,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_24,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_22]) ).
cnf(c_0_25,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_15 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_20 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c7
| inverse(sk_c8) = sk_c1 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c2,multiply(sk_c3,X1)) = multiply(sk_c8,X1)
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_31,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_32,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3,
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c2) = sk_c3
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_25 ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c1,multiply(sk_c8,X1)) = X1
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c8,inverse(sk_c3)) = sk_c2
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| multiply(sk_c7,sk_c8) = sk_c6 ),
prove_this_1 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| inverse(sk_c5) = sk_c7 ),
prove_this_4 ).
cnf(c_0_38,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_25]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c7
| inverse(sk_c3) = sk_c2 ),
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c3) = multiply(sk_c1,sk_c2)
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( multiply(inverse(sk_c7),sk_c6) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| inverse(sk_c7) = sk_c5 ),
inference(spm,[status(thm)],[c_0_26,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_10 ).
cnf(c_0_44,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_38]),c_0_26]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c2
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_5 ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| multiply(sk_c5,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( multiply(inverse(sk_c1),sk_c7) = sk_c8
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_22,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c7
| inverse(sk_c1) = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_31]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c7
| sk_c7 = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_21]) ).
cnf(c_0_52,negated_conjecture,
( multiply(inverse(sk_c6),sk_c8) = inverse(sk_c7)
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_38,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( multiply(inverse(sk_c5),sk_c7) = sk_c6
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_22,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c7,inverse(sk_c6)) = inverse(sk_c8)
| sk_c7 = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_52]),c_0_26]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c7,inverse(sk_c6)) = sk_c5
| sk_c7 = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_53]),c_0_26]) ).
cnf(c_0_56,negated_conjecture,
( inverse(sk_c2) = sk_c3
| inverse(sk_c4) = sk_c8 ),
prove_this_22 ).
cnf(c_0_57,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c5) = sk_c7 ),
prove_this_14 ).
cnf(c_0_58,negated_conjecture,
( inverse(sk_c8) = sk_c5
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( inverse(sk_c2) = sk_c3
| multiply(sk_c4,sk_c7) = sk_c8 ),
prove_this_23 ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| inverse(sk_c4) = sk_c8 ),
prove_this_17 ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c2,sk_c3) = identity
| inverse(sk_c4) = sk_c8 ),
inference(spm,[status(thm)],[c_0_31,c_0_56]) ).
cnf(c_0_62,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_63,negated_conjecture,
( inverse(sk_c5) = sk_c7
| inverse(sk_c8) = sk_c1 ),
inference(spm,[status(thm)],[c_0_26,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( inverse(sk_c5) = sk_c8
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_26,c_0_58]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
prove_this_18 ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c8
| multiply(sk_c2,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_31,c_0_59]) ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| multiply(sk_c8,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_20,c_0_60]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c2,sk_c3) = identity
| multiply(sk_c8,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_20,c_0_61]) ).
cnf(c_0_69,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_62]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c7 ),
prove_this_9 ).
cnf(c_0_71,negated_conjecture,
( inverse(sk_c8) = sk_c1
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_72,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c8
| sk_c8 = identity ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_73,negated_conjecture,
( multiply(sk_c8,sk_c4) = identity
| sk_c8 = identity ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_74,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_20,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_70,c_0_64]) ).
cnf(c_0_76,negated_conjecture,
( sk_c7 = sk_c8
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_58,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c7
| sk_c8 = identity ),
inference(spm,[status(thm)],[c_0_22,c_0_72]) ).
cnf(c_0_78,negated_conjecture,
( inverse(sk_c4) = sk_c8
| sk_c8 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_73]),c_0_74]),c_0_21]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c5,sk_c8) = identity
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_20,c_0_58]) ).
cnf(c_0_80,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c7
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c8,sk_c8) = sk_c7
| sk_c8 = identity ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,negated_conjecture,
( sk_c7 = sk_c8
| sk_c7 = identity ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_83,negated_conjecture,
( inverse(sk_c2) = sk_c3
| inverse(sk_c5) = sk_c7 ),
prove_this_24 ).
cnf(c_0_84,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| inverse(sk_c5) = sk_c7 ),
prove_this_19 ).
cnf(c_0_85,negated_conjecture,
( multiply(inverse(sk_c8),sk_c7) = sk_c8
| sk_c8 = identity ),
inference(spm,[status(thm)],[c_0_22,c_0_81]) ).
cnf(c_0_86,negated_conjecture,
( sk_c7 = identity
| sk_c8 != identity ),
inference(ef,[status(thm)],[c_0_82]) ).
cnf(c_0_87,negated_conjecture,
( multiply(sk_c2,sk_c3) = identity
| inverse(sk_c5) = sk_c7 ),
inference(spm,[status(thm)],[c_0_31,c_0_83]) ).
cnf(c_0_88,negated_conjecture,
( multiply(sk_c8,sk_c7) != sk_c6
| multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| multiply(X2,X3) != sk_c8
| inverse(X2) != X3
| multiply(X3,sk_c7) != sk_c8
| multiply(sk_c7,sk_c8) != sk_c6
| inverse(X4) != sk_c8
| multiply(X4,sk_c7) != sk_c8
| inverse(X5) != sk_c7
| multiply(X5,sk_c6) != sk_c7 ),
prove_this_31 ).
cnf(c_0_89,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_84,c_0_64]) ).
cnf(c_0_90,negated_conjecture,
sk_c7 = identity,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_82]),c_0_20])]),c_0_86]) ).
cnf(c_0_91,negated_conjecture,
( multiply(sk_c2,sk_c3) = identity
| multiply(sk_c5,sk_c7) = identity ),
inference(spm,[status(thm)],[c_0_31,c_0_87]) ).
cnf(c_0_92,negated_conjecture,
( multiply(inverse(X1),sk_c7) != sk_c8
| multiply(sk_c8,sk_c7) != sk_c6
| multiply(sk_c7,sk_c8) != sk_c6
| multiply(X1,inverse(X1)) != sk_c8
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c8) != sk_c7
| inverse(X2) != sk_c7
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(er,[status(thm)],[c_0_88]) ).
cnf(c_0_93,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| sk_c8 = identity ),
inference(rw,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_94,negated_conjecture,
( multiply(sk_c2,sk_c3) = identity
| sk_c5 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_90]),c_0_25]) ).
cnf(c_0_95,negated_conjecture,
( multiply(inverse(X1),sk_c7) != sk_c8
| multiply(sk_c8,sk_c7) != sk_c6
| multiply(sk_c7,sk_c8) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c8) != sk_c7
| inverse(X2) != sk_c7
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8
| sk_c8 != identity ),
inference(rw,[status(thm)],[c_0_92,c_0_31]) ).
cnf(c_0_96,negated_conjecture,
sk_c6 = sk_c8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_90]),c_0_74]),c_0_21]),c_0_90]),c_0_25])]) ).
cnf(c_0_97,negated_conjecture,
( multiply(sk_c5,sk_c8) = identity
| sk_c8 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_90]),c_0_90]) ).
cnf(c_0_98,negated_conjecture,
( sk_c5 = identity
| sk_c8 = identity ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_99,negated_conjecture,
( multiply(X1,sk_c8) != identity
| multiply(X2,sk_c8) != identity
| inverse(sk_c8) != sk_c8
| inverse(X3) != sk_c8
| inverse(X1) != identity
| inverse(X2) != sk_c8
| sk_c8 != identity ),
inference(cn,[status(thm)],[inference(rw,[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_90]),c_0_25]),c_0_90]),c_0_25]),c_0_90]),c_0_21]),c_0_90]),c_0_90]),c_0_25]),c_0_90]),c_0_90])])]),c_0_96]),c_0_96])]) ).
cnf(c_0_100,negated_conjecture,
sk_c8 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_21])]) ).
cnf(c_0_101,negated_conjecture,
inverse(X1) != identity,
inference(cn,[status(thm)],[inference(rw,[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)],[c_0_99,c_0_100]),c_0_25]),c_0_100]),c_0_25]),c_0_100]),c_0_74]),c_0_100]),c_0_100]),c_0_100]),c_0_100])])])]),c_0_74])]) ).
cnf(c_0_102,plain,
$false,
inference(sr,[status(thm)],[c_0_74,c_0_101]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP279-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 02:26:26 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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/tmp/tmp.fJmyZDBEVE/E---3.1_13558.p
% 1.69/0.74 # Version: 3.1pre001
% 1.69/0.74 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.69/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.69/0.74 # Starting new_bool_3 with 300s (1) cores
% 1.69/0.74 # Starting new_bool_1 with 300s (1) cores
% 1.69/0.74 # Starting sh5l with 300s (1) cores
% 1.69/0.74 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 13636 completed with status 0
% 1.69/0.74 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.69/0.74 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.69/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.69/0.74 # No SInE strategy applied
% 1.69/0.74 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.69/0.74 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.74 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.69/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.69/0.74 # Starting new_bool_3 with 136s (1) cores
% 1.69/0.74 # Starting new_bool_1 with 136s (1) cores
% 1.69/0.74 # Starting sh5l with 136s (1) cores
% 1.69/0.74 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 13640 completed with status 0
% 1.69/0.74 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.69/0.74 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.69/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.69/0.74 # No SInE strategy applied
% 1.69/0.74 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.69/0.74 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.74 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.69/0.74 # Preprocessing time : 0.001 s
% 1.69/0.74 # Presaturation interreduction done
% 1.69/0.74
% 1.69/0.74 # Proof found!
% 1.69/0.74 # SZS status Unsatisfiable
% 1.69/0.74 # SZS output start CNFRefutation
% See solution above
% 1.69/0.74 # Parsed axioms : 34
% 1.69/0.74 # Removed by relevancy pruning/SinE : 0
% 1.69/0.74 # Initial clauses : 34
% 1.69/0.74 # Removed in clause preprocessing : 0
% 1.69/0.74 # Initial clauses in saturation : 34
% 1.69/0.74 # Processed clauses : 2839
% 1.69/0.74 # ...of these trivial : 87
% 1.69/0.74 # ...subsumed : 1869
% 1.69/0.74 # ...remaining for further processing : 883
% 1.69/0.74 # Other redundant clauses eliminated : 4
% 1.69/0.74 # Clauses deleted for lack of memory : 0
% 1.69/0.74 # Backward-subsumed : 141
% 1.69/0.74 # Backward-rewritten : 677
% 1.69/0.74 # Generated clauses : 15342
% 1.69/0.74 # ...of the previous two non-redundant : 15344
% 1.69/0.74 # ...aggressively subsumed : 0
% 1.69/0.74 # Contextual simplify-reflections : 24
% 1.69/0.74 # Paramodulations : 15333
% 1.69/0.74 # Factorizations : 4
% 1.69/0.74 # NegExts : 0
% 1.69/0.74 # Equation resolutions : 4
% 1.69/0.74 # Total rewrite steps : 5497
% 1.69/0.74 # Propositional unsat checks : 0
% 1.69/0.74 # Propositional check models : 0
% 1.69/0.74 # Propositional check unsatisfiable : 0
% 1.69/0.74 # Propositional clauses : 0
% 1.69/0.74 # Propositional clauses after purity: 0
% 1.69/0.74 # Propositional unsat core size : 0
% 1.69/0.74 # Propositional preprocessing time : 0.000
% 1.69/0.74 # Propositional encoding time : 0.000
% 1.69/0.74 # Propositional solver time : 0.000
% 1.69/0.74 # Success case prop preproc time : 0.000
% 1.69/0.74 # Success case prop encoding time : 0.000
% 1.69/0.74 # Success case prop solver time : 0.000
% 1.69/0.74 # Current number of processed clauses : 29
% 1.69/0.74 # Positive orientable unit clauses : 16
% 1.69/0.74 # Positive unorientable unit clauses: 0
% 1.69/0.74 # Negative unit clauses : 1
% 1.69/0.74 # Non-unit-clauses : 12
% 1.69/0.74 # Current number of unprocessed clauses: 12423
% 1.69/0.74 # ...number of literals in the above : 36413
% 1.69/0.74 # Current number of archived formulas : 0
% 1.69/0.74 # Current number of archived clauses : 853
% 1.69/0.74 # Clause-clause subsumption calls (NU) : 25219
% 1.69/0.74 # Rec. Clause-clause subsumption calls : 19348
% 1.69/0.74 # Non-unit clause-clause subsumptions : 2032
% 1.69/0.74 # Unit Clause-clause subsumption calls : 138
% 1.69/0.74 # Rewrite failures with RHS unbound : 0
% 1.69/0.74 # BW rewrite match attempts : 10
% 1.69/0.74 # BW rewrite match successes : 8
% 1.69/0.74 # Condensation attempts : 0
% 1.69/0.74 # Condensation successes : 0
% 1.69/0.74 # Termbank termtop insertions : 129270
% 1.69/0.74
% 1.69/0.74 # -------------------------------------------------
% 1.69/0.74 # User time : 0.125 s
% 1.69/0.74 # System time : 0.006 s
% 1.69/0.74 # Total time : 0.131 s
% 1.69/0.74 # Maximum resident set size: 1600 pages
% 1.69/0.74
% 1.69/0.74 # -------------------------------------------------
% 1.69/0.74 # User time : 1.023 s
% 1.69/0.74 # System time : 0.016 s
% 1.69/0.74 # Total time : 1.039 s
% 1.69/0.74 # Maximum resident set size: 1688 pages
% 1.69/0.74 % E---3.1 exiting
% 1.69/0.74 % E---3.1 exiting
%------------------------------------------------------------------------------