TMTP Model File: HWV036-1.007-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---4.0
% Problem : HWV036-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc -t %d %s
% Computer : n115.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32286.75MB
% OS : Linux 2.6.32-504.23.4.el6.x86_64
% CPULimit : 300s
% DateTime : Wed Jul 8 11:11:00 EDT 2015
% Result : Satisfiable 1.44s
% Output : Saturation 1.44s
% Verified :
% Statistics : Number of clauses : 52 ( 52 expanded)
% Number of leaves : 52 ( 52 expanded)
% Depth : 0
% Number of atoms : 145 ( 145 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 5 ( 3 average)
% Maximal term depth : 3 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---4.0 format not known, defaulting to TPTP
cnf(fulladder_halfadder2,axiom,
( type(h2(X8),halfadder)
| ~ type(X8,fulladder) )).
cnf(fulladder_halfadder1,axiom,
( type(h1(X8),halfadder)
| ~ type(X8,fulladder) )).
cnf(halfadder_not1,axiom,
( type(not1(X8),not)
| ~ type(X8,halfadder) )).
cnf(halfadder_or1,axiom,
( type(or1(X8),or)
| ~ type(X8,halfadder) )).
cnf(fulladder_or1,axiom,
( type(or1(X8),or)
| ~ type(X8,fulladder) )).
cnf(halfadder_and2,axiom,
( type(and2(X8),and)
| ~ type(X8,halfadder) )).
cnf(halfadder_and1,axiom,
( type(and1(X8),and)
| ~ type(X8,halfadder) )).
cnf(ok_or_abnormal,axiom,
( ~ type(X6,X7)
| mode(X6,abnormal)
| mode(X6,ok) )).
cnf(u52,axiom,
( mode(h2(X6),abnormal)
| mode(h2(X6),ok)
| ~ type(X6,fulladder) )).
cnf(u51,axiom,
( mode(h1(X5),abnormal)
| mode(h1(X5),ok)
| ~ type(X5,fulladder) )).
cnf(u48,axiom,
( mode(or1(X2),abnormal)
| mode(or1(X2),ok)
| ~ type(X2,fulladder) )).
cnf(u49,axiom,
( mode(or1(X3),abnormal)
| mode(or1(X3),ok)
| ~ type(X3,halfadder) )).
cnf(u50,axiom,
( mode(not1(X4),abnormal)
| mode(not1(X4),ok)
| ~ type(X4,halfadder) )).
cnf(u47,axiom,
( mode(and2(X1),abnormal)
| mode(and2(X1),ok)
| ~ type(X1,halfadder) )).
cnf(u46,axiom,
( mode(and1(X0),abnormal)
| mode(and1(X0),ok)
| ~ type(X0,halfadder) )).
cnf(not_ok_and_abnormal,axiom,
( ~ mode(X6,abnormal)
| ~ mode(X6,ok) )).
cnf(equal_value2,axiom,
( ~ equal_value(n1,n0) )).
cnf(equal_value1,axiom,
( ~ equal_value(n0,n1) )).
cnf(or_0_0x,axiom,
( ~ value(out(n1,X6),n0)
| ~ type(X6,or)
| ~ mode(X6,ok)
| value(in(n1,X6),n0) )).
cnf(or_0_01,axiom,
( ~ value(out(n1,X6),n0)
| ~ type(X6,or)
| ~ mode(X6,ok)
| value(in(n2,X6),n0) )).
cnf(not_0_1_bw,axiom,
( ~ value(out(n1,X6),n0)
| ~ type(X6,not)
| ~ mode(X6,ok)
| value(in(n1,X6),n1) )).
cnf(and_0_00,axiom,
( ~ value(out(n1,X6),n0)
| ~ type(X6,and)
| ~ mode(X6,ok)
| value(in(n1,X6),n0)
| value(in(n2,X6),n0) )).
cnf(and_1_1x,axiom,
( ~ value(out(n1,X6),n1)
| ~ type(X6,and)
| ~ mode(X6,ok)
| value(in(n1,X6),n1) )).
cnf(and_1_x1,axiom,
( ~ value(out(n1,X6),n1)
| ~ type(X6,and)
| ~ mode(X6,ok)
| value(in(n2,X6),n1) )).
cnf(not_1_0_bw,axiom,
( ~ value(out(n1,X6),n1)
| ~ type(X6,not)
| ~ mode(X6,ok)
| value(in(n1,X6),n0) )).
cnf(or_1_11,axiom,
( ~ value(out(n1,X6),n1)
| ~ type(X6,or)
| ~ mode(X6,ok)
| value(in(n1,X6),n1)
| value(in(n2,X6),n1) )).
cnf(or_00_0,axiom,
( ~ value(in(n2,X6),n0)
| ~ type(X6,or)
| ~ mode(X6,ok)
| ~ value(in(n1,X6),n0)
| value(out(n1,X6),n0) )).
cnf(and_11_1,axiom,
( ~ value(in(n2,X6),n1)
| ~ type(X6,and)
| ~ mode(X6,ok)
| ~ value(in(n1,X6),n1)
| value(out(n1,X6),n1) )).
cnf(not_1_0_fw,axiom,
( ~ value(in(n1,X6),n1)
| ~ type(X6,not)
| ~ mode(X6,ok)
| value(out(n1,X6),n0) )).
cnf(not_0_1_fw,axiom,
( ~ value(in(n1,X6),n0)
| ~ type(X6,not)
| ~ mode(X6,ok)
| value(out(n1,X6),n1) )).
cnf(or_1x_1,axiom,
( ~ value(in(X7,X6),n1)
| ~ type(X6,or)
| ~ mode(X6,ok)
| value(out(n1,X6),n1) )).
cnf(and_0x_0,axiom,
( ~ value(in(X7,X6),n0)
| ~ type(X6,and)
| ~ mode(X6,ok)
| value(out(n1,X6),n0) )).
cnf(value_propagation1,axiom,
( ~ value(X0,X2)
| ~ connection(X0,X1)
| value(X1,X2) )).
cnf(value_propagation2,axiom,
( ~ value(X1,X2)
| ~ connection(X0,X1)
| value(X0,X2) )).
cnf(unique_value,axiom,
( ~ value(X3,X5)
| ~ value(X3,X4)
| equal_value(X4,X5) )).
cnf(fulladder_connection_outch2_in1or1,axiom,
( connection(out(c,h2(X8)),in(n1,or1(X8)))
| ~ type(X8,fulladder) )).
cnf(fulladder_connection_outch1_in2or1,axiom,
( connection(out(c,h1(X8)),in(n2,or1(X8)))
| ~ type(X8,fulladder) )).
cnf(fulladder_connection_outsh1_in2h2,axiom,
( connection(out(s,h1(X8)),in(n2,h2(X8)))
| ~ type(X8,fulladder) )).
cnf(halfadder_connection_out1not1_in2and1,axiom,
( connection(out(n1,not1(X8)),in(n2,and1(X8)))
| ~ type(X8,halfadder) )).
cnf(halfadder_connection_out1and2_in1not1,axiom,
( connection(out(n1,and2(X8)),in(n1,not1(X8)))
| ~ type(X8,halfadder) )).
cnf(halfadder_connection_out1or1_in1_and1,axiom,
( connection(out(n1,or1(X8)),in(n1,and1(X8)))
| ~ type(X8,halfadder) )).
cnf(fulladder_connection_outs_outsh2,axiom,
( connection(out(s,X8),out(s,h2(X8)))
| ~ type(X8,fulladder) )).
cnf(fulladder_connection_outc_out1or1,axiom,
( connection(out(c,X8),out(n1,or1(X8)))
| ~ type(X8,fulladder) )).
cnf(halfadder_connection_outc_out1and2,axiom,
( connection(out(c,X8),out(n1,and2(X8)))
| ~ type(X8,halfadder) )).
cnf(halfadder_connection_outs_out1and1,axiom,
( connection(out(s,X8),out(n1,and1(X8)))
| ~ type(X8,halfadder) )).
cnf(fulladder_connection_in1_in1h2,axiom,
( connection(in(n1,X8),in(n1,h2(X8)))
| ~ type(X8,fulladder) )).
cnf(fulladder_connection_inc_in2h1,axiom,
( connection(in(c,X8),in(n2,h1(X8)))
| ~ type(X8,fulladder) )).
cnf(fulladder_connection_in2_in1h1,axiom,
( connection(in(n2,X8),in(n1,h1(X8)))
| ~ type(X8,fulladder) )).
cnf(halfadder_connection_in2_in2or1,axiom,
( connection(in(n2,X8),in(n2,or1(X8)))
| ~ type(X8,halfadder) )).
cnf(halfadder_connection_in1_in1or1,axiom,
( connection(in(n1,X8),in(n1,or1(X8)))
| ~ type(X8,halfadder) )).
cnf(halfadder_connection_in2_in2and2,axiom,
( connection(in(n2,X8),in(n2,and2(X8)))
| ~ type(X8,halfadder) )).
cnf(halfadder_connection_in1_in1and2,axiom,
( connection(in(n1,X8),in(n1,and2(X8)))
| ~ type(X8,halfadder) )).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV036-1 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : vampire --mode casc -t %d %s
% 0.01/1.07 % Computer : n115.star.cs.uiowa.edu
% 0.01/1.07 % Model : x86_64 x86_64
% 0.01/1.07 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.01/1.07 % Memory : 32286.75MB
% 0.01/1.07 % OS : Linux 2.6.32-504.23.4.el6.x86_64
% 0.01/1.07 % CPULimit : 300
% 0.01/1.07 % DateTime : Tue Jul 7 11:13:53 CDT 2015
% 0.01/1.08 % CPUTime :
% 0.01/1.08 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem!
% 0.01/1.08 % remaining time: 2999 next slice time: 14
% 0.01/1.09 dis+2_12_fsr=off:lcm=reverse:nwc=3:spl=off:sp=reverse_arity:updr=off_13 on theBenchmark
% 1.44/2.59 % (41894)Time limit reached!
% 1.44/2.59 % ------------------------------
% 1.44/2.59 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 1.44/2.59 % Termination reason: Time limit
% 1.44/2.59 % Termination phase: Saturation
% 1.44/2.59
% 1.44/2.59 % Active clauses: 2037
% 1.44/2.59 % Passive clauses: 13462
% 1.44/2.59 % Generated clauses: 19764
% 1.44/2.59 % Final active clauses: 2037
% 1.44/2.59 % Final passive clauses: 11313
% 1.44/2.59 % Input clauses: 45
% 1.44/2.59 % Initial clauses: 45
% 1.44/2.59 %
% 1.44/2.59 % Duplicate literals: 5288
% 1.44/2.59 %
% 1.44/2.59 % Simple tautologies: 27
% 1.44/2.59 % Forward subsumptions: 3040
% 1.44/2.59 %
% 1.44/2.59 % Binary resolution: 16375
% 1.44/2.59 %
% 1.44/2.59 % Memory used [KB]: 8699
% 1.44/2.59 % Time elapsed: 1.500 s
% 1.44/2.59 % ------------------------------
% 1.44/2.59 ---- Runtime statistics ----
% 1.44/2.59 clauses created: 19764
% 1.44/2.59 clauses deleted: 5777
% 1.44/2.59 -----------------------------
% 1.44/2.59 % ------------------------------
% 1.44/2.59 % remaining time: 2984 next slice time: 18
% 1.44/2.59 dis+11_128_cond=fast:fsr=off:lcm=reverse:lwlo=on:nwc=1:sos=on:spl=off:sp=reverse_arity:updr=off_17 on theBenchmark
% 1.44/2.59 % Refutation not found, incomplete strategy
% 1.44/2.59 % ------------------------------
% 1.44/2.59 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 1.44/2.59 % Termination reason: Refutation not found, incomplete strategy
% 1.44/2.59
% 1.44/2.59 % Active clauses: 45
% 1.44/2.59 % Final active clauses: 45
% 1.44/2.59 % Input clauses: 45
% 1.44/2.59 % Initial clauses: 45
% 1.44/2.59 %
% 1.44/2.59 % Memory used [KB]: 639
% 1.44/2.59 % Time elapsed: 0.001 s
% 1.44/2.59 % ------------------------------
% 1.44/2.59 ---- Runtime statistics ----
% 1.44/2.59 clauses created: 45
% 1.44/2.59 -----------------------------
% 1.44/2.59 % ------------------------------
% 1.44/2.59 % remaining time: 2984 next slice time: 50
% 1.44/2.59 lrs+10_4_cond=fast:nwc=1:nicw=on:sas=minisat:stl=60:sfr=on:ssfp=10000:ssfq=1.2:smm=off_47 on theBenchmark
% 1.44/2.59 Satisfiable!
% 1.44/2.59 % SZS status Satisfiable for theBenchmark
% 1.44/2.59 % # SZS output start Saturation.
% 1.44/2.59 cnf(fulladder_halfadder2,axiom,
% 1.44/2.59 type(h2(X8),halfadder) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(fulladder_halfadder1,axiom,
% 1.44/2.59 type(h1(X8),halfadder) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_not1,axiom,
% 1.44/2.59 type(not1(X8),not) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_or1,axiom,
% 1.44/2.59 type(or1(X8),or) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(fulladder_or1,axiom,
% 1.44/2.59 type(or1(X8),or) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_and2,axiom,
% 1.44/2.59 type(and2(X8),and) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_and1,axiom,
% 1.44/2.59 type(and1(X8),and) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(ok_or_abnormal,axiom,
% 1.44/2.59 ~type(X6,X7) | mode(X6,abnormal) | mode(X6,ok)).
% 1.44/2.59
% 1.44/2.59 cnf(u52,axiom,
% 1.44/2.59 mode(h2(X6),abnormal) | mode(h2(X6),ok) | ~type(X6,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(u51,axiom,
% 1.44/2.59 mode(h1(X5),abnormal) | mode(h1(X5),ok) | ~type(X5,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(u48,axiom,
% 1.44/2.59 mode(or1(X2),abnormal) | mode(or1(X2),ok) | ~type(X2,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(u49,axiom,
% 1.44/2.59 mode(or1(X3),abnormal) | mode(or1(X3),ok) | ~type(X3,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(u50,axiom,
% 1.44/2.59 mode(not1(X4),abnormal) | mode(not1(X4),ok) | ~type(X4,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(u47,axiom,
% 1.44/2.59 mode(and2(X1),abnormal) | mode(and2(X1),ok) | ~type(X1,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(u46,axiom,
% 1.44/2.59 mode(and1(X0),abnormal) | mode(and1(X0),ok) | ~type(X0,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(not_ok_and_abnormal,axiom,
% 1.44/2.59 ~mode(X6,abnormal) | ~mode(X6,ok)).
% 1.44/2.59
% 1.44/2.59 cnf(equal_value2,axiom,
% 1.44/2.59 ~equal_value(n1,n0)).
% 1.44/2.59
% 1.44/2.59 cnf(equal_value1,axiom,
% 1.44/2.59 ~equal_value(n0,n1)).
% 1.44/2.59
% 1.44/2.59 cnf(or_0_0x,axiom,
% 1.44/2.59 ~value(out(n1,X6),n0) | ~type(X6,or) | ~mode(X6,ok) | value(in(n1,X6),n0)).
% 1.44/2.59
% 1.44/2.59 cnf(or_0_01,axiom,
% 1.44/2.59 ~value(out(n1,X6),n0) | ~type(X6,or) | ~mode(X6,ok) | value(in(n2,X6),n0)).
% 1.44/2.59
% 1.44/2.59 cnf(not_0_1_bw,axiom,
% 1.44/2.59 ~value(out(n1,X6),n0) | ~type(X6,not) | ~mode(X6,ok) | value(in(n1,X6),n1)).
% 1.44/2.59
% 1.44/2.59 cnf(and_0_00,axiom,
% 1.44/2.59 ~value(out(n1,X6),n0) | ~type(X6,and) | ~mode(X6,ok) | value(in(n1,X6),n0) | value(in(n2,X6),n0)).
% 1.44/2.59
% 1.44/2.59 cnf(and_1_1x,axiom,
% 1.44/2.59 ~value(out(n1,X6),n1) | ~type(X6,and) | ~mode(X6,ok) | value(in(n1,X6),n1)).
% 1.44/2.59
% 1.44/2.59 cnf(and_1_x1,axiom,
% 1.44/2.59 ~value(out(n1,X6),n1) | ~type(X6,and) | ~mode(X6,ok) | value(in(n2,X6),n1)).
% 1.44/2.59
% 1.44/2.59 cnf(not_1_0_bw,axiom,
% 1.44/2.59 ~value(out(n1,X6),n1) | ~type(X6,not) | ~mode(X6,ok) | value(in(n1,X6),n0)).
% 1.44/2.59
% 1.44/2.59 cnf(or_1_11,axiom,
% 1.44/2.59 ~value(out(n1,X6),n1) | ~type(X6,or) | ~mode(X6,ok) | value(in(n1,X6),n1) | value(in(n2,X6),n1)).
% 1.44/2.59
% 1.44/2.59 cnf(or_00_0,axiom,
% 1.44/2.59 ~value(in(n2,X6),n0) | ~type(X6,or) | ~mode(X6,ok) | ~value(in(n1,X6),n0) | value(out(n1,X6),n0)).
% 1.44/2.59
% 1.44/2.59 cnf(and_11_1,axiom,
% 1.44/2.59 ~value(in(n2,X6),n1) | ~type(X6,and) | ~mode(X6,ok) | ~value(in(n1,X6),n1) | value(out(n1,X6),n1)).
% 1.44/2.59
% 1.44/2.59 cnf(not_1_0_fw,axiom,
% 1.44/2.59 ~value(in(n1,X6),n1) | ~type(X6,not) | ~mode(X6,ok) | value(out(n1,X6),n0)).
% 1.44/2.59
% 1.44/2.59 cnf(not_0_1_fw,axiom,
% 1.44/2.59 ~value(in(n1,X6),n0) | ~type(X6,not) | ~mode(X6,ok) | value(out(n1,X6),n1)).
% 1.44/2.59
% 1.44/2.59 cnf(or_1x_1,axiom,
% 1.44/2.59 ~value(in(X7,X6),n1) | ~type(X6,or) | ~mode(X6,ok) | value(out(n1,X6),n1)).
% 1.44/2.59
% 1.44/2.59 cnf(and_0x_0,axiom,
% 1.44/2.59 ~value(in(X7,X6),n0) | ~type(X6,and) | ~mode(X6,ok) | value(out(n1,X6),n0)).
% 1.44/2.59
% 1.44/2.59 cnf(value_propagation1,axiom,
% 1.44/2.59 ~value(X0,X2) | ~connection(X0,X1) | value(X1,X2)).
% 1.44/2.59
% 1.44/2.59 cnf(value_propagation2,axiom,
% 1.44/2.59 ~value(X1,X2) | ~connection(X0,X1) | value(X0,X2)).
% 1.44/2.59
% 1.44/2.59 cnf(unique_value,axiom,
% 1.44/2.59 ~value(X3,X5) | ~value(X3,X4) | equal_value(X4,X5)).
% 1.44/2.59
% 1.44/2.59 cnf(fulladder_connection_outch2_in1or1,axiom,
% 1.44/2.59 connection(out(c,h2(X8)),in(n1,or1(X8))) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(fulladder_connection_outch1_in2or1,axiom,
% 1.44/2.59 connection(out(c,h1(X8)),in(n2,or1(X8))) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(fulladder_connection_outsh1_in2h2,axiom,
% 1.44/2.59 connection(out(s,h1(X8)),in(n2,h2(X8))) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_connection_out1not1_in2and1,axiom,
% 1.44/2.59 connection(out(n1,not1(X8)),in(n2,and1(X8))) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_connection_out1and2_in1not1,axiom,
% 1.44/2.59 connection(out(n1,and2(X8)),in(n1,not1(X8))) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_connection_out1or1_in1_and1,axiom,
% 1.44/2.59 connection(out(n1,or1(X8)),in(n1,and1(X8))) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(fulladder_connection_outs_outsh2,axiom,
% 1.44/2.59 connection(out(s,X8),out(s,h2(X8))) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(fulladder_connection_outc_out1or1,axiom,
% 1.44/2.59 connection(out(c,X8),out(n1,or1(X8))) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_connection_outc_out1and2,axiom,
% 1.44/2.59 connection(out(c,X8),out(n1,and2(X8))) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_connection_outs_out1and1,axiom,
% 1.44/2.59 connection(out(s,X8),out(n1,and1(X8))) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(fulladder_connection_in1_in1h2,axiom,
% 1.44/2.59 connection(in(n1,X8),in(n1,h2(X8))) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(fulladder_connection_inc_in2h1,axiom,
% 1.44/2.59 connection(in(c,X8),in(n2,h1(X8))) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(fulladder_connection_in2_in1h1,axiom,
% 1.44/2.59 connection(in(n2,X8),in(n1,h1(X8))) | ~type(X8,fulladder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_connection_in2_in2or1,axiom,
% 1.44/2.59 connection(in(n2,X8),in(n2,or1(X8))) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_connection_in1_in1or1,axiom,
% 1.44/2.59 connection(in(n1,X8),in(n1,or1(X8))) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_connection_in2_in2and2,axiom,
% 1.44/2.59 connection(in(n2,X8),in(n2,and2(X8))) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 cnf(halfadder_connection_in1_in1and2,axiom,
% 1.44/2.59 connection(in(n1,X8),in(n1,and2(X8))) | ~type(X8,halfadder)).
% 1.44/2.59
% 1.44/2.59 % # SZS output end Saturation.
% 1.44/2.59 % ------------------------------
% 1.44/2.59 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 1.44/2.59 % Termination reason: Satisfiable
% 1.44/2.59
% 1.44/2.59 % Active clauses: 52
% 1.44/2.59 % Passive clauses: 52
% 1.44/2.59 % Generated clauses: 59
% 1.44/2.59 % Final active clauses: 52
% 1.44/2.59 % Input clauses: 45
% 1.44/2.59 % Initial clauses: 45
% 1.44/2.59 %
% 1.44/2.59 % Simple tautologies: 7
% 1.44/2.59 %
% 1.44/2.59 % Binary resolution: 14
% 1.44/2.59 %
% 1.44/2.59 % SAT solver clauses: 1
% 1.44/2.59 %
% 1.44/2.59 % Memory used [KB]: 639
% 1.44/2.59 % Time elapsed: 0.002 s
% 1.44/2.59 % ------------------------------
% 1.44/2.59 ---- Runtime statistics ----
% 1.44/2.59 clauses created: 59
% 1.44/2.59 clauses deleted: 7
% 1.44/2.59 -----------------------------
% 1.44/2.59 % ------------------------------
% 1.44/2.59 % Success in time 1.515 s
%------------------------------------------------------------------------------