%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV008-1.002 : TPTP v9.3.1. Bugfixed v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:47:19 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 30
% Syntax : Number of clauses : 141 ( 59 unt; 10 nHn; 141 RR)
% Number of literals : 252 ( 0 equ; 116 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 13 con; 0-2 aty)
% Number of variables : 103 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(nbit_adder_fulladder2,axiom,
( ~ type(X1,nbit_adder(n2))
| type(f(n2,X1),fulladder) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nbit_adder_fulladder2) ).
cnf(nbit_adder_connection_ina2_in1f2,axiom,
( ~ type(X1,nbit_adder(n2))
| connection(in(a2,X1),in(n1,f(n2,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nbit_adder_connection_ina2_in1f2) ).
cnf(fulladder_halfadder2,axiom,
( ~ type(X1,fulladder)
| type(h2(X1),halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-2.ax',fulladder_halfadder2) ).
cnf(a_isa_2bit_adder,hypothesis,
type(a,nbit_adder(n2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_isa_2bit_adder) ).
cnf(fulladder_connection_in1_in1h2,axiom,
( ~ type(X1,fulladder)
| connection(in(n1,X1),in(n1,h2(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-2.ax',fulladder_connection_in1_in1h2) ).
cnf(value_propagation1,axiom,
( ~ value(X1,X3)
| ~ connection(X1,X2)
| value(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',value_propagation1) ).
cnf(nbit_adder_connection_outc_outcf1,axiom,
( ~ type(X1,nbit_adder(n2))
| connection(out(c,X1),out(c,f(n2,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nbit_adder_connection_outc_outcf1) ).
cnf(nbit_adder_connection_inb2_in2f2,axiom,
( ~ type(X1,nbit_adder(n2))
| connection(in(b2,X1),in(n2,f(n2,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nbit_adder_connection_inb2_in2f2) ).
cnf(halfadder_and2,axiom,
( ~ type(X1,halfadder)
| type(and2(X1),and) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_and2) ).
cnf(halfadder_connection_in1_in1and2,axiom,
( ~ type(X1,halfadder)
| connection(in(n1,X1),in(n1,and2(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_connection_in1_in1and2) ).
cnf(fulladder_or1,axiom,
( ~ type(X1,fulladder)
| type(or1(X1),or) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-2.ax',fulladder_or1) ).
cnf(fulladder_connection_outc_out1or1,axiom,
( ~ type(X1,fulladder)
| connection(out(c,X1),out(n1,or1(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-2.ax',fulladder_connection_outc_out1or1) ).
cnf(fulladder_halfadder1,axiom,
( ~ type(X1,fulladder)
| type(h1(X1),halfadder) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-2.ax',fulladder_halfadder1) ).
cnf(fulladder_connection_in2_in1h1,axiom,
( ~ type(X1,fulladder)
| connection(in(n2,X1),in(n1,h1(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-2.ax',fulladder_connection_in2_in1h1) ).
cnf(ok_or_abnormal,axiom,
( ~ type(X1,X2)
| mode(X1,abnormal)
| mode(X1,ok) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',ok_or_abnormal) ).
cnf(diagnosis_and2h1f2a,negated_conjecture,
~ mode(and2(h2(f(n2,a))),abnormal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_and2h1f2a) ).
cnf(ina2_0,hypothesis,
value(in(a2,a),n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ina2_0) ).
cnf(diagnosis_or1f2a,negated_conjecture,
~ mode(or1(f(n2,a)),abnormal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_or1f2a) ).
cnf(halfadder_connection_outc_out1and2,axiom,
( ~ type(X1,halfadder)
| connection(out(c,X1),out(n1,and2(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-1.ax',halfadder_connection_outc_out1and2) ).
cnf(and_0x_0,axiom,
( ~ value(in(X2,X1),n0)
| ~ type(X1,and)
| ~ mode(X1,ok)
| value(out(n1,X1),n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',and_0x_0) ).
cnf(fulladder_connection_outch1_in2or1,axiom,
( ~ type(X1,fulladder)
| connection(out(c,h1(X1)),in(n2,or1(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-2.ax',fulladder_connection_outch1_in2or1) ).
cnf(or_1_11,axiom,
( ~ value(out(n1,X1),n1)
| ~ type(X1,or)
| ~ mode(X1,ok)
| value(in(n2,X1),n1)
| value(in(n1,X1),n1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',or_1_11) ).
cnf(outc_1,hypothesis,
value(out(c,a),n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',outc_1) ).
cnf(diagnosis_and2h2f2a,negated_conjecture,
~ mode(and2(h1(f(n2,a))),abnormal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_and2h2f2a) ).
cnf(inb2_0,hypothesis,
value(in(b2,a),n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inb2_0) ).
cnf(fulladder_connection_outch2_in1or1,axiom,
( ~ type(X1,fulladder)
| connection(out(c,h2(X1)),in(n1,or1(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-2.ax',fulladder_connection_outch2_in1or1) ).
cnf(value_propagation2,axiom,
( ~ value(X2,X3)
| ~ connection(X1,X2)
| value(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',value_propagation2) ).
cnf(unique_value,axiom,
( ~ value(X1,X3)
| ~ value(X1,X2)
| equal_value(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',unique_value) ).
cnf(equal_value1,axiom,
~ equal_value(n0,n1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',equal_value1) ).
cnf(equal_value2,axiom,
~ equal_value(n1,n0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV001-0.ax',equal_value2) ).
cnf(c_0_30,plain,
( ~ type(X1,nbit_adder(n2))
| type(f(n2,X1),fulladder) ),
inference(fof_simplification,[status(thm)],[nbit_adder_fulladder2]) ).
cnf(c_0_31,plain,
( ~ type(X1,nbit_adder(n2))
| connection(in(a2,X1),in(n1,f(n2,X1))) ),
inference(fof_simplification,[status(thm)],[nbit_adder_connection_ina2_in1f2]) ).
cnf(c_0_32,plain,
( ~ type(X1,fulladder)
| type(h2(X1),halfadder) ),
inference(fof_simplification,[status(thm)],[fulladder_halfadder2]) ).
cnf(c_0_33,plain,
( ~ type(X1,nbit_adder(n2))
| type(f(n2,X1),fulladder) ),
c_0_30 ).
cnf(c_0_34,hypothesis,
type(a,nbit_adder(n2)),
a_isa_2bit_adder ).
cnf(c_0_35,plain,
( ~ type(X1,fulladder)
| connection(in(n1,X1),in(n1,h2(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_in1_in1h2]) ).
cnf(c_0_36,plain,
( ~ value(X1,X3)
| ~ connection(X1,X2)
| value(X2,X3) ),
inference(fof_simplification,[status(thm)],[value_propagation1]) ).
cnf(c_0_37,plain,
( ~ type(X1,nbit_adder(n2))
| connection(in(a2,X1),in(n1,f(n2,X1))) ),
c_0_31 ).
cnf(c_0_38,plain,
( ~ type(X1,nbit_adder(n2))
| connection(out(c,X1),out(c,f(n2,X1))) ),
inference(fof_simplification,[status(thm)],[nbit_adder_connection_outc_outcf1]) ).
cnf(c_0_39,plain,
( ~ type(X1,nbit_adder(n2))
| connection(in(b2,X1),in(n2,f(n2,X1))) ),
inference(fof_simplification,[status(thm)],[nbit_adder_connection_inb2_in2f2]) ).
cnf(c_0_40,plain,
( ~ type(X1,halfadder)
| type(and2(X1),and) ),
inference(fof_simplification,[status(thm)],[halfadder_and2]) ).
cnf(c_0_41,plain,
( ~ type(X1,fulladder)
| type(h2(X1),halfadder) ),
c_0_32 ).
cnf(c_0_42,hypothesis,
type(f(n2,a),fulladder),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,plain,
( ~ type(X1,halfadder)
| connection(in(n1,X1),in(n1,and2(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_in1_in1and2]) ).
cnf(c_0_44,plain,
( ~ type(X1,fulladder)
| connection(in(n1,X1),in(n1,h2(X1))) ),
c_0_35 ).
cnf(c_0_45,plain,
( ~ value(X1,X3)
| ~ connection(X1,X2)
| value(X2,X3) ),
c_0_36 ).
cnf(c_0_46,hypothesis,
connection(in(a2,a),in(n1,f(n2,a))),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_47,plain,
( ~ type(X1,fulladder)
| type(or1(X1),or) ),
inference(fof_simplification,[status(thm)],[fulladder_or1]) ).
cnf(c_0_48,plain,
( ~ type(X1,fulladder)
| connection(out(c,X1),out(n1,or1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_outc_out1or1]) ).
cnf(c_0_49,plain,
( ~ type(X1,nbit_adder(n2))
| connection(out(c,X1),out(c,f(n2,X1))) ),
c_0_38 ).
cnf(c_0_50,plain,
( ~ type(X1,fulladder)
| type(h1(X1),halfadder) ),
inference(fof_simplification,[status(thm)],[fulladder_halfadder1]) ).
cnf(c_0_51,plain,
( ~ type(X1,fulladder)
| connection(in(n2,X1),in(n1,h1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_in2_in1h1]) ).
cnf(c_0_52,plain,
( ~ type(X1,nbit_adder(n2))
| connection(in(b2,X1),in(n2,f(n2,X1))) ),
c_0_39 ).
cnf(c_0_53,plain,
( ~ type(X1,X2)
| mode(X1,abnormal)
| mode(X1,ok) ),
inference(fof_simplification,[status(thm)],[ok_or_abnormal]) ).
cnf(c_0_54,plain,
( ~ type(X1,halfadder)
| type(and2(X1),and) ),
c_0_40 ).
cnf(c_0_55,hypothesis,
type(h2(f(n2,a)),halfadder),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_56,negated_conjecture,
~ mode(and2(h2(f(n2,a))),abnormal),
inference(fof_simplification,[status(thm)],[diagnosis_and2h1f2a]) ).
cnf(c_0_57,plain,
( ~ type(X1,halfadder)
| connection(in(n1,X1),in(n1,and2(X1))) ),
c_0_43 ).
cnf(c_0_58,hypothesis,
connection(in(n1,f(n2,a)),in(n1,h2(f(n2,a)))),
inference(spm,[status(thm)],[c_0_44,c_0_42]) ).
cnf(c_0_59,hypothesis,
( ~ value(in(a2,a),X1)
| value(in(n1,f(n2,a)),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_60,hypothesis,
value(in(a2,a),n0),
ina2_0 ).
cnf(c_0_61,plain,
( ~ type(X1,fulladder)
| type(or1(X1),or) ),
c_0_47 ).
cnf(c_0_62,negated_conjecture,
~ mode(or1(f(n2,a)),abnormal),
inference(fof_simplification,[status(thm)],[diagnosis_or1f2a]) ).
cnf(c_0_63,plain,
( ~ type(X1,fulladder)
| connection(out(c,X1),out(n1,or1(X1))) ),
c_0_48 ).
cnf(c_0_64,hypothesis,
connection(out(c,a),out(c,f(n2,a))),
inference(spm,[status(thm)],[c_0_49,c_0_34]) ).
cnf(c_0_65,plain,
( ~ type(X1,fulladder)
| type(h1(X1),halfadder) ),
c_0_50 ).
cnf(c_0_66,plain,
( ~ type(X1,fulladder)
| connection(in(n2,X1),in(n1,h1(X1))) ),
c_0_51 ).
cnf(c_0_67,hypothesis,
connection(in(b2,a),in(n2,f(n2,a))),
inference(spm,[status(thm)],[c_0_52,c_0_34]) ).
cnf(c_0_68,plain,
( ~ type(X1,halfadder)
| connection(out(c,X1),out(n1,and2(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_outc_out1and2]) ).
cnf(c_0_69,plain,
( ~ value(in(X2,X1),n0)
| ~ type(X1,and)
| ~ mode(X1,ok)
| value(out(n1,X1),n0) ),
inference(fof_simplification,[status(thm)],[and_0x_0]) ).
cnf(c_0_70,plain,
( ~ type(X1,X2)
| mode(X1,abnormal)
| mode(X1,ok) ),
c_0_53 ).
cnf(c_0_71,hypothesis,
type(and2(h2(f(n2,a))),and),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_72,negated_conjecture,
~ mode(and2(h2(f(n2,a))),abnormal),
c_0_56 ).
cnf(c_0_73,hypothesis,
connection(in(n1,h2(f(n2,a))),in(n1,and2(h2(f(n2,a))))),
inference(spm,[status(thm)],[c_0_57,c_0_55]) ).
cnf(c_0_74,hypothesis,
( ~ value(in(n1,f(n2,a)),X1)
| value(in(n1,h2(f(n2,a))),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_58]) ).
cnf(c_0_75,hypothesis,
value(in(n1,f(n2,a)),n0),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_76,plain,
( ~ type(X1,fulladder)
| connection(out(c,h1(X1)),in(n2,or1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_outch1_in2or1]) ).
cnf(c_0_77,plain,
( ~ value(out(n1,X1),n1)
| ~ type(X1,or)
| ~ mode(X1,ok)
| value(in(n2,X1),n1)
| value(in(n1,X1),n1) ),
inference(fof_simplification,[status(thm)],[or_1_11]) ).
cnf(c_0_78,hypothesis,
type(or1(f(n2,a)),or),
inference(spm,[status(thm)],[c_0_61,c_0_42]) ).
cnf(c_0_79,negated_conjecture,
~ mode(or1(f(n2,a)),abnormal),
c_0_62 ).
cnf(c_0_80,hypothesis,
connection(out(c,f(n2,a)),out(n1,or1(f(n2,a)))),
inference(spm,[status(thm)],[c_0_63,c_0_42]) ).
cnf(c_0_81,hypothesis,
( ~ value(out(c,a),X1)
| value(out(c,f(n2,a)),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_64]) ).
cnf(c_0_82,hypothesis,
value(out(c,a),n1),
outc_1 ).
cnf(c_0_83,hypothesis,
type(h1(f(n2,a)),halfadder),
inference(spm,[status(thm)],[c_0_65,c_0_42]) ).
cnf(c_0_84,negated_conjecture,
~ mode(and2(h1(f(n2,a))),abnormal),
inference(fof_simplification,[status(thm)],[diagnosis_and2h2f2a]) ).
cnf(c_0_85,hypothesis,
connection(in(n2,f(n2,a)),in(n1,h1(f(n2,a)))),
inference(spm,[status(thm)],[c_0_66,c_0_42]) ).
cnf(c_0_86,hypothesis,
( ~ value(in(b2,a),X1)
| value(in(n2,f(n2,a)),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_67]) ).
cnf(c_0_87,hypothesis,
value(in(b2,a),n0),
inb2_0 ).
cnf(c_0_88,plain,
( ~ type(X1,fulladder)
| connection(out(c,h2(X1)),in(n1,or1(X1))) ),
inference(fof_simplification,[status(thm)],[fulladder_connection_outch2_in1or1]) ).
cnf(c_0_89,plain,
( ~ value(X2,X3)
| ~ connection(X1,X2)
| value(X1,X3) ),
inference(fof_simplification,[status(thm)],[value_propagation2]) ).
cnf(c_0_90,plain,
( ~ type(X1,halfadder)
| connection(out(c,X1),out(n1,and2(X1))) ),
c_0_68 ).
cnf(c_0_91,plain,
( ~ value(in(X2,X1),n0)
| ~ type(X1,and)
| ~ mode(X1,ok)
| value(out(n1,X1),n0) ),
c_0_69 ).
cnf(c_0_92,hypothesis,
mode(and2(h2(f(n2,a))),ok),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_93,hypothesis,
( ~ value(in(n1,h2(f(n2,a))),X1)
| value(in(n1,and2(h2(f(n2,a)))),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_73]) ).
cnf(c_0_94,hypothesis,
value(in(n1,h2(f(n2,a))),n0),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_95,plain,
( ~ type(X1,fulladder)
| connection(out(c,h1(X1)),in(n2,or1(X1))) ),
c_0_76 ).
cnf(c_0_96,plain,
( ~ value(out(n1,X1),n1)
| ~ type(X1,or)
| ~ mode(X1,ok)
| value(in(n2,X1),n1)
| value(in(n1,X1),n1) ),
c_0_77 ).
cnf(c_0_97,hypothesis,
mode(or1(f(n2,a)),ok),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_78]),c_0_79]) ).
cnf(c_0_98,hypothesis,
( ~ value(out(c,f(n2,a)),X1)
| value(out(n1,or1(f(n2,a))),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_80]) ).
cnf(c_0_99,hypothesis,
value(out(c,f(n2,a)),n1),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_100,hypothesis,
type(and2(h1(f(n2,a))),and),
inference(spm,[status(thm)],[c_0_54,c_0_83]) ).
cnf(c_0_101,negated_conjecture,
~ mode(and2(h1(f(n2,a))),abnormal),
c_0_84 ).
cnf(c_0_102,hypothesis,
connection(in(n1,h1(f(n2,a))),in(n1,and2(h1(f(n2,a))))),
inference(spm,[status(thm)],[c_0_57,c_0_83]) ).
cnf(c_0_103,hypothesis,
( ~ value(in(n2,f(n2,a)),X1)
| value(in(n1,h1(f(n2,a))),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_85]) ).
cnf(c_0_104,hypothesis,
value(in(n2,f(n2,a)),n0),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_105,plain,
( ~ type(X1,fulladder)
| connection(out(c,h2(X1)),in(n1,or1(X1))) ),
c_0_88 ).
cnf(c_0_106,plain,
( ~ value(X2,X3)
| ~ connection(X1,X2)
| value(X1,X3) ),
c_0_89 ).
cnf(c_0_107,hypothesis,
connection(out(c,h2(f(n2,a))),out(n1,and2(h2(f(n2,a))))),
inference(spm,[status(thm)],[c_0_90,c_0_55]) ).
cnf(c_0_108,hypothesis,
( ~ value(in(X1,and2(h2(f(n2,a)))),n0)
| value(out(n1,and2(h2(f(n2,a)))),n0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_71])]) ).
cnf(c_0_109,hypothesis,
value(in(n1,and2(h2(f(n2,a)))),n0),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_110,hypothesis,
connection(out(c,h1(f(n2,a))),in(n2,or1(f(n2,a)))),
inference(spm,[status(thm)],[c_0_95,c_0_42]) ).
cnf(c_0_111,hypothesis,
( ~ value(out(n1,or1(f(n2,a))),n1)
| value(in(n1,or1(f(n2,a))),n1)
| value(in(n2,or1(f(n2,a))),n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_78])]) ).
cnf(c_0_112,hypothesis,
value(out(n1,or1(f(n2,a))),n1),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_113,hypothesis,
mode(and2(h1(f(n2,a))),ok),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_100]),c_0_101]) ).
cnf(c_0_114,hypothesis,
( ~ value(in(n1,h1(f(n2,a))),X1)
| value(in(n1,and2(h1(f(n2,a)))),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_102]) ).
cnf(c_0_115,hypothesis,
value(in(n1,h1(f(n2,a))),n0),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_116,hypothesis,
connection(out(c,h2(f(n2,a))),in(n1,or1(f(n2,a)))),
inference(spm,[status(thm)],[c_0_105,c_0_42]) ).
cnf(c_0_117,hypothesis,
( ~ value(out(n1,and2(h2(f(n2,a)))),X1)
| value(out(c,h2(f(n2,a))),X1) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_118,hypothesis,
value(out(n1,and2(h2(f(n2,a)))),n0),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_119,plain,
( ~ value(X1,X3)
| ~ value(X1,X2)
| equal_value(X2,X3) ),
inference(fof_simplification,[status(thm)],[unique_value]) ).
cnf(c_0_120,hypothesis,
( ~ value(in(n2,or1(f(n2,a))),X1)
| value(out(c,h1(f(n2,a))),X1) ),
inference(spm,[status(thm)],[c_0_106,c_0_110]) ).
cnf(c_0_121,hypothesis,
( value(in(n2,or1(f(n2,a))),n1)
| value(in(n1,or1(f(n2,a))),n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_112])]) ).
cnf(c_0_122,hypothesis,
connection(out(c,h1(f(n2,a))),out(n1,and2(h1(f(n2,a))))),
inference(spm,[status(thm)],[c_0_90,c_0_83]) ).
cnf(c_0_123,hypothesis,
( ~ value(in(X1,and2(h1(f(n2,a)))),n0)
| value(out(n1,and2(h1(f(n2,a)))),n0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_113]),c_0_100])]) ).
cnf(c_0_124,hypothesis,
value(in(n1,and2(h1(f(n2,a)))),n0),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_125,hypothesis,
( ~ value(out(c,h2(f(n2,a))),X1)
| value(in(n1,or1(f(n2,a))),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_116]) ).
cnf(c_0_126,hypothesis,
value(out(c,h2(f(n2,a))),n0),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_127,plain,
( ~ value(X1,X3)
| ~ value(X1,X2)
| equal_value(X2,X3) ),
c_0_119 ).
cnf(c_0_128,hypothesis,
( value(out(c,h1(f(n2,a))),n1)
| value(in(n1,or1(f(n2,a))),n1) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_129,hypothesis,
( ~ value(out(n1,and2(h1(f(n2,a)))),X1)
| value(out(c,h1(f(n2,a))),X1) ),
inference(spm,[status(thm)],[c_0_106,c_0_122]) ).
cnf(c_0_130,hypothesis,
value(out(n1,and2(h1(f(n2,a)))),n0),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_131,plain,
~ equal_value(n0,n1),
inference(fof_simplification,[status(thm)],[equal_value1]) ).
cnf(c_0_132,hypothesis,
value(in(n1,or1(f(n2,a))),n0),
inference(spm,[status(thm)],[c_0_125,c_0_126]) ).
cnf(c_0_133,hypothesis,
( ~ value(out(c,h1(f(n2,a))),X1)
| value(in(n1,or1(f(n2,a))),n1)
| equal_value(X1,n1) ),
inference(spm,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_134,hypothesis,
value(out(c,h1(f(n2,a))),n0),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_135,plain,
~ equal_value(n0,n1),
c_0_131 ).
cnf(c_0_136,plain,
~ equal_value(n1,n0),
inference(fof_simplification,[status(thm)],[equal_value2]) ).
cnf(c_0_137,hypothesis,
( ~ value(in(n1,or1(f(n2,a))),X1)
| equal_value(X1,n0) ),
inference(spm,[status(thm)],[c_0_127,c_0_132]) ).
cnf(c_0_138,hypothesis,
value(in(n1,or1(f(n2,a))),n1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_135]) ).
cnf(c_0_139,plain,
~ equal_value(n1,n0),
c_0_136 ).
cnf(c_0_140,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_139]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV008-1.002 : TPTP v9.3.1. Bugfixed v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/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 20:47:55 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.52 % Version: 3.5.1
% 0.19/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 % Starting sh5l with 300s (1) cores
% 0.19/0.52 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 153895 completed with status 0
% 0.19/0.52 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.52 % No SInE strategy applied
% 0.19/0.52 % Search class: FGHNF-FFMM21-MFFFFFNN
% 0.19/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.52 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.52 % new_bool_1 with pid 153906 completed with status 0
% 0.19/0.52 % Result found by new_bool_1
% 0.19/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.52 % No SInE strategy applied
% 0.19/0.52 % Search class: FGHNF-FFMM21-MFFFFFNN
% 0.19/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.52 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.52 % Preprocessing time : 0.002 s
% 0.19/0.52 % Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 % Proof found!
% 0.19/0.52 % SZS status Unsatisfiable
% 0.19/0.52 % SZS output start CNFRefutation
% See solution above
% 0.19/0.52 % Parsed axioms : 68
% 0.19/0.52 % Removed by relevancy pruning/SinE : 0
% 0.19/0.52 % Initial clauses : 68
% 0.19/0.52 % Removed in clause preprocessing : 0
% 0.19/0.52 % Initial clauses in saturation : 68
% 0.19/0.52 % Processed clauses : 432
% 0.19/0.52 % ...of these trivial : 0
% 0.19/0.52 % ...subsumed : 10
% 0.19/0.52 % ...remaining for further processing : 422
% 0.19/0.52 % Other redundant clauses eliminated : 0
% 0.19/0.52 % Clauses deleted for lack of memory : 0
% 0.19/0.52 % Backward-subsumed : 1
% 0.19/0.52 % Backward-rewritten : 34
% 0.19/0.52 % Generated clauses : 386
% 0.19/0.52 % ...of the previous two non-redundant : 342
% 0.19/0.52 % ...aggressively subsumed : 0
% 0.19/0.52 % Contextual simplify-reflections : 0
% 0.19/0.52 % Paramodulations : 386
% 0.19/0.52 % Factorizations : 0
% 0.19/0.52 % NegExts : 0
% 0.19/0.52 % Equation resolutions : 0
% 0.19/0.52 % Disequality decompositions : 0
% 0.19/0.52 % Total rewrite steps : 105
% 0.19/0.52 % ...of those cached : 73
% 0.19/0.52 % Propositional unsat checks : 0
% 0.19/0.52 % Propositional check models : 0
% 0.19/0.52 % Propositional check unsatisfiable : 0
% 0.19/0.52 % Propositional clauses : 0
% 0.19/0.52 % Propositional clauses after purity: 0
% 0.19/0.52 % Propositional unsat core size : 0
% 0.19/0.52 % Propositional preprocessing time : 0.000
% 0.19/0.52 % Propositional encoding time : 0.000
% 0.19/0.52 % Propositional solver time : 0.000
% 0.19/0.52 % Success case prop preproc time : 0.000
% 0.19/0.52 % Success case prop encoding time : 0.000
% 0.19/0.52 % Success case prop solver time : 0.000
% 0.19/0.52 % Current number of processed clauses : 319
% 0.19/0.52 % Positive orientable unit clauses : 116
% 0.19/0.52 % Positive unorientable unit clauses: 0
% 0.19/0.52 % Negative unit clauses : 5
% 0.19/0.52 % Non-unit-clauses : 198
% 0.19/0.52 % Current number of unprocessed clauses: 43
% 0.19/0.52 % ...number of literals in the above : 73
% 0.19/0.52 % Current number of archived formulas : 0
% 0.19/0.52 % Current number of archived clauses : 103
% 0.19/0.52 % Clause-clause subsumption calls (NU) : 5198
% 0.19/0.52 % Rec. Clause-clause subsumption calls : 4492
% 0.19/0.52 % Non-unit clause-clause subsumptions : 8
% 0.19/0.52 % Unit Clause-clause subsumption calls : 147
% 0.19/0.52 % Rewrite failures with RHS unbound : 0
% 0.19/0.52 % BW rewrite match attempts : 67
% 0.19/0.52 % BW rewrite match successes : 8
% 0.19/0.52 % Condensation attempts : 0
% 0.19/0.52 % Condensation successes : 0
% 0.19/0.52 % Termbank termtop insertions : 12023
% 0.19/0.52 % Search garbage collected termcells : 123
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.048 s
% 0.19/0.52 % System time : 0.004 s
% 0.19/0.52 % Total time : 0.052 s
% 0.19/0.52 % Maximum resident set size: 3636 pages
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.269 s
% 0.19/0.52 % System time : 0.025 s
% 0.19/0.52 % Total time : 0.293 s
% 0.19/0.52 % Maximum resident set size: 4608 pages
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------