TSTP Solution File: GRP209-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP209-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:38 EDT 2023
% Result : Unsatisfiable 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 20
% Syntax : Number of clauses : 99 ( 24 unt; 66 nHn; 80 RR)
% Number of literals : 220 ( 219 equ; 60 neg)
% Maximal clause size : 13 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 59 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',left_identity) ).
cnf(prove_this_43,negated_conjecture,
( multiply(X1,X2) != sk_c10
| inverse(X1) != X2
| multiply(X2,sk_c9) != sk_c10
| multiply(sk_c10,X3) != sk_c9
| multiply(X4,sk_c10) != X3
| inverse(X4) != sk_c10
| inverse(X5) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X6,sk_c9) != sk_c10
| inverse(X6) != sk_c9
| multiply(X7,X8) != sk_c9
| inverse(X7) != X8
| multiply(X8,sk_c10) != sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_43) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c6,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_3) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| inverse(sk_c6) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_4) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c5,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_2) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| inverse(sk_c5) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_1) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| inverse(sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_6) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c7,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_5) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c8,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_7) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c6) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_11) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c9
| multiply(sk_c7,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_26) ).
cnf(prove_this_10,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c6,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_10) ).
cnf(prove_this_27,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c9
| inverse(sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_27) ).
cnf(prove_this_36,negated_conjecture,
( inverse(sk_c3) = sk_c10
| inverse(sk_c5) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_36) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c9
| multiply(sk_c5,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_23) ).
cnf(prove_this_30,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c4
| multiply(sk_c5,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_30) ).
cnf(prove_this_29,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c4
| inverse(sk_c5) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_29) ).
cnf(prove_this_37,negated_conjecture,
( inverse(sk_c3) = sk_c10
| multiply(sk_c5,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.IVBNs86BYe/E---3.1_15260.p',prove_this_37) ).
cnf(c_0_20,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_21,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_22,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_23,negated_conjecture,
( multiply(X1,X2) != sk_c10
| inverse(X1) != X2
| multiply(X2,sk_c9) != sk_c10
| multiply(sk_c10,X3) != sk_c9
| multiply(X4,sk_c10) != X3
| inverse(X4) != sk_c10
| inverse(X5) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X6,sk_c9) != sk_c10
| inverse(X6) != sk_c9
| multiply(X7,X8) != sk_c9
| inverse(X7) != X8
| multiply(X8,sk_c10) != sk_c9 ),
prove_this_43 ).
cnf(c_0_24,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c6,sk_c9) = sk_c10 ),
prove_this_3 ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9
| multiply(inverse(X2),sk_c10) != sk_c9
| multiply(inverse(X3),sk_c9) != sk_c10
| multiply(X2,inverse(X2)) != sk_c9
| multiply(X3,inverse(X3)) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| inverse(X4) != sk_c9
| inverse(X5) != sk_c10
| inverse(X1) != sk_c10 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])])]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| inverse(sk_c6) = sk_c9 ),
prove_this_4 ).
cnf(c_0_28,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( multiply(inverse(sk_c6),sk_c10) = sk_c9
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c5,sk_c9) = sk_c10 ),
prove_this_2 ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9
| multiply(inverse(X2),sk_c10) != sk_c9
| multiply(inverse(X3),sk_c9) != sk_c10
| multiply(X2,inverse(X2)) != sk_c9
| multiply(X3,inverse(X3)) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| inverse(X4) != sk_c10
| inverse(X1) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| inverse(sk_c5) = sk_c10 ),
prove_this_1 ).
cnf(c_0_33,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( multiply(inverse(inverse(sk_c6)),sk_c9) = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( multiply(inverse(sk_c5),sk_c10) = sk_c9
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_36,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_37,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_24]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9
| multiply(inverse(X2),sk_c10) != sk_c9
| multiply(inverse(X3),sk_c9) != sk_c10
| multiply(X2,inverse(X2)) != sk_c9
| multiply(X3,inverse(X3)) != sk_c10
| inverse(X1) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_30]) ).
cnf(c_0_39,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| identity = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_21]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_42,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(inverse(X1),sk_c10) != sk_c9
| multiply(inverse(X2),sk_c9) != sk_c10
| multiply(X1,inverse(X1)) != sk_c9
| multiply(X2,inverse(X2)) != sk_c10 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_22]),c_0_40]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| inverse(sk_c7) = sk_c8 ),
prove_this_6 ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c7,sk_c8) = sk_c9 ),
prove_this_5 ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c8,sk_c10) = sk_c9 ),
prove_this_7 ).
cnf(c_0_47,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_42]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c6) = sk_c9 ),
prove_this_11 ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(inverse(X1),sk_c9) != sk_c10
| multiply(X1,inverse(X1)) != sk_c10 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( multiply(inverse(inverse(sk_c5)),sk_c9) = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_51,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c9) = sk_c6 ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(inverse(sk_c5),inverse(inverse(sk_c5))) != sk_c10 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( inverse(sk_c9) = sk_c6
| inverse(sk_c2) = sk_c1 ),
inference(spm,[status(thm)],[c_0_47,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
multiply(sk_c1,sk_c2) = sk_c10,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_47]),c_0_21]),c_0_40]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c9
| multiply(sk_c7,sk_c8) = sk_c9 ),
prove_this_26 ).
cnf(c_0_56,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c6,sk_c9) = sk_c10 ),
prove_this_10 ).
cnf(c_0_57,negated_conjecture,
( inverse(sk_c9) = sk_c6
| identity = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_53]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( multiply(inverse(sk_c7),sk_c9) = sk_c8
| multiply(sk_c10,sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c9
| inverse(sk_c7) = sk_c8 ),
prove_this_27 ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c10
| multiply(sk_c2,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_21,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c6,sk_c9) = identity
| identity = sk_c10 ),
inference(spm,[status(thm)],[c_0_21,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c7,multiply(sk_c8,X1)) = multiply(sk_c9,X1)
| multiply(sk_c10,sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_20,c_0_55]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c9
| multiply(sk_c8,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
( inverse(sk_c3) = sk_c10
| inverse(sk_c5) = sk_c10 ),
prove_this_36 ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c2,sk_c1) = identity
| identity = sk_c10 ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c9
| multiply(sk_c5,sk_c9) = sk_c10 ),
prove_this_23 ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c7,sk_c8) = multiply(sk_c9,sk_c9)
| multiply(sk_c10,sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( inverse(sk_c3) = sk_c10
| inverse(sk_c10) = sk_c5 ),
inference(spm,[status(thm)],[c_0_47,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
( inverse(sk_c2) = sk_c1
| identity = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_65]),c_0_42]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c4
| multiply(sk_c5,sk_c9) = sk_c10 ),
prove_this_30 ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c5,multiply(sk_c9,X1)) = multiply(sk_c10,X1)
| multiply(sk_c10,sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_20,c_0_66]) ).
cnf(c_0_72,negated_conjecture,
( multiply(sk_c9,sk_c9) = sk_c9
| multiply(sk_c10,sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_55,c_0_67]) ).
cnf(c_0_73,negated_conjecture,
( inverse(sk_c10) = sk_c5
| inverse(sk_c10) = sk_c3 ),
inference(spm,[status(thm)],[c_0_47,c_0_68]) ).
cnf(c_0_74,negated_conjecture,
identity = sk_c10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_69]),c_0_54])]) ).
cnf(c_0_75,negated_conjecture,
( multiply(inverse(sk_c5),sk_c10) = sk_c9
| multiply(sk_c3,sk_c10) = sk_c4 ),
inference(spm,[status(thm)],[c_0_24,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c4
| inverse(sk_c5) = sk_c10 ),
prove_this_29 ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c5,sk_c9) = multiply(sk_c10,sk_c9)
| multiply(sk_c10,sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_78,negated_conjecture,
( inverse(sk_c3) = sk_c10
| multiply(sk_c5,sk_c9) = sk_c10 ),
prove_this_37 ).
cnf(c_0_79,negated_conjecture,
( inverse(sk_c10) = sk_c3
| inverse(sk_c5) = sk_c10 ),
inference(spm,[status(thm)],[c_0_47,c_0_73]) ).
cnf(c_0_80,plain,
inverse(sk_c10) = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_74]),c_0_74]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c4
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_82,plain,
multiply(X1,sk_c10) = X1,
inference(rw,[status(thm)],[c_0_42,c_0_74]) ).
cnf(c_0_83,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(sk_c10,sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_66,c_0_77]) ).
cnf(c_0_84,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_74]) ).
cnf(c_0_85,negated_conjecture,
( multiply(sk_c5,sk_c9) = sk_c10
| inverse(sk_c10) = sk_c3 ),
inference(spm,[status(thm)],[c_0_47,c_0_78]) ).
cnf(c_0_86,negated_conjecture,
( inverse(sk_c5) = sk_c10
| sk_c3 = sk_c10 ),
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_87,negated_conjecture,
( sk_c9 = sk_c10
| sk_c4 = sk_c3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_82]) ).
cnf(c_0_88,negated_conjecture,
( sk_c4 = sk_c9
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84]),c_0_84]) ).
cnf(c_0_89,negated_conjecture,
( multiply(sk_c5,sk_c9) = sk_c10
| sk_c3 = sk_c10 ),
inference(spm,[status(thm)],[c_0_85,c_0_80]) ).
cnf(c_0_90,negated_conjecture,
( sk_c3 = sk_c10
| sk_c5 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_86]),c_0_80]) ).
cnf(c_0_91,negated_conjecture,
( sk_c3 = sk_c9
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_92,negated_conjecture,
( sk_c3 = sk_c10
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_84]) ).
cnf(c_0_93,plain,
multiply(inverse(X1),X1) = sk_c10,
inference(rw,[status(thm)],[c_0_21,c_0_74]) ).
cnf(c_0_94,negated_conjecture,
sk_c9 = sk_c10,
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_95,plain,
multiply(X1,inverse(X1)) = sk_c10,
inference(spm,[status(thm)],[c_0_93,c_0_47]) ).
cnf(c_0_96,negated_conjecture,
( inverse(X1) != sk_c10
| inverse(X2) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_82]),c_0_82]),c_0_84]),c_0_94]),c_0_94]),c_0_94]),c_0_82]),c_0_95]),c_0_94]),c_0_95]),c_0_94]),c_0_82]),c_0_94]),c_0_82]),c_0_94])])])])]),c_0_80])]) ).
cnf(c_0_97,negated_conjecture,
inverse(X1) != sk_c10,
inference(spm,[status(thm)],[c_0_96,c_0_80]) ).
cnf(c_0_98,plain,
$false,
inference(sr,[status(thm)],[c_0_80,c_0_97]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP209-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 03:24:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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.IVBNs86BYe/E---3.1_15260.p
% 0.21/0.59 # Version: 3.1pre001
% 0.21/0.59 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.59 # Starting sh5l with 300s (1) cores
% 0.21/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 15360 completed with status 0
% 0.21/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.59 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.59 # No SInE strategy applied
% 0.21/0.59 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.21/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.59 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.59 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.59 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.59 # Starting sh5l with 136s (1) cores
% 0.21/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 15365 completed with status 0
% 0.21/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.59 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.59 # No SInE strategy applied
% 0.21/0.59 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.21/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.59 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.59 # Preprocessing time : 0.002 s
% 0.21/0.59 # Presaturation interreduction done
% 0.21/0.59
% 0.21/0.59 # Proof found!
% 0.21/0.59 # SZS status Unsatisfiable
% 0.21/0.59 # SZS output start CNFRefutation
% See solution above
% 0.21/0.59 # Parsed axioms : 46
% 0.21/0.59 # Removed by relevancy pruning/SinE : 0
% 0.21/0.59 # Initial clauses : 46
% 0.21/0.59 # Removed in clause preprocessing : 0
% 0.21/0.59 # Initial clauses in saturation : 46
% 0.21/0.59 # Processed clauses : 1351
% 0.21/0.59 # ...of these trivial : 141
% 0.21/0.59 # ...subsumed : 627
% 0.21/0.59 # ...remaining for further processing : 583
% 0.21/0.59 # Other redundant clauses eliminated : 33
% 0.21/0.59 # Clauses deleted for lack of memory : 0
% 0.21/0.59 # Backward-subsumed : 77
% 0.21/0.59 # Backward-rewritten : 407
% 0.21/0.59 # Generated clauses : 4271
% 0.21/0.59 # ...of the previous two non-redundant : 3553
% 0.21/0.59 # ...aggressively subsumed : 0
% 0.21/0.59 # Contextual simplify-reflections : 27
% 0.21/0.59 # Paramodulations : 4243
% 0.21/0.59 # Factorizations : 1
% 0.21/0.59 # NegExts : 0
% 0.21/0.59 # Equation resolutions : 33
% 0.21/0.59 # Total rewrite steps : 5552
% 0.21/0.59 # Propositional unsat checks : 0
% 0.21/0.59 # Propositional check models : 0
% 0.21/0.59 # Propositional check unsatisfiable : 0
% 0.21/0.59 # Propositional clauses : 0
% 0.21/0.59 # Propositional clauses after purity: 0
% 0.21/0.59 # Propositional unsat core size : 0
% 0.21/0.59 # Propositional preprocessing time : 0.000
% 0.21/0.59 # Propositional encoding time : 0.000
% 0.21/0.59 # Propositional solver time : 0.000
% 0.21/0.59 # Success case prop preproc time : 0.000
% 0.21/0.59 # Success case prop encoding time : 0.000
% 0.21/0.59 # Success case prop solver time : 0.000
% 0.21/0.59 # Current number of processed clauses : 45
% 0.21/0.59 # Positive orientable unit clauses : 44
% 0.21/0.59 # Positive unorientable unit clauses: 0
% 0.21/0.59 # Negative unit clauses : 1
% 0.21/0.59 # Non-unit-clauses : 0
% 0.21/0.59 # Current number of unprocessed clauses: 313
% 0.21/0.59 # ...number of literals in the above : 816
% 0.21/0.59 # Current number of archived formulas : 0
% 0.21/0.59 # Current number of archived clauses : 531
% 0.21/0.59 # Clause-clause subsumption calls (NU) : 4679
% 0.21/0.59 # Rec. Clause-clause subsumption calls : 2852
% 0.21/0.59 # Non-unit clause-clause subsumptions : 678
% 0.21/0.59 # Unit Clause-clause subsumption calls : 888
% 0.21/0.59 # Rewrite failures with RHS unbound : 0
% 0.21/0.59 # BW rewrite match attempts : 131
% 0.21/0.59 # BW rewrite match successes : 64
% 0.21/0.59 # Condensation attempts : 0
% 0.21/0.59 # Condensation successes : 0
% 0.21/0.59 # Termbank termtop insertions : 59638
% 0.21/0.59
% 0.21/0.59 # -------------------------------------------------
% 0.21/0.59 # User time : 0.087 s
% 0.21/0.59 # System time : 0.007 s
% 0.21/0.59 # Total time : 0.094 s
% 0.21/0.59 # Maximum resident set size: 1660 pages
% 0.21/0.59
% 0.21/0.59 # -------------------------------------------------
% 0.21/0.59 # User time : 0.447 s
% 0.21/0.59 # System time : 0.018 s
% 0.21/0.59 # Total time : 0.466 s
% 0.21/0.59 # Maximum resident set size: 1688 pages
% 0.21/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------