%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV008-2.002 : 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 : n017.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.45s 0.63s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 31
% Syntax : Number of clauses : 121 ( 21 unt; 13 nHn; 121 RR)
% Number of literals : 275 ( 0 equ; 158 neg)
% Maximal clause size : 5 ( 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 : 99 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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(diagnosis_and2h2f2a,negated_conjecture,
~ abnormal(and2(h2(f2(a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h2f2a) ).
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(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(value_propagation_one2,axiom,
( ~ one(X2)
| ~ connection(X1,X2)
| one(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',value_propagation_one2) ).
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(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(diagnosis_and2h1f2a,negated_conjecture,
~ abnormal(and2(h1(f2(a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h1f2a) ).
cnf(unique_value,axiom,
( ~ one(X1)
| ~ zero(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',unique_value) ).
cnf(nbit_adder_connection_ina2_in1f2,axiom,
( ~ nbit_adder2(X1)
| connection(ina2(X1),in1(f2(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_ina2_in1f2) ).
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(fulladder_halfadder2,axiom,
( ~ fulladder(X1)
| halfadder(h2(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_halfadder2) ).
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_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(nbit_adder_connection_inb2_in2f2,axiom,
( ~ nbit_adder2(X1)
| connection(inb2(X1),in2(f2(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_inb2_in2f2) ).
cnf(or_1_11,axiom,
( ~ one(out1(X1))
| ~ or_ok(X1)
| one(in2(X1))
| one(in1(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',or_1_11) ).
cnf(ina2_0,hypothesis,
zero(ina2(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ina2_0) ).
cnf(a_isa_2bit_adder,hypothesis,
nbit_adder2(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_isa_2bit_adder) ).
cnf(fulladder_halfadder1,axiom,
( ~ fulladder(X1)
| halfadder(h1(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_halfadder1) ).
cnf(fulladder_connection_in2_in1h1,axiom,
( ~ fulladder(X1)
| connection(in2(X1),in1(h1(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_in2_in1h1) ).
cnf(diagnosis_or1f2a,negated_conjecture,
~ abnormal(or1(f2(a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_or1f2a) ).
cnf(inb2_0,hypothesis,
zero(inb2(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inb2_0) ).
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(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(nbit_adder_connection_outc_outcf1,axiom,
( ~ nbit_adder2(X1)
| connection(outc(X1),outc(f2(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_outc_outcf1) ).
cnf(outc_1,hypothesis,
one(outc(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',outc_1) ).
cnf(nbit_adder_fulladder2,axiom,
( ~ nbit_adder2(X1)
| fulladder(f2(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_fulladder2) ).
cnf(c_0_31,plain,
( ~ logic_and(X1)
| abnormal(X1)
| and_ok(X1) ),
inference(fof_simplification,[status(thm)],[and_ok_or_abnormal]) ).
cnf(c_0_32,plain,
( ~ halfadder(X1)
| logic_and(and2(X1)) ),
inference(fof_simplification,[status(thm)],[halfadder_and2]) ).
cnf(c_0_33,plain,
( ~ zero(in1(X1))
| ~ and_ok(X1)
| zero(out1(X1)) ),
inference(fof_simplification,[status(thm)],[and_0x_0]) ).
cnf(c_0_34,plain,
( ~ logic_and(X1)
| abnormal(X1)
| and_ok(X1) ),
c_0_31 ).
cnf(c_0_35,plain,
( ~ halfadder(X1)
| logic_and(and2(X1)) ),
c_0_32 ).
cnf(c_0_36,negated_conjecture,
~ abnormal(and2(h2(f2(a)))),
inference(fof_simplification,[status(thm)],[diagnosis_and2h2f2a]) ).
cnf(c_0_37,plain,
( ~ zero(in1(X1))
| ~ and_ok(X1)
| zero(out1(X1)) ),
c_0_33 ).
cnf(c_0_38,plain,
( ~ halfadder(X1)
| and_ok(and2(X1))
| abnormal(and2(X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( ~ zero(X1)
| ~ connection(X1,X2)
| zero(X2) ),
inference(fof_simplification,[status(thm)],[value_propagation_zero1]) ).
cnf(c_0_40,plain,
( ~ halfadder(X1)
| connection(in1(X1),in1(and2(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_in1_in1and2]) ).
cnf(c_0_41,plain,
( ~ one(X2)
| ~ connection(X1,X2)
| one(X1) ),
inference(fof_simplification,[status(thm)],[value_propagation_one2]) ).
cnf(c_0_42,plain,
( ~ fulladder(X1)
| connection(outc(h2(X1)),in1(or1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_outch2_in1or1]) ).
cnf(c_0_43,plain,
( ~ zero(X2)
| ~ connection(X1,X2)
| zero(X1) ),
inference(fof_simplification,[status(thm)],[value_propagation_zero2]) ).
cnf(c_0_44,plain,
( ~ halfadder(X1)
| connection(outc(X1),out1(and2(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_outc_out1and2]) ).
cnf(c_0_45,negated_conjecture,
~ abnormal(and2(h2(f2(a)))),
c_0_36 ).
cnf(c_0_46,plain,
( ~ zero(in1(and2(X1)))
| ~ halfadder(X1)
| zero(out1(and2(X1)))
| abnormal(and2(X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,plain,
( ~ zero(X1)
| ~ connection(X1,X2)
| zero(X2) ),
c_0_39 ).
cnf(c_0_48,plain,
( ~ halfadder(X1)
| connection(in1(X1),in1(and2(X1))) ),
c_0_40 ).
cnf(c_0_49,negated_conjecture,
~ abnormal(and2(h1(f2(a)))),
inference(fof_simplification,[status(thm)],[diagnosis_and2h1f2a]) ).
cnf(c_0_50,plain,
( ~ one(X1)
| ~ zero(X1) ),
inference(fof_simplification,[status(thm)],[unique_value]) ).
cnf(c_0_51,plain,
( ~ one(X2)
| ~ connection(X1,X2)
| one(X1) ),
c_0_41 ).
cnf(c_0_52,plain,
( ~ fulladder(X1)
| connection(outc(h2(X1)),in1(or1(X1))) ),
c_0_42 ).
cnf(c_0_53,plain,
( ~ zero(X2)
| ~ connection(X1,X2)
| zero(X1) ),
c_0_43 ).
cnf(c_0_54,plain,
( ~ halfadder(X1)
| connection(outc(X1),out1(and2(X1))) ),
c_0_44 ).
cnf(c_0_55,negated_conjecture,
( ~ zero(in1(and2(h2(f2(a)))))
| ~ halfadder(h2(f2(a)))
| zero(out1(and2(h2(f2(a))))) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_56,plain,
( ~ zero(in1(X1))
| ~ halfadder(X1)
| zero(in1(and2(X1))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_57,plain,
( ~ nbit_adder2(X1)
| connection(ina2(X1),in1(f2(X1))) ),
inference(fof_simplification,[status(thm)],[nbit_adder_connection_ina2_in1f2]) ).
cnf(c_0_58,negated_conjecture,
~ abnormal(and2(h1(f2(a)))),
c_0_49 ).
cnf(c_0_59,plain,
( ~ logic_or(X1)
| abnormal(X1)
| or_ok(X1) ),
inference(fof_simplification,[status(thm)],[or_ok_or_abnormal]) ).
cnf(c_0_60,plain,
( ~ fulladder(X1)
| logic_or(or1(X1)) ),
inference(fof_simplification,[status(thm)],[fulladder_or1]) ).
cnf(c_0_61,plain,
( ~ one(X1)
| ~ zero(X1) ),
c_0_50 ).
cnf(c_0_62,plain,
( ~ one(in1(or1(X1)))
| ~ fulladder(X1)
| one(outc(h2(X1))) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_63,plain,
( ~ zero(out1(and2(X1)))
| ~ halfadder(X1)
| zero(outc(X1)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_64,negated_conjecture,
( ~ zero(in1(h2(f2(a))))
| ~ halfadder(h2(f2(a)))
| zero(out1(and2(h2(f2(a))))) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_65,plain,
( ~ fulladder(X1)
| halfadder(h2(X1)) ),
inference(fof_simplification,[status(thm)],[fulladder_halfadder2]) ).
cnf(c_0_66,plain,
( ~ fulladder(X1)
| connection(in1(X1),in1(h2(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_in1_in1h2]) ).
cnf(c_0_67,plain,
( ~ nbit_adder2(X1)
| connection(ina2(X1),in1(f2(X1))) ),
c_0_57 ).
cnf(c_0_68,plain,
( ~ fulladder(X1)
| connection(outc(h1(X1)),in2(or1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_outch1_in2or1]) ).
cnf(c_0_69,negated_conjecture,
( ~ zero(in1(and2(h1(f2(a)))))
| ~ halfadder(h1(f2(a)))
| zero(out1(and2(h1(f2(a))))) ),
inference(spm,[status(thm)],[c_0_58,c_0_46]) ).
cnf(c_0_70,plain,
( ~ nbit_adder2(X1)
| connection(inb2(X1),in2(f2(X1))) ),
inference(fof_simplification,[status(thm)],[nbit_adder_connection_inb2_in2f2]) ).
cnf(c_0_71,plain,
( ~ one(out1(X1))
| ~ or_ok(X1)
| one(in2(X1))
| one(in1(X1)) ),
inference(fof_simplification,[status(thm)],[or_1_11]) ).
cnf(c_0_72,plain,
( ~ logic_or(X1)
| abnormal(X1)
| or_ok(X1) ),
c_0_59 ).
cnf(c_0_73,plain,
( ~ fulladder(X1)
| logic_or(or1(X1)) ),
c_0_60 ).
cnf(c_0_74,plain,
( ~ zero(outc(h2(X1)))
| ~ one(in1(or1(X1)))
| ~ fulladder(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_75,negated_conjecture,
( ~ zero(in1(h2(f2(a))))
| ~ halfadder(h2(f2(a)))
| zero(outc(h2(f2(a)))) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_76,plain,
( ~ fulladder(X1)
| halfadder(h2(X1)) ),
c_0_65 ).
cnf(c_0_77,plain,
( ~ fulladder(X1)
| connection(in1(X1),in1(h2(X1))) ),
c_0_66 ).
cnf(c_0_78,plain,
( ~ zero(ina2(X1))
| ~ nbit_adder2(X1)
| zero(in1(f2(X1))) ),
inference(spm,[status(thm)],[c_0_47,c_0_67]) ).
cnf(c_0_79,hypothesis,
zero(ina2(a)),
ina2_0 ).
cnf(c_0_80,hypothesis,
nbit_adder2(a),
a_isa_2bit_adder ).
cnf(c_0_81,plain,
( ~ fulladder(X1)
| connection(outc(h1(X1)),in2(or1(X1))) ),
c_0_68 ).
cnf(c_0_82,negated_conjecture,
( ~ zero(in1(h1(f2(a))))
| ~ halfadder(h1(f2(a)))
| zero(out1(and2(h1(f2(a))))) ),
inference(spm,[status(thm)],[c_0_69,c_0_56]) ).
cnf(c_0_83,plain,
( ~ fulladder(X1)
| halfadder(h1(X1)) ),
inference(fof_simplification,[status(thm)],[fulladder_halfadder1]) ).
cnf(c_0_84,plain,
( ~ fulladder(X1)
| connection(in2(X1),in1(h1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_in2_in1h1]) ).
cnf(c_0_85,plain,
( ~ nbit_adder2(X1)
| connection(inb2(X1),in2(f2(X1))) ),
c_0_70 ).
cnf(c_0_86,negated_conjecture,
~ abnormal(or1(f2(a))),
inference(fof_simplification,[status(thm)],[diagnosis_or1f2a]) ).
cnf(c_0_87,plain,
( ~ one(out1(X1))
| ~ or_ok(X1)
| one(in2(X1))
| one(in1(X1)) ),
c_0_71 ).
cnf(c_0_88,plain,
( ~ fulladder(X1)
| abnormal(or1(X1))
| or_ok(or1(X1)) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_89,negated_conjecture,
( ~ zero(in1(h2(f2(a))))
| ~ one(in1(or1(f2(a))))
| ~ fulladder(f2(a)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).
cnf(c_0_90,plain,
( ~ zero(in1(X1))
| ~ fulladder(X1)
| zero(in1(h2(X1))) ),
inference(spm,[status(thm)],[c_0_47,c_0_77]) ).
cnf(c_0_91,hypothesis,
zero(in1(f2(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_92,plain,
( ~ zero(outc(h1(X1)))
| ~ fulladder(X1)
| zero(in2(or1(X1))) ),
inference(spm,[status(thm)],[c_0_47,c_0_81]) ).
cnf(c_0_93,negated_conjecture,
( ~ zero(in1(h1(f2(a))))
| ~ halfadder(h1(f2(a)))
| zero(outc(h1(f2(a)))) ),
inference(spm,[status(thm)],[c_0_63,c_0_82]) ).
cnf(c_0_94,plain,
( ~ fulladder(X1)
| halfadder(h1(X1)) ),
c_0_83 ).
cnf(c_0_95,plain,
( ~ fulladder(X1)
| connection(in2(X1),in1(h1(X1))) ),
c_0_84 ).
cnf(c_0_96,plain,
( ~ zero(inb2(X1))
| ~ nbit_adder2(X1)
| zero(in2(f2(X1))) ),
inference(spm,[status(thm)],[c_0_47,c_0_85]) ).
cnf(c_0_97,hypothesis,
zero(inb2(a)),
inb2_0 ).
cnf(c_0_98,negated_conjecture,
~ abnormal(or1(f2(a))),
c_0_86 ).
cnf(c_0_99,plain,
( ~ one(out1(or1(X1)))
| ~ fulladder(X1)
| one(in2(or1(X1)))
| one(in1(or1(X1)))
| abnormal(or1(X1)) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_100,negated_conjecture,
( ~ one(in1(or1(f2(a))))
| ~ fulladder(f2(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91])]) ).
cnf(c_0_101,negated_conjecture,
( ~ zero(in1(h1(f2(a))))
| ~ fulladder(f2(a))
| zero(in2(or1(f2(a)))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]) ).
cnf(c_0_102,plain,
( ~ zero(in2(X1))
| ~ fulladder(X1)
| zero(in1(h1(X1))) ),
inference(spm,[status(thm)],[c_0_47,c_0_95]) ).
cnf(c_0_103,hypothesis,
zero(in2(f2(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_80])]) ).
cnf(c_0_104,plain,
( ~ one(X1)
| ~ connection(X1,X2)
| one(X2) ),
inference(fof_simplification,[status(thm)],[value_propagation_one1]) ).
cnf(c_0_105,plain,
( ~ fulladder(X1)
| connection(outc(X1),out1(or1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_outc_out1or1]) ).
cnf(c_0_106,negated_conjecture,
( ~ one(out1(or1(f2(a))))
| ~ fulladder(f2(a))
| one(in2(or1(f2(a)))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]) ).
cnf(c_0_107,negated_conjecture,
( ~ fulladder(f2(a))
| zero(in2(or1(f2(a)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103])]) ).
cnf(c_0_108,plain,
( ~ one(X1)
| ~ connection(X1,X2)
| one(X2) ),
c_0_104 ).
cnf(c_0_109,plain,
( ~ fulladder(X1)
| connection(outc(X1),out1(or1(X1))) ),
c_0_105 ).
cnf(c_0_110,plain,
( ~ nbit_adder2(X1)
| connection(outc(X1),outc(f2(X1))) ),
inference(fof_simplification,[status(thm)],[nbit_adder_connection_outc_outcf1]) ).
cnf(c_0_111,negated_conjecture,
( ~ one(out1(or1(f2(a))))
| ~ fulladder(f2(a)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_106]),c_0_107]) ).
cnf(c_0_112,plain,
( ~ one(outc(X1))
| ~ fulladder(X1)
| one(out1(or1(X1))) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_113,plain,
( ~ nbit_adder2(X1)
| connection(outc(X1),outc(f2(X1))) ),
c_0_110 ).
cnf(c_0_114,negated_conjecture,
( ~ one(outc(f2(a)))
| ~ fulladder(f2(a)) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_115,plain,
( ~ one(outc(X1))
| ~ nbit_adder2(X1)
| one(outc(f2(X1))) ),
inference(spm,[status(thm)],[c_0_108,c_0_113]) ).
cnf(c_0_116,hypothesis,
one(outc(a)),
outc_1 ).
cnf(c_0_117,plain,
( ~ nbit_adder2(X1)
| fulladder(f2(X1)) ),
inference(fof_simplification,[status(thm)],[nbit_adder_fulladder2]) ).
cnf(c_0_118,negated_conjecture,
~ fulladder(f2(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_80]),c_0_116])]) ).
cnf(c_0_119,plain,
( ~ nbit_adder2(X1)
| fulladder(f2(X1)) ),
c_0_117 ).
cnf(c_0_120,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : HWV008-2.002 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n017.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Sun Sep 20 20:43:12 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.54 Running first-order theorem proving
% 0.27/0.54 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.45/0.63 % Version: 3.5.1
% 0.45/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.45/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.45/0.63 % Starting sh5l with 300s (1) cores
% 0.45/0.63 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 609390 completed with status 0
% 0.45/0.63 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.45/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.63 % No SInE strategy applied
% 0.45/0.63 % Search class: FGHNF-FFMM11-MFFFFFNN
% 0.45/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.45/0.63 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.45/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.45/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.45/0.63 % SubtermCWHack with pid 609394 completed with status 0
% 0.45/0.63 % Result found by SubtermCWHack
% 0.45/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.63 % No SInE strategy applied
% 0.45/0.63 % Search class: FGHNF-FFMM11-MFFFFFNN
% 0.45/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.63 % Preprocessing time : 0.003 s
% 0.45/0.63
% 0.45/0.63 % Proof found!
% 0.45/0.63 % SZS status Unsatisfiable
% 0.45/0.63 % SZS output start CNFRefutation
% See solution above
% 0.45/0.63 % Parsed axioms : 74
% 0.45/0.63 % Removed by relevancy pruning/SinE : 0
% 0.45/0.63 % Initial clauses : 74
% 0.45/0.63 % Removed in clause preprocessing : 0
% 0.45/0.63 % Initial clauses in saturation : 74
% 0.45/0.63 % Processed clauses : 370
% 0.45/0.63 % ...of these trivial : 0
% 0.45/0.63 % ...subsumed : 50
% 0.45/0.63 % ...remaining for further processing : 320
% 0.45/0.63 % Other redundant clauses eliminated : 0
% 0.45/0.63 % Clauses deleted for lack of memory : 0
% 0.45/0.63 % Backward-subsumed : 28
% 0.45/0.63 % Backward-rewritten : 0
% 0.45/0.63 % Generated clauses : 386
% 0.45/0.63 % ...of the previous two non-redundant : 316
% 0.45/0.63 % ...aggressively subsumed : 0
% 0.45/0.63 % Contextual simplify-reflections : 10
% 0.45/0.63 % Paramodulations : 386
% 0.45/0.63 % Factorizations : 0
% 0.45/0.63 % NegExts : 0
% 0.45/0.63 % Equation resolutions : 0
% 0.45/0.63 % Disequality decompositions : 0
% 0.45/0.63 % Total rewrite steps : 24
% 0.45/0.63 % ...of those cached : 20
% 0.45/0.63 % Propositional unsat checks : 0
% 0.45/0.63 % Propositional check models : 0
% 0.45/0.63 % Propositional check unsatisfiable : 0
% 0.45/0.63 % Propositional clauses : 0
% 0.45/0.63 % Propositional clauses after purity: 0
% 0.45/0.63 % Propositional unsat core size : 0
% 0.45/0.63 % Propositional preprocessing time : 0.000
% 0.45/0.63 % Propositional encoding time : 0.000
% 0.45/0.63 % Propositional solver time : 0.000
% 0.45/0.63 % Success case prop preproc time : 0.000
% 0.45/0.63 % Success case prop encoding time : 0.000
% 0.45/0.63 % Success case prop solver time : 0.000
% 0.45/0.63 % Current number of processed clauses : 292
% 0.45/0.63 % Positive orientable unit clauses : 14
% 0.45/0.63 % Positive unorientable unit clauses: 0
% 0.45/0.63 % Negative unit clauses : 9
% 0.45/0.63 % Non-unit-clauses : 269
% 0.45/0.63 % Current number of unprocessed clauses: 18
% 0.45/0.63 % ...number of literals in the above : 72
% 0.45/0.63 % Current number of archived formulas : 0
% 0.45/0.63 % Current number of archived clauses : 28
% 0.45/0.63 % Clause-clause subsumption calls (NU) : 5794
% 0.45/0.63 % Rec. Clause-clause subsumption calls : 3506
% 0.45/0.63 % Non-unit clause-clause subsumptions : 58
% 0.45/0.63 % Unit Clause-clause subsumption calls : 107
% 0.45/0.63 % Rewrite failures with RHS unbound : 0
% 0.45/0.63 % BW rewrite match attempts : 5
% 0.45/0.63 % BW rewrite match successes : 0
% 0.45/0.63 % Condensation attempts : 0
% 0.45/0.63 % Condensation successes : 0
% 0.45/0.63 % Termbank termtop insertions : 9776
% 0.45/0.63 % Search garbage collected termcells : 116
% 0.45/0.63
% 0.45/0.63 % -------------------------------------------------
% 0.45/0.63 % User time : 0.037 s
% 0.45/0.63 % System time : 0.009 s
% 0.45/0.63 % Total time : 0.047 s
% 0.45/0.63 % Maximum resident set size: 3688 pages
% 0.45/0.63
% 0.45/0.63 % -------------------------------------------------
% 0.45/0.63 % User time : 0.117 s
% 0.45/0.63 % System time : 0.029 s
% 0.45/0.63 % Total time : 0.146 s
% 0.45/0.63 % Maximum resident set size: 4608 pages
% 0.45/0.63 % E exiting
%------------------------------------------------------------------------------