TSTP Solution File: GRP262-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP262-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:10 EDT 2024
% Result : Unsatisfiable 0.37s 0.69s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 20
% Syntax : Number of clauses : 108 ( 23 unt; 81 nHn; 88 RR)
% Number of literals : 269 ( 268 equ; 73 neg)
% Maximal clause size : 10 ( 2 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 : 60 ( 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_c2,sk_c6) = sk_c5
| multiply(sk_c6,sk_c7) = sk_c5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c2) = sk_c6
| multiply(sk_c6,sk_c7) = sk_c5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(sk_c4,sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| multiply(sk_c6,sk_c7) = sk_c5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| inverse(sk_c4) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c4) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c5
| multiply(sk_c4,sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_10,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c4,sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c2) = sk_c6
| multiply(sk_c4,sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(sk_c3,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_19,negated_conjecture,
( inverse(sk_c2) = sk_c6
| inverse(sk_c4) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c5
| inverse(sk_c4) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_26,negated_conjecture,
( multiply(X1,sk_c7) != sk_c6
| inverse(X1) != sk_c7
| multiply(X2,sk_c6) != sk_c5
| inverse(X2) != sk_c6
| multiply(sk_c5,sk_c7) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| inverse(X3) != sk_c7
| multiply(X3,sk_c6) != sk_c7
| inverse(X4) != sk_c6
| multiply(X4,sk_c5) != sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c3,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| inverse(sk_c4) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_24) ).
cnf(c_0_20,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_21,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_22,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_23,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c5
| multiply(sk_c6,sk_c7) = sk_c5 ),
prove_this_11 ).
cnf(c_0_25,negated_conjecture,
( multiply(inverse(sk_c2),sk_c5) = sk_c6
| multiply(sk_c6,sk_c7) = sk_c5 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( inverse(sk_c2) = sk_c6
| multiply(sk_c6,sk_c7) = sk_c5 ),
prove_this_16 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| multiply(sk_c6,sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(sk_c4,sk_c5) = sk_c6 ),
prove_this_5 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c6,multiply(sk_c5,X1)) = multiply(sk_c6,X1)
| multiply(sk_c6,sk_c7) = sk_c5 ),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| multiply(sk_c6,sk_c7) = sk_c5 ),
prove_this_21 ).
cnf(c_0_31,negated_conjecture,
( multiply(inverse(sk_c4),sk_c6) = sk_c5
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c6,sk_c7) = multiply(sk_c6,sk_c6)
| multiply(sk_c6,sk_c7) = sk_c5 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( multiply(inverse(inverse(sk_c4)),sk_c5) = sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| inverse(sk_c4) = sk_c6 ),
prove_this_4 ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| sk_c7 = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_32]),c_0_23]) ).
cnf(c_0_36,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_37,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_38,negated_conjecture,
( multiply(inverse(sk_c6),sk_c5) = sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( multiply(inverse(sk_c6),sk_c5) = sk_c7
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_40,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_40]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c4) = sk_c6 ),
prove_this_9 ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c5
| multiply(sk_c4,sk_c5) = sk_c6 ),
prove_this_15 ).
cnf(c_0_45,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c4,sk_c5) = sk_c6 ),
prove_this_10 ).
cnf(c_0_46,negated_conjecture,
( multiply(inverse(sk_c1),sk_c6) = sk_c7
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c6) = sk_c4 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( multiply(inverse(sk_c2),sk_c5) = sk_c6
| multiply(sk_c4,sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( inverse(sk_c2) = sk_c6
| multiply(sk_c4,sk_c5) = sk_c6 ),
prove_this_20 ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c7,multiply(sk_c1,X1)) = X1
| multiply(sk_c4,sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| inverse(sk_c6) = sk_c4
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c6
| multiply(sk_c6,sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c7
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_50,c_0_41]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c4,sk_c5) = sk_c7
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_39,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(sk_c3,sk_c6) = sk_c7 ),
prove_this_3 ).
cnf(c_0_57,negated_conjecture,
( inverse(sk_c2) = sk_c6
| inverse(sk_c4) = sk_c6 ),
prove_this_19 ).
cnf(c_0_58,negated_conjecture,
( multiply(inverse(sk_c4),sk_c6) = sk_c5
| multiply(sk_c6,sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c5
| inverse(sk_c4) = sk_c6 ),
prove_this_14 ).
cnf(c_0_60,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_62,negated_conjecture,
( multiply(inverse(sk_c3),sk_c7) = sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_56]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| inverse(sk_c3) = sk_c7 ),
prove_this_2 ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c6,multiply(sk_c2,X1)) = X1
| inverse(sk_c4) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_57]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c5
| multiply(sk_c6,sk_c5) = sk_c6
| multiply(sk_c6,sk_c6) = sk_c5 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_21,c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( sk_c7 = sk_c6
| identity = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_61]),c_0_21]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,negated_conjecture,
( multiply(sk_c6,sk_c6) = sk_c5
| multiply(sk_c6,sk_c5) = sk_c6
| inverse(sk_c4) = sk_c6 ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,negated_conjecture,
( inverse(sk_c6) = sk_c6
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
( multiply(X1,sk_c7) != sk_c6
| inverse(X1) != sk_c7
| multiply(X2,sk_c6) != sk_c5
| inverse(X2) != sk_c6
| multiply(sk_c5,sk_c7) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| inverse(X3) != sk_c7
| multiply(X3,sk_c6) != sk_c7
| inverse(X4) != sk_c6
| multiply(X4,sk_c5) != sk_c6 ),
inference(fof_simplification,[status(thm)],[prove_this_26]) ).
cnf(c_0_72,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c3) = sk_c7 ),
prove_this_7 ).
cnf(c_0_73,negated_conjecture,
( multiply(inverse(sk_c1),sk_c6) = sk_c7
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_68]) ).
cnf(c_0_74,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c3,sk_c6) = sk_c7 ),
prove_this_8 ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c6
| multiply(sk_c6,sk_c6) = sk_c5 ),
inference(spm,[status(thm)],[c_0_58,c_0_69]) ).
cnf(c_0_76,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_39,c_0_70]) ).
cnf(c_0_77,negated_conjecture,
( multiply(X1,sk_c7) != sk_c6
| inverse(X1) != sk_c7
| multiply(X2,sk_c6) != sk_c5
| inverse(X2) != sk_c6
| multiply(sk_c5,sk_c7) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| inverse(X3) != sk_c7
| multiply(X3,sk_c6) != sk_c7
| inverse(X4) != sk_c6
| multiply(X4,sk_c5) != sk_c6 ),
c_0_71 ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| identity = sk_c5 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_21]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| inverse(sk_c4) = sk_c6 ),
prove_this_24 ).
cnf(c_0_80,negated_conjecture,
( multiply(sk_c7,multiply(sk_c3,X1)) = X1
| inverse(sk_c1) = sk_c7 ),
inference(spm,[status(thm)],[c_0_23,c_0_72]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| multiply(sk_c7,sk_c7) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_82,negated_conjecture,
( multiply(sk_c6,sk_c6) = sk_c5
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_83,negated_conjecture,
( identity = sk_c5
| multiply(sk_c5,sk_c7) != sk_c6
| multiply(X1,sk_c5) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c6) != sk_c5
| multiply(X4,sk_c7) != sk_c6
| inverse(X1) != sk_c6
| inverse(X2) != sk_c7
| inverse(X3) != sk_c6
| inverse(X4) != sk_c7 ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_84,negated_conjecture,
( multiply(sk_c5,sk_c7) = sk_c6
| multiply(sk_c6,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_21,c_0_79]) ).
cnf(c_0_85,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c7,sk_c7) = sk_c6
| inverse(sk_c1) = sk_c7 ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_86,negated_conjecture,
( multiply(inverse(sk_c6),sk_c5) = sk_c6
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_82]) ).
cnf(c_0_87,negated_conjecture,
( multiply(sk_c6,sk_c4) = identity
| identity = sk_c5
| multiply(X1,sk_c5) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c6) != sk_c5
| multiply(X4,sk_c7) != sk_c6
| inverse(X1) != sk_c6
| inverse(X2) != sk_c7
| inverse(X3) != sk_c6
| inverse(X4) != sk_c7 ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_88,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_73,c_0_85]) ).
cnf(c_0_89,negated_conjecture,
sk_c7 = sk_c6,
inference(spm,[status(thm)],[c_0_39,c_0_86]) ).
cnf(c_0_90,negated_conjecture,
( multiply(sk_c6,sk_c4) = identity
| identity = sk_c5
| multiply(inverse(sk_c6),sk_c5) != sk_c6
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,sk_c6) != sk_c5
| multiply(X3,sk_c7) != sk_c6
| inverse(X1) != sk_c7
| inverse(X2) != sk_c6
| inverse(X3) != sk_c7 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_42])]) ).
cnf(c_0_91,negated_conjecture,
( multiply(inverse(sk_c6),sk_c5) = sk_c7
| identity = sk_c5 ),
inference(spm,[status(thm)],[c_0_23,c_0_78]) ).
cnf(c_0_92,negated_conjecture,
multiply(sk_c6,sk_c6) = sk_c6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_89]),c_0_89]),c_0_89]),c_0_89])]) ).
cnf(c_0_93,negated_conjecture,
( multiply(sk_c6,sk_c4) = identity
| identity = sk_c5
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,sk_c6) != sk_c5
| multiply(X3,sk_c7) != sk_c6
| inverse(X1) != sk_c7
| inverse(X2) != sk_c6
| inverse(X3) != sk_c7
| sk_c7 != sk_c6 ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_94,negated_conjecture,
identity = sk_c6,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_92]),c_0_21]) ).
cnf(c_0_95,negated_conjecture,
( multiply(sk_c6,sk_c4) = sk_c6
| sk_c5 = sk_c6
| multiply(X1,sk_c6) != sk_c6
| multiply(X2,sk_c6) != sk_c5
| multiply(X3,sk_c6) != sk_c6
| inverse(X1) != sk_c6
| inverse(X2) != sk_c6
| inverse(X3) != sk_c6 ),
inference(rw,[status(thm)],[inference(rw,[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)],[c_0_93,c_0_89]),c_0_89]),c_0_89]),c_0_89]),c_0_89])]),c_0_94]),c_0_94]) ).
cnf(c_0_96,negated_conjecture,
( multiply(sk_c6,sk_c4) = sk_c6
| sk_c5 = sk_c6
| multiply(X1,sk_c6) != sk_c5
| multiply(X2,sk_c6) != sk_c6
| inverse(X1) != sk_c6
| inverse(X2) != sk_c6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_42])]),c_0_21]),c_0_94])]) ).
cnf(c_0_97,negated_conjecture,
( multiply(sk_c6,sk_c4) = sk_c6
| inverse(sk_c4) = sk_c6
| sk_c5 = sk_c6
| multiply(X1,sk_c6) != sk_c6
| inverse(X1) != sk_c6 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_57]),c_0_59]) ).
cnf(c_0_98,plain,
inverse(sk_c6) = sk_c6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_94]),c_0_94]) ).
cnf(c_0_99,negated_conjecture,
( multiply(sk_c6,sk_c4) = sk_c6
| inverse(sk_c4) = sk_c6
| sk_c5 = sk_c6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_92])]) ).
cnf(c_0_100,negated_conjecture,
( multiply(sk_c6,sk_c4) = sk_c6
| sk_c5 = sk_c6
| sk_c4 = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_99]),c_0_98]) ).
cnf(c_0_101,negated_conjecture,
( sk_c5 = sk_c6
| sk_c4 = sk_c6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_100]),c_0_21]),c_0_94])]) ).
cnf(c_0_102,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3,
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_103,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c6
| sk_c5 = sk_c6 ),
inference(spm,[status(thm)],[c_0_52,c_0_101]) ).
cnf(c_0_104,negated_conjecture,
multiply(sk_c6,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_92]),c_0_23]) ).
cnf(c_0_105,negated_conjecture,
sk_c5 = sk_c6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_103]),c_0_21]),c_0_94])]) ).
cnf(c_0_106,plain,
multiply(X1,sk_c6) = X1,
inference(rw,[status(thm)],[c_0_40,c_0_94]) ).
cnf(c_0_107,negated_conjecture,
$false,
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_89]),c_0_89]),c_0_89]),c_0_89]),c_0_89]),c_0_89]),c_0_104]),c_0_105]),c_0_105]),c_0_104]),c_0_105]),c_0_106]),c_0_106]),c_0_106]),c_0_105]),c_0_106])])])])])]),c_0_98])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP262-1 : TPTP v8.2.0. Released v2.5.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 04:09:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 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.37/0.69 # Version: 3.1.0
% 0.37/0.69 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.37/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.37/0.69 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.69 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.69 # Starting sh5l with 300s (1) cores
% 0.37/0.69 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 24391 completed with status 0
% 0.37/0.69 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.37/0.69 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.37/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.37/0.69 # No SInE strategy applied
% 0.37/0.69 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.37/0.69 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.69 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.37/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.37/0.69 # Starting new_bool_3 with 136s (1) cores
% 0.37/0.69 # Starting new_bool_1 with 136s (1) cores
% 0.37/0.69 # Starting sh5l with 136s (1) cores
% 0.37/0.69 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 24396 completed with status 0
% 0.37/0.69 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.37/0.69 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.37/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.37/0.69 # No SInE strategy applied
% 0.37/0.69 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.37/0.69 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.69 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.37/0.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.37/0.69 # Preprocessing time : 0.001 s
% 0.37/0.69 # Presaturation interreduction done
% 0.37/0.69
% 0.37/0.69 # Proof found!
% 0.37/0.69 # SZS status Unsatisfiable
% 0.37/0.69 # SZS output start CNFRefutation
% See solution above
% 0.37/0.69 # Parsed axioms : 29
% 0.37/0.69 # Removed by relevancy pruning/SinE : 0
% 0.37/0.69 # Initial clauses : 29
% 0.37/0.69 # Removed in clause preprocessing : 0
% 0.37/0.69 # Initial clauses in saturation : 29
% 0.37/0.69 # Processed clauses : 2250
% 0.37/0.69 # ...of these trivial : 139
% 0.37/0.69 # ...subsumed : 1445
% 0.37/0.69 # ...remaining for further processing : 666
% 0.37/0.69 # Other redundant clauses eliminated : 27
% 0.37/0.69 # Clauses deleted for lack of memory : 0
% 0.37/0.69 # Backward-subsumed : 148
% 0.37/0.69 # Backward-rewritten : 362
% 0.37/0.69 # Generated clauses : 7568
% 0.37/0.69 # ...of the previous two non-redundant : 7074
% 0.37/0.69 # ...aggressively subsumed : 0
% 0.37/0.69 # Contextual simplify-reflections : 21
% 0.37/0.69 # Paramodulations : 7539
% 0.37/0.69 # Factorizations : 5
% 0.37/0.69 # NegExts : 0
% 0.37/0.69 # Equation resolutions : 27
% 0.37/0.69 # Disequality decompositions : 0
% 0.37/0.69 # Total rewrite steps : 3259
% 0.37/0.69 # ...of those cached : 3053
% 0.37/0.69 # Propositional unsat checks : 0
% 0.37/0.69 # Propositional check models : 0
% 0.37/0.69 # Propositional check unsatisfiable : 0
% 0.37/0.69 # Propositional clauses : 0
% 0.37/0.69 # Propositional clauses after purity: 0
% 0.37/0.69 # Propositional unsat core size : 0
% 0.37/0.69 # Propositional preprocessing time : 0.000
% 0.37/0.69 # Propositional encoding time : 0.000
% 0.37/0.69 # Propositional solver time : 0.000
% 0.37/0.69 # Success case prop preproc time : 0.000
% 0.37/0.69 # Success case prop encoding time : 0.000
% 0.37/0.69 # Success case prop solver time : 0.000
% 0.37/0.69 # Current number of processed clauses : 126
% 0.37/0.69 # Positive orientable unit clauses : 10
% 0.37/0.69 # Positive unorientable unit clauses: 0
% 0.37/0.69 # Negative unit clauses : 0
% 0.37/0.69 # Non-unit-clauses : 116
% 0.37/0.69 # Current number of unprocessed clauses: 4410
% 0.37/0.69 # ...number of literals in the above : 22752
% 0.37/0.69 # Current number of archived formulas : 0
% 0.37/0.69 # Current number of archived clauses : 539
% 0.37/0.69 # Clause-clause subsumption calls (NU) : 20366
% 0.37/0.69 # Rec. Clause-clause subsumption calls : 6935
% 0.37/0.69 # Non-unit clause-clause subsumptions : 1613
% 0.37/0.69 # Unit Clause-clause subsumption calls : 133
% 0.37/0.69 # Rewrite failures with RHS unbound : 0
% 0.37/0.69 # BW rewrite match attempts : 31
% 0.37/0.69 # BW rewrite match successes : 30
% 0.37/0.69 # Condensation attempts : 0
% 0.37/0.69 # Condensation successes : 0
% 0.37/0.69 # Termbank termtop insertions : 106924
% 0.37/0.69 # Search garbage collected termcells : 27
% 0.37/0.69
% 0.37/0.69 # -------------------------------------------------
% 0.37/0.69 # User time : 0.157 s
% 0.37/0.69 # System time : 0.004 s
% 0.37/0.69 # Total time : 0.161 s
% 0.37/0.69 # Maximum resident set size: 1608 pages
% 0.37/0.69
% 0.37/0.69 # -------------------------------------------------
% 0.37/0.69 # User time : 0.780 s
% 0.37/0.69 # System time : 0.012 s
% 0.37/0.69 # Total time : 0.792 s
% 0.37/0.69 # Maximum resident set size: 1712 pages
% 0.37/0.69 % E---3.1 exiting
% 0.37/0.69 % E exiting
%------------------------------------------------------------------------------