TSTP Solution File: GRP261-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP261-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:46:48 EDT 2023
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 26
% Syntax : Number of clauses : 113 ( 21 unt; 88 nHn; 95 RR)
% Number of literals : 262 ( 261 equ; 62 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 : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',left_identity) ).
cnf(prove_this_27,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_27) ).
cnf(prove_this_28,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_28) ).
cnf(prove_this_31,negated_conjecture,
( multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| multiply(X2,sk_c7) != sk_c6
| inverse(X2) != sk_c7
| multiply(sk_c6,sk_c8) != sk_c7
| 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/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_31) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_12) ).
cnf(prove_this_10,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_10) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_9) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_8) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_7) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_3) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c6
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_15) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_4) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c6
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_16) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c2) = sk_c7
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_21) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c3,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_25) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_26) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c2) = sk_c7
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_22) ).
cnf(prove_this_30,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_30) ).
cnf(prove_this_29,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_29) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_6) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c3,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_1) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_5) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p',prove_this_2) ).
cnf(c_0_26,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_27,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_28,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_29,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_27 ).
cnf(c_0_31,negated_conjecture,
( multiply(inverse(sk_c4),sk_c6) = sk_c7
| multiply(sk_c6,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| inverse(sk_c4) = sk_c7 ),
prove_this_28 ).
cnf(c_0_33,negated_conjecture,
( multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| multiply(X2,sk_c7) != sk_c6
| inverse(X2) != sk_c7
| multiply(sk_c6,sk_c8) != sk_c7
| 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_34,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(X1,sk_c8) != sk_c6
| multiply(X2,sk_c7) != sk_c6
| multiply(X3,sk_c8) != sk_c7
| multiply(X4,sk_c7) != sk_c6
| multiply(X5,sk_c8) != sk_c7
| inverse(X1) != sk_c6
| inverse(X2) != sk_c7
| inverse(X3) != sk_c8
| inverse(X4) != sk_c7
| inverse(X5) != sk_c8 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c5) = sk_c6 ),
prove_this_11 ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
prove_this_12 ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c8
| multiply(X1,sk_c7) != sk_c6
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c7) != sk_c6
| multiply(X4,sk_c8) != sk_c7
| inverse(X1) != sk_c7
| inverse(X2) != sk_c8
| inverse(X3) != sk_c7
| inverse(X4) != sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c4) = sk_c7 ),
prove_this_10 ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_9 ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c8
| multiply(X1,sk_c8) != sk_c7
| multiply(X2,sk_c7) != sk_c6
| multiply(X3,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c7
| inverse(X3) != sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c3) = sk_c8 ),
prove_this_8 ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c7 ),
prove_this_7 ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c8
| multiply(X1,sk_c7) != sk_c6
| multiply(X2,sk_c8) != sk_c7
| inverse(X1) != sk_c7
| inverse(X2) != sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c8
| multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_3 ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c6
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_15 ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_42]),c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( multiply(inverse(sk_c4),sk_c6) = sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c4) = sk_c7 ),
prove_this_4 ).
cnf(c_0_51,negated_conjecture,
( multiply(inverse(sk_c4),sk_c6) = sk_c7
| multiply(sk_c2,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_29,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c6
| inverse(sk_c4) = sk_c7 ),
prove_this_16 ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c8,multiply(sk_c1,X1)) = X1
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( multiply(inverse(sk_c2),sk_c6) = sk_c7
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( inverse(sk_c2) = sk_c7
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_21 ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c3,sk_c8) = sk_c7 ),
prove_this_25 ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| identity = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_56]),c_0_27]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( multiply(inverse(sk_c3),sk_c7) = sk_c8
| multiply(sk_c6,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| inverse(sk_c3) = sk_c8 ),
prove_this_26 ).
cnf(c_0_64,negated_conjecture,
( identity = sk_c7
| identity = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_60]),c_0_27]) ).
cnf(c_0_65,negated_conjecture,
( multiply(inverse(sk_c4),sk_c6) = sk_c7
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( inverse(sk_c2) = sk_c7
| inverse(sk_c4) = sk_c7 ),
prove_this_22 ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c6,X1) = X1
| identity = sk_c7 ),
inference(spm,[status(thm)],[c_0_28,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| inverse(sk_c2) = sk_c7 ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| identity = sk_c7
| sk_c8 = sk_c7 ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c6 ),
prove_this_30 ).
cnf(c_0_72,negated_conjecture,
multiply(sk_c7,sk_c6) = sk_c7,
inference(spm,[status(thm)],[c_0_57,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
( sk_c8 = sk_c7
| identity = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_70]),c_0_27])]) ).
cnf(c_0_74,negated_conjecture,
( multiply(inverse(sk_c5),sk_c6) = sk_c8
| multiply(sk_c6,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c6 ),
prove_this_29 ).
cnf(c_0_76,negated_conjecture,
identity = sk_c6,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_72]),c_0_27]) ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c6 ),
prove_this_6 ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c7,X1) = X1
| sk_c8 = sk_c7 ),
inference(spm,[status(thm)],[c_0_28,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c6,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_80,plain,
multiply(sk_c6,X1) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_76]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c3,sk_c8) = sk_c7 ),
prove_this_1 ).
cnf(c_0_82,negated_conjecture,
( multiply(inverse(sk_c5),sk_c6) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_77]) ).
cnf(c_0_83,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c6 ),
prove_this_5 ).
cnf(c_0_84,negated_conjecture,
( sk_c8 = sk_c7
| sk_c6 = sk_c7 ),
inference(spm,[status(thm)],[c_0_78,c_0_72]) ).
cnf(c_0_85,negated_conjecture,
( sk_c6 = sk_c8
| sk_c8 = sk_c7 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80]),c_0_80]) ).
cnf(c_0_86,negated_conjecture,
( multiply(inverse(sk_c3),sk_c7) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_81]) ).
cnf(c_0_87,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c3) = sk_c8 ),
prove_this_2 ).
cnf(c_0_88,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c6,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_89,negated_conjecture,
sk_c8 = sk_c7,
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_90,negated_conjecture,
( multiply(sk_c6,sk_c5) = identity
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_91,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_92,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c7
| sk_c6 = sk_c7 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_80]),c_0_89]),c_0_89]) ).
cnf(c_0_93,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c6
| inverse(sk_c1) = sk_c8 ),
inference(rw,[status(thm)],[c_0_90,c_0_76]) ).
cnf(c_0_94,negated_conjecture,
( multiply(inverse(sk_c1),sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_29,c_0_91]) ).
cnf(c_0_95,negated_conjecture,
( multiply(inverse(sk_c1),sk_c7) = sk_c7
| sk_c6 = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_92]) ).
cnf(c_0_96,negated_conjecture,
( inverse(sk_c1) = sk_c7
| sk_c5 = sk_c6 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_80]),c_0_89]) ).
cnf(c_0_97,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c6
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_94,c_0_37]) ).
cnf(c_0_98,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c7
| sk_c5 = sk_c6
| sk_c6 = sk_c7 ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_99,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c7
| multiply(sk_c5,sk_c7) = sk_c6 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_89]),c_0_89]),c_0_89]) ).
cnf(c_0_100,negated_conjecture,
( sk_c5 = sk_c6
| sk_c6 = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_98]),c_0_27]),c_0_76])]) ).
cnf(c_0_101,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c7
| sk_c6 = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_80])]) ).
cnf(c_0_102,negated_conjecture,
sk_c6 = sk_c7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_101]),c_0_27]),c_0_76])]) ).
cnf(c_0_103,plain,
multiply(inverse(X1),X1) = sk_c7,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_76]),c_0_102]) ).
cnf(c_0_104,plain,
multiply(sk_c7,X1) = X1,
inference(rw,[status(thm)],[c_0_80,c_0_102]) ).
cnf(c_0_105,plain,
multiply(inverse(inverse(X1)),sk_c7) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_103]) ).
cnf(c_0_106,plain,
multiply(inverse(sk_c7),X1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_104]) ).
cnf(c_0_107,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_105]),c_0_104]) ).
cnf(c_0_108,plain,
multiply(inverse(inverse(sk_c7)),X1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_106]) ).
cnf(c_0_109,negated_conjecture,
( multiply(X1,sk_c7) != sk_c7
| multiply(X2,sk_c7) != sk_c7
| multiply(X3,sk_c7) != sk_c7
| multiply(X4,sk_c7) != sk_c7
| multiply(X5,sk_c7) != sk_c7
| inverse(X1) != sk_c7
| inverse(X2) != sk_c7
| inverse(X3) != sk_c7
| inverse(X4) != sk_c7
| inverse(X5) != 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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_80]),c_0_89]),c_0_89]),c_0_102]),c_0_102]),c_0_89]),c_0_102]),c_0_89]),c_0_102]),c_0_89]),c_0_89])]) ).
cnf(c_0_110,plain,
multiply(X1,sk_c7) = X1,
inference(rw,[status(thm)],[c_0_105,c_0_107]) ).
cnf(c_0_111,plain,
inverse(sk_c7) = sk_c7,
inference(spm,[status(thm)],[c_0_108,c_0_103]) ).
cnf(c_0_112,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[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)],[inference(rw,[status(thm)],[c_0_109,c_0_110]),c_0_110]),c_0_110]),c_0_110]),c_0_110])])])])])]),c_0_111])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GRP261-1 : TPTP v8.1.2. Released v2.5.0.
% 0.02/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n031.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Oct 3 03:05:58 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.utN5ZEk6nY/E---3.1_17945.p
% 0.14/0.43 # Version: 3.1pre001
% 0.14/0.43 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 18022 completed with status 0
% 0.14/0.43 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.43 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43 # No SInE strategy applied
% 0.14/0.43 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.14/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.14/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.43 # Starting sh5l with 136s (1) cores
% 0.14/0.43 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 18027 completed with status 0
% 0.14/0.43 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.43 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43 # No SInE strategy applied
% 0.14/0.43 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.14/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.14/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.43 # Preprocessing time : 0.001 s
% 0.14/0.43 # Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 # Proof found!
% 0.14/0.43 # SZS status Unsatisfiable
% 0.14/0.43 # SZS output start CNFRefutation
% See solution above
% 0.14/0.43 # Parsed axioms : 34
% 0.14/0.43 # Removed by relevancy pruning/SinE : 0
% 0.14/0.43 # Initial clauses : 34
% 0.14/0.43 # Removed in clause preprocessing : 0
% 0.14/0.43 # Initial clauses in saturation : 34
% 0.14/0.43 # Processed clauses : 472
% 0.14/0.43 # ...of these trivial : 26
% 0.14/0.43 # ...subsumed : 137
% 0.14/0.43 # ...remaining for further processing : 309
% 0.14/0.43 # Other redundant clauses eliminated : 13
% 0.14/0.43 # Clauses deleted for lack of memory : 0
% 0.14/0.43 # Backward-subsumed : 32
% 0.14/0.43 # Backward-rewritten : 188
% 0.14/0.43 # Generated clauses : 1349
% 0.14/0.43 # ...of the previous two non-redundant : 1243
% 0.14/0.43 # ...aggressively subsumed : 0
% 0.14/0.43 # Contextual simplify-reflections : 8
% 0.14/0.43 # Paramodulations : 1334
% 0.14/0.43 # Factorizations : 2
% 0.14/0.43 # NegExts : 0
% 0.14/0.43 # Equation resolutions : 13
% 0.14/0.43 # Total rewrite steps : 1028
% 0.14/0.43 # Propositional unsat checks : 0
% 0.14/0.43 # Propositional check models : 0
% 0.14/0.43 # Propositional check unsatisfiable : 0
% 0.14/0.43 # Propositional clauses : 0
% 0.14/0.43 # Propositional clauses after purity: 0
% 0.14/0.43 # Propositional unsat core size : 0
% 0.14/0.43 # Propositional preprocessing time : 0.000
% 0.14/0.43 # Propositional encoding time : 0.000
% 0.14/0.43 # Propositional solver time : 0.000
% 0.14/0.43 # Success case prop preproc time : 0.000
% 0.14/0.43 # Success case prop encoding time : 0.000
% 0.14/0.43 # Success case prop solver time : 0.000
% 0.14/0.43 # Current number of processed clauses : 55
% 0.14/0.43 # Positive orientable unit clauses : 10
% 0.14/0.43 # Positive unorientable unit clauses: 0
% 0.14/0.43 # Negative unit clauses : 0
% 0.14/0.43 # Non-unit-clauses : 45
% 0.14/0.43 # Current number of unprocessed clauses: 519
% 0.14/0.43 # ...number of literals in the above : 3210
% 0.14/0.43 # Current number of archived formulas : 0
% 0.14/0.43 # Current number of archived clauses : 254
% 0.14/0.43 # Clause-clause subsumption calls (NU) : 1418
% 0.14/0.43 # Rec. Clause-clause subsumption calls : 1236
% 0.14/0.43 # Non-unit clause-clause subsumptions : 175
% 0.14/0.43 # Unit Clause-clause subsumption calls : 212
% 0.14/0.43 # Rewrite failures with RHS unbound : 0
% 0.14/0.43 # BW rewrite match attempts : 34
% 0.14/0.43 # BW rewrite match successes : 25
% 0.14/0.43 # Condensation attempts : 0
% 0.14/0.43 # Condensation successes : 0
% 0.14/0.43 # Termbank termtop insertions : 19482
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.027 s
% 0.14/0.43 # System time : 0.003 s
% 0.14/0.43 # Total time : 0.030 s
% 0.14/0.43 # Maximum resident set size: 1596 pages
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.138 s
% 0.14/0.43 # System time : 0.012 s
% 0.14/0.43 # Total time : 0.149 s
% 0.14/0.43 # Maximum resident set size: 1684 pages
% 0.14/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------