TSTP Solution File: GRP391-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP391-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:59 EDT 2023
% Result : Unsatisfiable 0.70s 0.53s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 22
% Syntax : Number of clauses : 98 ( 14 unt; 79 nHn; 89 RR)
% Number of literals : 219 ( 218 equ; 35 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 : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',left_identity) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_9) ).
cnf(prove_this_30,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_30) ).
cnf(prove_this_12,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_12) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_10) ).
cnf(prove_this_29,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_29) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_11) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_15) ).
cnf(prove_this_6,negated_conjecture,
( inverse(sk_c6) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_6) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_18) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_25) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_16) ).
cnf(prove_this_5,negated_conjecture,
( inverse(sk_c6) = sk_c8
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_5) ).
cnf(prove_this_17,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_17) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_26) ).
cnf(prove_this_27,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_27) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c6) = sk_c8
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_2) ).
cnf(prove_this_28,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_28) ).
cnf(prove_this_1,negated_conjecture,
( inverse(sk_c6) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_1) ).
cnf(prove_this_31,negated_conjecture,
( inverse(sk_c6) != sk_c8
| multiply(X1,X2) != sk_c8
| inverse(X1) != X2
| multiply(X2,sk_c7) != sk_c8
| multiply(sk_c6,sk_c7) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| inverse(X3) != sk_c8
| multiply(X4,sk_c7) != sk_c6
| inverse(X4) != sk_c7
| inverse(X5) != sk_c6
| multiply(X5,sk_c8) != sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.Vrf3OZ9zsp/E---3.1_29949.p',prove_this_31) ).
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,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_9 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
prove_this_30 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
prove_this_12 ).
cnf(c_0_29,negated_conjecture,
( multiply(inverse(sk_c4),sk_c6) = sk_c7
| multiply(sk_c1,sk_c2) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c4) = sk_c7 ),
prove_this_10 ).
cnf(c_0_31,negated_conjecture,
( multiply(inverse(sk_c5),sk_c6) = sk_c8
| multiply(sk_c6,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| inverse(sk_c5) = sk_c6 ),
prove_this_29 ).
cnf(c_0_33,negated_conjecture,
( multiply(inverse(sk_c5),sk_c6) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c5) = sk_c6 ),
prove_this_11 ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| multiply(sk_c6,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c6,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c2
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_15 ).
cnf(c_0_40,negated_conjecture,
( multiply(inverse(sk_c6),sk_c8) = sk_c7
| multiply(sk_c6,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( inverse(sk_c6) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
prove_this_6 ).
cnf(c_0_42,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c2
| multiply(sk_c6,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c5,sk_c8) = sk_c6 ),
prove_this_18 ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c2 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c7 ),
prove_this_25 ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c6
| multiply(sk_c6,sk_c6) = sk_c8
| multiply(sk_c8,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c6
| multiply(sk_c6,sk_c6) = sk_c8
| multiply(sk_c2,sk_c8) = sk_c2 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( multiply(inverse(sk_c4),sk_c6) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c2
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_25,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c4) = sk_c7 ),
prove_this_16 ).
cnf(c_0_50,negated_conjecture,
( multiply(inverse(sk_c3),sk_c7) = sk_c8
| multiply(sk_c6,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( multiply(inverse(sk_c5),sk_c6) = sk_c8
| multiply(sk_c8,sk_c8) = sk_c7
| multiply(sk_c6,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( inverse(sk_c6) = sk_c8
| inverse(sk_c5) = sk_c6 ),
prove_this_5 ).
cnf(c_0_53,negated_conjecture,
( multiply(inverse(sk_c5),sk_c6) = sk_c8
| multiply(sk_c2,sk_c8) = sk_c2
| multiply(sk_c6,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c5) = sk_c6 ),
prove_this_17 ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c2
| multiply(sk_c7,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c2 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( multiply(inverse(inverse(sk_c3)),sk_c8) = sk_c7
| multiply(sk_c6,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| inverse(sk_c3) = sk_c8 ),
prove_this_26 ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c8,sk_c8) = sk_c7
| multiply(sk_c6,sk_c6) = sk_c8
| inverse(sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c2
| multiply(sk_c6,sk_c6) = sk_c8
| inverse(sk_c1) = sk_c2 ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c2 ),
inference(spm,[status(thm)],[c_0_38,c_0_55]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| sk_c7 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_23]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c6,sk_c6) = sk_c8
| multiply(sk_c8,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_40,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c6,sk_c6) = sk_c8
| multiply(sk_c2,sk_c8) = sk_c2 ),
inference(spm,[status(thm)],[c_0_42,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| sk_c8 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_60]),c_0_23]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_27 ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_50,c_0_57]) ).
cnf(c_0_67,negated_conjecture,
( inverse(sk_c6) = sk_c8
| inverse(sk_c3) = sk_c8 ),
prove_this_2 ).
cnf(c_0_68,negated_conjecture,
( multiply(inverse(sk_c6),sk_c8) = sk_c7
| sk_c7 = identity ),
inference(spm,[status(thm)],[c_0_25,c_0_61]) ).
cnf(c_0_69,negated_conjecture,
( multiply(inverse(sk_c6),sk_c8) = sk_c6
| multiply(sk_c8,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_25,c_0_62]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c6,sk_c6) = sk_c8
| sk_c8 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_63]),c_0_23]) ).
cnf(c_0_71,negated_conjecture,
( sk_c8 = identity
| sk_c6 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_64]),c_0_23]) ).
cnf(c_0_72,negated_conjecture,
( multiply(inverse(sk_c4),sk_c6) = sk_c7
| multiply(sk_c6,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_65]) ).
cnf(c_0_73,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| inverse(sk_c4) = sk_c7 ),
prove_this_28 ).
cnf(c_0_74,negated_conjecture,
( multiply(inverse(sk_c6),sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_66]) ).
cnf(c_0_75,negated_conjecture,
( inverse(sk_c6) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c7 ),
prove_this_1 ).
cnf(c_0_76,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_25]) ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c8,sk_c3) = identity
| inverse(sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_23,c_0_67]) ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c8,sk_c8) = sk_c7
| sk_c7 = identity
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_79,negated_conjecture,
sk_c8 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_24])]) ).
cnf(c_0_80,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c3,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8
| multiply(sk_c8,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_76]) ).
cnf(c_0_83,negated_conjecture,
( multiply(sk_c8,sk_c3) = identity
| multiply(sk_c8,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_77]) ).
cnf(c_0_84,negated_conjecture,
( sk_c7 = sk_c6
| sk_c7 = identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79]),c_0_79]),c_0_24])]) ).
cnf(c_0_85,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| sk_c6 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_80]),c_0_23]) ).
cnf(c_0_86,negated_conjecture,
( sk_c7 = identity
| sk_c3 = sk_c7 ),
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)],[c_0_81,c_0_79]),c_0_82]),c_0_79]),c_0_24]),c_0_79]),c_0_79]),c_0_79]),c_0_24])]) ).
cnf(c_0_87,negated_conjecture,
( sk_c6 = identity
| sk_c3 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_79]),c_0_24]),c_0_79]),c_0_24]) ).
cnf(c_0_88,negated_conjecture,
( sk_c7 = identity
| sk_c6 != identity ),
inference(ef,[status(thm)],[c_0_84]) ).
cnf(c_0_89,negated_conjecture,
( multiply(inverse(sk_c6),sk_c8) = sk_c7
| sk_c6 = identity ),
inference(spm,[status(thm)],[c_0_25,c_0_85]) ).
cnf(c_0_90,negated_conjecture,
sk_c7 = identity,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]) ).
cnf(c_0_91,negated_conjecture,
( inverse(sk_c6) != sk_c8
| multiply(X1,X2) != sk_c8
| inverse(X1) != X2
| multiply(X2,sk_c7) != sk_c8
| multiply(sk_c6,sk_c7) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| inverse(X3) != sk_c8
| multiply(X4,sk_c7) != sk_c6
| inverse(X4) != sk_c7
| inverse(X5) != sk_c6
| multiply(X5,sk_c8) != sk_c6 ),
prove_this_31 ).
cnf(c_0_92,negated_conjecture,
( inverse(sk_c6) = identity
| sk_c6 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_79]),c_0_82]),c_0_90]) ).
cnf(c_0_93,negated_conjecture,
( multiply(inverse(X1),sk_c7) != sk_c8
| multiply(sk_c6,sk_c7) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8
| multiply(X2,sk_c8) != sk_c6
| multiply(X3,sk_c7) != sk_c6
| multiply(X4,sk_c8) != sk_c7
| inverse(sk_c6) != sk_c8
| inverse(X2) != sk_c6
| inverse(X3) != sk_c7
| inverse(X4) != sk_c8 ),
inference(er,[status(thm)],[c_0_91]) ).
cnf(c_0_94,negated_conjecture,
sk_c6 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_92]),c_0_24])]) ).
cnf(c_0_95,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_23,c_0_82]) ).
cnf(c_0_96,negated_conjecture,
( multiply(X1,inverse(X1)) != identity
| inverse(X1) != 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)],[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(er,[status(thm)],[inference(er,[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_93,c_0_79]),c_0_79]),c_0_79]),c_0_79]),c_0_82]),c_0_79]),c_0_82]),c_0_79]),c_0_79])])]),c_0_90]),c_0_82]),c_0_94]),c_0_90]),c_0_24]),c_0_90]),c_0_82]),c_0_94]),c_0_94]),c_0_95]),c_0_94]),c_0_95]),c_0_94]),c_0_90]),c_0_90]),c_0_95])])]),c_0_95])]) ).
cnf(c_0_97,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_95]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP391-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Oct 3 02:41:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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.Vrf3OZ9zsp/E---3.1_29949.p
% 0.70/0.53 # Version: 3.1pre001
% 0.70/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.70/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.70/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.70/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.70/0.53 # Starting sh5l with 300s (1) cores
% 0.70/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 30086 completed with status 0
% 0.70/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.70/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.70/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.70/0.53 # No SInE strategy applied
% 0.70/0.53 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.70/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.70/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.70/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.70/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.70/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.70/0.53 # Starting sh5l with 136s (1) cores
% 0.70/0.53 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 30092 completed with status 0
% 0.70/0.53 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.70/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.70/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.70/0.53 # No SInE strategy applied
% 0.70/0.53 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.70/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.70/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.70/0.53 # Preprocessing time : 0.001 s
% 0.70/0.53 # Presaturation interreduction done
% 0.70/0.53
% 0.70/0.53 # Proof found!
% 0.70/0.53 # SZS status Unsatisfiable
% 0.70/0.53 # SZS output start CNFRefutation
% See solution above
% 0.70/0.53 # Parsed axioms : 34
% 0.70/0.53 # Removed by relevancy pruning/SinE : 0
% 0.70/0.53 # Initial clauses : 34
% 0.70/0.53 # Removed in clause preprocessing : 0
% 0.70/0.53 # Initial clauses in saturation : 34
% 0.70/0.53 # Processed clauses : 935
% 0.70/0.53 # ...of these trivial : 186
% 0.70/0.53 # ...subsumed : 267
% 0.70/0.53 # ...remaining for further processing : 482
% 0.70/0.53 # Other redundant clauses eliminated : 150
% 0.70/0.53 # Clauses deleted for lack of memory : 0
% 0.70/0.53 # Backward-subsumed : 28
% 0.70/0.53 # Backward-rewritten : 396
% 0.70/0.53 # Generated clauses : 2725
% 0.70/0.53 # ...of the previous two non-redundant : 2906
% 0.70/0.53 # ...aggressively subsumed : 0
% 0.70/0.53 # Contextual simplify-reflections : 16
% 0.70/0.53 # Paramodulations : 2578
% 0.70/0.53 # Factorizations : 1
% 0.70/0.53 # NegExts : 0
% 0.70/0.53 # Equation resolutions : 150
% 0.70/0.53 # Total rewrite steps : 3399
% 0.70/0.53 # Propositional unsat checks : 0
% 0.70/0.53 # Propositional check models : 0
% 0.70/0.53 # Propositional check unsatisfiable : 0
% 0.70/0.53 # Propositional clauses : 0
% 0.70/0.53 # Propositional clauses after purity: 0
% 0.70/0.53 # Propositional unsat core size : 0
% 0.70/0.53 # Propositional preprocessing time : 0.000
% 0.70/0.53 # Propositional encoding time : 0.000
% 0.70/0.53 # Propositional solver time : 0.000
% 0.70/0.53 # Success case prop preproc time : 0.000
% 0.70/0.53 # Success case prop encoding time : 0.000
% 0.70/0.53 # Success case prop solver time : 0.000
% 0.70/0.53 # Current number of processed clauses : 14
% 0.70/0.53 # Positive orientable unit clauses : 13
% 0.70/0.53 # Positive unorientable unit clauses: 0
% 0.70/0.53 # Negative unit clauses : 0
% 0.70/0.53 # Non-unit-clauses : 1
% 0.70/0.53 # Current number of unprocessed clauses: 1570
% 0.70/0.53 # ...number of literals in the above : 10647
% 0.70/0.53 # Current number of archived formulas : 0
% 0.70/0.53 # Current number of archived clauses : 458
% 0.70/0.53 # Clause-clause subsumption calls (NU) : 6612
% 0.70/0.53 # Rec. Clause-clause subsumption calls : 1589
% 0.70/0.53 # Non-unit clause-clause subsumptions : 310
% 0.70/0.53 # Unit Clause-clause subsumption calls : 267
% 0.70/0.53 # Rewrite failures with RHS unbound : 0
% 0.70/0.53 # BW rewrite match attempts : 35
% 0.70/0.53 # BW rewrite match successes : 35
% 0.70/0.53 # Condensation attempts : 0
% 0.70/0.53 # Condensation successes : 0
% 0.70/0.53 # Termbank termtop insertions : 54758
% 0.70/0.53
% 0.70/0.53 # -------------------------------------------------
% 0.70/0.53 # User time : 0.042 s
% 0.70/0.53 # System time : 0.007 s
% 0.70/0.53 # Total time : 0.049 s
% 0.70/0.53 # Maximum resident set size: 1600 pages
% 0.70/0.53
% 0.70/0.53 # -------------------------------------------------
% 0.70/0.53 # User time : 0.278 s
% 0.70/0.53 # System time : 0.011 s
% 0.70/0.53 # Total time : 0.289 s
% 0.70/0.53 # Maximum resident set size: 1688 pages
% 0.70/0.53 % E---3.1 exiting
% 0.70/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------