TSTP Solution File: GRP225-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP225-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Mon May 20 20:47:03 EDT 2024
% Result : Unsatisfiable 0.15s 0.49s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 22
% Syntax : Number of clauses : 127 ( 23 unt; 97 nHn; 104 RR)
% Number of literals : 300 ( 299 equ; 78 neg)
% Maximal clause size : 12 ( 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 : 70 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c9
| multiply(sk_c4,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c9
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c4,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c6,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_1,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_36,negated_conjecture,
( inverse(X1) != sk_c9
| multiply(X1,sk_c8) != sk_c9
| multiply(sk_c9,X2) != sk_c8
| multiply(X3,sk_c9) != X2
| inverse(X3) != sk_c9
| inverse(X4) != sk_c9
| multiply(X4,sk_c8) != sk_c9
| multiply(X5,sk_c8) != sk_c9
| inverse(X5) != sk_c8
| multiply(X6,X7) != sk_c8
| inverse(X6) != X7
| multiply(X7,sk_c9) != sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_36) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c4,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_27,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_27) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| multiply(sk_c6,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_33,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c6,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| multiply(sk_c5,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_32,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_32) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_31,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_31) ).
cnf(c_0_22,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_23,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_24,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_25,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c9
| multiply(sk_c4,sk_c8) = sk_c9 ),
prove_this_9 ).
cnf(c_0_27,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c9
| inverse(sk_c4) = sk_c9 ),
prove_this_8 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c9
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( multiply(inverse(sk_c1),sk_c9) = sk_c8
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c4,sk_c8) = sk_c9 ),
prove_this_2 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c6,sk_c7) = sk_c8 ),
prove_this_19 ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c4,sk_c8) = sk_c9
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( multiply(inverse(sk_c6),sk_c8) = sk_c7
| multiply(sk_c9,sk_c3) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| inverse(sk_c6) = sk_c7 ),
prove_this_20 ).
cnf(c_0_36,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c8
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c4) = sk_c9 ),
prove_this_1 ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c9 ),
prove_this_17 ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c7,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c9,sk_c9) = sk_c8
| inverse(sk_c1) = sk_c9 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( inverse(X1) != sk_c9
| multiply(X1,sk_c8) != sk_c9
| multiply(sk_c9,X2) != sk_c8
| multiply(X3,sk_c9) != X2
| inverse(X3) != sk_c9
| inverse(X4) != sk_c9
| multiply(X4,sk_c8) != sk_c9
| multiply(X5,sk_c8) != sk_c9
| inverse(X5) != sk_c8
| multiply(X6,X7) != sk_c8
| inverse(X6) != X7
| multiply(X7,sk_c9) != sk_c8 ),
inference(fof_simplification,[status(thm)],[prove_this_36]) ).
cnf(c_0_42,negated_conjecture,
( multiply(inverse(sk_c5),sk_c9) = sk_c8
| multiply(sk_c9,sk_c3) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| inverse(sk_c5) = sk_c8 ),
prove_this_18 ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| identity = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_39]),c_0_23]) ).
cnf(c_0_45,negated_conjecture,
multiply(sk_c9,sk_c9) = sk_c8,
inference(spm,[status(thm)],[c_0_30,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( inverse(X1) != sk_c9
| multiply(X1,sk_c8) != sk_c9
| multiply(sk_c9,X2) != sk_c8
| multiply(X3,sk_c9) != X2
| inverse(X3) != sk_c9
| inverse(X4) != sk_c9
| multiply(X4,sk_c8) != sk_c9
| multiply(X5,sk_c8) != sk_c9
| inverse(X5) != sk_c8
| multiply(X6,X7) != sk_c8
| inverse(X6) != X7
| multiply(X7,sk_c9) != sk_c8 ),
c_0_41 ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c4,sk_c8) = sk_c9 ),
prove_this_16 ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c8,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( multiply(inverse(sk_c9),sk_c8) = sk_c3
| identity = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
multiply(inverse(sk_c9),sk_c8) = sk_c9,
inference(spm,[status(thm)],[c_0_25,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c9,multiply(X1,sk_c9)) != sk_c8
| multiply(inverse(X2),sk_c9) != sk_c8
| multiply(X2,inverse(X2)) != sk_c8
| multiply(X3,sk_c8) != sk_c9
| multiply(X4,sk_c8) != sk_c9
| multiply(X5,sk_c8) != sk_c9
| inverse(X3) != sk_c8
| inverse(X4) != sk_c9
| inverse(X1) != sk_c9
| inverse(X5) != sk_c9 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_46])]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c4,multiply(sk_c8,X1)) = multiply(sk_c9,X1)
| multiply(sk_c9,sk_c3) = sk_c8 ),
inference(spm,[status(thm)],[c_0_22,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| identity = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_48]),c_0_23]) ).
cnf(c_0_54,negated_conjecture,
( identity = sk_c8
| sk_c3 = sk_c9 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c9,multiply(X1,sk_c9)) != sk_c8
| multiply(inverse(X2),sk_c9) != sk_c8
| multiply(X2,inverse(X2)) != sk_c8
| multiply(X3,sk_c8) != sk_c9
| multiply(X4,sk_c8) != sk_c9
| inverse(X3) != sk_c9
| inverse(X1) != sk_c9
| inverse(X4) != sk_c9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_43]),c_0_38]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| inverse(sk_c4) = sk_c9 ),
prove_this_15 ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c4,sk_c8) = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_48]),c_0_45]) ).
cnf(c_0_58,negated_conjecture,
( multiply(inverse(sk_c9),sk_c8) = sk_c3
| identity = sk_c9 ),
inference(spm,[status(thm)],[c_0_25,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c8,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_43]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c8,X1) = X1
| sk_c3 = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_54]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c9,multiply(X1,sk_c9)) != sk_c8
| multiply(inverse(X2),sk_c9) != sk_c8
| multiply(X2,inverse(X2)) != sk_c8
| multiply(X3,sk_c8) != sk_c9
| inverse(X1) != sk_c9
| inverse(X3) != sk_c9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_47]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| sk_c8 = sk_c9 ),
inference(spm,[status(thm)],[c_0_47,c_0_57]) ).
cnf(c_0_63,negated_conjecture,
( identity = sk_c9
| sk_c3 = sk_c9 ),
inference(spm,[status(thm)],[c_0_58,c_0_50]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| sk_c3 = sk_c9
| identity = sk_c5 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c9,multiply(sk_c5,sk_c9)) != sk_c8
| multiply(inverse(X1),sk_c9) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8
| multiply(X2,sk_c8) != sk_c9
| inverse(X2) != sk_c9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_43]),c_0_62]) ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c9,X1) = X1
| sk_c3 = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
( identity = sk_c5
| sk_c3 = sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_64]),c_0_50])]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| sk_c3 = sk_c9
| multiply(inverse(X1),sk_c9) != sk_c8
| multiply(sk_c5,sk_c9) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8
| multiply(X2,sk_c8) != sk_c9
| inverse(X2) != sk_c9 ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
( sk_c3 = sk_c9
| sk_c5 = sk_c9 ),
inference(spm,[status(thm)],[c_0_63,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| sk_c3 = sk_c9
| multiply(inverse(X1),sk_c9) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8
| multiply(X2,sk_c8) != sk_c9
| inverse(X2) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_45])]) ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| sk_c3 = sk_c9
| multiply(inverse(X1),sk_c9) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_56]),c_0_47]) ).
cnf(c_0_72,negated_conjecture,
( multiply(sk_c5,multiply(sk_c8,X1)) = multiply(sk_c9,X1)
| multiply(sk_c9,sk_c3) = sk_c8 ),
inference(spm,[status(thm)],[c_0_22,c_0_38]) ).
cnf(c_0_73,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| sk_c3 = sk_c9
| multiply(sk_c5,inverse(sk_c5)) != sk_c8 ),
inference(spm,[status(thm)],[c_0_71,c_0_42]) ).
cnf(c_0_74,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_48]),c_0_45]) ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| inverse(sk_c6) = sk_c7 ),
prove_this_27 ).
cnf(c_0_76,negated_conjecture,
( multiply(sk_c9,sk_c3) = sk_c8
| sk_c3 = sk_c9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_43]),c_0_74]) ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| multiply(sk_c6,sk_c7) = sk_c8 ),
prove_this_26 ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| multiply(sk_c7,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_75]) ).
cnf(c_0_79,negated_conjecture,
sk_c3 = sk_c9,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_76]),c_0_50])]) ).
cnf(c_0_80,negated_conjecture,
( multiply(inverse(sk_c6),sk_c8) = sk_c7
| multiply(sk_c2,sk_c9) = sk_c3 ),
inference(spm,[status(thm)],[c_0_25,c_0_77]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c7,sk_c6) = identity
| multiply(sk_c2,sk_c9) = sk_c9 ),
inference(rw,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c6) = sk_c7 ),
prove_this_34 ).
cnf(c_0_83,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| multiply(sk_c7,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_80,c_0_75]) ).
cnf(c_0_84,negated_conjecture,
( multiply(inverse(sk_c2),sk_c9) = sk_c9
| multiply(sk_c7,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_25,c_0_81]) ).
cnf(c_0_85,negated_conjecture,
( multiply(sk_c7,sk_c6) = identity
| inverse(sk_c2) = sk_c9 ),
inference(spm,[status(thm)],[c_0_23,c_0_82]) ).
cnf(c_0_86,negated_conjecture,
( multiply(inverse(sk_c2),sk_c3) = sk_c9
| multiply(sk_c7,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_25,c_0_83]) ).
cnf(c_0_87,negated_conjecture,
( multiply(sk_c7,sk_c6) = identity
| sk_c8 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_45]) ).
cnf(c_0_88,negated_conjecture,
( multiply(inverse(sk_c2),sk_c9) = sk_c9
| multiply(sk_c7,sk_c8) = sk_c7 ),
inference(rw,[status(thm)],[c_0_86,c_0_79]) ).
cnf(c_0_89,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c6,sk_c7) = sk_c8 ),
prove_this_33 ).
cnf(c_0_90,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| multiply(sk_c5,sk_c8) = sk_c9 ),
prove_this_24 ).
cnf(c_0_91,negated_conjecture,
( multiply(sk_c7,multiply(sk_c6,X1)) = X1
| sk_c8 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_87]),c_0_24]) ).
cnf(c_0_92,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c8
| multiply(sk_c7,sk_c8) = sk_c7
| sk_c8 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_45]) ).
cnf(c_0_93,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c5) = sk_c8 ),
prove_this_32 ).
cnf(c_0_94,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| inverse(sk_c5) = sk_c8 ),
prove_this_25 ).
cnf(c_0_95,negated_conjecture,
( multiply(inverse(sk_c5),sk_c9) = sk_c8
| multiply(sk_c2,sk_c9) = sk_c3 ),
inference(spm,[status(thm)],[c_0_25,c_0_90]) ).
cnf(c_0_96,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c7
| sk_c8 = sk_c9 ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_97,negated_conjecture,
( multiply(sk_c8,sk_c5) = identity
| inverse(sk_c2) = sk_c9 ),
inference(spm,[status(thm)],[c_0_23,c_0_93]) ).
cnf(c_0_98,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| multiply(sk_c8,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_94]) ).
cnf(c_0_99,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c3
| multiply(sk_c8,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_95,c_0_94]) ).
cnf(c_0_100,negated_conjecture,
( sk_c8 = sk_c9
| identity = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_96]),c_0_23]) ).
cnf(c_0_101,negated_conjecture,
( multiply(sk_c9,multiply(sk_c2,X1)) = X1
| multiply(sk_c8,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_25,c_0_97]) ).
cnf(c_0_102,negated_conjecture,
( multiply(sk_c8,sk_c5) = identity
| multiply(sk_c2,sk_c9) = sk_c9 ),
inference(rw,[status(thm)],[c_0_98,c_0_79]) ).
cnf(c_0_103,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_25]) ).
cnf(c_0_104,negated_conjecture,
( multiply(inverse(sk_c2),sk_c3) = sk_c9
| multiply(sk_c8,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_99]) ).
cnf(c_0_105,negated_conjecture,
( multiply(sk_c8,X1) = X1
| sk_c8 = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_100]) ).
cnf(c_0_106,negated_conjecture,
( multiply(sk_c8,sk_c5) = identity
| sk_c8 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_45]) ).
cnf(c_0_107,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_103]) ).
cnf(c_0_108,negated_conjecture,
( multiply(inverse(sk_c2),sk_c9) = sk_c9
| multiply(sk_c8,sk_c9) = sk_c8 ),
inference(rw,[status(thm)],[c_0_104,c_0_79]) ).
cnf(c_0_109,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c9 ),
prove_this_31 ).
cnf(c_0_110,negated_conjecture,
( multiply(inverse(sk_c8),X1) = X1
| sk_c8 = sk_c9 ),
inference(spm,[status(thm)],[c_0_25,c_0_105]) ).
cnf(c_0_111,negated_conjecture,
( inverse(sk_c8) = sk_c5
| sk_c8 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_106]),c_0_107]) ).
cnf(c_0_112,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c9
| multiply(sk_c8,sk_c9) = sk_c8
| sk_c8 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_45]) ).
cnf(c_0_113,negated_conjecture,
( multiply(sk_c5,X1) = X1
| sk_c8 = sk_c9 ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_114,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c8
| sk_c8 = sk_c9 ),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_115,negated_conjecture,
( multiply(inverse(sk_c9),sk_c8) = sk_c9
| identity = sk_c8 ),
inference(rw,[status(thm)],[c_0_49,c_0_79]) ).
cnf(c_0_116,negated_conjecture,
sk_c8 = sk_c9,
inference(spm,[status(thm)],[c_0_105,c_0_114]) ).
cnf(c_0_117,negated_conjecture,
identity = sk_c9,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_116]),c_0_23]),c_0_116])]) ).
cnf(c_0_118,plain,
multiply(X1,sk_c9) = X1,
inference(rw,[status(thm)],[c_0_107,c_0_117]) ).
cnf(c_0_119,plain,
multiply(inverse(X1),X1) = sk_c9,
inference(rw,[status(thm)],[c_0_23,c_0_117]) ).
cnf(c_0_120,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_118]),c_0_118]) ).
cnf(c_0_121,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_23,c_0_107]) ).
cnf(c_0_122,plain,
multiply(sk_c9,X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_117]) ).
cnf(c_0_123,plain,
multiply(X1,inverse(X1)) = sk_c9,
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_124,plain,
inverse(sk_c9) = sk_c9,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_117]),c_0_117]) ).
cnf(c_0_125,negated_conjecture,
inverse(X1) != sk_c9,
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(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)],[c_0_51,c_0_116]),c_0_116]),c_0_116]),c_0_116]),c_0_116]),c_0_116]),c_0_116]),c_0_118]),c_0_122]),c_0_118]),c_0_123]),c_0_118]),c_0_118]),c_0_118])])])])])]),c_0_124])]) ).
cnf(c_0_126,plain,
$false,
inference(sr,[status(thm)],[c_0_124,c_0_125]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP225-1 : TPTP v8.2.0. Released v2.5.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n024.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 05:45:52 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.49 # Version: 3.1.0
% 0.15/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.49 # Starting sh5l with 300s (1) cores
% 0.15/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 14991 completed with status 0
% 0.15/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.49 # No SInE strategy applied
% 0.15/0.49 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.15/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.15/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.49 # Starting sh5l with 136s (1) cores
% 0.15/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 14996 completed with status 0
% 0.15/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.49 # No SInE strategy applied
% 0.15/0.49 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.15/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.15/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.49 # Preprocessing time : 0.001 s
% 0.15/0.49 # Presaturation interreduction done
% 0.15/0.49
% 0.15/0.49 # Proof found!
% 0.15/0.49 # SZS status Unsatisfiable
% 0.15/0.49 # SZS output start CNFRefutation
% See solution above
% 0.15/0.49 # Parsed axioms : 39
% 0.15/0.49 # Removed by relevancy pruning/SinE : 0
% 0.15/0.49 # Initial clauses : 39
% 0.15/0.49 # Removed in clause preprocessing : 0
% 0.15/0.49 # Initial clauses in saturation : 39
% 0.15/0.49 # Processed clauses : 1543
% 0.15/0.49 # ...of these trivial : 112
% 0.15/0.49 # ...subsumed : 836
% 0.15/0.49 # ...remaining for further processing : 595
% 0.15/0.49 # Other redundant clauses eliminated : 28
% 0.15/0.49 # Clauses deleted for lack of memory : 0
% 0.15/0.49 # Backward-subsumed : 48
% 0.15/0.49 # Backward-rewritten : 470
% 0.15/0.49 # Generated clauses : 5172
% 0.15/0.49 # ...of the previous two non-redundant : 4676
% 0.15/0.49 # ...aggressively subsumed : 0
% 0.15/0.49 # Contextual simplify-reflections : 22
% 0.15/0.49 # Paramodulations : 5157
% 0.15/0.49 # Factorizations : 0
% 0.15/0.49 # NegExts : 0
% 0.15/0.49 # Equation resolutions : 28
% 0.15/0.49 # Disequality decompositions : 0
% 0.15/0.49 # Total rewrite steps : 3572
% 0.15/0.49 # ...of those cached : 3043
% 0.15/0.49 # Propositional unsat checks : 0
% 0.15/0.49 # Propositional check models : 0
% 0.15/0.49 # Propositional check unsatisfiable : 0
% 0.15/0.49 # Propositional clauses : 0
% 0.15/0.49 # Propositional clauses after purity: 0
% 0.15/0.49 # Propositional unsat core size : 0
% 0.15/0.49 # Propositional preprocessing time : 0.000
% 0.15/0.49 # Propositional encoding time : 0.000
% 0.15/0.49 # Propositional solver time : 0.000
% 0.15/0.49 # Success case prop preproc time : 0.000
% 0.15/0.49 # Success case prop encoding time : 0.000
% 0.15/0.49 # Success case prop solver time : 0.000
% 0.15/0.49 # Current number of processed clauses : 29
% 0.15/0.49 # Positive orientable unit clauses : 28
% 0.15/0.49 # Positive unorientable unit clauses: 0
% 0.15/0.49 # Negative unit clauses : 1
% 0.15/0.49 # Non-unit-clauses : 0
% 0.15/0.49 # Current number of unprocessed clauses: 35
% 0.15/0.49 # ...number of literals in the above : 35
% 0.15/0.49 # Current number of archived formulas : 0
% 0.15/0.49 # Current number of archived clauses : 558
% 0.15/0.49 # Clause-clause subsumption calls (NU) : 8165
% 0.15/0.49 # Rec. Clause-clause subsumption calls : 5677
% 0.15/0.49 # Non-unit clause-clause subsumptions : 901
% 0.15/0.49 # Unit Clause-clause subsumption calls : 425
% 0.15/0.49 # Rewrite failures with RHS unbound : 0
% 0.15/0.49 # BW rewrite match attempts : 48
% 0.15/0.49 # BW rewrite match successes : 39
% 0.15/0.49 # Condensation attempts : 0
% 0.15/0.49 # Condensation successes : 0
% 0.15/0.49 # Termbank termtop insertions : 60456
% 0.15/0.49 # Search garbage collected termcells : 35
% 0.15/0.49
% 0.15/0.49 # -------------------------------------------------
% 0.15/0.49 # User time : 0.071 s
% 0.15/0.49 # System time : 0.004 s
% 0.15/0.49 # Total time : 0.075 s
% 0.15/0.49 # Maximum resident set size: 1676 pages
% 0.15/0.49
% 0.15/0.49 # -------------------------------------------------
% 0.15/0.49 # User time : 0.356 s
% 0.15/0.49 # System time : 0.012 s
% 0.15/0.49 # Total time : 0.367 s
% 0.15/0.49 # Maximum resident set size: 1716 pages
% 0.15/0.49 % E---3.1 exiting
% 0.15/0.49 % E exiting
%------------------------------------------------------------------------------