TSTP Solution File: HWV008-1.002 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HWV008-1.002 : TPTP v8.1.2. Bugfixed v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 01:59:58 EDT 2023
% Result : Unsatisfiable 0.20s 0.74s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 61
% Syntax : Number of formulae : 125 ( 20 unt; 32 typ; 0 def)
% Number of atoms : 222 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 263 ( 134 ~; 129 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 15 >; 8 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 27 ( 27 usr; 17 con; 0-2 aty)
% Number of variables : 85 ( 4 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
connection: ( $i * $i ) > $o ).
tff(decl_23,type,
value: ( $i * $i ) > $o ).
tff(decl_24,type,
equal_value: ( $i * $i ) > $o ).
tff(decl_25,type,
n0: $i ).
tff(decl_26,type,
n1: $i ).
tff(decl_27,type,
ok: $i ).
tff(decl_28,type,
mode: ( $i * $i ) > $o ).
tff(decl_29,type,
abnormal: $i ).
tff(decl_30,type,
type: ( $i * $i ) > $o ).
tff(decl_31,type,
and: $i ).
tff(decl_32,type,
in: ( $i * $i ) > $i ).
tff(decl_33,type,
out: ( $i * $i ) > $i ).
tff(decl_34,type,
n2: $i ).
tff(decl_35,type,
or: $i ).
tff(decl_36,type,
not: $i ).
tff(decl_37,type,
halfadder: $i ).
tff(decl_38,type,
and1: $i > $i ).
tff(decl_39,type,
and2: $i > $i ).
tff(decl_40,type,
not1: $i > $i ).
tff(decl_41,type,
or1: $i > $i ).
tff(decl_42,type,
s: $i ).
tff(decl_43,type,
c: $i ).
tff(decl_44,type,
fulladder: $i ).
tff(decl_45,type,
h1: $i > $i ).
tff(decl_46,type,
h2: $i > $i ).
tff(decl_47,type,
nbit_adder: $i > $i ).
tff(decl_48,type,
f: ( $i * $i ) > $i ).
tff(decl_49,type,
a1: $i ).
tff(decl_50,type,
b1: $i ).
tff(decl_51,type,
a2: $i ).
tff(decl_52,type,
b2: $i ).
tff(decl_53,type,
a: $i ).
cnf(value_propagation1,axiom,
( value(X2,X3)
| ~ connection(X1,X2)
| ~ value(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',value_propagation1) ).
cnf(halfadder_connection_in1_in1and2,axiom,
( connection(in(n1,X1),in(n1,and2(X1)))
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_in1_in1and2) ).
cnf(value_propagation2,axiom,
( value(X1,X3)
| ~ connection(X1,X2)
| ~ value(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',value_propagation2) ).
cnf(halfadder_connection_outc_out1and2,axiom,
( connection(out(c,X1),out(n1,and2(X1)))
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_outc_out1and2) ).
cnf(and_0x_0,axiom,
( value(out(n1,X1),n0)
| ~ mode(X1,ok)
| ~ type(X1,and)
| ~ value(in(X2,X1),n0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',and_0x_0) ).
cnf(halfadder_and2,axiom,
( type(and2(X1),and)
| ~ type(X1,halfadder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_and2) ).
cnf(ok_or_abnormal,axiom,
( mode(X1,ok)
| mode(X1,abnormal)
| ~ type(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',ok_or_abnormal) ).
cnf(diagnosis_and2h2f2a,negated_conjecture,
~ mode(and2(h1(f(n2,a))),abnormal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h2f2a) ).
cnf(diagnosis_and2h1f2a,negated_conjecture,
~ mode(and2(h2(f(n2,a))),abnormal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h1f2a) ).
cnf(fulladder_connection_outch1_in2or1,axiom,
( connection(out(c,h1(X1)),in(n2,or1(X1)))
| ~ type(X1,fulladder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_outch1_in2or1) ).
cnf(nbit_adder_fulladder2,axiom,
( type(f(n2,X1),fulladder)
| ~ type(X1,nbit_adder(n2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_fulladder2) ).
cnf(a_isa_2bit_adder,hypothesis,
type(a,nbit_adder(n2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_isa_2bit_adder) ).
cnf(fulladder_connection_outch2_in1or1,axiom,
( connection(out(c,h2(X1)),in(n1,or1(X1)))
| ~ type(X1,fulladder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_outch2_in1or1) ).
cnf(fulladder_connection_in2_in1h1,axiom,
( connection(in(n2,X1),in(n1,h1(X1)))
| ~ type(X1,fulladder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_in2_in1h1) ).
cnf(fulladder_connection_outc_out1or1,axiom,
( connection(out(c,X1),out(n1,or1(X1)))
| ~ type(X1,fulladder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_outc_out1or1) ).
cnf(fulladder_or1,axiom,
( type(or1(X1),or)
| ~ type(X1,fulladder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_or1) ).
cnf(fulladder_connection_in1_in1h2,axiom,
( connection(in(n1,X1),in(n1,h2(X1)))
| ~ type(X1,fulladder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_in1_in1h2) ).
cnf(or_1_11,axiom,
( value(in(n1,X1),n1)
| value(in(n2,X1),n1)
| ~ mode(X1,ok)
| ~ type(X1,or)
| ~ value(out(n1,X1),n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',or_1_11) ).
cnf(diagnosis_or1f2a,negated_conjecture,
~ mode(or1(f(n2,a)),abnormal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_or1f2a) ).
cnf(unique_value,axiom,
( equal_value(X2,X3)
| ~ value(X1,X2)
| ~ value(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',unique_value) ).
cnf(equal_value2,axiom,
~ equal_value(n1,n0),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',equal_value2) ).
cnf(fulladder_halfadder2,axiom,
( type(h2(X1),halfadder)
| ~ type(X1,fulladder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_halfadder2) ).
cnf(fulladder_halfadder1,axiom,
( type(h1(X1),halfadder)
| ~ type(X1,fulladder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_halfadder1) ).
cnf(nbit_adder_connection_outc_outcf1,axiom,
( connection(out(c,X1),out(c,f(n2,X1)))
| ~ type(X1,nbit_adder(n2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_outc_outcf1) ).
cnf(outc_1,hypothesis,
value(out(c,a),n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',outc_1) ).
cnf(nbit_adder_connection_inb2_in2f2,axiom,
( connection(in(b2,X1),in(n2,f(n2,X1)))
| ~ type(X1,nbit_adder(n2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_inb2_in2f2) ).
cnf(inb2_0,hypothesis,
value(in(b2,a),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inb2_0) ).
cnf(nbit_adder_connection_ina2_in1f2,axiom,
( connection(in(a2,X1),in(n1,f(n2,X1)))
| ~ type(X1,nbit_adder(n2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_ina2_in1f2) ).
cnf(ina2_0,hypothesis,
value(in(a2,a),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ina2_0) ).
cnf(c_0_29,axiom,
( value(X2,X3)
| ~ connection(X1,X2)
| ~ value(X1,X3) ),
value_propagation1 ).
cnf(c_0_30,axiom,
( connection(in(n1,X1),in(n1,and2(X1)))
| ~ type(X1,halfadder) ),
halfadder_connection_in1_in1and2 ).
cnf(c_0_31,axiom,
( value(X1,X3)
| ~ connection(X1,X2)
| ~ value(X2,X3) ),
value_propagation2 ).
cnf(c_0_32,axiom,
( connection(out(c,X1),out(n1,and2(X1)))
| ~ type(X1,halfadder) ),
halfadder_connection_outc_out1and2 ).
cnf(c_0_33,axiom,
( value(out(n1,X1),n0)
| ~ mode(X1,ok)
| ~ type(X1,and)
| ~ value(in(X2,X1),n0) ),
and_0x_0 ).
cnf(c_0_34,plain,
( value(in(n1,and2(X1)),X2)
| ~ type(X1,halfadder)
| ~ value(in(n1,X1),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,axiom,
( type(and2(X1),and)
| ~ type(X1,halfadder) ),
halfadder_and2 ).
cnf(c_0_36,axiom,
( mode(X1,ok)
| mode(X1,abnormal)
| ~ type(X1,X2) ),
ok_or_abnormal ).
cnf(c_0_37,plain,
( value(out(c,X1),X2)
| ~ type(X1,halfadder)
| ~ value(out(n1,and2(X1)),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( value(out(n1,and2(X1)),n0)
| ~ type(X1,halfadder)
| ~ mode(and2(X1),ok)
| ~ value(in(n1,X1),n0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ mode(and2(h1(f(n2,a))),abnormal),
diagnosis_and2h2f2a ).
cnf(c_0_40,plain,
( mode(and2(X1),abnormal)
| mode(and2(X1),ok)
| ~ type(X1,halfadder) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
~ mode(and2(h2(f(n2,a))),abnormal),
diagnosis_and2h1f2a ).
cnf(c_0_42,axiom,
( connection(out(c,h1(X1)),in(n2,or1(X1)))
| ~ type(X1,fulladder) ),
fulladder_connection_outch1_in2or1 ).
cnf(c_0_43,plain,
( value(out(c,X1),n0)
| ~ type(X1,halfadder)
| ~ mode(and2(X1),ok)
| ~ value(in(n1,X1),n0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( mode(and2(h1(f(n2,a))),ok)
| ~ type(h1(f(n2,a)),halfadder) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,axiom,
( type(f(n2,X1),fulladder)
| ~ type(X1,nbit_adder(n2)) ),
nbit_adder_fulladder2 ).
cnf(c_0_46,hypothesis,
type(a,nbit_adder(n2)),
a_isa_2bit_adder ).
cnf(c_0_47,axiom,
( connection(out(c,h2(X1)),in(n1,or1(X1)))
| ~ type(X1,fulladder) ),
fulladder_connection_outch2_in1or1 ).
cnf(c_0_48,negated_conjecture,
( mode(and2(h2(f(n2,a))),ok)
| ~ type(h2(f(n2,a)),halfadder) ),
inference(spm,[status(thm)],[c_0_41,c_0_40]) ).
cnf(c_0_49,plain,
( value(in(n2,or1(X1)),X2)
| ~ type(X1,fulladder)
| ~ value(out(c,h1(X1)),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( value(out(c,h1(f(n2,a))),n0)
| ~ type(h1(f(n2,a)),halfadder)
| ~ value(in(n1,h1(f(n2,a))),n0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,hypothesis,
type(f(n2,a),fulladder),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,axiom,
( connection(in(n2,X1),in(n1,h1(X1)))
| ~ type(X1,fulladder) ),
fulladder_connection_in2_in1h1 ).
cnf(c_0_53,axiom,
( connection(out(c,X1),out(n1,or1(X1)))
| ~ type(X1,fulladder) ),
fulladder_connection_outc_out1or1 ).
cnf(c_0_54,axiom,
( type(or1(X1),or)
| ~ type(X1,fulladder) ),
fulladder_or1 ).
cnf(c_0_55,plain,
( value(in(n1,or1(X1)),X2)
| ~ type(X1,fulladder)
| ~ value(out(c,h2(X1)),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( value(out(c,h2(f(n2,a))),n0)
| ~ type(h2(f(n2,a)),halfadder)
| ~ value(in(n1,h2(f(n2,a))),n0) ),
inference(spm,[status(thm)],[c_0_43,c_0_48]) ).
cnf(c_0_57,axiom,
( connection(in(n1,X1),in(n1,h2(X1)))
| ~ type(X1,fulladder) ),
fulladder_connection_in1_in1h2 ).
cnf(c_0_58,negated_conjecture,
( value(in(n2,or1(f(n2,a))),n0)
| ~ type(h1(f(n2,a)),halfadder)
| ~ value(in(n1,h1(f(n2,a))),n0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_59,plain,
( value(in(n1,h1(X1)),X2)
| ~ type(X1,fulladder)
| ~ value(in(n2,X1),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_52]) ).
cnf(c_0_60,axiom,
( value(in(n1,X1),n1)
| value(in(n2,X1),n1)
| ~ mode(X1,ok)
| ~ type(X1,or)
| ~ value(out(n1,X1),n1) ),
or_1_11 ).
cnf(c_0_61,plain,
( value(out(n1,or1(X1)),X2)
| ~ type(X1,fulladder)
| ~ value(out(c,X1),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_53]) ).
cnf(c_0_62,negated_conjecture,
~ mode(or1(f(n2,a)),abnormal),
diagnosis_or1f2a ).
cnf(c_0_63,plain,
( mode(or1(X1),abnormal)
| mode(or1(X1),ok)
| ~ type(X1,fulladder) ),
inference(spm,[status(thm)],[c_0_36,c_0_54]) ).
cnf(c_0_64,negated_conjecture,
( value(in(n1,or1(f(n2,a))),n0)
| ~ type(h2(f(n2,a)),halfadder)
| ~ value(in(n1,h2(f(n2,a))),n0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_51])]) ).
cnf(c_0_65,plain,
( value(in(n1,h2(X1)),X2)
| ~ type(X1,fulladder)
| ~ value(in(n1,X1),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_57]) ).
cnf(c_0_66,axiom,
( equal_value(X2,X3)
| ~ value(X1,X2)
| ~ value(X1,X3) ),
unique_value ).
cnf(c_0_67,negated_conjecture,
( value(in(n2,or1(f(n2,a))),n0)
| ~ type(h1(f(n2,a)),halfadder)
| ~ value(in(n2,f(n2,a)),n0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_51])]) ).
cnf(c_0_68,plain,
( value(in(n2,or1(X1)),n1)
| value(in(n1,or1(X1)),n1)
| ~ type(X1,fulladder)
| ~ mode(or1(X1),ok)
| ~ value(out(c,X1),n1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_54]) ).
cnf(c_0_69,negated_conjecture,
mode(or1(f(n2,a)),ok),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_51])]) ).
cnf(c_0_70,negated_conjecture,
( value(in(n1,or1(f(n2,a))),n0)
| ~ type(h2(f(n2,a)),halfadder)
| ~ value(in(n1,f(n2,a)),n0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_51])]) ).
cnf(c_0_71,negated_conjecture,
( equal_value(X1,n0)
| ~ type(h1(f(n2,a)),halfadder)
| ~ value(in(n2,or1(f(n2,a))),X1)
| ~ value(in(n2,f(n2,a)),n0) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( value(in(n1,or1(f(n2,a))),n1)
| value(in(n2,or1(f(n2,a))),n1)
| ~ value(out(c,f(n2,a)),n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_51])]) ).
cnf(c_0_73,axiom,
~ equal_value(n1,n0),
equal_value2 ).
cnf(c_0_74,negated_conjecture,
( equal_value(X1,n0)
| ~ type(h2(f(n2,a)),halfadder)
| ~ value(in(n1,or1(f(n2,a))),X1)
| ~ value(in(n1,f(n2,a)),n0) ),
inference(spm,[status(thm)],[c_0_66,c_0_70]) ).
cnf(c_0_75,negated_conjecture,
( value(in(n1,or1(f(n2,a))),n1)
| ~ type(h1(f(n2,a)),halfadder)
| ~ value(in(n2,f(n2,a)),n0)
| ~ value(out(c,f(n2,a)),n1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
cnf(c_0_76,negated_conjecture,
( ~ type(h2(f(n2,a)),halfadder)
| ~ type(h1(f(n2,a)),halfadder)
| ~ value(in(n1,f(n2,a)),n0)
| ~ value(in(n2,f(n2,a)),n0)
| ~ value(out(c,f(n2,a)),n1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_73]) ).
cnf(c_0_77,axiom,
( type(h2(X1),halfadder)
| ~ type(X1,fulladder) ),
fulladder_halfadder2 ).
cnf(c_0_78,negated_conjecture,
( ~ type(h1(f(n2,a)),halfadder)
| ~ value(in(n1,f(n2,a)),n0)
| ~ value(in(n2,f(n2,a)),n0)
| ~ value(out(c,f(n2,a)),n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_51])]) ).
cnf(c_0_79,axiom,
( type(h1(X1),halfadder)
| ~ type(X1,fulladder) ),
fulladder_halfadder1 ).
cnf(c_0_80,axiom,
( connection(out(c,X1),out(c,f(n2,X1)))
| ~ type(X1,nbit_adder(n2)) ),
nbit_adder_connection_outc_outcf1 ).
cnf(c_0_81,negated_conjecture,
( ~ value(in(n1,f(n2,a)),n0)
| ~ value(in(n2,f(n2,a)),n0)
| ~ value(out(c,f(n2,a)),n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_51])]) ).
cnf(c_0_82,plain,
( value(out(c,f(n2,X1)),X2)
| ~ type(X1,nbit_adder(n2))
| ~ value(out(c,X1),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_80]) ).
cnf(c_0_83,hypothesis,
value(out(c,a),n1),
outc_1 ).
cnf(c_0_84,axiom,
( connection(in(b2,X1),in(n2,f(n2,X1)))
| ~ type(X1,nbit_adder(n2)) ),
nbit_adder_connection_inb2_in2f2 ).
cnf(c_0_85,negated_conjecture,
( ~ value(in(n1,f(n2,a)),n0)
| ~ value(in(n2,f(n2,a)),n0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_46]),c_0_83])]) ).
cnf(c_0_86,plain,
( value(in(n2,f(n2,X1)),X2)
| ~ type(X1,nbit_adder(n2))
| ~ value(in(b2,X1),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_84]) ).
cnf(c_0_87,hypothesis,
value(in(b2,a),n0),
inb2_0 ).
cnf(c_0_88,axiom,
( connection(in(a2,X1),in(n1,f(n2,X1)))
| ~ type(X1,nbit_adder(n2)) ),
nbit_adder_connection_ina2_in1f2 ).
cnf(c_0_89,negated_conjecture,
~ value(in(n1,f(n2,a)),n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_46]),c_0_87])]) ).
cnf(c_0_90,plain,
( value(in(n1,f(n2,X1)),X2)
| ~ type(X1,nbit_adder(n2))
| ~ value(in(a2,X1),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_88]) ).
cnf(c_0_91,hypothesis,
value(in(a2,a),n0),
ina2_0 ).
cnf(c_0_92,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_46]),c_0_91])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : HWV008-1.002 : TPTP v8.1.2. Bugfixed v2.2.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 14:13:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.74 % Version : CSE_E---1.5
% 0.20/0.74 % Problem : theBenchmark.p
% 0.20/0.74 % Proof found
% 0.20/0.74 % SZS status Theorem for theBenchmark.p
% 0.20/0.74 % SZS output start Proof
% See solution above
% 0.20/0.75 % Total time : 0.158000 s
% 0.20/0.75 % SZS output end Proof
% 0.20/0.75 % Total time : 0.162000 s
%------------------------------------------------------------------------------