TSTP Solution File: GRP285-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP285-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:33 EDT 2023
% Result : Unsatisfiable 1.60s 0.69s
% Output : CNFRefutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 21
% Syntax : Number of clauses : 110 ( 16 unt; 79 nHn; 97 RR)
% Number of literals : 267 ( 266 equ; 86 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 : 66 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',left_identity) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c3) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_16) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c5) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_21) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_7) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| inverse(sk_c3) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_2) ).
cnf(prove_this_29,negated_conjecture,
( multiply(sk_c9,sk_c8) != sk_c7
| multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| multiply(X2,sk_c9) != sk_c7
| multiply(X3,sk_c9) != sk_c8
| inverse(X3) != sk_c9
| multiply(X4,sk_c7) != sk_c8
| inverse(X4) != sk_c7
| multiply(sk_c9,X5) != sk_c7
| multiply(X6,sk_c9) != X5
| inverse(X6) != sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_29) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c5) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_14) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c3) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_9) ).
cnf(prove_this_28,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c7
| inverse(sk_c5) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_28) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c7
| inverse(sk_c3) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_23) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c5,sk_c9) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_20) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c3,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_15) ).
cnf(prove_this_13,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c5,sk_c9) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_13) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c3,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_8) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| multiply(sk_c5,sk_c9) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_6) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| multiply(sk_c3,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_1) ).
cnf(prove_this_12,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c9,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_12) ).
cnf(prove_this_19,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c9,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_19) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| multiply(sk_c9,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.afaRxjVdya/E---3.1_26366.p',prove_this_5) ).
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,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_26,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_24]) ).
cnf(c_0_27,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c3) = sk_c9 ),
prove_this_16 ).
cnf(c_0_30,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c5) = sk_c9 ),
prove_this_21 ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c9) = sk_c3 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c9 ),
prove_this_7 ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| inverse(sk_c3) = sk_c9 ),
prove_this_2 ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c9) = sk_c5 ),
inference(spm,[status(thm)],[c_0_28,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( inverse(sk_c9) = sk_c3
| inverse(sk_c9) = sk_c1 ),
inference(spm,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c9,sk_c8) != sk_c7
| multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| multiply(X2,sk_c9) != sk_c7
| multiply(X3,sk_c9) != sk_c8
| inverse(X3) != sk_c9
| multiply(X4,sk_c7) != sk_c8
| inverse(X4) != sk_c7
| multiply(sk_c9,X5) != sk_c7
| multiply(X6,sk_c9) != X5
| inverse(X6) != sk_c9 ),
prove_this_29 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| inverse(sk_c9) = sk_c5 ),
inference(spm,[status(thm)],[c_0_28,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| inverse(sk_c9) = sk_c3 ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c5) = sk_c9 ),
prove_this_14 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c3) = sk_c9 ),
prove_this_9 ).
cnf(c_0_41,negated_conjecture,
( inverse(sk_c9) = sk_c5
| inverse(sk_c9) = sk_c1 ),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c9) = sk_c1
| sk_c3 != sk_c1 ),
inference(ef,[status(thm)],[c_0_35]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c9,multiply(X1,sk_c9)) != sk_c7
| multiply(sk_c9,sk_c8) != sk_c7
| multiply(X2,sk_c7) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c9) != sk_c7
| multiply(X5,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(X2) != sk_c7
| inverse(X3) != sk_c9
| inverse(X5) != sk_c9 ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| sk_c5 = sk_c3 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c9) = sk_c5 ),
inference(spm,[status(thm)],[c_0_28,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c9) = sk_c3 ),
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c9) = sk_c1
| sk_c5 = sk_c3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_35]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( sk_c5 = sk_c3
| multiply(sk_c9,multiply(X1,sk_c9)) != sk_c7
| multiply(X2,sk_c7) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c9) != sk_c7
| multiply(X5,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(X2) != sk_c7
| inverse(X3) != sk_c9
| inverse(X5) != sk_c9 ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| sk_c5 = sk_c3 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( inverse(sk_c1) = sk_c9
| sk_c5 = sk_c3 ),
inference(spm,[status(thm)],[c_0_28,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c1,sk_c9) = identity
| sk_c5 = sk_c3 ),
inference(spm,[status(thm)],[c_0_22,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( sk_c5 = sk_c3
| multiply(X1,sk_c7) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c9) != sk_c7
| multiply(X4,sk_c9) != sk_c8
| inverse(X1) != sk_c7
| inverse(X2) != sk_c9
| inverse(X4) != sk_c9 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_44]) ).
cnf(c_0_53,negated_conjecture,
( sk_c5 = sk_c3
| sk_c8 = identity ),
inference(spm,[status(thm)],[c_0_51,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c7
| inverse(sk_c5) = sk_c9 ),
prove_this_28 ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c7
| inverse(sk_c3) = sk_c9 ),
prove_this_23 ).
cnf(c_0_56,negated_conjecture,
( sk_c5 = sk_c3
| multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c9) != sk_c7
| multiply(X3,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(X3) != sk_c9 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_22]),c_0_28])]),c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c7
| inverse(sk_c9) = sk_c5 ),
inference(spm,[status(thm)],[c_0_28,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c7
| inverse(sk_c9) = sk_c3 ),
inference(spm,[status(thm)],[c_0_28,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( sk_c5 = sk_c3
| multiply(X1,sk_c9) != sk_c7
| multiply(X2,sk_c9) != sk_c8
| inverse(X2) != sk_c9 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_22]),c_0_28])]),c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c7
| sk_c5 = sk_c3 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c5,sk_c9) = sk_c6 ),
prove_this_20 ).
cnf(c_0_62,negated_conjecture,
( sk_c5 = sk_c3
| multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c3,sk_c9) = sk_c8 ),
prove_this_15 ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c5,sk_c9) = sk_c6
| multiply(sk_c9,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_22,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
sk_c5 = sk_c3,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_50]),c_0_49]) ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c5,sk_c9) = sk_c6 ),
prove_this_13 ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| multiply(sk_c9,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_22,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c9,sk_c1) = identity
| multiply(sk_c3,sk_c9) = sk_c6 ),
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c3,sk_c9) = sk_c8 ),
prove_this_8 ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c3,sk_c9) = sk_c6 ),
inference(rw,[status(thm)],[c_0_66,c_0_65]) ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c9,sk_c1) = identity
| sk_c6 = sk_c8 ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
( multiply(inverse(sk_c3),sk_c8) = sk_c9
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_24,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| sk_c6 = sk_c8 ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( inverse(sk_c9) = sk_c1
| sk_c6 = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_71]),c_0_27]) ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| multiply(sk_c5,sk_c9) = sk_c6 ),
prove_this_6 ).
cnf(c_0_76,negated_conjecture,
( multiply(inverse(sk_c3),sk_c6) = sk_c9
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_24,c_0_70]) ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c9,multiply(sk_c1,X1)) = X1
| multiply(sk_c3,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_24,c_0_63]) ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_72,c_0_40]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| multiply(sk_c3,sk_c9) = sk_c8 ),
prove_this_1 ).
cnf(c_0_80,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c9
| sk_c6 = sk_c8 ),
inference(spm,[status(thm)],[c_0_24,c_0_73]) ).
cnf(c_0_81,negated_conjecture,
( inverse(sk_c1) = sk_c9
| sk_c6 = sk_c8 ),
inference(spm,[status(thm)],[c_0_28,c_0_74]) ).
cnf(c_0_82,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c6
| multiply(sk_c9,sk_c8) = sk_c7 ),
inference(rw,[status(thm)],[c_0_75,c_0_65]) ).
cnf(c_0_83,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c9,sk_c6) = sk_c7 ),
prove_this_12 ).
cnf(c_0_84,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c9,sk_c6) = sk_c9 ),
inference(spm,[status(thm)],[c_0_76,c_0_40]) ).
cnf(c_0_85,negated_conjecture,
( multiply(sk_c9,multiply(sk_c3,X1)) = X1
| inverse(sk_c1) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_86,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_87,negated_conjecture,
( multiply(inverse(sk_c3),sk_c8) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_24,c_0_79]) ).
cnf(c_0_88,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| sk_c6 = sk_c8 ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_89,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| sk_c6 = sk_c8 ),
inference(spm,[status(thm)],[c_0_79,c_0_82]) ).
cnf(c_0_90,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c9
| multiply(sk_c9,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_24,c_0_83]) ).
cnf(c_0_91,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c9,sk_c6) = sk_c7 ),
prove_this_19 ).
cnf(c_0_92,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c9
| multiply(sk_c9,sk_c6) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_84]) ).
cnf(c_0_93,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| inverse(sk_c1) = sk_c9 ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_94,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_87,c_0_33]) ).
cnf(c_0_95,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| multiply(sk_c9,sk_c6) = sk_c7 ),
prove_this_5 ).
cnf(c_0_96,negated_conjecture,
( sk_c6 = sk_c8
| sk_c7 = sk_c9 ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_97,negated_conjecture,
( multiply(sk_c9,sk_c6) = sk_c7
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_98,negated_conjecture,
( multiply(sk_c9,sk_c6) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_99,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| sk_c7 != sk_c9 ),
inference(ef,[status(thm)],[c_0_94]) ).
cnf(c_0_100,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c7
| sk_c7 = sk_c9 ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_101,negated_conjecture,
multiply(sk_c9,sk_c8) = sk_c9,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99]) ).
cnf(c_0_102,negated_conjecture,
sk_c7 = sk_c9,
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_103,negated_conjecture,
sk_c8 = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_101]),c_0_22]) ).
cnf(c_0_104,negated_conjecture,
( multiply(sk_c9,multiply(X1,sk_c9)) != sk_c9
| multiply(X2,sk_c9) != identity
| multiply(X3,sk_c9) != identity
| multiply(X4,sk_c9) != sk_c9
| multiply(X5,sk_c9) != identity
| inverse(X1) != sk_c9
| inverse(X2) != sk_c9
| inverse(X3) != sk_c9
| inverse(X5) != sk_c9 ),
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_43,c_0_101]),c_0_102]),c_0_102]),c_0_102]),c_0_103]),c_0_103]),c_0_102]),c_0_103]),c_0_102])]) ).
cnf(c_0_105,negated_conjecture,
( multiply(X1,sk_c9) != identity
| multiply(X2,sk_c9) != identity
| multiply(X3,sk_c9) != sk_c9
| multiply(X4,sk_c9) != identity
| inverse(X1) != sk_c9
| inverse(X2) != sk_c9
| inverse(X4) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_22]),c_0_27]),c_0_28])]) ).
cnf(c_0_106,negated_conjecture,
( multiply(X1,sk_c9) != identity
| multiply(X2,sk_c9) != sk_c9
| multiply(X3,sk_c9) != identity
| inverse(X1) != sk_c9
| inverse(X3) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_22]),c_0_28])]) ).
cnf(c_0_107,negated_conjecture,
( multiply(X1,sk_c9) != sk_c9
| multiply(X2,sk_c9) != identity
| inverse(X2) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_22]),c_0_28])]) ).
cnf(c_0_108,negated_conjecture,
( multiply(X1,sk_c9) != identity
| inverse(X1) != sk_c9 ),
inference(spm,[status(thm)],[c_0_107,c_0_23]) ).
cnf(c_0_109,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_28])]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GRP285-1 : TPTP v8.1.2. Released v2.5.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 02:38:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.afaRxjVdya/E---3.1_26366.p
% 1.60/0.69 # Version: 3.1pre001
% 1.60/0.69 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.60/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.60/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.60/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.60/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.60/0.69 # Starting sh5l with 300s (1) cores
% 1.60/0.69 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 26521 completed with status 0
% 1.60/0.69 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.60/0.69 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.60/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.60/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.60/0.69 # No SInE strategy applied
% 1.60/0.69 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.60/0.69 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.60/0.69 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.60/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.60/0.69 # Starting new_bool_3 with 136s (1) cores
% 1.60/0.69 # Starting new_bool_1 with 136s (1) cores
% 1.60/0.69 # Starting sh5l with 136s (1) cores
% 1.60/0.69 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26526 completed with status 0
% 1.60/0.69 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.60/0.69 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.60/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.60/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.60/0.69 # No SInE strategy applied
% 1.60/0.69 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.60/0.69 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.60/0.69 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.60/0.69 # Preprocessing time : 0.001 s
% 1.60/0.69 # Presaturation interreduction done
% 1.60/0.69
% 1.60/0.69 # Proof found!
% 1.60/0.69 # SZS status Unsatisfiable
% 1.60/0.69 # SZS output start CNFRefutation
% See solution above
% 1.60/0.69 # Parsed axioms : 32
% 1.60/0.69 # Removed by relevancy pruning/SinE : 0
% 1.60/0.69 # Initial clauses : 32
% 1.60/0.69 # Removed in clause preprocessing : 0
% 1.60/0.69 # Initial clauses in saturation : 32
% 1.60/0.69 # Processed clauses : 3245
% 1.60/0.69 # ...of these trivial : 83
% 1.60/0.69 # ...subsumed : 2327
% 1.60/0.69 # ...remaining for further processing : 835
% 1.60/0.69 # Other redundant clauses eliminated : 3
% 1.60/0.69 # Clauses deleted for lack of memory : 0
% 1.60/0.69 # Backward-subsumed : 120
% 1.60/0.69 # Backward-rewritten : 230
% 1.60/0.69 # Generated clauses : 15450
% 1.60/0.69 # ...of the previous two non-redundant : 14663
% 1.60/0.69 # ...aggressively subsumed : 0
% 1.60/0.69 # Contextual simplify-reflections : 22
% 1.60/0.69 # Paramodulations : 15443
% 1.60/0.69 # Factorizations : 4
% 1.60/0.69 # NegExts : 0
% 1.60/0.69 # Equation resolutions : 3
% 1.60/0.69 # Total rewrite steps : 7127
% 1.60/0.69 # Propositional unsat checks : 0
% 1.60/0.69 # Propositional check models : 0
% 1.60/0.69 # Propositional check unsatisfiable : 0
% 1.60/0.69 # Propositional clauses : 0
% 1.60/0.69 # Propositional clauses after purity: 0
% 1.60/0.69 # Propositional unsat core size : 0
% 1.60/0.69 # Propositional preprocessing time : 0.000
% 1.60/0.69 # Propositional encoding time : 0.000
% 1.60/0.69 # Propositional solver time : 0.000
% 1.60/0.69 # Success case prop preproc time : 0.000
% 1.60/0.69 # Success case prop encoding time : 0.000
% 1.60/0.69 # Success case prop solver time : 0.000
% 1.60/0.69 # Current number of processed clauses : 452
% 1.60/0.69 # Positive orientable unit clauses : 18
% 1.60/0.69 # Positive unorientable unit clauses: 0
% 1.60/0.69 # Negative unit clauses : 0
% 1.60/0.69 # Non-unit-clauses : 434
% 1.60/0.69 # Current number of unprocessed clauses: 9538
% 1.60/0.69 # ...number of literals in the above : 28126
% 1.60/0.69 # Current number of archived formulas : 0
% 1.60/0.69 # Current number of archived clauses : 382
% 1.60/0.69 # Clause-clause subsumption calls (NU) : 50143
% 1.60/0.69 # Rec. Clause-clause subsumption calls : 37837
% 1.60/0.69 # Non-unit clause-clause subsumptions : 2466
% 1.60/0.69 # Unit Clause-clause subsumption calls : 162
% 1.60/0.69 # Rewrite failures with RHS unbound : 0
% 1.60/0.69 # BW rewrite match attempts : 30
% 1.60/0.69 # BW rewrite match successes : 12
% 1.60/0.69 # Condensation attempts : 0
% 1.60/0.69 # Condensation successes : 0
% 1.60/0.69 # Termbank termtop insertions : 155837
% 1.60/0.69
% 1.60/0.69 # -------------------------------------------------
% 1.60/0.69 # User time : 0.182 s
% 1.60/0.69 # System time : 0.006 s
% 1.60/0.69 # Total time : 0.187 s
% 1.60/0.69 # Maximum resident set size: 1600 pages
% 1.60/0.69
% 1.60/0.69 # -------------------------------------------------
% 1.60/0.69 # User time : 0.900 s
% 1.60/0.69 # System time : 0.017 s
% 1.60/0.69 # Total time : 0.917 s
% 1.60/0.69 # Maximum resident set size: 1688 pages
% 1.60/0.69 % E---3.1 exiting
% 1.60/0.69 % E---3.1 exiting
%------------------------------------------------------------------------------