%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP254-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 : n008.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:06 PM UTC 2026
% Result : Unsatisfiable 1.76s 0.63s
% Output : CNFRefutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 16
% Syntax : Number of clauses : 82 ( 20 unt; 53 nHn; 68 RR)
% Number of literals : 258 ( 257 equ; 129 neg)
% Maximal clause size : 16 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 80 ( 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_23,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| multiply(sk_c2,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c5) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| inverse(sk_c2) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c5) = sk_c11
| inverse(sk_c2) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_45,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| inverse(sk_c3) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_45) ).
cnf(prove_this_55,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| multiply(sk_c3,sk_c12) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_55) ).
cnf(prove_this_56,negated_conjecture,
( inverse(sk_c6) = sk_c9
| multiply(sk_c3,sk_c12) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_56) ).
cnf(prove_this_46,negated_conjecture,
( inverse(sk_c6) = sk_c9
| inverse(sk_c3) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_46) ).
cnf(prove_this_61,negated_conjecture,
( multiply(X8,X7) != X9
| inverse(X9) != X7
| inverse(X8) != X9
| multiply(X7,sk_c11) != sk_c12
| inverse(X6) != X7
| multiply(X6,X7) != sk_c12
| inverse(X5) != sk_c11
| multiply(X5,sk_c11) != sk_c10
| inverse(X4) != sk_c12
| multiply(X4,sk_c12) != sk_c11
| multiply(X3,sk_c12) != sk_c10
| inverse(X3) != sk_c10
| inverse(X2) != sk_c11
| multiply(X2,sk_c11) != sk_c10
| inverse(X1) != sk_c12
| multiply(X1,sk_c12) != sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_61) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| multiply(sk_c1,sk_c12) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c4) = sk_c12
| inverse(sk_c1) = sk_c12 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c4) = sk_c12
| multiply(sk_c1,sk_c12) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| inverse(sk_c1) = sk_c12 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(c_0_16,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_17,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_18,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| multiply(sk_c2,sk_c11) = sk_c10 ),
prove_this_23 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| multiply(inverse(sk_c5),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( inverse(sk_c5) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c10 ),
prove_this_24 ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c2,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(inverse(sk_c2),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c10
| inverse(sk_c2) = sk_c11 ),
prove_this_33 ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c5,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(inverse(sk_c5),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( inverse(sk_c5) = sk_c11
| inverse(sk_c2) = sk_c11 ),
prove_this_34 ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c2) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| inverse(sk_c3) = sk_c10 ),
prove_this_45 ).
cnf(c_0_31,negated_conjecture,
multiply(sk_c11,sk_c10) = sk_c11,
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c10,sk_c3) = identity
| multiply(sk_c6,sk_c9) = sk_c12 ),
inference(spm,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
identity = sk_c10,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_31]),c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| multiply(sk_c3,sk_c12) = sk_c10 ),
prove_this_55 ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c12
| multiply(sk_c10,sk_c3) = sk_c10 ),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c3,sk_c12) = sk_c10
| multiply(inverse(sk_c6),sk_c12) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( inverse(sk_c6) = sk_c9
| multiply(sk_c3,sk_c12) = sk_c10 ),
prove_this_56 ).
cnf(c_0_39,negated_conjecture,
( sk_c3 = sk_c10
| multiply(sk_c6,sk_c9) = sk_c12 ),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c9,sk_c12) = sk_c9
| multiply(sk_c3,sk_c12) = sk_c10 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( sk_c3 = sk_c10
| multiply(inverse(sk_c6),sk_c12) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c6) = sk_c9
| inverse(sk_c3) = sk_c10 ),
prove_this_46 ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c9,sk_c12) = sk_c9
| multiply(inverse(sk_c3),sk_c10) = sk_c12 ),
inference(spm,[status(thm)],[c_0_19,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( sk_c3 = sk_c10
| inverse(sk_c3) = sk_c10
| multiply(sk_c9,sk_c12) = sk_c9 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( sk_c10 = sk_c12
| sk_c3 = sk_c10
| multiply(sk_c9,sk_c12) = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_36]) ).
cnf(c_0_46,negated_conjecture,
( sk_c3 = sk_c10
| sk_c10 = sk_c12
| multiply(inverse(sk_c9),sk_c9) = sk_c12 ),
inference(spm,[status(thm)],[c_0_19,c_0_45]) ).
cnf(c_0_47,plain,
multiply(inverse(X1),X1) = sk_c10,
inference(rw,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_48,negated_conjecture,
( multiply(X8,X7) != X9
| inverse(X9) != X7
| inverse(X8) != X9
| multiply(X7,sk_c11) != sk_c12
| inverse(X6) != X7
| multiply(X6,X7) != sk_c12
| inverse(X5) != sk_c11
| multiply(X5,sk_c11) != sk_c10
| inverse(X4) != sk_c12
| multiply(X4,sk_c12) != sk_c11
| multiply(X3,sk_c12) != sk_c10
| inverse(X3) != sk_c10
| inverse(X2) != sk_c11
| multiply(X2,sk_c11) != sk_c10
| inverse(X1) != sk_c12
| multiply(X1,sk_c12) != sk_c11 ),
inference(fof_simplification,[status(thm)],[prove_this_61]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| multiply(sk_c1,sk_c12) = sk_c11 ),
prove_this_1 ).
cnf(c_0_50,negated_conjecture,
( sk_c10 = sk_c12
| sk_c3 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_51,negated_conjecture,
( inverse(sk_c4) = sk_c12
| inverse(sk_c1) = sk_c12 ),
prove_this_12 ).
cnf(c_0_52,negated_conjecture,
( multiply(X8,X7) != X9
| inverse(X9) != X7
| inverse(X8) != X9
| multiply(X7,sk_c11) != sk_c12
| inverse(X6) != X7
| multiply(X6,X7) != sk_c12
| inverse(X5) != sk_c11
| multiply(X5,sk_c11) != sk_c10
| inverse(X4) != sk_c12
| multiply(X4,sk_c12) != sk_c11
| multiply(X3,sk_c12) != sk_c10
| inverse(X3) != sk_c10
| inverse(X2) != sk_c11
| multiply(X2,sk_c11) != sk_c10
| inverse(X1) != sk_c12
| multiply(X1,sk_c12) != sk_c11 ),
c_0_48 ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c1,sk_c12) = sk_c11
| multiply(inverse(sk_c4),sk_c11) = sk_c12 ),
inference(spm,[status(thm)],[c_0_19,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( inverse(sk_c4) = sk_c12
| multiply(sk_c1,sk_c12) = sk_c11 ),
prove_this_2 ).
cnf(c_0_55,negated_conjecture,
( sk_c10 = sk_c12
| multiply(sk_c9,sk_c12) = sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_50]),c_0_36])]) ).
cnf(c_0_56,negated_conjecture,
( inverse(sk_c1) = sk_c12
| multiply(sk_c12,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_17,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( inverse(X7) != sk_c12
| inverse(X6) != sk_c11
| inverse(X5) != sk_c10
| inverse(X4) != sk_c12
| inverse(X3) != sk_c11
| multiply(X7,sk_c12) != sk_c11
| multiply(X6,sk_c11) != sk_c10
| multiply(X5,sk_c12) != sk_c10
| multiply(X4,sk_c12) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| multiply(X2,inverse(X2)) != sk_c12
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c11) != sk_c12
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_52])]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| multiply(sk_c1,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
sk_c10 = sk_c12,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_55]),c_0_47])]) ).
cnf(c_0_60,negated_conjecture,
( inverse(sk_c1) = sk_c12
| multiply(sk_c12,sk_c4) = sk_c10 ),
inference(rw,[status(thm)],[c_0_56,c_0_33]) ).
cnf(c_0_61,negated_conjecture,
( inverse(X6) != sk_c12
| inverse(X5) != sk_c11
| inverse(X4) != sk_c10
| inverse(X3) != sk_c12
| inverse(X2) != sk_c11
| multiply(X6,sk_c12) != sk_c11
| multiply(X5,sk_c11) != sk_c10
| multiply(X4,sk_c12) != sk_c10
| multiply(X3,sk_c12) != sk_c11
| multiply(X2,sk_c11) != sk_c10
| inverse(X1) != inverse(identity)
| multiply(X1,inverse(X1)) != sk_c12
| inverse(inverse(X1)) != inverse(X1)
| multiply(inverse(X1),sk_c11) != sk_c12 ),
inference(spm,[status(thm)],[c_0_57,c_0_18]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| multiply(inverse(sk_c1),sk_c11) = sk_c12 ),
inference(spm,[status(thm)],[c_0_19,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c4,sk_c12) = sk_c11
| inverse(sk_c1) = sk_c12 ),
prove_this_11 ).
cnf(c_0_64,plain,
multiply(sk_c12,X1) = X1,
inference(rw,[status(thm)],[c_0_36,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
( inverse(sk_c1) = sk_c12
| multiply(sk_c12,sk_c4) = sk_c12 ),
inference(rw,[status(thm)],[c_0_60,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
( identity != sk_c12
| inverse(X5) != sk_c12
| inverse(X4) != sk_c11
| inverse(X3) != sk_c10
| inverse(X2) != sk_c12
| inverse(X1) != sk_c11
| multiply(X5,sk_c12) != sk_c11
| multiply(X4,sk_c11) != sk_c10
| multiply(X3,sk_c12) != sk_c10
| multiply(X2,sk_c12) != sk_c11
| multiply(X1,sk_c11) != sk_c10
| inverse(identity) != inverse(sk_c11)
| multiply(sk_c11,inverse(sk_c11)) != sk_c12
| inverse(inverse(sk_c11)) != inverse(sk_c11) ),
inference(spm,[status(thm)],[c_0_61,c_0_17]) ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c12,sk_c11) = sk_c12
| multiply(sk_c4,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( sk_c11 = sk_c12
| multiply(inverse(sk_c1),sk_c11) = sk_c12 ),
inference(rw,[status(thm)],[c_0_62,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
( sk_c4 = sk_c12
| inverse(sk_c1) = sk_c12 ),
inference(rw,[status(thm)],[c_0_65,c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( sk_c10 != sk_c12
| inverse(X5) != sk_c12
| inverse(X4) != sk_c11
| inverse(X3) != sk_c10
| inverse(X2) != sk_c12
| inverse(X1) != sk_c11
| multiply(X5,sk_c12) != sk_c11
| multiply(X4,sk_c11) != sk_c10
| multiply(X3,sk_c12) != sk_c10
| multiply(X2,sk_c12) != sk_c11
| multiply(X1,sk_c11) != sk_c10
| inverse(sk_c10) != inverse(sk_c11)
| multiply(sk_c11,inverse(sk_c11)) != sk_c12
| inverse(inverse(sk_c11)) != inverse(sk_c11) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_33]),c_0_33]) ).
cnf(c_0_71,negated_conjecture,
( sk_c11 = sk_c12
| multiply(sk_c4,sk_c12) = sk_c11 ),
inference(rw,[status(thm)],[c_0_67,c_0_64]) ).
cnf(c_0_72,negated_conjecture,
( sk_c11 = sk_c12
| sk_c4 = sk_c12 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_64])]) ).
cnf(c_0_73,plain,
multiply(inverse(X1),X1) = sk_c12,
inference(rw,[status(thm)],[c_0_47,c_0_59]) ).
cnf(c_0_74,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_75,negated_conjecture,
( inverse(X5) != sk_c12
| inverse(X4) != sk_c11
| inverse(X3) != sk_c12
| inverse(X2) != sk_c12
| inverse(X1) != sk_c11
| multiply(X5,sk_c12) != sk_c11
| multiply(X4,sk_c11) != sk_c12
| multiply(X3,sk_c12) != sk_c12
| multiply(X2,sk_c12) != sk_c11
| multiply(X1,sk_c11) != sk_c12
| inverse(sk_c11) != inverse(sk_c12)
| multiply(sk_c11,inverse(sk_c11)) != sk_c12
| inverse(inverse(sk_c11)) != inverse(sk_c11) ),
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)],[c_0_70,c_0_59]),c_0_59]),c_0_59]),c_0_59]),c_0_59]),c_0_59])]) ).
cnf(c_0_76,negated_conjecture,
sk_c11 = sk_c12,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_64])]) ).
cnf(c_0_77,plain,
multiply(inverse(sk_c10),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_78,plain,
multiply(X1,sk_c12) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_73]),c_0_74]) ).
cnf(c_0_79,negated_conjecture,
( inverse(X5) != sk_c12
| inverse(X4) != sk_c12
| inverse(X3) != sk_c12
| inverse(X2) != sk_c12
| inverse(X1) != sk_c12
| inverse(sk_c12) != sk_c12
| multiply(X5,sk_c12) != sk_c12
| multiply(X4,sk_c12) != sk_c12
| multiply(X3,sk_c12) != sk_c12
| multiply(X2,sk_c12) != sk_c12
| multiply(X1,sk_c12) != sk_c12
| inverse(inverse(sk_c12)) != inverse(sk_c12) ),
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)],[c_0_75,c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_64]),c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_76])]) ).
cnf(c_0_80,plain,
inverse(sk_c12) = sk_c12,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_59]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_78]),c_0_78]),c_0_78]),c_0_78]),c_0_78])])])])])]),c_0_80]),c_0_80]),c_0_80]),c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP254-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.09/0.36 % Computer : n008.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 20:08:24 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.76/0.63 % Version: 3.5.1
% 1.76/0.63 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.76/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.76/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.76/0.63 % Starting new_bool_3 with 300s (1) cores
% 1.76/0.63 % Starting new_bool_1 with 300s (1) cores
% 1.76/0.63 % Starting sh5l with 300s (1) cores
% 1.76/0.63 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3496814 completed with status 0
% 1.76/0.63 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.76/0.63 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.76/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.76/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.76/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.76/0.63 % No SInE strategy applied
% 1.76/0.63 % Search class: FGHPS-FFMM21-SFFFFFNN
% 1.76/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.76/0.63 % Starting SubtermCWHack with 136s (1) cores
% 1.76/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.76/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.76/0.63 % Starting new_bool_3 with 136s (1) cores
% 1.76/0.63 % Starting new_bool_1 with 136s (1) cores
% 1.76/0.63 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3496823 completed with status 0
% 1.76/0.63 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.76/0.63 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.76/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.76/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.76/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.76/0.63 % No SInE strategy applied
% 1.76/0.63 % Search class: FGHPS-FFMM21-SFFFFFNN
% 1.76/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.76/0.63 % Starting SubtermCWHack with 136s (1) cores
% 1.76/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.76/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.76/0.63 % Preprocessing time : 0.002 s
% 1.76/0.63 % Presaturation interreduction done
% 1.76/0.63
% 1.76/0.63 % Proof found!
% 1.76/0.63 % SZS status Unsatisfiable
% 1.76/0.63 % SZS output start CNFRefutation
% See solution above
% 1.76/0.64 % Parsed axioms : 64
% 1.76/0.64 % Removed by relevancy pruning/SinE : 0
% 1.76/0.64 % Initial clauses : 64
% 1.76/0.64 % Removed in clause preprocessing : 0
% 1.76/0.64 % Initial clauses in saturation : 64
% 1.76/0.64 % Processed clauses : 3223
% 1.76/0.64 % ...of these trivial : 68
% 1.76/0.64 % ...subsumed : 1951
% 1.76/0.64 % ...remaining for further processing : 1203
% 1.76/0.64 % Other redundant clauses eliminated : 197
% 1.76/0.64 % Clauses deleted for lack of memory : 0
% 1.76/0.64 % Backward-subsumed : 136
% 1.76/0.64 % Backward-rewritten : 981
% 1.76/0.64 % Generated clauses : 10095
% 1.76/0.64 % ...of the previous two non-redundant : 9558
% 1.76/0.64 % ...aggressively subsumed : 0
% 1.76/0.64 % Contextual simplify-reflections : 88
% 1.76/0.64 % Paramodulations : 9898
% 1.76/0.64 % Factorizations : 1
% 1.76/0.64 % NegExts : 0
% 1.76/0.64 % Equation resolutions : 197
% 1.76/0.64 % Disequality decompositions : 0
% 1.76/0.64 % Total rewrite steps : 6334
% 1.76/0.64 % ...of those cached : 6180
% 1.76/0.64 % Propositional unsat checks : 0
% 1.76/0.64 % Propositional check models : 0
% 1.76/0.64 % Propositional check unsatisfiable : 0
% 1.76/0.64 % Propositional clauses : 0
% 1.76/0.64 % Propositional clauses after purity: 0
% 1.76/0.64 % Propositional unsat core size : 0
% 1.76/0.64 % Propositional preprocessing time : 0.000
% 1.76/0.64 % Propositional encoding time : 0.000
% 1.76/0.64 % Propositional solver time : 0.000
% 1.76/0.64 % Success case prop preproc time : 0.000
% 1.76/0.64 % Success case prop encoding time : 0.000
% 1.76/0.64 % Success case prop solver time : 0.000
% 1.76/0.64 % Current number of processed clauses : 21
% 1.76/0.64 % Positive orientable unit clauses : 21
% 1.76/0.64 % Positive unorientable unit clauses: 0
% 1.76/0.64 % Negative unit clauses : 0
% 1.76/0.64 % Non-unit-clauses : 0
% 1.76/0.64 % Current number of unprocessed clauses: 3864
% 1.76/0.64 % ...number of literals in the above : 24366
% 1.76/0.64 % Current number of archived formulas : 0
% 1.76/0.64 % Current number of archived clauses : 1181
% 1.76/0.64 % Clause-clause subsumption calls (NU) : 63999
% 1.76/0.64 % Rec. Clause-clause subsumption calls : 18721
% 1.76/0.64 % Non-unit clause-clause subsumptions : 2146
% 1.76/0.64 % Unit Clause-clause subsumption calls : 982
% 1.76/0.64 % Rewrite failures with RHS unbound : 0
% 1.76/0.64 % BW rewrite match attempts : 93
% 1.76/0.64 % BW rewrite match successes : 67
% 1.76/0.64 % Condensation attempts : 0
% 1.76/0.64 % Condensation successes : 0
% 1.76/0.64 % Termbank termtop insertions : 186854
% 1.76/0.64 % Search garbage collected termcells : 47
% 1.76/0.64
% 1.76/0.64 % -------------------------------------------------
% 1.76/0.64 % User time : 0.176 s
% 1.76/0.64 % System time : 0.009 s
% 1.76/0.64 % Total time : 0.184 s
% 1.76/0.64 % Maximum resident set size: 3664 pages
% 1.76/0.64
% 1.76/0.64 % -------------------------------------------------
% 1.76/0.64 % User time : 0.965 s
% 1.76/0.64 % System time : 0.046 s
% 1.76/0.64 % Total time : 1.012 s
% 1.76/0.64 % Maximum resident set size: 4864 pages
% 1.76/0.64 % E exiting
%------------------------------------------------------------------------------