TSTP Solution File: GRP062-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP062-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:56:21 EDT 2024
% Result : Unsatisfiable 2.40s 0.79s
% Output : CNFRefutation 2.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 2
% Syntax : Number of clauses : 79 ( 74 unt; 0 nHn; 27 RR)
% Number of literals : 87 ( 86 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 143 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2))))))) = X4,
file('/export/starexec/sandbox2/tmp/tmp.QLnSPBSdty/E---3.1_30335.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox2/tmp/tmp.QLnSPBSdty/E---3.1_30335.p',prove_these_axioms) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2))))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,multiply(multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,multiply(X4,X1)))),multiply(multiply(X5,inverse(X5)),X3)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(multiply(multiply(X3,inverse(X3)),X4),multiply(multiply(X5,inverse(X5)),X6)))) = multiply(multiply(X7,inverse(X7)),inverse(multiply(X2,multiply(X4,X6)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,multiply(X3,X4)))),multiply(multiply(multiply(X5,inverse(X5)),X2),multiply(multiply(X6,inverse(X6)),X3)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
multiply(a1,inverse(a1)) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_4]),c_0_3]) ).
cnf(c_0_7,plain,
multiply(multiply(a1,inverse(a1)),inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,X2)))) = X3,
inference(rw,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_9,plain,
multiply(multiply(a1,inverse(a1)),inverse(multiply(inverse(multiply(X1,multiply(inverse(X1),X2))),multiply(X3,inverse(X3))))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
inverse(multiply(X1,multiply(inverse(X1),X2))) = inverse(multiply(X3,multiply(inverse(X3),X2))),
inference(spm,[status(thm)],[c_0_2,c_0_9]) ).
cnf(c_0_11,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(X3,X4))),multiply(X2,X3)))) = X4,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
inverse(multiply(X1,multiply(inverse(X1),inverse(inverse(X2))))) = inverse(multiply(X2,multiply(X3,inverse(X3)))),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_13,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(a1,inverse(a1)))),multiply(X2,X3)))) = inverse(X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_14,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(a1,inverse(a1)))),multiply(a1,inverse(a1))))) = inverse(inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_12]) ).
cnf(c_0_15,plain,
inverse(multiply(inverse(X1),multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(inverse(X4),X2))))))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_16,plain,
multiply(multiply(a1,inverse(a1)),inverse(multiply(inverse(multiply(X1,multiply(a1,inverse(a1)))),multiply(X2,inverse(X2))))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_12]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(a1),multiply(inverse(inverse(X1)),multiply(multiply(X2,inverse(X2)),inverse(multiply(X1,multiply(a1,inverse(a1)))))))) = a1,
inference(spm,[status(thm)],[c_0_3,c_0_14]) ).
cnf(c_0_18,plain,
multiply(X1,inverse(X1)) = multiply(multiply(X2,multiply(inverse(X2),X3)),inverse(multiply(X4,multiply(inverse(X4),X3)))),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_19,plain,
inverse(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(X2,multiply(a1,inverse(a1)))))),inverse(inverse(X2))))) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
inverse(multiply(inverse(a1),multiply(inverse(inverse(inverse(multiply(X1,multiply(a1,inverse(a1)))))),inverse(inverse(X1))))) = a1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,plain,
multiply(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(X2,multiply(a1,inverse(a1)))))),inverse(inverse(X2)))),X1) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_18]) ).
cnf(c_0_22,plain,
inverse(multiply(inverse(a1),multiply(inverse(inverse(inverse(multiply(multiply(inverse(a1),multiply(inverse(inverse(inverse(multiply(X1,multiply(a1,inverse(a1)))))),inverse(inverse(X1)))),multiply(a1,inverse(a1)))))),inverse(a1)))) = a1,
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_23,plain,
multiply(X1,multiply(inverse(X1),X2)) = multiply(X3,multiply(inverse(X3),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_15]) ).
cnf(c_0_24,plain,
inverse(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(a1,inverse(a1))))),inverse(multiply(a1,inverse(a1)))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_19]) ).
cnf(c_0_25,plain,
inverse(multiply(inverse(a1),multiply(inverse(inverse(inverse(multiply(multiply(inverse(a1),multiply(inverse(inverse(inverse(multiply(a1,inverse(a1))))),inverse(multiply(a1,inverse(a1))))),multiply(a1,inverse(a1)))))),inverse(a1)))) = a1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_19]) ).
cnf(c_0_26,plain,
multiply(X1,multiply(inverse(X1),inverse(inverse(X2)))) = multiply(X2,multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_18]) ).
cnf(c_0_27,plain,
inverse(multiply(X1,multiply(inverse(X1),inverse(multiply(a1,inverse(a1)))))) = inverse(multiply(a1,inverse(a1))),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_28,plain,
multiply(multiply(a1,inverse(a1)),inverse(multiply(inverse(multiply(X1,multiply(X2,inverse(X2)))),multiply(X1,X3)))) = inverse(X3),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_29,plain,
inverse(inverse(multiply(inverse(a1),multiply(inverse(inverse(inverse(multiply(a1,inverse(a1))))),inverse(multiply(a1,inverse(a1))))))) = inverse(a1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_25]),c_0_26]),c_0_14]) ).
cnf(c_0_30,plain,
multiply(X1,multiply(inverse(X1),inverse(multiply(a1,inverse(a1))))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_27]),c_0_15]) ).
cnf(c_0_31,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(X3,inverse(X3)))),multiply(X2,X4)))) = inverse(X4),
inference(spm,[status(thm)],[c_0_28,c_0_8]) ).
cnf(c_0_32,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(multiply(X3,multiply(X4,multiply(multiply(X5,inverse(X5)),inverse(multiply(X6,multiply(X3,X4)))))),X6),inverse(multiply(X7,multiply(X1,X2))))))) = X7,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_33,plain,
inverse(multiply(inverse(a1),multiply(inverse(inverse(inverse(multiply(a1,inverse(a1))))),inverse(multiply(a1,inverse(a1)))))) = a1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_29]),c_0_15]) ).
cnf(c_0_34,plain,
multiply(inverse(X1),inverse(multiply(a1,inverse(a1)))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_30]),c_0_31]) ).
cnf(c_0_35,plain,
inverse(multiply(multiply(multiply(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2)))))),X4),inverse(multiply(X5,multiply(X6,X7)))),multiply(multiply(multiply(X8,inverse(X8)),X5),multiply(multiply(X9,inverse(X9)),X6)))) = X7,
inference(spm,[status(thm)],[c_0_3,c_0_32]) ).
cnf(c_0_36,plain,
multiply(multiply(inverse(a1),multiply(inverse(inverse(inverse(multiply(a1,inverse(a1))))),inverse(multiply(a1,inverse(a1))))),a1) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_33]),c_0_18]) ).
cnf(c_0_37,plain,
multiply(X1,inverse(multiply(a1,inverse(a1)))) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
multiply(multiply(inverse(a1),inverse(inverse(inverse(multiply(a1,inverse(a1)))))),a1) = multiply(a1,inverse(a1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(a1,inverse(a1)))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_21]),c_0_4]),c_0_21]),c_0_8]) ).
cnf(c_0_40,plain,
inverse(multiply(inverse(a1),inverse(inverse(inverse(multiply(a1,inverse(a1))))))) = a1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_38]),c_0_31]) ).
cnf(c_0_41,plain,
inverse(multiply(inverse(X1),multiply(inverse(multiply(a1,inverse(a1))),multiply(a1,inverse(a1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_24]),c_0_39]) ).
cnf(c_0_42,plain,
inverse(multiply(a1,inverse(inverse(inverse(multiply(a1,inverse(a1))))))) = multiply(inverse(a1),inverse(inverse(inverse(multiply(a1,inverse(a1)))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_40]),c_0_34]) ).
cnf(c_0_43,plain,
inverse(multiply(a1,multiply(inverse(multiply(a1,inverse(a1))),multiply(a1,inverse(a1))))) = multiply(inverse(a1),inverse(inverse(inverse(multiply(a1,inverse(a1)))))),
inference(spm,[status(thm)],[c_0_41,c_0_40]) ).
cnf(c_0_44,plain,
multiply(multiply(a1,inverse(inverse(inverse(multiply(a1,inverse(a1)))))),multiply(inverse(a1),inverse(inverse(inverse(multiply(a1,inverse(a1))))))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_42]),c_0_18]) ).
cnf(c_0_45,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,inverse(X2)))) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_39,c_0_8]) ).
cnf(c_0_46,plain,
multiply(multiply(a1,multiply(inverse(multiply(a1,inverse(a1))),multiply(a1,inverse(a1)))),multiply(inverse(a1),inverse(inverse(inverse(multiply(a1,inverse(a1))))))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_43]),c_0_18]) ).
cnf(c_0_47,plain,
inverse(multiply(inverse(a1),multiply(inverse(inverse(inverse(multiply(a1,inverse(a1))))),multiply(a1,inverse(a1))))) = multiply(a1,inverse(inverse(inverse(multiply(a1,inverse(a1)))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_44]),c_0_45]) ).
cnf(c_0_48,plain,
multiply(multiply(a1,inverse(a1)),inverse(multiply(inverse(multiply(X1,multiply(X2,inverse(X2)))),multiply(a1,inverse(a1))))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_12]),c_0_12]) ).
cnf(c_0_49,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,multiply(X3,X4)))),multiply(multiply(multiply(X5,inverse(X5)),X2),multiply(multiply(multiply(X6,multiply(X7,multiply(multiply(X8,inverse(X8)),inverse(multiply(X9,multiply(X6,X7)))))),X9),X3)))) = X4,
inference(spm,[status(thm)],[c_0_32,c_0_3]) ).
cnf(c_0_50,plain,
multiply(a1,multiply(inverse(multiply(a1,inverse(a1))),multiply(a1,inverse(a1)))) = multiply(a1,inverse(inverse(inverse(multiply(a1,inverse(a1)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_46]),c_0_45]),c_0_47]) ).
cnf(c_0_51,plain,
inverse(multiply(inverse(a1),multiply(inverse(inverse(inverse(multiply(X1,multiply(X2,inverse(X2)))))),inverse(inverse(X1))))) = a1,
inference(spm,[status(thm)],[c_0_17,c_0_48]) ).
cnf(c_0_52,plain,
multiply(inverse(multiply(a1,inverse(a1))),multiply(a1,inverse(a1))) = inverse(inverse(inverse(multiply(a1,inverse(a1))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_49]) ).
cnf(c_0_53,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_8]) ).
cnf(c_0_54,plain,
inverse(multiply(inverse(a1),multiply(inverse(inverse(inverse(inverse(inverse(inverse(multiply(a1,inverse(a1)))))))),inverse(inverse(inverse(multiply(a1,inverse(a1)))))))) = a1,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
inverse(multiply(inverse(X1),inverse(inverse(inverse(multiply(a1,inverse(a1))))))) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_53]) ).
cnf(c_0_56,plain,
multiply(inverse(a1),multiply(inverse(inverse(inverse(inverse(inverse(inverse(multiply(a1,inverse(a1)))))))),inverse(inverse(inverse(multiply(a1,inverse(a1))))))) = multiply(inverse(a1),inverse(inverse(inverse(multiply(a1,inverse(a1)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_54]),c_0_34]),c_0_42]) ).
cnf(c_0_57,plain,
inverse(multiply(inverse(X1),inverse(inverse(inverse(multiply(X2,inverse(X2))))))) = X1,
inference(spm,[status(thm)],[c_0_55,c_0_8]) ).
cnf(c_0_58,plain,
inverse(inverse(inverse(inverse(inverse(multiply(a1,inverse(a1))))))) = inverse(inverse(inverse(inverse(multiply(a1,inverse(a1)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_56]),c_0_31]),c_0_57]) ).
cnf(c_0_59,plain,
inverse(inverse(inverse(inverse(multiply(a1,inverse(a1)))))) = inverse(inverse(inverse(multiply(a1,inverse(a1))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_58]),c_0_15]) ).
cnf(c_0_60,plain,
inverse(inverse(inverse(multiply(a1,inverse(a1))))) = inverse(inverse(multiply(a1,inverse(a1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_59]),c_0_15]) ).
cnf(c_0_61,plain,
inverse(inverse(multiply(a1,inverse(a1)))) = inverse(multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_60]),c_0_15]) ).
cnf(c_0_62,plain,
inverse(inverse(X1)) = X1,
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(spm,[status(thm)],[c_0_19,c_0_61]),c_0_52]),c_0_61]),c_0_61]),c_0_61]),c_0_61]),c_0_61]),c_0_61]),c_0_53]),c_0_37]) ).
cnf(c_0_63,plain,
inverse(multiply(a1,inverse(a1))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_64,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_65,plain,
multiply(X1,multiply(a1,inverse(a1))) = X1,
inference(spm,[status(thm)],[c_0_53,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
c_0_64 ).
cnf(c_0_67,plain,
multiply(inverse(X1),X1) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_62]),c_0_18]) ).
cnf(c_0_68,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_62]),c_0_65]),c_0_65]),c_0_62]) ).
cnf(c_0_69,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(a1,inverse(a1)),a2) != a2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_67]),c_0_67])]) ).
cnf(c_0_70,plain,
inverse(multiply(X1,inverse(multiply(X2,X1)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_68]),c_0_68]),c_0_68]) ).
cnf(c_0_71,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_62]),c_0_65]) ).
cnf(c_0_72,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_65,c_0_8]) ).
cnf(c_0_73,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(X1,inverse(X1)),a2) != a2 ),
inference(spm,[status(thm)],[c_0_69,c_0_8]) ).
cnf(c_0_74,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_70]),c_0_71]),c_0_68]),c_0_72]) ).
cnf(c_0_75,plain,
inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,X2))) = X3,
inference(rw,[status(thm)],[c_0_11,c_0_68]) ).
cnf(c_0_76,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_68])]) ).
cnf(c_0_77,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_62]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP062-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 15:55:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.QLnSPBSdty/E---3.1_30335.p
% 2.40/0.79 # Version: 3.1.0
% 2.40/0.79 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.40/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.40/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.40/0.79 # Starting new_bool_3 with 300s (1) cores
% 2.40/0.79 # Starting new_bool_1 with 300s (1) cores
% 2.40/0.79 # Starting sh5l with 300s (1) cores
% 2.40/0.79 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30451 completed with status 0
% 2.40/0.79 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.40/0.79 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.40/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.40/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.40/0.79 # No SInE strategy applied
% 2.40/0.79 # Search class: FUHPF-FFSF21-DFFFFFNN
% 2.40/0.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.40/0.79 # Starting G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A with 811s (1) cores
% 2.40/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.40/0.79 # Starting new_bool_3 with 136s (1) cores
% 2.40/0.79 # Starting new_bool_1 with 136s (1) cores
% 2.40/0.79 # Starting sh5l with 136s (1) cores
% 2.40/0.79 # G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A with pid 30455 completed with status 0
% 2.40/0.79 # Result found by G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A
% 2.40/0.79 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.40/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.40/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.40/0.79 # No SInE strategy applied
% 2.40/0.79 # Search class: FUHPF-FFSF21-DFFFFFNN
% 2.40/0.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.40/0.79 # Starting G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A with 811s (1) cores
% 2.40/0.79 # Preprocessing time : 0.001 s
% 2.40/0.79 # Presaturation interreduction done
% 2.40/0.79
% 2.40/0.79 # Proof found!
% 2.40/0.79 # SZS status Unsatisfiable
% 2.40/0.79 # SZS output start CNFRefutation
% See solution above
% 2.40/0.79 # Parsed axioms : 2
% 2.40/0.79 # Removed by relevancy pruning/SinE : 0
% 2.40/0.79 # Initial clauses : 2
% 2.40/0.79 # Removed in clause preprocessing : 0
% 2.40/0.79 # Initial clauses in saturation : 2
% 2.40/0.79 # Processed clauses : 418
% 2.40/0.79 # ...of these trivial : 96
% 2.40/0.79 # ...subsumed : 190
% 2.40/0.79 # ...remaining for further processing : 132
% 2.40/0.79 # Other redundant clauses eliminated : 0
% 2.40/0.79 # Clauses deleted for lack of memory : 0
% 2.40/0.79 # Backward-subsumed : 5
% 2.40/0.79 # Backward-rewritten : 84
% 2.40/0.79 # Generated clauses : 17381
% 2.40/0.79 # ...of the previous two non-redundant : 15002
% 2.40/0.79 # ...aggressively subsumed : 0
% 2.40/0.79 # Contextual simplify-reflections : 0
% 2.40/0.79 # Paramodulations : 17381
% 2.40/0.79 # Factorizations : 0
% 2.40/0.79 # NegExts : 0
% 2.40/0.79 # Equation resolutions : 0
% 2.40/0.79 # Disequality decompositions : 0
% 2.40/0.79 # Total rewrite steps : 14589
% 2.40/0.79 # ...of those cached : 12208
% 2.40/0.79 # Propositional unsat checks : 0
% 2.40/0.79 # Propositional check models : 0
% 2.40/0.79 # Propositional check unsatisfiable : 0
% 2.40/0.79 # Propositional clauses : 0
% 2.40/0.79 # Propositional clauses after purity: 0
% 2.40/0.79 # Propositional unsat core size : 0
% 2.40/0.79 # Propositional preprocessing time : 0.000
% 2.40/0.79 # Propositional encoding time : 0.000
% 2.40/0.79 # Propositional solver time : 0.000
% 2.40/0.79 # Success case prop preproc time : 0.000
% 2.40/0.79 # Success case prop encoding time : 0.000
% 2.40/0.79 # Success case prop solver time : 0.000
% 2.40/0.79 # Current number of processed clauses : 41
% 2.40/0.79 # Positive orientable unit clauses : 40
% 2.40/0.79 # Positive unorientable unit clauses: 1
% 2.40/0.79 # Negative unit clauses : 0
% 2.40/0.79 # Non-unit-clauses : 0
% 2.40/0.79 # Current number of unprocessed clauses: 14086
% 2.40/0.79 # ...number of literals in the above : 14086
% 2.40/0.79 # Current number of archived formulas : 0
% 2.40/0.79 # Current number of archived clauses : 91
% 2.40/0.79 # Clause-clause subsumption calls (NU) : 34
% 2.40/0.79 # Rec. Clause-clause subsumption calls : 34
% 2.40/0.79 # Non-unit clause-clause subsumptions : 32
% 2.40/0.79 # Unit Clause-clause subsumption calls : 72
% 2.40/0.79 # Rewrite failures with RHS unbound : 0
% 2.40/0.79 # BW rewrite match attempts : 1048
% 2.40/0.79 # BW rewrite match successes : 99
% 2.40/0.79 # Condensation attempts : 0
% 2.40/0.79 # Condensation successes : 0
% 2.40/0.79 # Termbank termtop insertions : 559454
% 2.40/0.79 # Search garbage collected termcells : 8
% 2.40/0.79
% 2.40/0.79 # -------------------------------------------------
% 2.40/0.79 # User time : 0.274 s
% 2.40/0.79 # System time : 0.010 s
% 2.40/0.79 # Total time : 0.284 s
% 2.40/0.79 # Maximum resident set size: 1552 pages
% 2.40/0.79
% 2.40/0.79 # -------------------------------------------------
% 2.40/0.79 # User time : 1.392 s
% 2.40/0.79 # System time : 0.027 s
% 2.40/0.79 # Total time : 1.419 s
% 2.40/0.79 # Maximum resident set size: 1692 pages
% 2.40/0.79 % E---3.1 exiting
%------------------------------------------------------------------------------