TSTP Solution File: GRP363-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP363-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:40 EDT 2024
% Result : Unsatisfiable 1.20s 0.60s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 22
% Syntax : Number of clauses : 130 ( 24 unt; 94 nHn; 115 RR)
% Number of literals : 278 ( 277 equ; 56 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 : 42 ( 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_21,negated_conjecture,
( inverse(sk_c1) = sk_c6
| inverse(sk_c2) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c6) = sk_c5
| inverse(sk_c2) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c1) = sk_c6
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c6) = sk_c5
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_23,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c3,sk_c7) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c3,sk_c7) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c7,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_10,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c7,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_19,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c6,sk_c7) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c6,sk_c7) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c6,sk_c5) != sk_c7
| inverse(sk_c6) != sk_c5
| multiply(X1,sk_c6) != sk_c5
| inverse(X1) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| multiply(X2,sk_c6) != sk_c7
| inverse(X2) != sk_c6
| multiply(sk_c7,X3) != sk_c6
| multiply(X4,sk_c7) != X3
| inverse(X4) != sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c3,sk_c7) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| inverse(sk_c2) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c7,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| multiply(sk_c6,sk_c7) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).
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,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_27,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_25]) ).
cnf(c_0_28,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c1) = sk_c6
| inverse(sk_c2) = sk_c6 ),
prove_this_21 ).
cnf(c_0_30,negated_conjecture,
( inverse(sk_c6) = sk_c5
| inverse(sk_c2) = sk_c6 ),
prove_this_9 ).
cnf(c_0_31,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c6,sk_c2) = identity
| inverse(sk_c1) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c2,sk_c6) = sk_c7 ),
prove_this_20 ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c6,sk_c2) = identity
| inverse(sk_c6) = sk_c5 ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c6,sk_c2) = identity
| inverse(sk_c6) = sk_c1 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c2,sk_c6) = sk_c7 ),
prove_this_8 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c7
| inverse(sk_c6) = sk_c1 ),
inference(spm,[status(thm)],[c_0_31,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c6,sk_c2) = identity
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c7
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c6) = sk_c2
| sk_c1 = sk_c5 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_38]),c_0_28]) ).
cnf(c_0_41,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_42,negated_conjecture,
( multiply(inverse(sk_c2),sk_c7) = sk_c6
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c2) = sk_c6
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_31,c_0_40]) ).
cnf(c_0_44,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c6
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( inverse(sk_c1) = sk_c6
| inverse(sk_c3) = sk_c7 ),
prove_this_24 ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c6) = sk_c5
| inverse(sk_c3) = sk_c7 ),
prove_this_12 ).
cnf(c_0_48,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_23,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( sk_c1 = sk_c5
| identity = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_45]),c_0_23]) ).
cnf(c_0_50,negated_conjecture,
( inverse(sk_c1) = sk_c6
| inverse(sk_c7) = sk_c3 ),
inference(spm,[status(thm)],[c_0_31,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c3,sk_c7) = sk_c4 ),
prove_this_23 ).
cnf(c_0_52,negated_conjecture,
( inverse(sk_c6) = sk_c5
| inverse(sk_c7) = sk_c3 ),
inference(spm,[status(thm)],[c_0_31,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( inverse(sk_c7) = sk_c7
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( inverse(sk_c7) = sk_c3
| inverse(sk_c6) = sk_c1 ),
inference(spm,[status(thm)],[c_0_31,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c3,sk_c7) = sk_c4 ),
prove_this_11 ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c4
| inverse(sk_c6) = sk_c1 ),
inference(spm,[status(thm)],[c_0_31,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( inverse(sk_c6) = sk_c5
| sk_c1 = sk_c5
| sk_c3 = sk_c7 ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( inverse(sk_c6) = sk_c1
| sk_c1 = sk_c5
| sk_c3 = sk_c7 ),
inference(spm,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c4
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( sk_c3 = sk_c7
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c4
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
( multiply(inverse(sk_c7),sk_c4) = sk_c7
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_61]) ).
cnf(c_0_63,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c7,sk_c4) = sk_c6 ),
prove_this_22 ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c7,sk_c4) = sk_c7
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_62,c_0_53]) ).
cnf(c_0_65,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c7,sk_c4) = sk_c6 ),
prove_this_10 ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c7,sk_c4) = sk_c6
| inverse(sk_c6) = sk_c1 ),
inference(spm,[status(thm)],[c_0_31,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
( sk_c1 = sk_c5
| identity = sk_c4 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_64]),c_0_23]) ).
cnf(c_0_68,negated_conjecture,
( multiply(sk_c7,sk_c4) = sk_c6
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
( sk_c4 = sk_c7
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_49,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c6
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_71,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c6,sk_c7) = sk_c5 ),
prove_this_19 ).
cnf(c_0_72,negated_conjecture,
( inverse(sk_c4) = sk_c4
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_48,c_0_67]) ).
cnf(c_0_73,negated_conjecture,
( sk_c1 = sk_c5
| sk_c4 = sk_c6 ),
inference(spm,[status(thm)],[c_0_61,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( inverse(sk_c6) = sk_c5
| multiply(sk_c6,sk_c7) = sk_c5 ),
prove_this_7 ).
cnf(c_0_75,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| inverse(sk_c6) = sk_c1 ),
inference(spm,[status(thm)],[c_0_31,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
( multiply(sk_c6,sk_c5) != sk_c7
| inverse(sk_c6) != sk_c5
| multiply(X1,sk_c6) != sk_c5
| inverse(X1) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| multiply(X2,sk_c6) != sk_c7
| inverse(X2) != sk_c6
| multiply(sk_c7,X3) != sk_c6
| multiply(X4,sk_c7) != X3
| inverse(X4) != sk_c7 ),
inference(fof_simplification,[status(thm)],[prove_this_25]) ).
cnf(c_0_77,negated_conjecture,
( inverse(sk_c6) = sk_c5
| inverse(sk_c6) = sk_c2 ),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_78,negated_conjecture,
( inverse(sk_c6) = sk_c6
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_80,negated_conjecture,
( multiply(inverse(sk_c7),sk_c6) = sk_c4
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_68]) ).
cnf(c_0_81,negated_conjecture,
( multiply(sk_c6,sk_c5) != sk_c7
| inverse(sk_c6) != sk_c5
| multiply(X1,sk_c6) != sk_c5
| inverse(X1) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| multiply(X2,sk_c6) != sk_c7
| inverse(X2) != sk_c6
| multiply(sk_c7,X3) != sk_c6
| multiply(X4,sk_c7) != X3
| inverse(X4) != sk_c7 ),
c_0_76 ).
cnf(c_0_82,negated_conjecture,
( inverse(sk_c6) = sk_c5
| sk_c2 != sk_c5 ),
inference(ef,[status(thm)],[c_0_77]) ).
cnf(c_0_83,negated_conjecture,
( sk_c1 = sk_c5
| sk_c2 = sk_c6 ),
inference(spm,[status(thm)],[c_0_40,c_0_78]) ).
cnf(c_0_84,negated_conjecture,
( sk_c1 = sk_c5
| sk_c5 = sk_c6 ),
inference(spm,[status(thm)],[c_0_79,c_0_45]) ).
cnf(c_0_85,negated_conjecture,
( multiply(inverse(sk_c6),sk_c5) = sk_c7
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_79]) ).
cnf(c_0_86,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c4
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_80,c_0_53]) ).
cnf(c_0_87,negated_conjecture,
( multiply(sk_c7,multiply(X1,sk_c7)) != sk_c6
| multiply(sk_c6,sk_c5) != sk_c7
| multiply(sk_c6,sk_c7) != sk_c5
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c6) != sk_c5
| inverse(sk_c6) != sk_c5
| inverse(X1) != sk_c7
| inverse(X2) != sk_c6
| inverse(X3) != sk_c6 ),
inference(er,[status(thm)],[c_0_81]) ).
cnf(c_0_88,negated_conjecture,
( inverse(sk_c6) = sk_c5
| sk_c1 = sk_c5 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]) ).
cnf(c_0_89,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_85,c_0_78]) ).
cnf(c_0_90,negated_conjecture,
( multiply(inverse(sk_c7),sk_c4) = sk_c6
| sk_c1 = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_86]) ).
cnf(c_0_91,negated_conjecture,
( sk_c1 = sk_c5
| multiply(sk_c7,multiply(X1,sk_c7)) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c6) != sk_c5
| inverse(X1) != sk_c7
| inverse(X2) != sk_c6
| inverse(X3) != sk_c6 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_79]),c_0_89]) ).
cnf(c_0_92,negated_conjecture,
( sk_c1 = sk_c5
| sk_c7 = sk_c6 ),
inference(spm,[status(thm)],[c_0_90,c_0_62]) ).
cnf(c_0_93,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c2,sk_c6) = sk_c7 ),
prove_this_14 ).
cnf(c_0_94,negated_conjecture,
( sk_c1 = sk_c5
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,sk_c6) != sk_c5
| inverse(X1) != sk_c6
| inverse(X2) != sk_c6 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_31])]),c_0_23]),c_0_28]),c_0_92]) ).
cnf(c_0_95,negated_conjecture,
( multiply(inverse(sk_c2),sk_c7) = sk_c6
| multiply(sk_c1,sk_c6) = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_93]) ).
cnf(c_0_96,negated_conjecture,
( sk_c1 = sk_c5
| multiply(X1,sk_c6) != sk_c5
| inverse(X1) != sk_c6 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_31])]),c_0_23]),c_0_49]) ).
cnf(c_0_97,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c3,sk_c7) = sk_c4 ),
prove_this_17 ).
cnf(c_0_98,negated_conjecture,
( multiply(inverse(inverse(sk_c2)),sk_c6) = sk_c7
| multiply(sk_c1,sk_c6) = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_95]) ).
cnf(c_0_99,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| inverse(sk_c2) = sk_c6 ),
prove_this_15 ).
cnf(c_0_100,negated_conjecture,
( sk_c1 = sk_c5
| identity != sk_c5 ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_31])]),c_0_23]) ).
cnf(c_0_101,negated_conjecture,
( sk_c1 = sk_c5
| identity = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_69]),c_0_23]) ).
cnf(c_0_102,negated_conjecture,
( multiply(inverse(sk_c3),sk_c4) = sk_c7
| multiply(sk_c1,sk_c6) = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_97]) ).
cnf(c_0_103,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| inverse(sk_c3) = sk_c7 ),
prove_this_18 ).
cnf(c_0_104,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| identity = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_23]) ).
cnf(c_0_105,negated_conjecture,
sk_c1 = sk_c5,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_84]) ).
cnf(c_0_106,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c7,sk_c4) = sk_c6 ),
prove_this_16 ).
cnf(c_0_107,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c5
| multiply(sk_c7,sk_c4) = sk_c7 ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_108,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c5
| identity = sk_c7 ),
inference(rw,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_109,negated_conjecture,
( multiply(inverse(sk_c1),sk_c5) = sk_c6
| multiply(sk_c7,sk_c4) = sk_c6 ),
inference(spm,[status(thm)],[c_0_25,c_0_106]) ).
cnf(c_0_110,negated_conjecture,
( multiply(inverse(sk_c1),sk_c5) = sk_c6
| multiply(sk_c7,sk_c4) = sk_c7 ),
inference(spm,[status(thm)],[c_0_25,c_0_107]) ).
cnf(c_0_111,negated_conjecture,
( identity = sk_c7
| identity = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_108]),c_0_23]) ).
cnf(c_0_112,negated_conjecture,
( multiply(sk_c7,sk_c4) = sk_c6
| identity = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_105]),c_0_23]) ).
cnf(c_0_113,negated_conjecture,
( multiply(sk_c7,sk_c4) = sk_c7
| identity = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_105]),c_0_23]) ).
cnf(c_0_114,negated_conjecture,
( identity = sk_c6
| sk_c7 != sk_c6 ),
inference(ef,[status(thm)],[c_0_111]) ).
cnf(c_0_115,negated_conjecture,
( multiply(sk_c6,sk_c5) = sk_c7
| multiply(sk_c6,sk_c7) = sk_c5 ),
prove_this_1 ).
cnf(c_0_116,negated_conjecture,
identity = sk_c6,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]) ).
cnf(c_0_117,negated_conjecture,
( multiply(inverse(sk_c6),sk_c7) = sk_c5
| multiply(sk_c6,sk_c7) = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_115]) ).
cnf(c_0_118,plain,
inverse(sk_c6) = sk_c6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_116]),c_0_116]) ).
cnf(c_0_119,negated_conjecture,
multiply(sk_c6,sk_c7) = sk_c5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_117,c_0_118])]) ).
cnf(c_0_120,negated_conjecture,
multiply(sk_c6,sk_c5) = sk_c7,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_119]),c_0_118]) ).
cnf(c_0_121,plain,
multiply(sk_c6,X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_116]) ).
cnf(c_0_122,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c7
| inverse(sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_31,c_0_36]) ).
cnf(c_0_123,plain,
multiply(X1,sk_c6) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_116]) ).
cnf(c_0_124,negated_conjecture,
sk_c5 = sk_c7,
inference(rw,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_125,negated_conjecture,
( sk_c5 = sk_c6
| sk_c2 != sk_c5 ),
inference(rw,[status(thm)],[c_0_82,c_0_118]) ).
cnf(c_0_126,negated_conjecture,
( inverse(sk_c7) = sk_c6
| sk_c2 = sk_c7 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_122,c_0_123]),c_0_124]) ).
cnf(c_0_127,negated_conjecture,
( sk_c7 = sk_c6
| sk_c2 != sk_c7 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_124]),c_0_124]) ).
cnf(c_0_128,negated_conjecture,
sk_c7 = sk_c6,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_126]),c_0_118]),c_0_127]) ).
cnf(c_0_129,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_118]),c_0_128]),c_0_128]),c_0_123]),c_0_121]),c_0_121]),c_0_124]),c_0_128]),c_0_128]),c_0_121]),c_0_128]),c_0_124]),c_0_128]),c_0_123]),c_0_128]),c_0_123]),c_0_124]),c_0_128]),c_0_124]),c_0_128]),c_0_128])])])])]),c_0_118])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP363-1 : TPTP v8.2.0. Released v2.5.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 05:37:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.20/0.60 # Version: 3.1.0
% 1.20/0.60 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.20/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.20/0.60 # Starting new_bool_3 with 300s (1) cores
% 1.20/0.60 # Starting new_bool_1 with 300s (1) cores
% 1.20/0.60 # Starting sh5l with 300s (1) cores
% 1.20/0.60 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 11060 completed with status 0
% 1.20/0.60 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.20/0.60 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.20/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.20/0.60 # No SInE strategy applied
% 1.20/0.60 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.20/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.20/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.20/0.60 # Starting new_bool_3 with 136s (1) cores
% 1.20/0.60 # Starting new_bool_1 with 136s (1) cores
% 1.20/0.60 # Starting sh5l with 136s (1) cores
% 1.20/0.60 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 11065 completed with status 0
% 1.20/0.60 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.20/0.60 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.20/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.20/0.60 # No SInE strategy applied
% 1.20/0.60 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.20/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.20/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.20/0.60 # Preprocessing time : 0.001 s
% 1.20/0.60 # Presaturation interreduction done
% 1.20/0.60
% 1.20/0.60 # Proof found!
% 1.20/0.60 # SZS status Unsatisfiable
% 1.20/0.60 # SZS output start CNFRefutation
% See solution above
% 1.20/0.60 # Parsed axioms : 28
% 1.20/0.60 # Removed by relevancy pruning/SinE : 0
% 1.20/0.60 # Initial clauses : 28
% 1.20/0.60 # Removed in clause preprocessing : 0
% 1.20/0.60 # Initial clauses in saturation : 28
% 1.20/0.60 # Processed clauses : 1317
% 1.20/0.60 # ...of these trivial : 198
% 1.20/0.60 # ...subsumed : 583
% 1.20/0.60 # ...remaining for further processing : 536
% 1.20/0.60 # Other redundant clauses eliminated : 63
% 1.20/0.60 # Clauses deleted for lack of memory : 0
% 1.20/0.60 # Backward-subsumed : 63
% 1.20/0.60 # Backward-rewritten : 413
% 1.20/0.60 # Generated clauses : 6298
% 1.20/0.60 # ...of the previous two non-redundant : 5812
% 1.20/0.60 # ...aggressively subsumed : 0
% 1.20/0.60 # Contextual simplify-reflections : 17
% 1.20/0.60 # Paramodulations : 6239
% 1.20/0.60 # Factorizations : 4
% 1.20/0.60 # NegExts : 0
% 1.20/0.60 # Equation resolutions : 63
% 1.20/0.60 # Disequality decompositions : 0
% 1.20/0.60 # Total rewrite steps : 3606
% 1.20/0.60 # ...of those cached : 3109
% 1.20/0.60 # Propositional unsat checks : 0
% 1.20/0.60 # Propositional check models : 0
% 1.20/0.60 # Propositional check unsatisfiable : 0
% 1.20/0.60 # Propositional clauses : 0
% 1.20/0.60 # Propositional clauses after purity: 0
% 1.20/0.60 # Propositional unsat core size : 0
% 1.20/0.60 # Propositional preprocessing time : 0.000
% 1.20/0.60 # Propositional encoding time : 0.000
% 1.20/0.60 # Propositional solver time : 0.000
% 1.20/0.60 # Success case prop preproc time : 0.000
% 1.20/0.60 # Success case prop encoding time : 0.000
% 1.20/0.60 # Success case prop solver time : 0.000
% 1.20/0.60 # Current number of processed clauses : 27
% 1.20/0.60 # Positive orientable unit clauses : 27
% 1.20/0.60 # Positive unorientable unit clauses: 0
% 1.20/0.60 # Negative unit clauses : 0
% 1.20/0.60 # Non-unit-clauses : 0
% 1.20/0.60 # Current number of unprocessed clauses: 1463
% 1.20/0.60 # ...number of literals in the above : 12862
% 1.20/0.60 # Current number of archived formulas : 0
% 1.20/0.60 # Current number of archived clauses : 504
% 1.20/0.60 # Clause-clause subsumption calls (NU) : 6040
% 1.20/0.60 # Rec. Clause-clause subsumption calls : 2056
% 1.20/0.60 # Non-unit clause-clause subsumptions : 653
% 1.20/0.60 # Unit Clause-clause subsumption calls : 256
% 1.20/0.60 # Rewrite failures with RHS unbound : 0
% 1.20/0.60 # BW rewrite match attempts : 42
% 1.20/0.60 # BW rewrite match successes : 33
% 1.20/0.60 # Condensation attempts : 0
% 1.20/0.60 # Condensation successes : 0
% 1.20/0.60 # Termbank termtop insertions : 94147
% 1.20/0.60 # Search garbage collected termcells : 26
% 1.20/0.60
% 1.20/0.60 # -------------------------------------------------
% 1.20/0.60 # User time : 0.110 s
% 1.20/0.60 # System time : 0.004 s
% 1.20/0.60 # Total time : 0.114 s
% 1.20/0.60 # Maximum resident set size: 1664 pages
% 1.20/0.60
% 1.20/0.60 # -------------------------------------------------
% 1.20/0.60 # User time : 0.584 s
% 1.20/0.60 # System time : 0.013 s
% 1.20/0.60 # Total time : 0.597 s
% 1.20/0.60 # Maximum resident set size: 1708 pages
% 1.20/0.60 % E---3.1 exiting
% 1.20/0.60 % E exiting
%------------------------------------------------------------------------------