%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE104-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 : n011.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:58:51 PM UTC 2026
% Result : Unsatisfiable 109.97s 16.62s
% Output : CNFRefutation 109.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 28
% Syntax : Number of clauses : 104 ( 104 unt; 0 nHn; 24 RR)
% Number of literals : 104 ( 103 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 15 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 6 con; 0-4 aty)
% Number of variables : 140 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(additive_identity,axiom,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity) ).
cnf(additive_commutativity,axiom,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
cnf(complement,axiom,
c(X1) = antidomain(domain(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement) ).
cnf(domain4,axiom,
domain(X1) = antidomain(antidomain(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain4) ).
cnf(left_distributivity,axiom,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).
cnf(domain1,axiom,
multiplication(antidomain(X1),X1) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain1) ).
cnf(domain3,axiom,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain3) ).
cnf(backward_box,axiom,
backward_box(X1,X2) = c(backward_diamond(X1,c(X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',backward_box) ).
cnf(backward_diamond,axiom,
backward_diamond(X1,X2) = codomain(multiplication(codomain(X2),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',backward_diamond) ).
cnf(codomain4,axiom,
codomain(X1) = coantidomain(coantidomain(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',codomain4) ).
cnf(right_distributivity,axiom,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_distributivity) ).
cnf(multiplicative_left_identity,axiom,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).
cnf(goals,negated_conjecture,
addition(domain(sK2_goals_X1),backward_box(sK3_goals_X0,domain(sK1_goals_X2))) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(multiplicative_right_identity,axiom,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).
cnf(additive_associativity,axiom,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).
cnf(additive_idempotence,axiom,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_idempotence) ).
cnf(codomain3,axiom,
addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',codomain3) ).
cnf(codomain1,axiom,
multiplication(X1,coantidomain(X1)) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',codomain1) ).
cnf(multiplicative_associativity,axiom,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).
cnf(right_annihilation,axiom,
multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_annihilation) ).
cnf(order_1,axiom,
ifeq(leq(X1,X2),true,addition(X1,X2),X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order_1) ).
cnf(domain2,axiom,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2))))) = antidomain(multiplication(X1,antidomain(antidomain(X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain2) ).
cnf(forward_diamond,axiom,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',forward_diamond) ).
cnf(order,axiom,
ifeq2(addition(X1,X2),X2,leq(X1,X2),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(goals_1,negated_conjecture,
addition(forward_box(sK3_goals_X0,domain(sK2_goals_X1)),domain(sK1_goals_X2)) != one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_1) ).
cnf(forward_box,axiom,
forward_box(X1,X2) = c(forward_diamond(X1,c(X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',forward_box) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(c_0_28,axiom,
addition(X1,zero) = X1,
additive_identity ).
cnf(c_0_29,axiom,
addition(X1,X2) = addition(X2,X1),
additive_commutativity ).
cnf(c_0_30,axiom,
c(X1) = antidomain(domain(X1)),
complement ).
cnf(c_0_31,axiom,
domain(X1) = antidomain(antidomain(X1)),
domain4 ).
cnf(c_0_32,axiom,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
left_distributivity ).
cnf(c_0_33,axiom,
multiplication(antidomain(X1),X1) = zero,
domain1 ).
cnf(c_0_34,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,axiom,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
domain3 ).
cnf(c_0_36,axiom,
backward_box(X1,X2) = c(backward_diamond(X1,c(X2))),
backward_box ).
cnf(c_0_37,plain,
c(X1) = antidomain(antidomain(antidomain(X1))),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,axiom,
backward_diamond(X1,X2) = codomain(multiplication(codomain(X2),X1)),
backward_diamond ).
cnf(c_0_39,axiom,
codomain(X1) = coantidomain(coantidomain(X1)),
codomain4 ).
cnf(c_0_40,axiom,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
right_distributivity ).
cnf(c_0_41,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_42,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_43,axiom,
multiplication(one,X1) = X1,
multiplicative_left_identity ).
cnf(c_0_44,negated_conjecture,
addition(domain(sK2_goals_X1),backward_box(sK3_goals_X0,domain(sK1_goals_X2))) = one,
goals ).
cnf(c_0_45,plain,
backward_box(X1,X2) = antidomain(antidomain(antidomain(backward_diamond(X1,antidomain(antidomain(antidomain(X2))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_46,plain,
backward_diamond(X1,X2) = coantidomain(coantidomain(multiplication(coantidomain(coantidomain(X2)),X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39]) ).
cnf(c_0_47,plain,
multiplication(antidomain(X1),addition(X2,X1)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_28]) ).
cnf(c_0_48,axiom,
multiplication(X1,one) = X1,
multiplicative_right_identity ).
cnf(c_0_49,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_50,negated_conjecture,
addition(antidomain(antidomain(sK2_goals_X1)),antidomain(antidomain(antidomain(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(antidomain(antidomain(antidomain(antidomain(sK1_goals_X2))))))),sK3_goals_X0))))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_31]),c_0_31]),c_0_45]),c_0_46]) ).
cnf(c_0_51,plain,
antidomain(antidomain(antidomain(X1))) = antidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_48]),c_0_49]) ).
cnf(c_0_52,axiom,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
additive_associativity ).
cnf(c_0_53,axiom,
addition(X1,X1) = X1,
additive_idempotence ).
cnf(c_0_54,axiom,
addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
codomain3 ).
cnf(c_0_55,axiom,
multiplication(X1,coantidomain(X1)) = zero,
codomain1 ).
cnf(c_0_56,plain,
multiplication(addition(X1,antidomain(X2)),X2) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28]) ).
cnf(c_0_57,negated_conjecture,
addition(antidomain(antidomain(sK2_goals_X1)),antidomain(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(sK1_goals_X2))),sK3_goals_X0))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_51]),c_0_51]) ).
cnf(c_0_58,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,plain,
addition(coantidomain(X1),coantidomain(coantidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_54,c_0_29]) ).
cnf(c_0_60,plain,
multiplication(X1,addition(coantidomain(X1),X2)) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_55]),c_0_34]) ).
cnf(c_0_61,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_48]),c_0_29]) ).
cnf(c_0_62,negated_conjecture,
multiplication(antidomain(antidomain(sK2_goals_X1)),coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(sK1_goals_X2))),sK3_goals_X0)))) = coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(sK1_goals_X2))),sK3_goals_X0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_43]) ).
cnf(c_0_63,plain,
addition(one,coantidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_29]) ).
cnf(c_0_64,axiom,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
multiplicative_associativity ).
cnf(c_0_65,plain,
multiplication(X1,coantidomain(coantidomain(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_59]),c_0_48]) ).
cnf(c_0_66,negated_conjecture,
addition(antidomain(antidomain(sK2_goals_X1)),coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(sK1_goals_X2))),sK3_goals_X0)))) = antidomain(antidomain(sK2_goals_X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_29]),c_0_63]),c_0_48]) ).
cnf(c_0_67,plain,
multiplication(X1,multiplication(coantidomain(coantidomain(X1)),X2)) = multiplication(X1,X2),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
multiplication(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(sK1_goals_X2))),sK3_goals_X0))),antidomain(sK2_goals_X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_66]),c_0_33]) ).
cnf(c_0_69,axiom,
multiplication(X1,zero) = zero,
right_annihilation ).
cnf(c_0_70,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_48,c_0_33]) ).
cnf(c_0_71,negated_conjecture,
multiplication(coantidomain(coantidomain(antidomain(sK1_goals_X2))),multiplication(sK3_goals_X0,antidomain(sK2_goals_X1))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_64]) ).
cnf(c_0_72,plain,
addition(zero,antidomain(zero)) = one,
inference(spm,[status(thm)],[c_0_42,c_0_70]) ).
cnf(c_0_73,axiom,
ifeq(leq(X1,X2),true,addition(X1,X2),X2) = X2,
order_1 ).
cnf(c_0_74,axiom,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2))))) = antidomain(multiplication(X1,antidomain(antidomain(X2)))),
domain2 ).
cnf(c_0_75,negated_conjecture,
multiplication(antidomain(sK1_goals_X2),multiplication(sK3_goals_X0,antidomain(sK2_goals_X1))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_71]),c_0_69]) ).
cnf(c_0_76,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[c_0_72,c_0_34]) ).
cnf(c_0_77,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_42]),c_0_29]) ).
cnf(c_0_78,axiom,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
forward_diamond ).
cnf(c_0_79,plain,
ifeq(leq(multiplication(X1,X2),multiplication(X1,X3)),true,multiplication(X1,addition(X2,X3)),multiplication(X1,X3)) = multiplication(X1,X3),
inference(spm,[status(thm)],[c_0_73,c_0_40]) ).
cnf(c_0_80,negated_conjecture,
antidomain(multiplication(antidomain(sK1_goals_X2),antidomain(antidomain(multiplication(sK3_goals_X0,antidomain(sK2_goals_X1)))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_77]) ).
cnf(c_0_81,axiom,
ifeq2(addition(X1,X2),X2,leq(X1,X2),true) = true,
order ).
cnf(c_0_82,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_83,negated_conjecture,
addition(forward_box(sK3_goals_X0,domain(sK2_goals_X1)),domain(sK1_goals_X2)) != one,
inference(fof_simplification,[status(thm)],[goals_1]) ).
cnf(c_0_84,axiom,
forward_box(X1,X2) = c(forward_diamond(X1,c(X2))),
forward_box ).
cnf(c_0_85,plain,
forward_diamond(X1,X2) = antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_31]),c_0_31]) ).
cnf(c_0_86,plain,
multiplication(antidomain(addition(X1,X2)),X1) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_58]),c_0_33]) ).
cnf(c_0_87,plain,
ifeq(leq(multiplication(X1,antidomain(X2)),multiplication(X1,antidomain(antidomain(X2)))),true,X1,multiplication(X1,antidomain(antidomain(X2)))) = multiplication(X1,antidomain(antidomain(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_42]),c_0_48]) ).
cnf(c_0_88,negated_conjecture,
multiplication(antidomain(sK1_goals_X2),antidomain(antidomain(multiplication(sK3_goals_X0,antidomain(sK2_goals_X1))))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_80]),c_0_43]) ).
cnf(c_0_89,plain,
leq(zero,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_34]),c_0_82]) ).
cnf(c_0_90,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_91,negated_conjecture,
addition(forward_box(sK3_goals_X0,domain(sK2_goals_X1)),domain(sK1_goals_X2)) != one,
c_0_83 ).
cnf(c_0_92,plain,
forward_box(X1,X2) = antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(X1,antidomain(antidomain(antidomain(antidomain(antidomain(X2))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_37]),c_0_37]),c_0_85]) ).
cnf(c_0_93,plain,
multiplication(addition(antidomain(addition(X1,X2)),X3),X1) = multiplication(X3,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_86]),c_0_34]) ).
cnf(c_0_94,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_43]),c_0_29]) ).
cnf(c_0_95,negated_conjecture,
multiplication(antidomain(sK1_goals_X2),antidomain(multiplication(sK3_goals_X0,antidomain(sK2_goals_X1)))) = antidomain(sK1_goals_X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_51]),c_0_89]),c_0_51]),c_0_90]),c_0_51]) ).
cnf(c_0_96,negated_conjecture,
addition(antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK3_goals_X0,antidomain(antidomain(antidomain(antidomain(antidomain(antidomain(antidomain(sK2_goals_X1))))))))))))),antidomain(antidomain(sK1_goals_X2))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_31]),c_0_31]),c_0_92]) ).
cnf(c_0_97,plain,
multiplication(antidomain(antidomain(addition(X1,X2))),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_42]),c_0_43]) ).
cnf(c_0_98,negated_conjecture,
addition(antidomain(sK1_goals_X2),antidomain(multiplication(sK3_goals_X0,antidomain(sK2_goals_X1)))) = antidomain(multiplication(sK3_goals_X0,antidomain(sK2_goals_X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_29]),c_0_29]),c_0_77]),c_0_43]) ).
cnf(c_0_99,negated_conjecture,
addition(antidomain(antidomain(sK1_goals_X2)),antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK3_goals_X0,antidomain(antidomain(antidomain(antidomain(antidomain(antidomain(antidomain(sK2_goals_X1)))))))))))))) != one,
inference(rw,[status(thm)],[c_0_96,c_0_29]) ).
cnf(c_0_100,plain,
addition(X1,addition(antidomain(X2),multiplication(X1,X2))) = multiplication(addition(X1,antidomain(X2)),addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_56]),c_0_52]) ).
cnf(c_0_101,negated_conjecture,
multiplication(antidomain(multiplication(sK3_goals_X0,antidomain(sK2_goals_X1))),antidomain(sK1_goals_X2)) = antidomain(sK1_goals_X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_51]) ).
cnf(c_0_102,negated_conjecture,
addition(antidomain(antidomain(sK1_goals_X2)),antidomain(multiplication(sK3_goals_X0,antidomain(sK2_goals_X1)))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_51]),c_0_51]),c_0_51]),c_0_51]),c_0_51]) ).
cnf(c_0_103,negated_conjecture,
$false,
inference(sr,[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(spm,[status(thm)],[c_0_100,c_0_101]),c_0_29]),c_0_42]),c_0_29]),c_0_77]),c_0_29]),c_0_77]),c_0_48]),c_0_29]),c_0_102]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE104-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.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 22:43:41 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 109.97/16.62 % Version: 3.5.1
% 109.97/16.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 109.97/16.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 109.97/16.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 109.97/16.62 % Starting new_bool_3 with 300s (1) cores
% 109.97/16.62 % Starting new_bool_1 with 300s (1) cores
% 109.97/16.62 % Starting sh5l with 300s (1) cores
% 109.97/16.62 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 351349 completed with status 0
% 109.97/16.62 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 109.97/16.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 109.97/16.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 109.97/16.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 109.97/16.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 109.97/16.62 % No SInE strategy applied
% 109.97/16.62 % Search class: FUUPM-FFMF32-DFFFFFNN
% 109.97/16.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 109.97/16.62 % Starting SubtermCWHack with 136s (1) cores
% 109.97/16.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 109.97/16.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 226s (1) cores
% 109.97/16.62 % Starting new_bool_3 with 226s (1) cores
% 109.97/16.62 % Starting new_bool_1 with 226s (1) cores
% 109.97/16.62 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 351355 completed with status 0
% 109.97/16.62 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 109.97/16.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 109.97/16.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 109.97/16.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 109.97/16.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 109.97/16.62 % No SInE strategy applied
% 109.97/16.62 % Search class: FUUPM-FFMF32-DFFFFFNN
% 109.97/16.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 109.97/16.62 % Starting SubtermCWHack with 136s (1) cores
% 109.97/16.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 109.97/16.62 % Preprocessing time : 0.001 s
% 109.97/16.62 % Presaturation interreduction done
% 109.97/16.62
% 109.97/16.62 % Proof found!
% 109.97/16.62 % SZS status Unsatisfiable
% 109.97/16.62 % SZS output start CNFRefutation
% See solution above
% 109.97/16.62 % Parsed axioms : 31
% 109.97/16.62 % Removed by relevancy pruning/SinE : 0
% 109.97/16.62 % Initial clauses : 31
% 109.97/16.62 % Removed in clause preprocessing : 8
% 109.97/16.62 % Initial clauses in saturation : 23
% 109.97/16.62 % Processed clauses : 13128
% 109.97/16.62 % ...of these trivial : 3631
% 109.97/16.62 % ...subsumed : 6055
% 109.97/16.62 % ...remaining for further processing : 3441
% 109.97/16.62 % Other redundant clauses eliminated : 0
% 109.97/16.62 % Clauses deleted for lack of memory : 0
% 109.97/16.62 % Backward-subsumed : 0
% 109.97/16.62 % Backward-rewritten : 1039
% 109.97/16.62 % Generated clauses : 1026028
% 109.97/16.62 % ...of the previous two non-redundant : 605897
% 109.97/16.62 % ...aggressively subsumed : 0
% 109.97/16.62 % Contextual simplify-reflections : 0
% 109.97/16.62 % Paramodulations : 1026028
% 109.97/16.62 % Factorizations : 0
% 109.97/16.62 % NegExts : 0
% 109.97/16.62 % Equation resolutions : 0
% 109.97/16.62 % Disequality decompositions : 0
% 109.97/16.62 % Total rewrite steps : 2218339
% 109.97/16.62 % ...of those cached : 1956576
% 109.97/16.62 % Propositional unsat checks : 0
% 109.97/16.62 % Propositional check models : 0
% 109.97/16.62 % Propositional check unsatisfiable : 0
% 109.97/16.62 % Propositional clauses : 0
% 109.97/16.62 % Propositional clauses after purity: 0
% 109.97/16.62 % Propositional unsat core size : 0
% 109.97/16.62 % Propositional preprocessing time : 0.000
% 109.97/16.62 % Propositional encoding time : 0.000
% 109.97/16.62 % Propositional solver time : 0.000
% 109.97/16.62 % Success case prop preproc time : 0.000
% 109.97/16.62 % Success case prop encoding time : 0.000
% 109.97/16.62 % Success case prop solver time : 0.000
% 109.97/16.62 % Current number of processed clauses : 2379
% 109.97/16.62 % Positive orientable unit clauses : 2360
% 109.97/16.62 % Positive unorientable unit clauses: 18
% 109.97/16.62 % Negative unit clauses : 1
% 109.97/16.62 % Non-unit-clauses : 0
% 109.97/16.62 % Current number of unprocessed clauses: 589999
% 109.97/16.62 % ...number of literals in the above : 589999
% 109.97/16.62 % Current number of archived formulas : 0
% 109.97/16.62 % Current number of archived clauses : 1070
% 109.97/16.62 % Clause-clause subsumption calls (NU) : 0
% 109.97/16.62 % Rec. Clause-clause subsumption calls : 0
% 109.97/16.62 % Non-unit clause-clause subsumptions : 0
% 109.97/16.62 % Unit Clause-clause subsumption calls : 1368
% 109.97/16.62 % Rewrite failures with RHS unbound : 0
% 109.97/16.62 % BW rewrite match attempts : 113529
% 109.97/16.62 % BW rewrite match successes : 673
% 109.97/16.62 % Condensation attempts : 0
% 109.97/16.62 % Condensation successes : 0
% 109.97/16.62 % Termbank termtop insertions : 24727980
% 109.97/16.62 % Search garbage collected termcells : 2
% 109.97/16.62
% 109.97/16.62 % -------------------------------------------------
% 109.97/16.62 % User time : 14.998 s
% 109.97/16.62 % System time : 0.626 s
% 109.97/16.62 % Total time : 15.624 s
% 109.97/16.62 % Maximum resident set size: 3652 pages
% 109.97/16.62
% 109.97/16.62 % -------------------------------------------------
% 109.97/16.62 % User time : 74.804 s
% 109.97/16.62 % System time : 2.922 s
% 109.97/16.62 % Total time : 77.725 s
% 109.97/16.62 % Maximum resident set size: 4864 pages
% 109.97/16.62 % E exiting
%------------------------------------------------------------------------------