TSTP Solution File: GRP355-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP355-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:38 EDT 2024
% Result : Unsatisfiable 0.17s 0.51s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 14
% Syntax : Number of clauses : 87 ( 25 unt; 38 nHn; 74 RR)
% Number of literals : 272 ( 271 equ; 156 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 94 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c2) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c2,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_22,negated_conjecture,
( multiply(sk_c7,sk_c6) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| inverse(X2) != sk_c8
| multiply(X3,sk_c6) != sk_c7
| inverse(X3) != sk_c6
| multiply(sk_c8,X4) != sk_c6
| multiply(X5,sk_c8) != X4
| inverse(X5) != sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c2) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c4,sk_c8) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c8,sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| inverse(sk_c2) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c7 ),
prove_this_8 ).
cnf(c_0_19,negated_conjecture,
( multiply(inverse(sk_c2),sk_c7) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c2) = sk_c8 ),
prove_this_9 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(inverse(sk_c1),sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c2,sk_c8) = sk_c7 ),
prove_this_15 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c7,sk_c6) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| inverse(X2) != sk_c8
| multiply(X3,sk_c6) != sk_c7
| inverse(X3) != sk_c6
| multiply(sk_c8,X4) != sk_c6
| multiply(X5,sk_c8) != X4
| inverse(X5) != sk_c8 ),
inference(fof_simplification,[status(thm)],[prove_this_22]) ).
cnf(c_0_26,negated_conjecture,
( multiply(inverse(sk_c2),sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c2) = sk_c8 ),
prove_this_16 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c7,sk_c6) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| inverse(X2) != sk_c8
| multiply(X3,sk_c6) != sk_c7
| inverse(X3) != sk_c6
| multiply(sk_c8,X4) != sk_c6
| multiply(X5,sk_c8) != X4
| inverse(X5) != sk_c8 ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| inverse(sk_c4) = sk_c8 ),
prove_this_7 ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c8,multiply(X1,sk_c8)) != sk_c6
| multiply(sk_c7,sk_c6) != sk_c8
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| multiply(X4,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c6
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c8,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c4) = sk_c8 ),
prove_this_14 ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c4) = sk_c8 ),
prove_this_21 ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c4,sk_c8) = sk_c5 ),
prove_this_6 ).
cnf(c_0_36,negated_conjecture,
multiply(sk_c8,sk_c7) = sk_c8,
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c8,sk_c4) = identity
| multiply(sk_c8,multiply(X1,sk_c8)) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| multiply(X4,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c6
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c8,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c8,sk_c4) = identity
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( multiply(inverse(sk_c4),sk_c5) = sk_c8
| multiply(sk_c7,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
identity = sk_c7,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_36]),c_0_15]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c8,sk_c4) = identity
| multiply(sk_c8,sk_c7) != sk_c6
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| inverse(X1) != sk_c6
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c8,sk_c5) = sk_c8 ),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_44,plain,
multiply(sk_c7,X1) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c8,sk_c5) = sk_c6 ),
prove_this_5 ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c8,sk_c4) = identity
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| inverse(X1) != sk_c6
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| sk_c6 != sk_c8 ),
inference(rw,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c8
| sk_c6 = sk_c8 ),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c6
| sk_c6 = sk_c8 ),
inference(rw,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_49,plain,
multiply(inverse(X1),X1) = sk_c7,
inference(rw,[status(thm)],[c_0_15,c_0_41]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| inverse(sk_c2) = sk_c8 ),
prove_this_2 ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c8,sk_c4) = sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| inverse(X1) != sk_c6
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| sk_c6 != sk_c8 ),
inference(rw,[status(thm)],[c_0_46,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
sk_c6 = sk_c8,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
multiply(inverse(inverse(X1)),sk_c7) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_49]) ).
cnf(c_0_54,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(sk_c8,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c8,sk_c4) = sk_c7
| multiply(X1,sk_c8) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_52]),c_0_52])]) ).
cnf(c_0_57,plain,
multiply(X1,sk_c7) = X1,
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c8,sk_c2) = identity
| multiply(sk_c8,multiply(X1,sk_c8)) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| multiply(X4,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c6
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(spm,[status(thm)],[c_0_31,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c8,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c8,sk_c2) = identity
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c8,sk_c4) = sk_c7
| multiply(X1,multiply(X2,sk_c8)) != sk_c7
| inverse(multiply(X1,X2)) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| multiply(X4,sk_c8) != sk_c7
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(spm,[status(thm)],[c_0_56,c_0_14]) ).
cnf(c_0_62,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_57]),c_0_57]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c8,sk_c2) = identity
| multiply(sk_c8,sk_c7) != sk_c6
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| inverse(X1) != sk_c6
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c8,sk_c4) = sk_c7
| multiply(X1,sk_c8) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_49]),c_0_57])]),c_0_44]),c_0_62])]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c8,sk_c2) = identity
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| inverse(X1) != sk_c6
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| sk_c6 != sk_c8 ),
inference(rw,[status(thm)],[c_0_63,c_0_36]) ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c8,sk_c4) = sk_c7
| multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_49]),c_0_62])]) ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c8,sk_c2) = sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| inverse(X1) != sk_c6
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| sk_c6 != sk_c8 ),
inference(rw,[status(thm)],[c_0_65,c_0_41]) ).
cnf(c_0_68,negated_conjecture,
multiply(sk_c8,sk_c4) = sk_c7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_62])]),c_0_15]),c_0_41])]) ).
cnf(c_0_69,negated_conjecture,
( multiply(sk_c8,sk_c2) = sk_c7
| multiply(X1,sk_c8) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_52]),c_0_52]),c_0_52])]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c8,sk_c2) = sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(rw,[status(thm)],[c_0_59,c_0_41]) ).
cnf(c_0_71,negated_conjecture,
( multiply(sk_c8,sk_c2) = sk_c7
| inverse(sk_c1) = sk_c8 ),
inference(rw,[status(thm)],[c_0_60,c_0_41]) ).
cnf(c_0_72,negated_conjecture,
inverse(sk_c8) = sk_c4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_68]),c_0_57]) ).
cnf(c_0_73,negated_conjecture,
( multiply(sk_c8,sk_c2) = sk_c7
| multiply(X1,sk_c8) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_74,negated_conjecture,
multiply(sk_c4,sk_c8) = sk_c7,
inference(spm,[status(thm)],[c_0_49,c_0_72]) ).
cnf(c_0_75,negated_conjecture,
inverse(sk_c4) = sk_c8,
inference(spm,[status(thm)],[c_0_62,c_0_72]) ).
cnf(c_0_76,negated_conjecture,
( multiply(sk_c8,sk_c2) = sk_c7
| multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]) ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c8,multiply(X1,sk_c8)) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| multiply(X4,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c6
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8
| sk_c6 != sk_c8 ),
inference(rw,[status(thm)],[c_0_31,c_0_44]) ).
cnf(c_0_78,negated_conjecture,
multiply(sk_c8,sk_c2) = sk_c7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_75]),c_0_74])]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c8,multiply(X1,sk_c8)) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| multiply(X4,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_52]),c_0_52]),c_0_52]),c_0_52])]) ).
cnf(c_0_80,negated_conjecture,
sk_c4 = sk_c2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_78]),c_0_57]),c_0_72]) ).
cnf(c_0_81,negated_conjecture,
( multiply(X1,sk_c8) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_49]),c_0_36])]),c_0_62])]) ).
cnf(c_0_82,negated_conjecture,
multiply(sk_c2,sk_c8) = sk_c7,
inference(rw,[status(thm)],[c_0_74,c_0_80]) ).
cnf(c_0_83,negated_conjecture,
inverse(sk_c2) = sk_c8,
inference(rw,[status(thm)],[c_0_75,c_0_80]) ).
cnf(c_0_84,negated_conjecture,
( multiply(X1,sk_c8) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83])]) ).
cnf(c_0_85,negated_conjecture,
( multiply(X1,sk_c8) != sk_c7
| inverse(X1) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_82]),c_0_83])]) ).
cnf(c_0_86,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_83]),c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : GRP355-1 : TPTP v8.2.0. Released v2.5.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 04:12:23 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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/benchmark/theBenchmark.p
% 0.17/0.51 # Version: 3.1.0
% 0.17/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.51 # Starting sh5l with 300s (1) cores
% 0.17/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 26515 completed with status 0
% 0.17/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.51 # No SInE strategy applied
% 0.17/0.51 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.51 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.51 # Starting sh5l with 136s (1) cores
% 0.17/0.51 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26519 completed with status 0
% 0.17/0.51 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.51 # No SInE strategy applied
% 0.17/0.51 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.51 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.51 # Preprocessing time : 0.001 s
% 0.17/0.51 # Presaturation interreduction done
% 0.17/0.51
% 0.17/0.51 # Proof found!
% 0.17/0.51 # SZS status Unsatisfiable
% 0.17/0.51 # SZS output start CNFRefutation
% See solution above
% 0.17/0.51 # Parsed axioms : 25
% 0.17/0.51 # Removed by relevancy pruning/SinE : 0
% 0.17/0.51 # Initial clauses : 25
% 0.17/0.51 # Removed in clause preprocessing : 0
% 0.17/0.51 # Initial clauses in saturation : 25
% 0.17/0.51 # Processed clauses : 1153
% 0.17/0.51 # ...of these trivial : 57
% 0.17/0.51 # ...subsumed : 673
% 0.17/0.51 # ...remaining for further processing : 423
% 0.17/0.51 # Other redundant clauses eliminated : 37
% 0.17/0.51 # Clauses deleted for lack of memory : 0
% 0.17/0.51 # Backward-subsumed : 58
% 0.17/0.51 # Backward-rewritten : 258
% 0.17/0.51 # Generated clauses : 3642
% 0.17/0.51 # ...of the previous two non-redundant : 3188
% 0.17/0.51 # ...aggressively subsumed : 0
% 0.17/0.51 # Contextual simplify-reflections : 11
% 0.17/0.51 # Paramodulations : 3600
% 0.17/0.51 # Factorizations : 5
% 0.17/0.51 # NegExts : 0
% 0.17/0.51 # Equation resolutions : 37
% 0.17/0.51 # Disequality decompositions : 0
% 0.17/0.51 # Total rewrite steps : 1933
% 0.17/0.51 # ...of those cached : 1811
% 0.17/0.51 # Propositional unsat checks : 0
% 0.17/0.51 # Propositional check models : 0
% 0.17/0.51 # Propositional check unsatisfiable : 0
% 0.17/0.51 # Propositional clauses : 0
% 0.17/0.51 # Propositional clauses after purity: 0
% 0.17/0.51 # Propositional unsat core size : 0
% 0.17/0.51 # Propositional preprocessing time : 0.000
% 0.17/0.51 # Propositional encoding time : 0.000
% 0.17/0.51 # Propositional solver time : 0.000
% 0.17/0.51 # Success case prop preproc time : 0.000
% 0.17/0.51 # Success case prop encoding time : 0.000
% 0.17/0.51 # Success case prop solver time : 0.000
% 0.17/0.51 # Current number of processed clauses : 81
% 0.17/0.51 # Positive orientable unit clauses : 20
% 0.17/0.51 # Positive unorientable unit clauses: 0
% 0.17/0.51 # Negative unit clauses : 0
% 0.17/0.51 # Non-unit-clauses : 61
% 0.17/0.51 # Current number of unprocessed clauses: 1439
% 0.17/0.51 # ...number of literals in the above : 6283
% 0.17/0.51 # Current number of archived formulas : 0
% 0.17/0.51 # Current number of archived clauses : 341
% 0.17/0.51 # Clause-clause subsumption calls (NU) : 3808
% 0.17/0.51 # Rec. Clause-clause subsumption calls : 2846
% 0.17/0.51 # Non-unit clause-clause subsumptions : 718
% 0.17/0.51 # Unit Clause-clause subsumption calls : 391
% 0.17/0.51 # Rewrite failures with RHS unbound : 0
% 0.17/0.51 # BW rewrite match attempts : 41
% 0.17/0.51 # BW rewrite match successes : 38
% 0.17/0.51 # Condensation attempts : 0
% 0.17/0.51 # Condensation successes : 0
% 0.17/0.51 # Termbank termtop insertions : 49075
% 0.17/0.51 # Search garbage collected termcells : 28
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.061 s
% 0.17/0.51 # System time : 0.004 s
% 0.17/0.51 # Total time : 0.065 s
% 0.17/0.51 # Maximum resident set size: 1604 pages
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.232 s
% 0.17/0.51 # System time : 0.008 s
% 0.17/0.51 # Total time : 0.240 s
% 0.17/0.51 # Maximum resident set size: 1708 pages
% 0.17/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------