%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP366-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:39:24 PM UTC 2026
% Result : Unsatisfiable 7.58s 1.65s
% Output : CNFRefutation 7.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 17
% Syntax : Number of clauses : 103 ( 27 unt; 65 nHn; 81 RR)
% Number of literals : 233 ( 232 equ; 70 neg)
% Maximal clause size : 16 ( 2 avg)
% Maximal term depth : 5 ( 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 : 59 ( 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_33,negated_conjecture,
( inverse(sk_c4) = sk_c10
| inverse(sk_c1) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_23,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_32,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| inverse(sk_c1) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_32) ).
cnf(prove_this_55,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_55) ).
cnf(prove_this_54,negated_conjecture,
( inverse(sk_c9) = sk_c8
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_54) ).
cnf(prove_this_22,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c1,sk_c10) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_45,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| multiply(sk_c3,sk_c8) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_45) ).
cnf(prove_this_44,negated_conjecture,
( inverse(sk_c9) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_44) ).
cnf(prove_this_13,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c10,sk_c2) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_12,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c10,sk_c2) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c9) = sk_c8
| inverse(sk_c1) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c9) = sk_c8
| multiply(sk_c1,sk_c10) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c9) = sk_c8
| multiply(sk_c8,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_61,negated_conjecture,
( multiply(X6,sk_c10) != X7
| inverse(X7) != sk_c10
| inverse(X6) != X7
| multiply(X5,sk_c8) != sk_c9
| inverse(X5) != sk_c9
| multiply(sk_c10,sk_c8) != sk_c9
| inverse(sk_c9) != sk_c8
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| multiply(sk_c9,sk_c10) != sk_c8
| inverse(X3) != sk_c8
| multiply(X3,sk_c8) != sk_c10
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != X1
| multiply(sk_c10,X1) != sk_c9
| multiply(sk_c8,sk_c10) != sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_61) ).
cnf(c_0_17,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_18,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_19,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_20,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_22,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_21]) ).
cnf(c_0_24,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( inverse(sk_c4) = sk_c10
| inverse(sk_c1) = sk_c10 ),
prove_this_33 ).
cnf(c_0_26,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c2 ),
prove_this_23 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| inverse(sk_c1) = sk_c10 ),
prove_this_32 ).
cnf(c_0_28,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c4,sk_c10) = identity ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| inverse(sk_c3) = sk_c8 ),
prove_this_55 ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c9) = sk_c8
| inverse(sk_c3) = sk_c8 ),
prove_this_54 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c1,sk_c10) = sk_c2 ),
prove_this_22 ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c4,sk_c10) = identity
| multiply(sk_c1,sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_34,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3,
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_35,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c10,sk_c1) = identity
| multiply(sk_c4,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c10,sk_c1) = identity
| multiply(sk_c4,sk_c10) = identity ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_38,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| multiply(sk_c3,sk_c8) = sk_c10 ),
prove_this_45 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c3,sk_c8) = identity
| multiply(sk_c10,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
( inverse(sk_c9) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c10 ),
prove_this_44 ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c9) = sk_c8
| multiply(sk_c3,sk_c8) = identity ),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c10,sk_c2) = sk_c9 ),
prove_this_13 ).
cnf(c_0_44,negated_conjecture,
( identity = sk_c9
| multiply(sk_c1,sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_45,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_35]) ).
cnf(c_0_46,negated_conjecture,
( identity = sk_c9
| multiply(sk_c10,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_18,c_0_38]) ).
cnf(c_0_48,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_49,negated_conjecture,
( identity = sk_c10
| multiply(sk_c10,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c8,sk_c9) = identity
| multiply(sk_c3,sk_c8) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_41]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c8,sk_c9) = identity
| multiply(sk_c3,sk_c8) = identity ),
inference(spm,[status(thm)],[c_0_18,c_0_42]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c10,sk_c2) = sk_c9 ),
prove_this_12 ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c4,sk_c10) = identity
| multiply(sk_c10,sk_c2) = sk_c9 ),
inference(spm,[status(thm)],[c_0_24,c_0_43]) ).
cnf(c_0_54,negated_conjecture,
( identity = sk_c9
| multiply(inverse(sk_c1),sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_20,c_0_44]) ).
cnf(c_0_55,negated_conjecture,
( identity = sk_c9
| inverse(sk_c1) = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_19]) ).
cnf(c_0_56,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_48]),c_0_35]) ).
cnf(c_0_57,negated_conjecture,
( identity = sk_c10
| multiply(inverse(sk_c10),sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_20,c_0_49]) ).
cnf(c_0_58,negated_conjecture,
( identity = sk_c10
| multiply(sk_c8,sk_c9) = identity ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
( identity = sk_c9
| multiply(sk_c10,sk_c2) = sk_c9 ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( identity = sk_c9
| multiply(sk_c10,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,negated_conjecture,
( identity = sk_c10
| multiply(sk_c9,inverse(sk_c8)) = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_23]) ).
cnf(c_0_62,negated_conjecture,
( identity = sk_c10
| inverse(sk_c8) = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_58]),c_0_35]) ).
cnf(c_0_63,negated_conjecture,
( sk_c9 = sk_c10
| identity = sk_c9 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( identity = sk_c10
| multiply(sk_c9,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
( sk_c9 = sk_c10
| multiply(sk_c9,X1) = X1 ),
inference(spm,[status(thm)],[c_0_19,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( sk_c9 = sk_c10
| identity = sk_c10 ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_67,negated_conjecture,
( identity = sk_c9
| inverse(sk_c10) = sk_c1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_46]),c_0_35]) ).
cnf(c_0_68,negated_conjecture,
sk_c9 = sk_c10,
inference(spm,[status(thm)],[c_0_63,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
( inverse(sk_c9) = sk_c8
| inverse(sk_c1) = sk_c10 ),
prove_this_34 ).
cnf(c_0_70,negated_conjecture,
( identity = sk_c9
| multiply(sk_c1,sk_c10) = identity ),
inference(spm,[status(thm)],[c_0_18,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
( identity = sk_c8
| identity = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_68]),c_0_18]) ).
cnf(c_0_72,negated_conjecture,
( inverse(sk_c9) = sk_c8
| multiply(sk_c1,sk_c10) = sk_c2 ),
prove_this_24 ).
cnf(c_0_73,negated_conjecture,
( inverse(sk_c9) = sk_c8
| multiply(sk_c1,sk_c10) = identity ),
inference(spm,[status(thm)],[c_0_24,c_0_69]) ).
cnf(c_0_74,negated_conjecture,
( identity = sk_c2
| identity = sk_c9 ),
inference(spm,[status(thm)],[c_0_44,c_0_70]) ).
cnf(c_0_75,negated_conjecture,
( identity = sk_c10
| inverse(sk_c8) = sk_c10 ),
inference(rw,[status(thm)],[c_0_62,c_0_68]) ).
cnf(c_0_76,negated_conjecture,
( identity = sk_c10
| inverse(sk_c8) = sk_c8 ),
inference(spm,[status(thm)],[c_0_47,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( sk_c8 != sk_c10
| identity = sk_c10 ),
inference(ef,[status(thm)],[c_0_71]) ).
cnf(c_0_78,negated_conjecture,
( multiply(sk_c8,sk_c9) = identity
| multiply(sk_c1,sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_18,c_0_72]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c8,sk_c9) = identity
| multiply(sk_c1,sk_c10) = identity ),
inference(spm,[status(thm)],[c_0_18,c_0_73]) ).
cnf(c_0_80,negated_conjecture,
( sk_c2 != sk_c9
| identity = sk_c9 ),
inference(ef,[status(thm)],[c_0_74]) ).
cnf(c_0_81,negated_conjecture,
( inverse(sk_c9) = sk_c8
| multiply(sk_c8,sk_c10) = sk_c9 ),
prove_this_4 ).
cnf(c_0_82,negated_conjecture,
identity = sk_c10,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_83,negated_conjecture,
( identity = sk_c2
| multiply(sk_c8,sk_c9) = identity ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_84,negated_conjecture,
( sk_c2 != sk_c9
| multiply(sk_c9,X1) = X1 ),
inference(spm,[status(thm)],[c_0_19,c_0_80]) ).
cnf(c_0_85,negated_conjecture,
( multiply(X6,sk_c10) != X7
| inverse(X7) != sk_c10
| inverse(X6) != X7
| multiply(X5,sk_c8) != sk_c9
| inverse(X5) != sk_c9
| multiply(sk_c10,sk_c8) != sk_c9
| inverse(sk_c9) != sk_c8
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| multiply(sk_c9,sk_c10) != sk_c8
| inverse(X3) != sk_c8
| multiply(X3,sk_c8) != sk_c10
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != X1
| multiply(sk_c10,X1) != sk_c9
| multiply(sk_c8,sk_c10) != sk_c9 ),
inference(fof_simplification,[status(thm)],[prove_this_61]) ).
cnf(c_0_86,negated_conjecture,
( inverse(sk_c8) = sk_c9
| multiply(sk_c8,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_23,c_0_81]) ).
cnf(c_0_87,plain,
multiply(X1,sk_c10) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_82]) ).
cnf(c_0_88,negated_conjecture,
( identity = sk_c2
| inverse(sk_c9) = sk_c8 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_83]),c_0_47]),c_0_19]) ).
cnf(c_0_89,negated_conjecture,
( sk_c2 != sk_c9
| inverse(sk_c9) = identity ),
inference(spm,[status(thm)],[c_0_24,c_0_84]) ).
cnf(c_0_90,negated_conjecture,
( multiply(X6,sk_c10) != X7
| inverse(X7) != sk_c10
| inverse(X6) != X7
| multiply(X5,sk_c8) != sk_c9
| inverse(X5) != sk_c9
| multiply(sk_c10,sk_c8) != sk_c9
| inverse(sk_c9) != sk_c8
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| multiply(sk_c9,sk_c10) != sk_c8
| inverse(X3) != sk_c8
| multiply(X3,sk_c8) != sk_c10
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != X1
| multiply(sk_c10,X1) != sk_c9
| multiply(sk_c8,sk_c10) != sk_c9 ),
c_0_85 ).
cnf(c_0_91,negated_conjecture,
( sk_c8 = sk_c10
| inverse(sk_c8) = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_68]),c_0_68]),c_0_87]) ).
cnf(c_0_92,plain,
inverse(sk_c10) = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_82]),c_0_82]) ).
cnf(c_0_93,negated_conjecture,
( identity = sk_c2
| inverse(sk_c10) = sk_c8 ),
inference(rw,[status(thm)],[c_0_88,c_0_68]) ).
cnf(c_0_94,negated_conjecture,
( sk_c2 != sk_c10
| inverse(sk_c10) = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_68]),c_0_68]) ).
cnf(c_0_95,negated_conjecture,
( inverse(X1) != sk_c10
| inverse(X5) != sk_c8
| inverse(X4) != sk_c10
| inverse(X3) != sk_c9
| inverse(sk_c9) != sk_c8
| multiply(X5,sk_c8) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| multiply(X3,sk_c8) != sk_c9
| inverse(X2) != multiply(X2,sk_c10)
| multiply(sk_c9,sk_c10) != sk_c8
| multiply(sk_c10,sk_c8) != sk_c9
| multiply(sk_c8,sk_c10) != sk_c9
| inverse(multiply(X2,sk_c10)) != sk_c10
| multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_90])]) ).
cnf(c_0_96,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_82]) ).
cnf(c_0_97,negated_conjecture,
sk_c8 = sk_c10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_91]),c_0_92])]) ).
cnf(c_0_98,negated_conjecture,
( sk_c2 = sk_c10
| inverse(sk_c10) = sk_c8 ),
inference(rw,[status(thm)],[c_0_93,c_0_82]) ).
cnf(c_0_99,negated_conjecture,
( sk_c2 != sk_c10
| inverse(sk_c10) = sk_c10 ),
inference(rw,[status(thm)],[c_0_94,c_0_82]) ).
cnf(c_0_100,negated_conjecture,
( inverse(X1) != X1
| inverse(X1) != sk_c10 ),
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)],[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_95,c_0_68]),c_0_68]),c_0_68]),c_0_68]),c_0_68]),c_0_68]),c_0_68]),c_0_68]),c_0_87]),c_0_96]),c_0_87]),c_0_87]),c_0_97]),c_0_96]),c_0_97]),c_0_87]),c_0_97]),c_0_87]),c_0_97]),c_0_87]),c_0_87]),c_0_97]),c_0_87]),c_0_92]),c_0_97]),c_0_97])])])])])]),c_0_92])]) ).
cnf(c_0_101,negated_conjecture,
inverse(sk_c10) = sk_c10,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_97]),c_0_99]) ).
cnf(c_0_102,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_100,c_0_101]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP366-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 20:10:06 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.44 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
% 7.58/1.65 % Version: 3.5.1
% 7.58/1.65 % Preprocessing class: FSMSSMSMSSSNFFN.
% 7.58/1.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.58/1.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 7.58/1.65 % Starting new_bool_3 with 300s (1) cores
% 7.58/1.65 % Starting new_bool_1 with 300s (1) cores
% 7.58/1.65 % Starting sh5l with 300s (1) cores
% 7.58/1.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2247671 completed with status 0
% 7.58/1.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 7.58/1.65 % Preprocessing class: FSMSSMSMSSSNFFN.
% 7.58/1.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.58/1.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 7.58/1.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.58/1.65 % No SInE strategy applied
% 7.58/1.65 % Search class: FGHPS-FFMM21-SFFFFFNN
% 7.58/1.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.58/1.65 % Starting SubtermCWHack with 136s (1) cores
% 7.58/1.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 7.58/1.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.58/1.65 % Starting new_bool_3 with 136s (1) cores
% 7.58/1.65 % Starting new_bool_1 with 136s (1) cores
% 7.58/1.65 % SubtermCWHack with pid 2247676 completed with status 0
% 7.58/1.65 % Result found by SubtermCWHack
% 7.58/1.65 % Preprocessing class: FSMSSMSMSSSNFFN.
% 7.58/1.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.58/1.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 7.58/1.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.58/1.65 % No SInE strategy applied
% 7.58/1.65 % Search class: FGHPS-FFMM21-SFFFFFNN
% 7.58/1.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.58/1.65 % Starting SubtermCWHack with 136s (1) cores
% 7.58/1.65 % Preprocessing time : 0.001 s
% 7.58/1.65
% 7.58/1.65 % Proof found!
% 7.58/1.65 % SZS status Unsatisfiable
% 7.58/1.65 % SZS output start CNFRefutation
% See solution above
% 7.58/1.65 % Parsed axioms : 64
% 7.58/1.65 % Removed by relevancy pruning/SinE : 0
% 7.58/1.65 % Initial clauses : 64
% 7.58/1.65 % Removed in clause preprocessing : 0
% 7.58/1.65 % Initial clauses in saturation : 64
% 7.58/1.65 % Processed clauses : 25976
% 7.58/1.65 % ...of these trivial : 269
% 7.58/1.65 % ...subsumed : 23137
% 7.58/1.65 % ...remaining for further processing : 2570
% 7.58/1.65 % Other redundant clauses eliminated : 6
% 7.58/1.65 % Clauses deleted for lack of memory : 0
% 7.58/1.65 % Backward-subsumed : 62
% 7.58/1.65 % Backward-rewritten : 1687
% 7.58/1.65 % Generated clauses : 162437
% 7.58/1.65 % ...of the previous two non-redundant : 158830
% 7.58/1.65 % ...aggressively subsumed : 0
% 7.58/1.65 % Contextual simplify-reflections : 2
% 7.58/1.65 % Paramodulations : 162427
% 7.58/1.65 % Factorizations : 8
% 7.58/1.65 % NegExts : 0
% 7.58/1.65 % Equation resolutions : 6
% 7.58/1.65 % Disequality decompositions : 0
% 7.58/1.65 % Total rewrite steps : 59860
% 7.58/1.65 % ...of those cached : 57522
% 7.58/1.65 % Propositional unsat checks : 0
% 7.58/1.65 % Propositional check models : 0
% 7.58/1.65 % Propositional check unsatisfiable : 0
% 7.58/1.65 % Propositional clauses : 0
% 7.58/1.65 % Propositional clauses after purity: 0
% 7.58/1.65 % Propositional unsat core size : 0
% 7.58/1.65 % Propositional preprocessing time : 0.000
% 7.58/1.65 % Propositional encoding time : 0.000
% 7.58/1.65 % Propositional solver time : 0.000
% 7.58/1.65 % Success case prop preproc time : 0.000
% 7.58/1.65 % Success case prop encoding time : 0.000
% 7.58/1.65 % Success case prop solver time : 0.000
% 7.58/1.65 % Current number of processed clauses : 819
% 7.58/1.65 % Positive orientable unit clauses : 22
% 7.58/1.65 % Positive unorientable unit clauses: 0
% 7.58/1.65 % Negative unit clauses : 0
% 7.58/1.65 % Non-unit-clauses : 797
% 7.58/1.65 % Current number of unprocessed clauses: 65795
% 7.58/1.65 % ...number of literals in the above : 176434
% 7.58/1.65 % Current number of archived formulas : 0
% 7.58/1.65 % Current number of archived clauses : 1749
% 7.58/1.65 % Clause-clause subsumption calls (NU) : 379896
% 7.58/1.65 % Rec. Clause-clause subsumption calls : 310969
% 7.58/1.65 % Non-unit clause-clause subsumptions : 23174
% 7.58/1.65 % Unit Clause-clause subsumption calls : 1352
% 7.58/1.65 % Rewrite failures with RHS unbound : 0
% 7.58/1.65 % BW rewrite match attempts : 116
% 7.58/1.65 % BW rewrite match successes : 60
% 7.58/1.65 % Condensation attempts : 0
% 7.58/1.65 % Condensation successes : 0
% 7.58/1.65 % Termbank termtop insertions : 1234715
% 7.58/1.65 % Search garbage collected termcells : 43
% 7.58/1.65
% 7.58/1.65 % -------------------------------------------------
% 7.58/1.65 % User time : 1.035 s
% 7.58/1.65 % System time : 0.048 s
% 7.58/1.65 % Total time : 1.083 s
% 7.58/1.65 % Maximum resident set size: 3664 pages
% 7.58/1.65
% 7.58/1.65 % -------------------------------------------------
% 7.58/1.65 % User time : 5.198 s
% 7.58/1.65 % System time : 0.236 s
% 7.58/1.65 % Total time : 5.434 s
% 7.58/1.65 % Maximum resident set size: 4608 pages
% 7.58/1.65 % E exiting
%------------------------------------------------------------------------------