TSTP Solution File: GRP375-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP375-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:55:46 EDT 2024
% Result : Unsatisfiable 1.45s 0.64s
% Output : CNFRefutation 1.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 15
% Syntax : Number of clauses : 92 ( 20 unt; 51 nHn; 75 RR)
% Number of literals : 305 ( 304 equ; 169 neg)
% Maximal clause size : 14 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 100 ( 0 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_11,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c2,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| inverse(sk_c2) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c2,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c2) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_41,negated_conjecture,
( inverse(sk_c10) != sk_c9
| multiply(X1,sk_c10) != sk_c9
| inverse(X1) != sk_c10
| multiply(sk_c8,sk_c10) != sk_c9
| multiply(X2,sk_c10) != sk_c9
| inverse(X2) != sk_c10
| multiply(X3,sk_c9) != sk_c8
| inverse(X3) != sk_c9
| multiply(X4,X5) != sk_c10
| inverse(X4) != X5
| multiply(X5,sk_c9) != sk_c10
| inverse(X6) != X7
| inverse(X7) != X5
| multiply(X6,X5) != X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_41) ).
cnf(prove_this_5,negated_conjecture,
( inverse(sk_c10) = sk_c9
| multiply(sk_c4,sk_c7) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_1,negated_conjecture,
( inverse(sk_c10) = sk_c9
| multiply(sk_c2,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_31,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c9
| multiply(sk_c2,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_31) ).
cnf(prove_this_6,negated_conjecture,
( inverse(sk_c10) = sk_c9
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c9
| multiply(sk_c3,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_34,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c9
| inverse(sk_c3) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c10) = sk_c9
| inverse(sk_c2) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(c_0_15,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_16,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_17,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_18,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c2,sk_c10) = sk_c9 ),
prove_this_11 ).
cnf(c_0_20,negated_conjecture,
( multiply(inverse(sk_c2),sk_c9) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| inverse(sk_c2) = sk_c10 ),
prove_this_12 ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( multiply(inverse(sk_c1),sk_c9) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c2,sk_c10) = sk_c9 ),
prove_this_21 ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( multiply(inverse(sk_c2),sk_c9) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c2) = sk_c10 ),
prove_this_22 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| inverse(sk_c1) = sk_c10 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c10) != sk_c9
| multiply(X1,sk_c10) != sk_c9
| inverse(X1) != sk_c10
| multiply(sk_c8,sk_c10) != sk_c9
| multiply(X2,sk_c10) != sk_c9
| inverse(X2) != sk_c10
| multiply(X3,sk_c9) != sk_c8
| inverse(X3) != sk_c9
| multiply(X4,X5) != sk_c10
| inverse(X4) != X5
| multiply(X5,sk_c9) != sk_c10
| inverse(X6) != X7
| inverse(X7) != X5
| multiply(X6,X5) != X7 ),
inference(fof_simplification,[status(thm)],[prove_this_41]) ).
cnf(c_0_30,negated_conjecture,
multiply(sk_c10,sk_c9) = sk_c10,
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c10) != sk_c9
| multiply(X1,sk_c10) != sk_c9
| inverse(X1) != sk_c10
| multiply(sk_c8,sk_c10) != sk_c9
| multiply(X2,sk_c10) != sk_c9
| inverse(X2) != sk_c10
| multiply(X3,sk_c9) != sk_c8
| inverse(X3) != sk_c9
| multiply(X4,X5) != sk_c10
| inverse(X4) != X5
| multiply(X5,sk_c9) != sk_c10
| inverse(X6) != X7
| inverse(X7) != X5
| multiply(X6,X5) != X7 ),
c_0_29 ).
cnf(c_0_32,negated_conjecture,
( inverse(sk_c10) = sk_c9
| multiply(sk_c4,sk_c7) = sk_c10 ),
prove_this_5 ).
cnf(c_0_33,negated_conjecture,
identity = sk_c9,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_30]),c_0_16]) ).
cnf(c_0_34,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c9) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c8,sk_c10) != sk_c9
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c10) != sk_c9
| multiply(X5,sk_c10) != sk_c9
| inverse(sk_c10) != sk_c9
| inverse(X3) != sk_c9
| inverse(X4) != sk_c10
| inverse(X5) != sk_c10 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
( inverse(sk_c10) = sk_c9
| multiply(sk_c2,sk_c10) = sk_c9 ),
prove_this_1 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c9
| multiply(sk_c2,sk_c10) = sk_c9 ),
prove_this_31 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c10
| multiply(sk_c9,sk_c10) = identity ),
inference(spm,[status(thm)],[c_0_16,c_0_32]) ).
cnf(c_0_38,plain,
multiply(sk_c9,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c9) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c10) != sk_c9
| multiply(X5,sk_c10) != sk_c9
| inverse(X3) != sk_c9
| inverse(X4) != sk_c10
| inverse(X5) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c10
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_33]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| multiply(inverse(X1),sk_c9) != sk_c10
| inverse(inverse(X1)) != inverse(X1)
| multiply(X1,inverse(X1)) != sk_c10
| inverse(X1) != inverse(identity)
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c10) != sk_c9
| multiply(X4,sk_c10) != sk_c9
| inverse(X2) != sk_c9
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10 ),
inference(spm,[status(thm)],[c_0_39,c_0_17]) ).
cnf(c_0_42,negated_conjecture,
( multiply(inverse(sk_c4),sk_c10) = sk_c7
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c10) = sk_c9
| inverse(sk_c4) = sk_c7 ),
prove_this_6 ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| multiply(sk_c9,sk_c9) != sk_c10
| multiply(sk_c10,sk_c9) != sk_c10
| multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c10) != sk_c9
| multiply(X3,sk_c10) != sk_c9
| inverse(sk_c9) != sk_c9
| inverse(identity) != sk_c9
| inverse(X1) != sk_c9
| inverse(X2) != sk_c10
| inverse(X3) != sk_c10 ),
inference(spm,[status(thm)],[c_0_41,c_0_35]) ).
cnf(c_0_45,plain,
multiply(inverse(X1),X1) = sk_c9,
inference(rw,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c7,sk_c10) = sk_c7
| inverse(sk_c10) = sk_c9
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c9
| multiply(sk_c3,sk_c9) = sk_c8 ),
prove_this_33 ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| multiply(sk_c9,sk_c9) != sk_c10
| multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c10) != sk_c9
| multiply(X3,sk_c10) != sk_c9
| inverse(sk_c9) != sk_c9
| inverse(X1) != sk_c9
| inverse(X2) != sk_c10
| inverse(X3) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_30])]),c_0_33])]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c7,sk_c10) = sk_c7
| sk_c9 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_38])]) ).
cnf(c_0_50,negated_conjecture,
( multiply(inverse(sk_c3),sk_c8) = sk_c9
| multiply(sk_c8,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_18,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c9
| inverse(sk_c3) = sk_c9 ),
prove_this_34 ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c10) != sk_c9
| multiply(X3,sk_c10) != sk_c9
| inverse(sk_c9) != sk_c9
| inverse(X1) != sk_c9
| inverse(X2) != sk_c10
| inverse(X3) != sk_c10
| sk_c9 != sk_c10 ),
inference(rw,[status(thm)],[c_0_48,c_0_38]) ).
cnf(c_0_53,negated_conjecture,
sk_c9 = sk_c10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_49]),c_0_45])]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c10
| multiply(X1,sk_c10) != sk_c8
| multiply(X2,sk_c10) != sk_c10
| multiply(X3,sk_c10) != sk_c10
| inverse(sk_c10) != sk_c10
| inverse(X1) != sk_c10
| inverse(X2) != sk_c10
| inverse(X3) != sk_c10 ),
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)],[c_0_52,c_0_53]),c_0_53]),c_0_53]),c_0_53]),c_0_53]),c_0_53]),c_0_53]),c_0_53])]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c10
| inverse(sk_c10) = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_53]),c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( multiply(inverse(sk_c8),sk_c9) = sk_c10
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_18,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c10
| multiply(X1,sk_c10) != sk_c8
| multiply(X2,sk_c10) != sk_c10
| multiply(X3,sk_c10) != sk_c10
| inverse(X1) != sk_c10
| inverse(X2) != sk_c10
| inverse(X3) != sk_c10 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c9
| sk_c8 = sk_c9 ),
inference(rw,[status(thm)],[c_0_54,c_0_38]) ).
cnf(c_0_60,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[c_0_38,c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( multiply(inverse(sk_c8),sk_c9) = sk_c10
| sk_c8 = sk_c9 ),
inference(rw,[status(thm)],[c_0_57,c_0_38]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c10
| multiply(X1,multiply(X2,sk_c10)) != sk_c8
| inverse(multiply(X1,X2)) != sk_c10
| multiply(X3,sk_c10) != sk_c10
| multiply(X4,sk_c10) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10 ),
inference(spm,[status(thm)],[c_0_58,c_0_15]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c10
| sk_c8 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_53]),c_0_53]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c10
| multiply(X1,sk_c10) != sk_c10
| multiply(X2,sk_c10) != sk_c10
| inverse(X1) != sk_c10
| inverse(X2) != sk_c10
| sk_c8 != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_60]),c_0_56]) ).
cnf(c_0_65,negated_conjecture,
( multiply(inverse(sk_c8),sk_c10) = sk_c10
| sk_c8 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_53]),c_0_53]) ).
cnf(c_0_66,negated_conjecture,
( inverse(sk_c10) = sk_c9
| inverse(sk_c2) = sk_c10 ),
prove_this_2 ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c10
| inverse(multiply(X1,sk_c8)) != sk_c10
| multiply(X1,sk_c10) != sk_c8
| multiply(X2,sk_c10) != sk_c10
| multiply(X3,sk_c10) != sk_c10
| inverse(X2) != sk_c10
| inverse(X3) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_68,plain,
multiply(inverse(X1),X1) = sk_c10,
inference(rw,[status(thm)],[c_0_45,c_0_53]) ).
cnf(c_0_69,negated_conjecture,
( multiply(inverse(sk_c8),X1) = X1
| sk_c8 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_65]),c_0_60]),c_0_60]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c10,sk_c2) = identity
| inverse(sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_16,c_0_66]) ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c10
| multiply(inverse(sk_c8),sk_c10) != sk_c8
| multiply(X1,sk_c10) != sk_c10
| multiply(X2,sk_c10) != sk_c10
| inverse(X1) != sk_c10
| inverse(X2) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_56]) ).
cnf(c_0_72,negated_conjecture,
sk_c8 = sk_c10,
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
( inverse(sk_c2) = sk_c10
| inverse(sk_c10) = sk_c10 ),
inference(rw,[status(thm)],[c_0_66,c_0_53]) ).
cnf(c_0_74,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c9
| inverse(sk_c10) = sk_c9 ),
inference(rw,[status(thm)],[c_0_70,c_0_33]) ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c10
| multiply(X1,sk_c10) != sk_c10
| multiply(X2,sk_c10) != sk_c10
| inverse(X1) != sk_c10
| inverse(X2) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72]),c_0_16]),c_0_33]),c_0_53]),c_0_72])]) ).
cnf(c_0_76,negated_conjecture,
( inverse(sk_c10) = sk_c10
| multiply(sk_c2,X1) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_73]),c_0_60]) ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c10
| inverse(sk_c10) = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_53]),c_0_53]) ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c10
| multiply(X1,sk_c10) != sk_c10
| inverse(X1) != sk_c10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_60]),c_0_76]) ).
cnf(c_0_79,negated_conjecture,
( inverse(sk_c10) = sk_c10
| sk_c2 = sk_c10 ),
inference(rw,[status(thm)],[c_0_77,c_0_60]) ).
cnf(c_0_80,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c10
| sk_c2 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_60])]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c2,X1) = X1
| sk_c2 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_80]),c_0_60]),c_0_60]) ).
cnf(c_0_82,negated_conjecture,
( multiply(inverse(sk_c2),X1) = X1
| sk_c2 = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_81]) ).
cnf(c_0_83,negated_conjecture,
sk_c2 = sk_c10,
inference(spm,[status(thm)],[c_0_68,c_0_82]) ).
cnf(c_0_84,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c8,sk_c10) != sk_c10
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X3,sk_c10) != sk_c8
| multiply(X4,sk_c10) != sk_c10
| multiply(X5,sk_c10) != sk_c10
| inverse(sk_c10) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != sk_c10 ),
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_34,c_0_53]),c_0_53]),c_0_53]),c_0_53]),c_0_53]),c_0_53]),c_0_53]) ).
cnf(c_0_85,negated_conjecture,
inverse(sk_c10) = sk_c10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_83])]) ).
cnf(c_0_86,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_18]) ).
cnf(c_0_87,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X3,sk_c10) != sk_c10
| multiply(X4,sk_c10) != sk_c10
| multiply(X5,sk_c10) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_72]),c_0_60]),c_0_72])]),c_0_85])]) ).
cnf(c_0_88,plain,
multiply(X1,sk_c10) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_68]),c_0_86]) ).
cnf(c_0_89,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != 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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88]),c_0_88]),c_0_88]),c_0_88])])])]),c_0_85])]) ).
cnf(c_0_90,negated_conjecture,
( inverse(X1) != sk_c10
| inverse(X1) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_85]),c_0_88]),c_0_88]),c_0_60])]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_90,c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP375-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 05:25:22 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/benchmark/theBenchmark.p
% 1.45/0.64 # Version: 3.1.0
% 1.45/0.64 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.45/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.45/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.45/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.45/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.45/0.64 # Starting sh5l with 300s (1) cores
% 1.45/0.64 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 9581 completed with status 0
% 1.45/0.64 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.45/0.64 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.45/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.45/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.45/0.64 # No SInE strategy applied
% 1.45/0.64 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.45/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.45/0.64 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.45/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.45/0.64 # Starting new_bool_3 with 136s (1) cores
% 1.45/0.64 # Starting new_bool_1 with 136s (1) cores
% 1.45/0.64 # Starting sh5l with 136s (1) cores
% 1.45/0.64 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9585 completed with status 0
% 1.45/0.64 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.45/0.64 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.45/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.45/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.45/0.64 # No SInE strategy applied
% 1.45/0.64 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.45/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.45/0.64 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.45/0.64 # Preprocessing time : 0.001 s
% 1.45/0.64 # Presaturation interreduction done
% 1.45/0.64
% 1.45/0.64 # Proof found!
% 1.45/0.64 # SZS status Unsatisfiable
% 1.45/0.64 # SZS output start CNFRefutation
% See solution above
% 1.45/0.65 # Parsed axioms : 44
% 1.45/0.65 # Removed by relevancy pruning/SinE : 0
% 1.45/0.65 # Initial clauses : 44
% 1.45/0.65 # Removed in clause preprocessing : 0
% 1.45/0.65 # Initial clauses in saturation : 44
% 1.45/0.65 # Processed clauses : 2395
% 1.45/0.65 # ...of these trivial : 38
% 1.45/0.65 # ...subsumed : 1681
% 1.45/0.65 # ...remaining for further processing : 676
% 1.45/0.65 # Other redundant clauses eliminated : 5
% 1.45/0.65 # Clauses deleted for lack of memory : 0
% 1.45/0.65 # Backward-subsumed : 77
% 1.45/0.65 # Backward-rewritten : 421
% 1.45/0.65 # Generated clauses : 6118
% 1.45/0.65 # ...of the previous two non-redundant : 5934
% 1.45/0.65 # ...aggressively subsumed : 0
% 1.45/0.65 # Contextual simplify-reflections : 24
% 1.45/0.65 # Paramodulations : 6114
% 1.45/0.65 # Factorizations : 0
% 1.45/0.65 # NegExts : 0
% 1.45/0.65 # Equation resolutions : 5
% 1.45/0.65 # Disequality decompositions : 0
% 1.45/0.65 # Total rewrite steps : 2746
% 1.45/0.65 # ...of those cached : 2589
% 1.45/0.65 # Propositional unsat checks : 0
% 1.45/0.65 # Propositional check models : 0
% 1.45/0.65 # Propositional check unsatisfiable : 0
% 1.45/0.65 # Propositional clauses : 0
% 1.45/0.65 # Propositional clauses after purity: 0
% 1.45/0.65 # Propositional unsat core size : 0
% 1.45/0.65 # Propositional preprocessing time : 0.000
% 1.45/0.65 # Propositional encoding time : 0.000
% 1.45/0.65 # Propositional solver time : 0.000
% 1.45/0.65 # Success case prop preproc time : 0.000
% 1.45/0.65 # Success case prop encoding time : 0.000
% 1.45/0.65 # Success case prop solver time : 0.000
% 1.45/0.65 # Current number of processed clauses : 133
% 1.45/0.65 # Positive orientable unit clauses : 12
% 1.45/0.65 # Positive unorientable unit clauses: 0
% 1.45/0.65 # Negative unit clauses : 0
% 1.45/0.65 # Non-unit-clauses : 121
% 1.45/0.65 # Current number of unprocessed clauses: 2633
% 1.45/0.65 # ...number of literals in the above : 10729
% 1.45/0.65 # Current number of archived formulas : 0
% 1.45/0.65 # Current number of archived clauses : 542
% 1.45/0.65 # Clause-clause subsumption calls (NU) : 21343
% 1.45/0.65 # Rec. Clause-clause subsumption calls : 16034
% 1.45/0.65 # Non-unit clause-clause subsumptions : 1771
% 1.45/0.65 # Unit Clause-clause subsumption calls : 466
% 1.45/0.65 # Rewrite failures with RHS unbound : 0
% 1.45/0.65 # BW rewrite match attempts : 53
% 1.45/0.65 # BW rewrite match successes : 35
% 1.45/0.65 # Condensation attempts : 0
% 1.45/0.65 # Condensation successes : 0
% 1.45/0.65 # Termbank termtop insertions : 86230
% 1.45/0.65 # Search garbage collected termcells : 39
% 1.45/0.65
% 1.45/0.65 # -------------------------------------------------
% 1.45/0.65 # User time : 0.142 s
% 1.45/0.65 # System time : 0.003 s
% 1.45/0.65 # Total time : 0.145 s
% 1.45/0.65 # Maximum resident set size: 1660 pages
% 1.45/0.65
% 1.45/0.65 # -------------------------------------------------
% 1.45/0.65 # User time : 0.712 s
% 1.45/0.65 # System time : 0.008 s
% 1.45/0.65 # Total time : 0.720 s
% 1.45/0.65 # Maximum resident set size: 1716 pages
% 1.45/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------