%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP002-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:37:24 PM UTC 2026
% Result : Unsatisfiable 5.67s 1.36s
% Output : CNFRefutation 5.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of clauses : 106 ( 106 unt; 0 nHn; 30 RR)
% Number of literals : 106 ( 105 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-4 aty)
% Number of variables : 161 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity2,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,ifeq(product(X4,X1,X6),true,product(X6,X2,X5),true),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity2) ).
cnf(d_times_inverse_b_is_h,negated_conjecture,
product(d,inverse(b),h) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_times_inverse_b_is_h) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(total_function2,axiom,
ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',total_function2) ).
cnf(right_identity,axiom,
product(X1,identity,X1) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_identity) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(left_identity,axiom,
product(identity,X1,X1) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',total_function1) ).
cnf(h_times_b_is_j,negated_conjecture,
product(h,b,j) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_times_b_is_j) ).
cnf(associativity1,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X4,X1),true,product(X6,X5,X3),true),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity1) ).
cnf(x_cubed_is_identity_2,hypothesis,
ifeq(product(X1,X1,X2),true,product(X2,X1,identity),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_cubed_is_identity_2) ).
cnf(c_times_inverse_a_is_d,negated_conjecture,
product(c,inverse(a),d) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_times_inverse_a_is_d) ).
cnf(a_times_b_is_c,negated_conjecture,
product(a,b,c) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b_is_c) ).
cnf(right_inverse,axiom,
product(X1,inverse(X1),identity) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_inverse) ).
cnf(j_times_inverse_h_is_k,negated_conjecture,
product(j,inverse(h),k) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',j_times_inverse_h_is_k) ).
cnf(prove_k_times_inverse_b_is_e,negated_conjecture,
product(k,inverse(b),identity) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_k_times_inverse_b_is_e) ).
cnf(c_0_17,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,ifeq(product(X4,X1,X6),true,product(X6,X2,X5),true),true),true) = true,
associativity2 ).
cnf(c_0_18,negated_conjecture,
product(d,inverse(b),h) = true,
d_times_inverse_b_is_h ).
cnf(c_0_19,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_20,axiom,
ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
total_function2 ).
cnf(c_0_21,axiom,
product(X1,identity,X1) = true,
right_identity ).
cnf(c_0_22,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_23,axiom,
product(identity,X1,X1) = true,
left_identity ).
cnf(c_0_24,negated_conjecture,
ifeq(product(inverse(b),X1,X2),true,ifeq(product(d,X2,X3),true,product(h,X1,X3),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,axiom,
product(inverse(X1),X1,identity) = true,
left_inverse ).
cnf(c_0_26,plain,
ifeq2(product(X1,identity,X2),true,X1,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,axiom,
product(X1,X2,multiply(X1,X2)) = true,
total_function1 ).
cnf(c_0_28,negated_conjecture,
product(h,b,j) = true,
h_times_b_is_j ).
cnf(c_0_29,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X4,X1),true,product(X6,X5,X3),true),true),true) = true,
associativity1 ).
cnf(c_0_30,plain,
ifeq2(product(identity,X1,X2),true,X1,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_22]) ).
cnf(c_0_31,plain,
ifeq(product(X1,X2,identity),true,ifeq(product(X3,X1,X4),true,product(X4,X2,X3),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_21]),c_0_19]) ).
cnf(c_0_32,negated_conjecture,
ifeq(product(d,identity,X1),true,product(h,b,X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19]) ).
cnf(c_0_33,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22]) ).
cnf(c_0_34,negated_conjecture,
ifeq2(product(h,b,X1),true,X1,j) = j,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_28]),c_0_22]) ).
cnf(c_0_35,plain,
ifeq(product(identity,X1,X2),true,ifeq(product(X3,X1,X4),true,product(inverse(X3),X4,X2),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_19]) ).
cnf(c_0_36,plain,
multiply(identity,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27]),c_0_22]) ).
cnf(c_0_37,plain,
ifeq(product(X1,inverse(X2),X3),true,product(X3,X2,X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_19]) ).
cnf(c_0_38,hypothesis,
ifeq(product(X1,X1,X2),true,product(X2,X1,identity),true) = true,
x_cubed_is_identity_2 ).
cnf(c_0_39,negated_conjecture,
product(c,inverse(a),d) = true,
c_times_inverse_a_is_d ).
cnf(c_0_40,plain,
ifeq2(product(X1,X2,X3),true,multiply(X1,X2),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_22]) ).
cnf(c_0_41,negated_conjecture,
product(h,b,d) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_27]),c_0_33]),c_0_19]) ).
cnf(c_0_42,negated_conjecture,
multiply(h,b) = j,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_22]) ).
cnf(c_0_43,plain,
ifeq(product(X1,X2,X3),true,product(inverse(X1),X3,X2),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_27]),c_0_36]),c_0_19]) ).
cnf(c_0_44,plain,
product(identity,X1,inverse(inverse(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_25]),c_0_19]) ).
cnf(c_0_45,plain,
product(multiply(X1,inverse(X2)),X2,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_27]),c_0_19]) ).
cnf(c_0_46,hypothesis,
product(multiply(X1,X1),X1,identity) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_27]),c_0_19]) ).
cnf(c_0_47,negated_conjecture,
ifeq(product(inverse(a),X1,X2),true,ifeq(product(c,X2,X3),true,product(d,X1,X3),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_39]),c_0_19]) ).
cnf(c_0_48,negated_conjecture,
d = j,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_22]) ).
cnf(c_0_49,plain,
product(inverse(X1),multiply(X1,X2),X2) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_27]),c_0_19]) ).
cnf(c_0_50,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_44]),c_0_36]),c_0_22]) ).
cnf(c_0_51,plain,
multiply(multiply(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_45]),c_0_22]) ).
cnf(c_0_52,hypothesis,
multiply(multiply(X1,X1),X1) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_46]),c_0_22]) ).
cnf(c_0_53,negated_conjecture,
ifeq(product(inverse(a),X1,X2),true,product(j,X1,multiply(c,X2)),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_27]),c_0_19]),c_0_48]) ).
cnf(c_0_54,plain,
product(X1,multiply(inverse(X1),X2),X2) = true,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,hypothesis,
multiply(inverse(X1),inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_36]) ).
cnf(c_0_56,negated_conjecture,
product(a,b,c) = true,
a_times_b_is_c ).
cnf(c_0_57,axiom,
product(X1,inverse(X1),identity) = true,
right_inverse ).
cnf(c_0_58,negated_conjecture,
product(j,multiply(a,X1),multiply(c,X1)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_50]),c_0_19]) ).
cnf(c_0_59,hypothesis,
multiply(X1,X1) = inverse(X1),
inference(spm,[status(thm)],[c_0_51,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
ifeq(product(b,X1,X2),true,ifeq(product(h,X2,X3),true,product(j,X1,X3),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_19]) ).
cnf(c_0_61,negated_conjecture,
ifeq(product(b,X1,X2),true,ifeq(product(a,X2,X3),true,product(c,X1,X3),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_56]),c_0_19]) ).
cnf(c_0_62,plain,
ifeq(product(X1,X2,X3),true,product(X3,inverse(X2),X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_57]),c_0_19]) ).
cnf(c_0_63,hypothesis,
product(j,multiply(a,c),inverse(c)) = true,
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
ifeq(product(b,X1,X2),true,product(j,X1,multiply(h,X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_27]),c_0_19]) ).
cnf(c_0_65,negated_conjecture,
ifeq(product(b,X1,X2),true,product(c,X1,multiply(a,X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_27]),c_0_19]) ).
cnf(c_0_66,hypothesis,
product(inverse(c),inverse(multiply(a,c)),j) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_19]) ).
cnf(c_0_67,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_49]),c_0_22]) ).
cnf(c_0_68,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_69,negated_conjecture,
product(j,X1,multiply(h,multiply(b,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_27]),c_0_19]) ).
cnf(c_0_70,negated_conjecture,
product(c,X1,multiply(a,multiply(b,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_27]),c_0_19]) ).
cnf(c_0_71,hypothesis,
product(c,j,inverse(multiply(a,c))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_66]),c_0_50]),c_0_19]) ).
cnf(c_0_72,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_73,negated_conjecture,
multiply(h,multiply(b,X1)) = multiply(j,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_69]),c_0_22]) ).
cnf(c_0_74,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_67,c_0_50]) ).
cnf(c_0_75,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_68,c_0_67]) ).
cnf(c_0_76,negated_conjecture,
multiply(a,multiply(b,X1)) = multiply(c,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_70]),c_0_22]) ).
cnf(c_0_77,hypothesis,
inverse(multiply(a,c)) = multiply(c,j),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_71]),c_0_22]) ).
cnf(c_0_78,negated_conjecture,
multiply(inverse(multiply(j,X1)),h) = inverse(multiply(b,X1)),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_79,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_80,plain,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,product(multiply(X4,X1),X2,X5),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_27]),c_0_19]) ).
cnf(c_0_81,negated_conjecture,
multiply(inverse(a),multiply(c,X1)) = multiply(b,X1),
inference(spm,[status(thm)],[c_0_67,c_0_76]) ).
cnf(c_0_82,hypothesis,
multiply(c,multiply(c,j)) = inverse(a),
inference(spm,[status(thm)],[c_0_75,c_0_77]) ).
cnf(c_0_83,hypothesis,
product(inverse(j),inverse(c),multiply(a,c)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_63]),c_0_19]) ).
cnf(c_0_84,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_67,c_0_75]) ).
cnf(c_0_85,negated_conjecture,
multiply(multiply(X1,j),inverse(b)) = multiply(X1,h),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_75]),c_0_50]),c_0_79]) ).
cnf(c_0_86,plain,
ifeq(product(X1,X2,X3),true,product(multiply(X4,X1),X2,multiply(X4,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_27]),c_0_19]) ).
cnf(c_0_87,hypothesis,
product(X1,X1,inverse(X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_59]),c_0_50]) ).
cnf(c_0_88,hypothesis,
multiply(b,multiply(c,j)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_55]) ).
cnf(c_0_89,hypothesis,
inverse(multiply(c,j)) = multiply(a,c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_83]),c_0_84]),c_0_22]) ).
cnf(c_0_90,negated_conjecture,
multiply(multiply(X1,h),b) = multiply(X1,j),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_85]),c_0_50]) ).
cnf(c_0_91,hypothesis,
product(multiply(X1,X2),X2,multiply(X1,inverse(X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_19]) ).
cnf(c_0_92,negated_conjecture,
multiply(j,multiply(a,X1)) = multiply(c,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_58]),c_0_22]) ).
cnf(c_0_93,hypothesis,
multiply(a,multiply(a,c)) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_88]),c_0_89]) ).
cnf(c_0_94,negated_conjecture,
product(j,inverse(h),k) = true,
j_times_inverse_h_is_k ).
cnf(c_0_95,negated_conjecture,
multiply(multiply(X1,inverse(h)),j) = multiply(X1,b),
inference(spm,[status(thm)],[c_0_90,c_0_51]) ).
cnf(c_0_96,hypothesis,
multiply(multiply(X1,X2),X2) = multiply(X1,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_91]),c_0_22]) ).
cnf(c_0_97,negated_conjecture,
multiply(c,multiply(a,c)) = multiply(j,b),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_98,negated_conjecture,
ifeq2(product(j,inverse(h),X1),true,X1,k) = k,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_94]),c_0_22]) ).
cnf(c_0_99,negated_conjecture,
product(k,inverse(b),identity) != true,
inference(fof_simplification,[status(thm)],[prove_k_times_inverse_b_is_e]) ).
cnf(c_0_100,negated_conjecture,
multiply(multiply(X1,b),inverse(j)) = multiply(X1,inverse(h)),
inference(spm,[status(thm)],[c_0_68,c_0_95]) ).
cnf(c_0_101,hypothesis,
multiply(j,b) = multiply(b,j),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_82]),c_0_81]),c_0_89]),c_0_97]) ).
cnf(c_0_102,negated_conjecture,
multiply(j,inverse(h)) = k,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_27]),c_0_22]) ).
cnf(c_0_103,negated_conjecture,
product(k,inverse(b),identity) != true,
c_0_99 ).
cnf(c_0_104,negated_conjecture,
k = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_68]),c_0_102]) ).
cnf(c_0_105,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP002-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n007.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 20 19:50:35 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.47 Running first-order theorem proving
% 0.13/0.47 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
% 5.67/1.36 % Version: 3.5.1
% 5.67/1.36 % Preprocessing class: FSMSSMSMSSSNFFN.
% 5.67/1.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.67/1.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 5.67/1.36 % Starting new_bool_3 with 300s (1) cores
% 5.67/1.36 % Starting new_bool_1 with 300s (1) cores
% 5.67/1.36 % Starting sh5l with 300s (1) cores
% 5.67/1.36 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3433863 completed with status 0
% 5.67/1.36 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 5.67/1.36 % Preprocessing class: FSMSSMSMSSSNFFN.
% 5.67/1.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.67/1.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 5.67/1.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.67/1.36 % No SInE strategy applied
% 5.67/1.36 % Search class: FUUPM-FFSS32-MFFFFFNN
% 5.67/1.36 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.67/1.36 % Starting SubtermCWHack with 136s (1) cores
% 5.67/1.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 5.67/1.36 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.67/1.36 % Starting new_bool_3 with 136s (1) cores
% 5.67/1.36 % Starting new_bool_1 with 136s (1) cores
% 5.67/1.36 % new_bool_3 with pid 3433871 completed with status 0
% 5.67/1.36 % Result found by new_bool_3
% 5.67/1.36 % Preprocessing class: FSMSSMSMSSSNFFN.
% 5.67/1.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.67/1.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 5.67/1.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.67/1.36 % No SInE strategy applied
% 5.67/1.36 % Search class: FUUPM-FFSS32-MFFFFFNN
% 5.67/1.36 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.67/1.36 % Starting SubtermCWHack with 136s (1) cores
% 5.67/1.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 5.67/1.36 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.67/1.36 % Starting new_bool_3 with 136s (1) cores
% 5.67/1.36 % Preprocessing time : 0.001 s
% 5.67/1.36 % Presaturation interreduction done
% 5.67/1.36
% 5.67/1.36 % Proof found!
% 5.67/1.36 % SZS status Unsatisfiable
% 5.67/1.36 % SZS output start CNFRefutation
% See solution above
% 5.67/1.36 % Parsed axioms : 18
% 5.67/1.36 % Removed by relevancy pruning/SinE : 0
% 5.67/1.36 % Initial clauses : 18
% 5.67/1.36 % Removed in clause preprocessing : 0
% 5.67/1.36 % Initial clauses in saturation : 18
% 5.67/1.36 % Processed clauses : 2641
% 5.67/1.36 % ...of these trivial : 1393
% 5.67/1.36 % ...subsumed : 0
% 5.67/1.36 % ...remaining for further processing : 1248
% 5.67/1.36 % Other redundant clauses eliminated : 0
% 5.67/1.36 % Clauses deleted for lack of memory : 0
% 5.67/1.36 % Backward-subsumed : 0
% 5.67/1.36 % Backward-rewritten : 373
% 5.67/1.36 % Generated clauses : 55105
% 5.67/1.36 % ...of the previous two non-redundant : 33231
% 5.67/1.36 % ...aggressively subsumed : 0
% 5.67/1.36 % Contextual simplify-reflections : 0
% 5.67/1.36 % Paramodulations : 55105
% 5.67/1.36 % Factorizations : 0
% 5.67/1.36 % NegExts : 0
% 5.67/1.36 % Equation resolutions : 0
% 5.67/1.36 % Disequality decompositions : 0
% 5.67/1.36 % Total rewrite steps : 76266
% 5.67/1.36 % ...of those cached : 55425
% 5.67/1.36 % Propositional unsat checks : 0
% 5.67/1.36 % Propositional check models : 0
% 5.67/1.36 % Propositional check unsatisfiable : 0
% 5.67/1.36 % Propositional clauses : 0
% 5.67/1.36 % Propositional clauses after purity: 0
% 5.67/1.36 % Propositional unsat core size : 0
% 5.67/1.36 % Propositional preprocessing time : 0.000
% 5.67/1.36 % Propositional encoding time : 0.000
% 5.67/1.36 % Propositional solver time : 0.000
% 5.67/1.36 % Success case prop preproc time : 0.000
% 5.67/1.36 % Success case prop encoding time : 0.000
% 5.67/1.36 % Success case prop solver time : 0.000
% 5.67/1.36 % Current number of processed clauses : 857
% 5.67/1.36 % Positive orientable unit clauses : 857
% 5.67/1.36 % Positive unorientable unit clauses: 0
% 5.67/1.36 % Negative unit clauses : 0
% 5.67/1.36 % Non-unit-clauses : 0
% 5.67/1.36 % Current number of unprocessed clauses: 29960
% 5.67/1.36 % ...number of literals in the above : 29960
% 5.67/1.36 % Current number of archived formulas : 0
% 5.67/1.36 % Current number of archived clauses : 391
% 5.67/1.36 % Clause-clause subsumption calls (NU) : 0
% 5.67/1.36 % Rec. Clause-clause subsumption calls : 0
% 5.67/1.36 % Non-unit clause-clause subsumptions : 0
% 5.67/1.36 % Unit Clause-clause subsumption calls : 0
% 5.67/1.36 % Rewrite failures with RHS unbound : 0
% 5.67/1.36 % BW rewrite match attempts : 15474
% 5.67/1.36 % BW rewrite match successes : 199
% 5.67/1.36 % Condensation attempts : 0
% 5.67/1.36 % Condensation successes : 0
% 5.67/1.36 % Termbank termtop insertions : 858186
% 5.67/1.36 % Search garbage collected termcells : 2
% 5.67/1.36
% 5.67/1.36 % -------------------------------------------------
% 5.67/1.36 % User time : 0.655 s
% 5.67/1.36 % System time : 0.043 s
% 5.67/1.36 % Total time : 0.698 s
% 5.67/1.36 % Maximum resident set size: 3640 pages
% 5.67/1.36
% 5.67/1.36 % -------------------------------------------------
% 5.67/1.36 % User time : 3.726 s
% 5.67/1.36 % System time : 0.236 s
% 5.67/1.36 % Total time : 3.962 s
% 5.67/1.36 % Maximum resident set size: 4608 pages
% 5.67/1.36 % E exiting
%------------------------------------------------------------------------------