%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV008-2.001 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:47:19 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.61s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 32
% Syntax : Number of clauses : 142 ( 35 unt; 8 nHn; 142 RR)
% Number of literals : 289 ( 0 equ; 154 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 1 con; 0-1 aty)
% Number of variables : 97 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(value_propagation_zero1,axiom,
( ~ zero(X1)
| ~ connection(X1,X2)
| zero(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',value_propagation_zero1) ).
cnf(nbit_adder_connection_ina1_in1f1,axiom,
( ~ nbit_adder1(X1)
| connection(ina1(X1),in1(f1(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_ina1_in1f1) ).
cnf(nbit_adder_connection_inc_incf1,axiom,
( ~ nbit_adder1(X1)
| connection(inc(X1),inc(f1(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_inc_incf1) ).
cnf(fulladder_connection_in1_in1h2,axiom,
( ~ fulladder(X1)
| connection(in1(X1),in1(h2(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_in1_in1h2) ).
cnf(fulladder_connection_inc_in2h1,axiom,
( ~ fulladder(X1)
| connection(inc(X1),in2(h1(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_inc_in2h1) ).
cnf(ina1_0,hypothesis,
zero(ina1(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ina1_0) ).
cnf(a_isa_1bit_adder,hypothesis,
nbit_adder1(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_isa_1bit_adder) ).
cnf(inc_0,hypothesis,
zero(inc(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inc_0) ).
cnf(halfadder_connection_in1_in1and2,axiom,
( ~ halfadder(X1)
| connection(in1(X1),in1(and2(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-1.ax',halfadder_connection_in1_in1and2) ).
cnf(nbit_adder_fulladder1,axiom,
( ~ nbit_adder1(X1)
| fulladder(f1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_fulladder1) ).
cnf(halfadder_connection_in2_in2and2,axiom,
( ~ halfadder(X1)
| connection(in2(X1),in2(and2(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-1.ax',halfadder_connection_in2_in2and2) ).
cnf(fulladder_halfadder2,axiom,
( ~ fulladder(X1)
| halfadder(h2(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_halfadder2) ).
cnf(fulladder_halfadder1,axiom,
( ~ fulladder(X1)
| halfadder(h1(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_halfadder1) ).
cnf(and_0x_0,axiom,
( ~ zero(in1(X1))
| ~ and_ok(X1)
| zero(out1(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',and_0x_0) ).
cnf(and_ok_or_abnormal,axiom,
( ~ logic_and(X1)
| abnormal(X1)
| and_ok(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',and_ok_or_abnormal) ).
cnf(halfadder_and2,axiom,
( ~ halfadder(X1)
| logic_and(and2(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-1.ax',halfadder_and2) ).
cnf(and_x0_0,axiom,
( ~ zero(in2(X1))
| ~ and_ok(X1)
| zero(out1(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',and_x0_0) ).
cnf(diagnosis_and2h2f1,negated_conjecture,
~ abnormal(and2(h2(f1(a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h2f1) ).
cnf(diagnosis_and2h1f1,negated_conjecture,
~ abnormal(and2(h1(f1(a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h1f1) ).
cnf(value_propagation_zero2,axiom,
( ~ zero(X2)
| ~ connection(X1,X2)
| zero(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',value_propagation_zero2) ).
cnf(halfadder_connection_outc_out1and2,axiom,
( ~ halfadder(X1)
| connection(outc(X1),out1(and2(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-1.ax',halfadder_connection_outc_out1and2) ).
cnf(value_propagation_one1,axiom,
( ~ one(X1)
| ~ connection(X1,X2)
| one(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',value_propagation_one1) ).
cnf(nbit_adder_connection_outc_outcf1,axiom,
( ~ nbit_adder1(X1)
| connection(outc(X1),outc(f1(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_outc_outcf1) ).
cnf(fulladder_connection_outc_out1or1,axiom,
( ~ fulladder(X1)
| connection(outc(X1),out1(or1(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_outc_out1or1) ).
cnf(fulladder_connection_outch2_in1or1,axiom,
( ~ fulladder(X1)
| connection(outc(h2(X1)),in1(or1(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_outch2_in1or1) ).
cnf(fulladder_connection_outch1_in2or1,axiom,
( ~ fulladder(X1)
| connection(outc(h1(X1)),in2(or1(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_outch1_in2or1) ).
cnf(outc_0,hypothesis,
one(outc(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',outc_0) ).
cnf(unique_value,axiom,
( ~ one(X1)
| ~ zero(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',unique_value) ).
cnf(or_00_0,axiom,
( ~ zero(in2(X1))
| ~ zero(in1(X1))
| ~ or_ok(X1)
| zero(out1(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',or_00_0) ).
cnf(or_ok_or_abnormal,axiom,
( ~ logic_or(X1)
| abnormal(X1)
| or_ok(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',or_ok_or_abnormal) ).
cnf(fulladder_or1,axiom,
( ~ fulladder(X1)
| logic_or(or1(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_or1) ).
cnf(diagnosis_or1f1,negated_conjecture,
~ abnormal(or1(f1(a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_or1f1) ).
cnf(c_0_32,plain,
( ~ zero(X1)
| ~ connection(X1,X2)
| zero(X2) ),
inference(fof_simplification,[status(thm)],[value_propagation_zero1]) ).
cnf(c_0_33,plain,
( ~ nbit_adder1(X1)
| connection(ina1(X1),in1(f1(X1))) ),
inference(fof_simplification,[status(thm)],[nbit_adder_connection_ina1_in1f1]) ).
cnf(c_0_34,plain,
( ~ nbit_adder1(X1)
| connection(inc(X1),inc(f1(X1))) ),
inference(fof_simplification,[status(thm)],[nbit_adder_connection_inc_incf1]) ).
cnf(c_0_35,plain,
( ~ fulladder(X1)
| connection(in1(X1),in1(h2(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_in1_in1h2]) ).
cnf(c_0_36,plain,
( ~ zero(X1)
| ~ connection(X1,X2)
| zero(X2) ),
c_0_32 ).
cnf(c_0_37,plain,
( ~ nbit_adder1(X1)
| connection(ina1(X1),in1(f1(X1))) ),
c_0_33 ).
cnf(c_0_38,plain,
( ~ fulladder(X1)
| connection(inc(X1),in2(h1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_inc_in2h1]) ).
cnf(c_0_39,plain,
( ~ nbit_adder1(X1)
| connection(inc(X1),inc(f1(X1))) ),
c_0_34 ).
cnf(c_0_40,plain,
( ~ fulladder(X1)
| connection(in1(X1),in1(h2(X1))) ),
c_0_35 ).
cnf(c_0_41,plain,
( ~ zero(ina1(X1))
| ~ nbit_adder1(X1)
| zero(in1(f1(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,hypothesis,
zero(ina1(a)),
ina1_0 ).
cnf(c_0_43,hypothesis,
nbit_adder1(a),
a_isa_1bit_adder ).
cnf(c_0_44,plain,
( ~ fulladder(X1)
| connection(inc(X1),in2(h1(X1))) ),
c_0_38 ).
cnf(c_0_45,plain,
( ~ zero(inc(X1))
| ~ nbit_adder1(X1)
| zero(inc(f1(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_39]) ).
cnf(c_0_46,hypothesis,
zero(inc(a)),
inc_0 ).
cnf(c_0_47,plain,
( ~ halfadder(X1)
| connection(in1(X1),in1(and2(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_in1_in1and2]) ).
cnf(c_0_48,plain,
( ~ zero(in1(X1))
| ~ fulladder(X1)
| zero(in1(h2(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_40]) ).
cnf(c_0_49,hypothesis,
zero(in1(f1(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_50,plain,
( ~ nbit_adder1(X1)
| fulladder(f1(X1)) ),
inference(fof_simplification,[status(thm)],[nbit_adder_fulladder1]) ).
cnf(c_0_51,plain,
( ~ halfadder(X1)
| connection(in2(X1),in2(and2(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_in2_in2and2]) ).
cnf(c_0_52,plain,
( ~ zero(inc(X1))
| ~ fulladder(X1)
| zero(in2(h1(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_44]) ).
cnf(c_0_53,hypothesis,
zero(inc(f1(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_43])]) ).
cnf(c_0_54,plain,
( ~ halfadder(X1)
| connection(in1(X1),in1(and2(X1))) ),
c_0_47 ).
cnf(c_0_55,hypothesis,
( ~ fulladder(f1(a))
| zero(in1(h2(f1(a)))) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,plain,
( ~ nbit_adder1(X1)
| fulladder(f1(X1)) ),
c_0_50 ).
cnf(c_0_57,plain,
( ~ halfadder(X1)
| connection(in2(X1),in2(and2(X1))) ),
c_0_51 ).
cnf(c_0_58,hypothesis,
( ~ fulladder(f1(a))
| zero(in2(h1(f1(a)))) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,plain,
( ~ zero(in1(X1))
| ~ halfadder(X1)
| zero(in1(and2(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_54]) ).
cnf(c_0_60,hypothesis,
zero(in1(h2(f1(a)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_43])]) ).
cnf(c_0_61,plain,
( ~ fulladder(X1)
| halfadder(h2(X1)) ),
inference(fof_simplification,[status(thm)],[fulladder_halfadder2]) ).
cnf(c_0_62,plain,
( ~ zero(in2(X1))
| ~ halfadder(X1)
| zero(in2(and2(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_57]) ).
cnf(c_0_63,hypothesis,
zero(in2(h1(f1(a)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_56]),c_0_43])]) ).
cnf(c_0_64,plain,
( ~ fulladder(X1)
| halfadder(h1(X1)) ),
inference(fof_simplification,[status(thm)],[fulladder_halfadder1]) ).
cnf(c_0_65,hypothesis,
( ~ halfadder(h2(f1(a)))
| zero(in1(and2(h2(f1(a))))) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
( ~ fulladder(X1)
| halfadder(h2(X1)) ),
c_0_61 ).
cnf(c_0_67,hypothesis,
( ~ halfadder(h1(f1(a)))
| zero(in2(and2(h1(f1(a))))) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,plain,
( ~ fulladder(X1)
| halfadder(h1(X1)) ),
c_0_64 ).
cnf(c_0_69,plain,
( ~ zero(in1(X1))
| ~ and_ok(X1)
| zero(out1(X1)) ),
inference(fof_simplification,[status(thm)],[and_0x_0]) ).
cnf(c_0_70,hypothesis,
( ~ fulladder(f1(a))
| zero(in1(and2(h2(f1(a))))) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,plain,
( ~ logic_and(X1)
| abnormal(X1)
| and_ok(X1) ),
inference(fof_simplification,[status(thm)],[and_ok_or_abnormal]) ).
cnf(c_0_72,plain,
( ~ halfadder(X1)
| logic_and(and2(X1)) ),
inference(fof_simplification,[status(thm)],[halfadder_and2]) ).
cnf(c_0_73,plain,
( ~ zero(in2(X1))
| ~ and_ok(X1)
| zero(out1(X1)) ),
inference(fof_simplification,[status(thm)],[and_x0_0]) ).
cnf(c_0_74,hypothesis,
( ~ fulladder(f1(a))
| zero(in2(and2(h1(f1(a))))) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_75,plain,
( ~ zero(in1(X1))
| ~ and_ok(X1)
| zero(out1(X1)) ),
c_0_69 ).
cnf(c_0_76,hypothesis,
zero(in1(and2(h2(f1(a))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_56]),c_0_43])]) ).
cnf(c_0_77,plain,
( ~ logic_and(X1)
| abnormal(X1)
| and_ok(X1) ),
c_0_71 ).
cnf(c_0_78,plain,
( ~ halfadder(X1)
| logic_and(and2(X1)) ),
c_0_72 ).
cnf(c_0_79,negated_conjecture,
~ abnormal(and2(h2(f1(a)))),
inference(fof_simplification,[status(thm)],[diagnosis_and2h2f1]) ).
cnf(c_0_80,plain,
( ~ zero(in2(X1))
| ~ and_ok(X1)
| zero(out1(X1)) ),
c_0_73 ).
cnf(c_0_81,hypothesis,
zero(in2(and2(h1(f1(a))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_56]),c_0_43])]) ).
cnf(c_0_82,negated_conjecture,
~ abnormal(and2(h1(f1(a)))),
inference(fof_simplification,[status(thm)],[diagnosis_and2h1f1]) ).
cnf(c_0_83,hypothesis,
( ~ and_ok(and2(h2(f1(a))))
| zero(out1(and2(h2(f1(a))))) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_84,plain,
( ~ halfadder(X1)
| and_ok(and2(X1))
| abnormal(and2(X1)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_85,negated_conjecture,
~ abnormal(and2(h2(f1(a)))),
c_0_79 ).
cnf(c_0_86,hypothesis,
( ~ and_ok(and2(h1(f1(a))))
| zero(out1(and2(h1(f1(a))))) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_87,negated_conjecture,
~ abnormal(and2(h1(f1(a)))),
c_0_82 ).
cnf(c_0_88,plain,
( ~ zero(X2)
| ~ connection(X1,X2)
| zero(X1) ),
inference(fof_simplification,[status(thm)],[value_propagation_zero2]) ).
cnf(c_0_89,plain,
( ~ halfadder(X1)
| connection(outc(X1),out1(and2(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_outc_out1and2]) ).
cnf(c_0_90,hypothesis,
( ~ halfadder(h2(f1(a)))
| zero(out1(and2(h2(f1(a))))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]) ).
cnf(c_0_91,hypothesis,
( ~ halfadder(h1(f1(a)))
| zero(out1(and2(h1(f1(a))))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_84]),c_0_87]) ).
cnf(c_0_92,plain,
( ~ zero(X2)
| ~ connection(X1,X2)
| zero(X1) ),
c_0_88 ).
cnf(c_0_93,plain,
( ~ halfadder(X1)
| connection(outc(X1),out1(and2(X1))) ),
c_0_89 ).
cnf(c_0_94,hypothesis,
( ~ fulladder(f1(a))
| zero(out1(and2(h2(f1(a))))) ),
inference(spm,[status(thm)],[c_0_90,c_0_66]) ).
cnf(c_0_95,hypothesis,
( ~ fulladder(f1(a))
| zero(out1(and2(h1(f1(a))))) ),
inference(spm,[status(thm)],[c_0_91,c_0_68]) ).
cnf(c_0_96,plain,
( ~ one(X1)
| ~ connection(X1,X2)
| one(X2) ),
inference(fof_simplification,[status(thm)],[value_propagation_one1]) ).
cnf(c_0_97,plain,
( ~ nbit_adder1(X1)
| connection(outc(X1),outc(f1(X1))) ),
inference(fof_simplification,[status(thm)],[nbit_adder_connection_outc_outcf1]) ).
cnf(c_0_98,plain,
( ~ zero(out1(and2(X1)))
| ~ halfadder(X1)
| zero(outc(X1)) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_99,hypothesis,
zero(out1(and2(h2(f1(a))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_56]),c_0_43])]) ).
cnf(c_0_100,hypothesis,
zero(out1(and2(h1(f1(a))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_56]),c_0_43])]) ).
cnf(c_0_101,plain,
( ~ fulladder(X1)
| connection(outc(X1),out1(or1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_outc_out1or1]) ).
cnf(c_0_102,plain,
( ~ one(X1)
| ~ connection(X1,X2)
| one(X2) ),
c_0_96 ).
cnf(c_0_103,plain,
( ~ nbit_adder1(X1)
| connection(outc(X1),outc(f1(X1))) ),
c_0_97 ).
cnf(c_0_104,plain,
( ~ fulladder(X1)
| connection(outc(h2(X1)),in1(or1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_outch2_in1or1]) ).
cnf(c_0_105,hypothesis,
( ~ halfadder(h2(f1(a)))
| zero(outc(h2(f1(a)))) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_106,plain,
( ~ fulladder(X1)
| connection(outc(h1(X1)),in2(or1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_outch1_in2or1]) ).
cnf(c_0_107,hypothesis,
( ~ halfadder(h1(f1(a)))
| zero(outc(h1(f1(a)))) ),
inference(spm,[status(thm)],[c_0_98,c_0_100]) ).
cnf(c_0_108,plain,
( ~ fulladder(X1)
| connection(outc(X1),out1(or1(X1))) ),
c_0_101 ).
cnf(c_0_109,plain,
( ~ one(outc(X1))
| ~ nbit_adder1(X1)
| one(outc(f1(X1))) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_110,hypothesis,
one(outc(a)),
outc_0 ).
cnf(c_0_111,plain,
( ~ fulladder(X1)
| connection(outc(h2(X1)),in1(or1(X1))) ),
c_0_104 ).
cnf(c_0_112,hypothesis,
( ~ fulladder(f1(a))
| zero(outc(h2(f1(a)))) ),
inference(spm,[status(thm)],[c_0_105,c_0_66]) ).
cnf(c_0_113,plain,
( ~ fulladder(X1)
| connection(outc(h1(X1)),in2(or1(X1))) ),
c_0_106 ).
cnf(c_0_114,hypothesis,
( ~ fulladder(f1(a))
| zero(outc(h1(f1(a)))) ),
inference(spm,[status(thm)],[c_0_107,c_0_68]) ).
cnf(c_0_115,plain,
( ~ one(outc(X1))
| ~ fulladder(X1)
| one(out1(or1(X1))) ),
inference(spm,[status(thm)],[c_0_102,c_0_108]) ).
cnf(c_0_116,hypothesis,
one(outc(f1(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_43])]) ).
cnf(c_0_117,plain,
( ~ zero(outc(h2(X1)))
| ~ fulladder(X1)
| zero(in1(or1(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_111]) ).
cnf(c_0_118,hypothesis,
zero(outc(h2(f1(a)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_56]),c_0_43])]) ).
cnf(c_0_119,plain,
( ~ zero(outc(h1(X1)))
| ~ fulladder(X1)
| zero(in2(or1(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_113]) ).
cnf(c_0_120,hypothesis,
zero(outc(h1(f1(a)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_56]),c_0_43])]) ).
cnf(c_0_121,plain,
( ~ one(X1)
| ~ zero(X1) ),
inference(fof_simplification,[status(thm)],[unique_value]) ).
cnf(c_0_122,hypothesis,
( ~ fulladder(f1(a))
| one(out1(or1(f1(a)))) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_123,plain,
( ~ zero(in2(X1))
| ~ zero(in1(X1))
| ~ or_ok(X1)
| zero(out1(X1)) ),
inference(fof_simplification,[status(thm)],[or_00_0]) ).
cnf(c_0_124,hypothesis,
( ~ fulladder(f1(a))
| zero(in1(or1(f1(a)))) ),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_125,hypothesis,
( ~ fulladder(f1(a))
| zero(in2(or1(f1(a)))) ),
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_126,plain,
( ~ one(X1)
| ~ zero(X1) ),
c_0_121 ).
cnf(c_0_127,hypothesis,
one(out1(or1(f1(a)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_56]),c_0_43])]) ).
cnf(c_0_128,plain,
( ~ logic_or(X1)
| abnormal(X1)
| or_ok(X1) ),
inference(fof_simplification,[status(thm)],[or_ok_or_abnormal]) ).
cnf(c_0_129,plain,
( ~ fulladder(X1)
| logic_or(or1(X1)) ),
inference(fof_simplification,[status(thm)],[fulladder_or1]) ).
cnf(c_0_130,plain,
( ~ zero(in2(X1))
| ~ zero(in1(X1))
| ~ or_ok(X1)
| zero(out1(X1)) ),
c_0_123 ).
cnf(c_0_131,hypothesis,
zero(in1(or1(f1(a)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_56]),c_0_43])]) ).
cnf(c_0_132,hypothesis,
zero(in2(or1(f1(a)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_56]),c_0_43])]) ).
cnf(c_0_133,hypothesis,
~ zero(out1(or1(f1(a)))),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_134,plain,
( ~ logic_or(X1)
| abnormal(X1)
| or_ok(X1) ),
c_0_128 ).
cnf(c_0_135,plain,
( ~ fulladder(X1)
| logic_or(or1(X1)) ),
c_0_129 ).
cnf(c_0_136,negated_conjecture,
~ abnormal(or1(f1(a))),
inference(fof_simplification,[status(thm)],[diagnosis_or1f1]) ).
cnf(c_0_137,hypothesis,
~ or_ok(or1(f1(a))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132])]),c_0_133]) ).
cnf(c_0_138,plain,
( ~ fulladder(X1)
| abnormal(or1(X1))
| or_ok(or1(X1)) ),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_139,negated_conjecture,
~ abnormal(or1(f1(a))),
c_0_136 ).
cnf(c_0_140,hypothesis,
~ fulladder(f1(a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_139]) ).
cnf(c_0_141,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_56]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : HWV008-2.001 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n014.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Sun Sep 20 20:47:51 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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
% 0.23/0.61 % Version: 3.5.1
% 0.23/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.61 % Starting sh5l with 300s (1) cores
% 0.23/0.61 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2331025 completed with status 0
% 0.23/0.61 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.61 % No SInE strategy applied
% 0.23/0.61 % Search class: FGHNF-FFMM11-MFFFFFNN
% 0.23/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.61 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.61 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2331032 completed with status 0
% 0.23/0.61 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.61 % No SInE strategy applied
% 0.23/0.61 % Search class: FGHNF-FFMM11-MFFFFFNN
% 0.23/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.61 % Preprocessing time : 0.002 s
% 0.23/0.61 % Presaturation interreduction done
% 0.23/0.61
% 0.23/0.61 % Proof found!
% 0.23/0.61 % SZS status Unsatisfiable
% 0.23/0.61 % SZS output start CNFRefutation
% See solution above
% 0.23/0.61 % Parsed axioms : 66
% 0.23/0.61 % Removed by relevancy pruning/SinE : 0
% 0.23/0.61 % Initial clauses : 66
% 0.23/0.61 % Removed in clause preprocessing : 0
% 0.23/0.61 % Initial clauses in saturation : 66
% 0.23/0.61 % Processed clauses : 346
% 0.23/0.61 % ...of these trivial : 0
% 0.23/0.61 % ...subsumed : 3
% 0.23/0.61 % ...remaining for further processing : 343
% 0.23/0.61 % Other redundant clauses eliminated : 0
% 0.23/0.61 % Clauses deleted for lack of memory : 0
% 0.23/0.61 % Backward-subsumed : 8
% 0.23/0.61 % Backward-rewritten : 36
% 0.23/0.61 % Generated clauses : 294
% 0.23/0.61 % ...of the previous two non-redundant : 258
% 0.23/0.61 % ...aggressively subsumed : 0
% 0.23/0.61 % Contextual simplify-reflections : 0
% 0.23/0.61 % Paramodulations : 294
% 0.23/0.61 % Factorizations : 0
% 0.23/0.61 % NegExts : 0
% 0.23/0.61 % Equation resolutions : 0
% 0.23/0.61 % Disequality decompositions : 0
% 0.23/0.61 % Total rewrite steps : 102
% 0.23/0.61 % ...of those cached : 72
% 0.23/0.61 % Propositional unsat checks : 0
% 0.23/0.61 % Propositional check models : 0
% 0.23/0.61 % Propositional check unsatisfiable : 0
% 0.23/0.61 % Propositional clauses : 0
% 0.23/0.61 % Propositional clauses after purity: 0
% 0.23/0.61 % Propositional unsat core size : 0
% 0.23/0.61 % Propositional preprocessing time : 0.000
% 0.23/0.61 % Propositional encoding time : 0.000
% 0.23/0.61 % Propositional solver time : 0.000
% 0.23/0.61 % Success case prop preproc time : 0.000
% 0.23/0.61 % Success case prop encoding time : 0.000
% 0.23/0.61 % Success case prop solver time : 0.000
% 0.23/0.61 % Current number of processed clauses : 233
% 0.23/0.61 % Positive orientable unit clauses : 30
% 0.23/0.61 % Positive unorientable unit clauses: 0
% 0.23/0.61 % Negative unit clauses : 10
% 0.23/0.61 % Non-unit-clauses : 193
% 0.23/0.61 % Current number of unprocessed clauses: 44
% 0.23/0.61 % ...number of literals in the above : 96
% 0.23/0.61 % Current number of archived formulas : 0
% 0.23/0.61 % Current number of archived clauses : 110
% 0.23/0.61 % Clause-clause subsumption calls (NU) : 2347
% 0.23/0.61 % Rec. Clause-clause subsumption calls : 2192
% 0.23/0.61 % Non-unit clause-clause subsumptions : 2
% 0.23/0.61 % Unit Clause-clause subsumption calls : 470
% 0.23/0.61 % Rewrite failures with RHS unbound : 0
% 0.23/0.61 % BW rewrite match attempts : 61
% 0.23/0.61 % BW rewrite match successes : 19
% 0.23/0.61 % Condensation attempts : 0
% 0.23/0.61 % Condensation successes : 0
% 0.23/0.61 % Termbank termtop insertions : 7988
% 0.23/0.61 % Search garbage collected termcells : 111
% 0.23/0.61
% 0.23/0.61 % -------------------------------------------------
% 0.23/0.61 % User time : 0.018 s
% 0.23/0.61 % System time : 0.009 s
% 0.23/0.61 % Total time : 0.027 s
% 0.23/0.61 % Maximum resident set size: 3684 pages
% 0.23/0.61
% 0.23/0.61 % -------------------------------------------------
% 0.23/0.61 % User time : 0.112 s
% 0.23/0.61 % System time : 0.029 s
% 0.23/0.61 % Total time : 0.142 s
% 0.23/0.61 % Maximum resident set size: 4608 pages
% 0.23/0.61 % E exiting
%------------------------------------------------------------------------------