TSTP Solution File: GRP330-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP330-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:47:05 EDT 2023
% Result : Unsatisfiable 1.46s 0.67s
% Output : CNFRefutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 19
% Syntax : Number of clauses : 97 ( 22 unt; 64 nHn; 78 RR)
% Number of literals : 237 ( 236 equ; 84 neg)
% Maximal clause size : 15 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 67 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',left_identity) ).
cnf(prove_this_42,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_42) ).
cnf(prove_this_32,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_32) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_1) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_5) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_3) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_2) ).
cnf(prove_this_41,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_41) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c8,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_7) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_4) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_6) ).
cnf(prove_this_31,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_31) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_24) ).
cnf(prove_this_51,negated_conjecture,
( multiply(sk_c10,sk_c11) != sk_c9
| multiply(X1,sk_c10) != sk_c11
| inverse(X1) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| inverse(X2) != sk_c9
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_51) ).
cnf(prove_this_23,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_23) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_16) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.OhKLvOpCMf/E---3.1_26653.p',prove_this_15) ).
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_c2) = sk_c9
| inverse(sk_c3) = sk_c11 ),
prove_this_42 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| inverse(sk_c3) = sk_c11 ),
prove_this_32 ).
cnf(c_0_29,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c11,sk_c3) = identity
| inverse(sk_c2) = sk_c9 ),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| multiply(sk_c11,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c11,sk_c3) = identity
| multiply(sk_c2,sk_c9) = identity ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_1 ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c11,sk_c3) = identity
| sk_c10 = identity ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_5 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_3 ).
cnf(c_0_37,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_38,negated_conjecture,
( multiply(inverse(sk_c3),sk_c10) = sk_c11
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_22,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c3) = sk_c11 ),
prove_this_2 ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_41 ).
cnf(c_0_41,negated_conjecture,
( inverse(sk_c11) = sk_c3
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_34]),c_0_25]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c8,sk_c10) = sk_c11 ),
prove_this_7 ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c4) = sk_c10 ),
prove_this_4 ).
cnf(c_0_44,negated_conjecture,
( multiply(inverse(sk_c5),sk_c11) = sk_c8
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c5) = sk_c8 ),
prove_this_6 ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c4,multiply(sk_c10,X1)) = multiply(sk_c9,X1)
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_47,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_29]),c_0_25]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_31 ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| multiply(sk_c3,sk_c11) = identity ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c2,sk_c9) = identity ),
inference(spm,[status(thm)],[c_0_29,c_0_40]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c3,sk_c11) = identity
| sk_c10 = identity ),
inference(spm,[status(thm)],[c_0_20,c_0_41]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c8,multiply(sk_c10,X1)) = multiply(sk_c11,X1)
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_42]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c10,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_20,c_0_43]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c8,sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_24 ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c9,inverse(sk_c10)) = sk_c4
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_29]),c_0_25]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| inverse(sk_c10) = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_20]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c10
| sk_c10 = identity ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c2,sk_c9) = identity
| sk_c10 = identity ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c11,sk_c4) = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_25]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(sk_c11,X1) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_55]),c_0_22]) ).
cnf(c_0_63,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c10) = sk_c4 ),
inference(spm,[status(thm)],[c_0_26,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| sk_c4 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_25]) ).
cnf(c_0_65,negated_conjecture,
sk_c10 = identity,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| sk_c4 = sk_c8 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
( inverse(sk_c10) = sk_c4
| inverse(sk_c10) = sk_c1 ),
inference(spm,[status(thm)],[c_0_26,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( sk_c4 = sk_c9
| sk_c9 = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_21]) ).
cnf(c_0_69,negated_conjecture,
( sk_c4 = sk_c8
| sk_c9 = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_65]),c_0_21]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c10,sk_c11) != sk_c9
| multiply(X1,sk_c10) != sk_c11
| inverse(X1) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| inverse(X2) != sk_c9
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
prove_this_51 ).
cnf(c_0_71,negated_conjecture,
( inverse(sk_c10) = sk_c1
| sk_c4 != sk_c1 ),
inference(ef,[status(thm)],[c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_23 ).
cnf(c_0_73,negated_conjecture,
( sk_c8 = sk_c11
| sk_c9 = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_65]),c_0_21]),c_0_65]),c_0_25]) ).
cnf(c_0_74,negated_conjecture,
( sk_c9 = sk_c11
| sk_c8 = sk_c9 ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| inverse(sk_c5) = sk_c8 ),
prove_this_16 ).
cnf(c_0_76,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c10,sk_c11) != sk_c9
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c10) != sk_c9
| multiply(X4,sk_c11) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| inverse(X3) != sk_c10
| inverse(X4) != sk_c11
| inverse(X5) != sk_c9
| inverse(X6) != sk_c10 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_70])]) ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c10,sk_c1) = identity
| sk_c4 != sk_c1 ),
inference(spm,[status(thm)],[c_0_29,c_0_71]) ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c1,sk_c10) = identity ),
inference(spm,[status(thm)],[c_0_29,c_0_72]) ).
cnf(c_0_79,negated_conjecture,
sk_c9 = sk_c11,
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_80,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_15 ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c5,sk_c8) = identity ),
inference(spm,[status(thm)],[c_0_29,c_0_75]) ).
cnf(c_0_82,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c10,sk_c11) != sk_c9
| multiply(X3,sk_c10) != sk_c9
| multiply(X4,sk_c11) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| inverse(X3) != sk_c10
| inverse(X4) != sk_c11
| inverse(X5) != sk_c9
| inverse(X6) != sk_c10
| sk_c11 != identity ),
inference(rw,[status(thm)],[c_0_76,c_0_29]) ).
cnf(c_0_83,negated_conjecture,
( sk_c1 = identity
| sk_c4 != sk_c1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_65]),c_0_21]) ).
cnf(c_0_84,negated_conjecture,
( sk_c1 = identity
| sk_c4 = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_65]),c_0_25]),c_0_65]),c_0_25]),c_0_79]) ).
cnf(c_0_85,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_86,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_87,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X3,sk_c11) != identity
| multiply(X4,sk_c9) != identity
| inverse(sk_c9) != identity
| inverse(sk_c11) != identity
| inverse(X2) != sk_c11
| inverse(X3) != sk_c11
| inverse(X4) != sk_c9
| sk_c9 != sk_c11
| sk_c11 != identity ),
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_65]),c_0_25]),c_0_65]),c_0_21]),c_0_65]),c_0_25]),c_0_65]),c_0_65]),c_0_65]),c_0_25]),c_0_65]),c_0_65])])]) ).
cnf(c_0_88,negated_conjecture,
( sk_c1 = identity
| sk_c1 != sk_c11 ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_89,negated_conjecture,
( sk_c11 = identity
| sk_c1 = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_65]),c_0_25]) ).
cnf(c_0_90,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_86]) ).
cnf(c_0_91,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X3,sk_c11) != identity
| multiply(X4,sk_c11) != identity
| inverse(sk_c11) != identity
| inverse(X2) != sk_c11
| inverse(X3) != sk_c11
| inverse(X4) != sk_c11
| sk_c11 != identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_79]),c_0_79]),c_0_79]),c_0_79])]) ).
cnf(c_0_92,negated_conjecture,
sk_c11 = identity,
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_93,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_20,c_0_90]) ).
cnf(c_0_94,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| inverse(X2) != 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_91,c_0_92]),c_0_25]),c_0_92]),c_0_25]),c_0_92]),c_0_93]),c_0_92]),c_0_92]),c_0_92]),c_0_92])])])]),c_0_93])]) ).
cnf(c_0_95,negated_conjecture,
inverse(X1) != identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_20]),c_0_93]),c_0_26])]) ).
cnf(c_0_96,plain,
$false,
inference(sr,[status(thm)],[c_0_93,c_0_95]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP330-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 02:58:13 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.OhKLvOpCMf/E---3.1_26653.p
% 1.46/0.67 # Version: 3.1pre001
% 1.46/0.67 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.46/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.46/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.46/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.46/0.67 # Starting sh5l with 300s (1) cores
% 1.46/0.67 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 26730 completed with status 0
% 1.46/0.67 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.46/0.67 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.46/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.46/0.67 # No SInE strategy applied
% 1.46/0.67 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.46/0.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.46/0.67 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.46/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.46/0.67 # Starting new_bool_3 with 136s (1) cores
% 1.46/0.67 # Starting new_bool_1 with 136s (1) cores
% 1.46/0.67 # Starting sh5l with 136s (1) cores
% 1.46/0.67 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26734 completed with status 0
% 1.46/0.67 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.46/0.67 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.46/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.46/0.67 # No SInE strategy applied
% 1.46/0.67 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.46/0.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.46/0.67 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.46/0.67 # Preprocessing time : 0.002 s
% 1.46/0.67 # Presaturation interreduction done
% 1.46/0.67
% 1.46/0.67 # Proof found!
% 1.46/0.67 # SZS status Unsatisfiable
% 1.46/0.67 # SZS output start CNFRefutation
% See solution above
% 1.46/0.67 # Parsed axioms : 54
% 1.46/0.67 # Removed by relevancy pruning/SinE : 0
% 1.46/0.67 # Initial clauses : 54
% 1.46/0.67 # Removed in clause preprocessing : 0
% 1.46/0.67 # Initial clauses in saturation : 54
% 1.46/0.67 # Processed clauses : 4224
% 1.46/0.67 # ...of these trivial : 21
% 1.46/0.67 # ...subsumed : 3237
% 1.46/0.67 # ...remaining for further processing : 966
% 1.46/0.67 # Other redundant clauses eliminated : 9
% 1.46/0.67 # Clauses deleted for lack of memory : 0
% 1.46/0.67 # Backward-subsumed : 43
% 1.46/0.67 # Backward-rewritten : 804
% 1.46/0.67 # Generated clauses : 19249
% 1.46/0.67 # ...of the previous two non-redundant : 19189
% 1.46/0.67 # ...aggressively subsumed : 0
% 1.46/0.67 # Contextual simplify-reflections : 2
% 1.46/0.67 # Paramodulations : 19235
% 1.46/0.67 # Factorizations : 1
% 1.46/0.67 # NegExts : 0
% 1.46/0.67 # Equation resolutions : 9
% 1.46/0.67 # Total rewrite steps : 5975
% 1.46/0.67 # Propositional unsat checks : 0
% 1.46/0.67 # Propositional check models : 0
% 1.46/0.67 # Propositional check unsatisfiable : 0
% 1.46/0.67 # Propositional clauses : 0
% 1.46/0.67 # Propositional clauses after purity: 0
% 1.46/0.67 # Propositional unsat core size : 0
% 1.46/0.67 # Propositional preprocessing time : 0.000
% 1.46/0.67 # Propositional encoding time : 0.000
% 1.46/0.67 # Propositional solver time : 0.000
% 1.46/0.67 # Success case prop preproc time : 0.000
% 1.46/0.67 # Success case prop encoding time : 0.000
% 1.46/0.67 # Success case prop solver time : 0.000
% 1.46/0.67 # Current number of processed clauses : 59
% 1.46/0.67 # Positive orientable unit clauses : 13
% 1.46/0.67 # Positive unorientable unit clauses: 0
% 1.46/0.67 # Negative unit clauses : 1
% 1.46/0.67 # Non-unit-clauses : 45
% 1.46/0.67 # Current number of unprocessed clauses: 14959
% 1.46/0.67 # ...number of literals in the above : 40640
% 1.46/0.67 # Current number of archived formulas : 0
% 1.46/0.67 # Current number of archived clauses : 906
% 1.46/0.67 # Clause-clause subsumption calls (NU) : 51670
% 1.46/0.67 # Rec. Clause-clause subsumption calls : 41398
% 1.46/0.67 # Non-unit clause-clause subsumptions : 3281
% 1.46/0.67 # Unit Clause-clause subsumption calls : 225
% 1.46/0.67 # Rewrite failures with RHS unbound : 0
% 1.46/0.67 # BW rewrite match attempts : 11
% 1.46/0.67 # BW rewrite match successes : 8
% 1.46/0.67 # Condensation attempts : 0
% 1.46/0.67 # Condensation successes : 0
% 1.46/0.67 # Termbank termtop insertions : 160719
% 1.46/0.67
% 1.46/0.67 # -------------------------------------------------
% 1.46/0.67 # User time : 0.177 s
% 1.46/0.67 # System time : 0.010 s
% 1.46/0.67 # Total time : 0.187 s
% 1.46/0.67 # Maximum resident set size: 1676 pages
% 1.46/0.67
% 1.46/0.67 # -------------------------------------------------
% 1.46/0.67 # User time : 0.897 s
% 1.46/0.67 # System time : 0.022 s
% 1.46/0.67 # Total time : 0.918 s
% 1.46/0.67 # Maximum resident set size: 1696 pages
% 1.46/0.67 % E---3.1 exiting
%------------------------------------------------------------------------------