TSTP Solution File: HWV008-1.002 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV008-1.002 : TPTP v8.1.0. Bugfixed v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : 600s
% DateTime : Sat Jul 16 19:01:09 EDT 2022
% Result : Unsatisfiable 0.80s 1.10s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : HWV008-1.002 : TPTP v8.1.0. Bugfixed v2.2.0.
% 0.10/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 16 21:30:12 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.49/1.06 ============================== Prover9 ===============================
% 0.49/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.06 Process 10024 was started by sandbox on n029.cluster.edu,
% 0.49/1.06 Thu Jun 16 21:30:13 2022
% 0.49/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9871_n029.cluster.edu".
% 0.49/1.06 ============================== end of head ===========================
% 0.49/1.06
% 0.49/1.06 ============================== INPUT =================================
% 0.49/1.06
% 0.49/1.06 % Reading from file /tmp/Prover9_9871_n029.cluster.edu
% 0.49/1.06
% 0.49/1.06 set(prolog_style_variables).
% 0.49/1.06 set(auto2).
% 0.49/1.06 % set(auto2) -> set(auto).
% 0.49/1.06 % set(auto) -> set(auto_inference).
% 0.49/1.06 % set(auto) -> set(auto_setup).
% 0.49/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.06 % set(auto) -> set(auto_limits).
% 0.49/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.06 % set(auto) -> set(auto_denials).
% 0.49/1.06 % set(auto) -> set(auto_process).
% 0.49/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.06 % set(auto2) -> assign(stats, some).
% 0.49/1.06 % set(auto2) -> clear(echo_input).
% 0.49/1.06 % set(auto2) -> set(quiet).
% 0.49/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.06 % set(auto2) -> clear(print_given).
% 0.49/1.06 assign(lrs_ticks,-1).
% 0.49/1.06 assign(sos_limit,10000).
% 0.49/1.06 assign(order,kbo).
% 0.49/1.06 set(lex_order_vars).
% 0.49/1.06 clear(print_given).
% 0.49/1.06
% 0.49/1.06 % formulas(sos). % not echoed (68 formulas)
% 0.49/1.06
% 0.49/1.06 ============================== end of input ==========================
% 0.49/1.06
% 0.49/1.06 % From the command line: assign(max_seconds, 300).
% 0.49/1.06
% 0.49/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.06
% 0.49/1.06 % Formulas that are not ordinary clauses:
% 0.49/1.06
% 0.49/1.06 ============================== end of process non-clausal formulas ===
% 0.49/1.06
% 0.49/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.06
% 0.49/1.06 ============================== PREDICATE ELIMINATION =================
% 0.49/1.06 1 -value(A,B) | -value(A,C) | equal_value(B,C) # label(unique_value) # label(axiom). [assumption].
% 0.49/1.06 2 -equal_value(n0,n1) # label(equal_value1) # label(axiom). [assumption].
% 0.49/1.06 3 -equal_value(n1,n0) # label(equal_value2) # label(axiom). [assumption].
% 0.49/1.06 Derived: -value(A,n0) | -value(A,n1). [resolve(1,c,2,a)].
% 0.49/1.06 4 -type(A,halfadder) | connection(in(n1,A),in(n1,or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.49/1.06 5 -connection(A,B) | -value(A,C) | value(B,C) # label(value_propagation1) # label(axiom). [assumption].
% 0.49/1.06 6 -connection(A,B) | -value(B,C) | value(A,C) # label(value_propagation2) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n1,A),B) | value(in(n1,or1(A)),B). [resolve(4,b,5,a)].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n1,or1(A)),B) | value(in(n1,A),B). [resolve(4,b,6,a)].
% 0.49/1.06 7 -type(A,halfadder) | connection(in(n2,A),in(n2,or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n2,A),B) | value(in(n2,or1(A)),B). [resolve(7,b,5,a)].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n2,or1(A)),B) | value(in(n2,A),B). [resolve(7,b,6,a)].
% 0.49/1.06 8 -type(A,halfadder) | connection(in(n1,A),in(n1,and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n1,A),B) | value(in(n1,and2(A)),B). [resolve(8,b,5,a)].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n1,and2(A)),B) | value(in(n1,A),B). [resolve(8,b,6,a)].
% 0.49/1.06 9 -type(A,halfadder) | connection(in(n2,A),in(n2,and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n2,A),B) | value(in(n2,and2(A)),B). [resolve(9,b,5,a)].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n2,and2(A)),B) | value(in(n2,A),B). [resolve(9,b,6,a)].
% 0.49/1.06 10 -type(A,halfadder) | connection(out(s,A),out(n1,and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(out(s,A),B) | value(out(n1,and1(A)),B). [resolve(10,b,5,a)].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(out(n1,and1(A)),B) | value(out(s,A),B). [resolve(10,b,6,a)].
% 0.49/1.06 11 -type(A,halfadder) | connection(out(c,A),out(n1,and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(out(c,A),B) | value(out(n1,and2(A)),B). [resolve(11,b,5,a)].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(out(c,A),B). [resolve(11,b,6,a)].
% 0.49/1.06 12 -type(A,fulladder) | connection(in(n1,A),in(n1,h2(A))) # label(fulladder_connection_in1_in1h2) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(in(n1,A),B) | value(in(n1,h2(A)),B). [resolve(12,b,5,a)].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(in(n1,h2(A)),B) | value(in(n1,A),B). [resolve(12,b,6,a)].
% 0.49/1.06 13 -type(A,fulladder) | connection(in(n2,A),in(n1,h1(A))) # label(fulladder_connection_in2_in1h1) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(in(n2,A),B) | value(in(n1,h1(A)),B). [resolve(13,b,5,a)].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(in(n1,h1(A)),B) | value(in(n2,A),B). [resolve(13,b,6,a)].
% 0.49/1.06 14 -type(A,fulladder) | connection(in(c,A),in(n2,h1(A))) # label(fulladder_connection_inc_in2h1) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(in(c,A),B) | value(in(n2,h1(A)),B). [resolve(14,b,5,a)].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(in(n2,h1(A)),B) | value(in(c,A),B). [resolve(14,b,6,a)].
% 0.49/1.06 15 -type(A,fulladder) | connection(out(s,A),out(s,h2(A))) # label(fulladder_connection_outs_outsh2) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(out(s,A),B) | value(out(s,h2(A)),B). [resolve(15,b,5,a)].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(out(s,h2(A)),B) | value(out(s,A),B). [resolve(15,b,6,a)].
% 0.49/1.06 16 -type(A,fulladder) | connection(out(c,A),out(n1,or1(A))) # label(fulladder_connection_outc_out1or1) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(out(c,A),B) | value(out(n1,or1(A)),B). [resolve(16,b,5,a)].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(out(n1,or1(A)),B) | value(out(c,A),B). [resolve(16,b,6,a)].
% 0.49/1.06 17 -type(A,halfadder) | connection(out(n1,or1(A)),in(n1,and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(out(n1,or1(A)),B) | value(in(n1,and1(A)),B). [resolve(17,b,5,a)].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n1,and1(A)),B) | value(out(n1,or1(A)),B). [resolve(17,b,6,a)].
% 0.49/1.06 18 -type(A,halfadder) | connection(out(n1,and2(A)),in(n1,not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(in(n1,not1(A)),B). [resolve(18,b,5,a)].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n1,not1(A)),B) | value(out(n1,and2(A)),B). [resolve(18,b,6,a)].
% 0.49/1.06 19 -type(A,halfadder) | connection(out(n1,not1(A)),in(n2,and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(out(n1,not1(A)),B) | value(in(n2,and1(A)),B). [resolve(19,b,5,a)].
% 0.49/1.06 Derived: -type(A,halfadder) | -value(in(n2,and1(A)),B) | value(out(n1,not1(A)),B). [resolve(19,b,6,a)].
% 0.49/1.06 20 -type(A,fulladder) | connection(out(s,h1(A)),in(n2,h2(A))) # label(fulladder_connection_outsh1_in2h2) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(out(s,h1(A)),B) | value(in(n2,h2(A)),B). [resolve(20,b,5,a)].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(in(n2,h2(A)),B) | value(out(s,h1(A)),B). [resolve(20,b,6,a)].
% 0.49/1.06 21 -type(A,fulladder) | connection(out(c,h1(A)),in(n2,or1(A))) # label(fulladder_connection_outch1_in2or1) # label(axiom). [assumption].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(out(c,h1(A)),B) | value(in(n2,or1(A)),B). [resolve(21,b,5,a)].
% 0.49/1.06 Derived: -type(A,fulladder) | -value(in(n2,or1(A)),B) | value(out(c,h1(A)),B). [resolve(21,b,6,a)].
% 0.49/1.06 22 -type(A,fulladder) | connection(out(c,h2(A)),in(n1,or1(A))) # label(fulladder_connection_outch2_in1or1) # label(axiom). [assumption].
% 0.49/1.07 Derived: -type(A,fulladder) | -value(out(c,h2(A)),B) | value(in(n1,or1(A)),B). [resolve(22,b,5,a)].
% 0.49/1.07 Derived: -type(A,fulladder) | -value(in(n1,or1(A)),B) | value(out(c,h2(A)),B). [resolve(22,b,6,a)].
% 0.49/1.07 23 -type(A,nbit_adder(n2)) | connection(out(n1,A),out(n1,f(n1,A))) # label(nbit_adder_connection_out1_out1f1) # label(axiom). [assumption].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(out(n1,A),B) | value(out(n1,f(n1,A)),B). [resolve(23,b,5,a)].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(out(n1,f(n1,A)),B) | value(out(n1,A),B). [resolve(23,b,6,a)].
% 0.49/1.07 24 -type(A,nbit_adder(n2)) | connection(out(n2,A),out(n1,f(n2,A))) # label(nbit_adder_connection_out2_out1f2) # label(axiom). [assumption].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(out(n2,A),B) | value(out(n1,f(n2,A)),B). [resolve(24,b,5,a)].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(out(n1,f(n2,A)),B) | value(out(n2,A),B). [resolve(24,b,6,a)].
% 0.49/1.07 25 -type(A,nbit_adder(n2)) | connection(out(c,A),out(c,f(n2,A))) # label(nbit_adder_connection_outc_outcf1) # label(axiom). [assumption].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(out(c,A),B) | value(out(c,f(n2,A)),B). [resolve(25,b,5,a)].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(out(c,f(n2,A)),B) | value(out(c,A),B). [resolve(25,b,6,a)].
% 0.49/1.07 26 -type(A,nbit_adder(n2)) | connection(in(a1,A),in(n1,f(n1,A))) # label(nbit_adder_connection_ina1_in1f1) # label(axiom). [assumption].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(a1,A),B) | value(in(n1,f(n1,A)),B). [resolve(26,b,5,a)].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(n1,f(n1,A)),B) | value(in(a1,A),B). [resolve(26,b,6,a)].
% 0.49/1.07 27 -type(A,nbit_adder(n2)) | connection(in(b1,A),in(n2,f(n1,A))) # label(nbit_adder_connection_inb1_in2f1) # label(axiom). [assumption].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(b1,A),B) | value(in(n2,f(n1,A)),B). [resolve(27,b,5,a)].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(n2,f(n1,A)),B) | value(in(b1,A),B). [resolve(27,b,6,a)].
% 0.49/1.07 28 -type(A,nbit_adder(n2)) | connection(in(a2,A),in(n1,f(n2,A))) # label(nbit_adder_connection_ina2_in1f2) # label(axiom). [assumption].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(a2,A),B) | value(in(n1,f(n2,A)),B). [resolve(28,b,5,a)].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(n1,f(n2,A)),B) | value(in(a2,A),B). [resolve(28,b,6,a)].
% 0.49/1.07 29 -type(A,nbit_adder(n2)) | connection(in(b2,A),in(n2,f(n2,A))) # label(nbit_adder_connection_inb2_in2f2) # label(axiom). [assumption].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(b2,A),B) | value(in(n2,f(n2,A)),B). [resolve(29,b,5,a)].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(n2,f(n2,A)),B) | value(in(b2,A),B). [resolve(29,b,6,a)].
% 0.49/1.07 30 -type(A,nbit_adder(n2)) | connection(in(c,A),in(c,f(n1,A))) # label(nbit_adder_connection_inc_incf2) # label(axiom). [assumption].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(c,A),B) | value(in(c,f(n1,A)),B). [resolve(30,b,5,a)].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(c,f(n1,A)),B) | value(in(c,A),B). [resolve(30,b,6,a)].
% 0.49/1.07 31 -type(A,nbit_adder(n2)) | connection(out(c,f(n1,A)),in(c,f(n2,A))) # label(nbit_adder_connection_inc_incf1) # label(axiom). [assumption].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(out(c,f(n1,A)),B) | value(in(c,f(n2,A)),B). [resolve(31,b,5,a)].
% 0.49/1.07 Derived: -type(A,nbit_adder(n2)) | -value(in(c,f(n2,A)),B) | value(out(c,f(n1,A)),B). [resolve(31,b,6,a)].
% 0.49/1.07
% 0.49/1.07 ============================== end predicate elimination =============
% 0.49/1.07
% 0.49/1.07 Auto_denials: (non-Horn, no changes).
% 0.49/1.07
% 0.49/1.07 Term ordering decisions:
% 0.49/1.07 Function symbol KB weights: n1=1. n2=1. c=1. halfadder=1. n0=1. fulladder=1. ok=1. a=1. s=1. and=1. or=1. not=1. a1=1. a2=1. b1=1. b2=1. abnormal=1. in=1. out=1. f=1. nbit_adder=1. or1=1. and2=1. h1=1. h2=1. and1=1. not1=1.
% 0.49/1.07
% 0.49/1.07 ============================== end of process initial clauses ========
% 0.49/1.07
% 0.49/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.49/1.07
% 0.49/1.07 ============================== end of clauses for search =============
% 0.49/1.07
% 0.49/1.07 ============================== SEARCH ================================
% 0.80/1.10
% 0.80/1.10 % Starting search at 0.02 seconds.
% 0.80/1.10
% 0.80/1.10 ============================== PROOF =================================
% 0.80/1.10 % SZS status Unsatisfiable
% 0.80/1.10 % SZS output start Refutation
% 0.80/1.10
% 0.80/1.10 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.80/1.10 % Length of proof is 69.
% 0.80/1.10 % Level of proof is 11.
% 0.80/1.10 % Maximum clause weight is 24.000.
% 0.80/1.10 % Given clauses 174.
% 0.80/1.10
% 0.80/1.10 1 -value(A,B) | -value(A,C) | equal_value(B,C) # label(unique_value) # label(axiom). [assumption].
% 0.80/1.10 2 -equal_value(n0,n1) # label(equal_value1) # label(axiom). [assumption].
% 0.80/1.10 5 -connection(A,B) | -value(A,C) | value(B,C) # label(value_propagation1) # label(axiom). [assumption].
% 0.80/1.10 6 -connection(A,B) | -value(B,C) | value(A,C) # label(value_propagation2) # label(axiom). [assumption].
% 0.80/1.10 8 -type(A,halfadder) | connection(in(n1,A),in(n1,and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.80/1.10 11 -type(A,halfadder) | connection(out(c,A),out(n1,and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.80/1.10 12 -type(A,fulladder) | connection(in(n1,A),in(n1,h2(A))) # label(fulladder_connection_in1_in1h2) # label(axiom). [assumption].
% 0.80/1.10 13 -type(A,fulladder) | connection(in(n2,A),in(n1,h1(A))) # label(fulladder_connection_in2_in1h1) # label(axiom). [assumption].
% 0.80/1.10 16 -type(A,fulladder) | connection(out(c,A),out(n1,or1(A))) # label(fulladder_connection_outc_out1or1) # label(axiom). [assumption].
% 0.80/1.10 21 -type(A,fulladder) | connection(out(c,h1(A)),in(n2,or1(A))) # label(fulladder_connection_outch1_in2or1) # label(axiom). [assumption].
% 0.80/1.10 22 -type(A,fulladder) | connection(out(c,h2(A)),in(n1,or1(A))) # label(fulladder_connection_outch2_in1or1) # label(axiom). [assumption].
% 0.80/1.10 25 -type(A,nbit_adder(n2)) | connection(out(c,A),out(c,f(n2,A))) # label(nbit_adder_connection_outc_outcf1) # label(axiom). [assumption].
% 0.80/1.10 28 -type(A,nbit_adder(n2)) | connection(in(a2,A),in(n1,f(n2,A))) # label(nbit_adder_connection_ina2_in1f2) # label(axiom). [assumption].
% 0.80/1.10 29 -type(A,nbit_adder(n2)) | connection(in(b2,A),in(n2,f(n2,A))) # label(nbit_adder_connection_inb2_in2f2) # label(axiom). [assumption].
% 0.80/1.10 32 type(a,nbit_adder(n2)) # label(a_isa_2bit_adder) # label(hypothesis). [assumption].
% 0.80/1.10 34 value(in(a2,a),n0) # label(ina2_0) # label(hypothesis). [assumption].
% 0.80/1.10 36 value(in(b2,a),n0) # label(inb2_0) # label(hypothesis). [assumption].
% 0.80/1.10 40 value(out(c,a),n1) # label(outc_1) # label(hypothesis). [assumption].
% 0.80/1.10 42 -mode(or1(f(n2,a)),abnormal) # label(diagnosis_or1f2a) # label(negated_conjecture). [assumption].
% 0.80/1.10 43 -mode(and2(h1(f(n2,a))),abnormal) # label(diagnosis_and2h2f2a) # label(negated_conjecture). [assumption].
% 0.80/1.10 44 -mode(and2(h2(f(n2,a))),abnormal) # label(diagnosis_and2h1f2a) # label(negated_conjecture). [assumption].
% 0.80/1.10 46 -type(A,halfadder) | type(and2(A),and) # label(halfadder_and2) # label(axiom). [assumption].
% 0.80/1.10 49 -type(A,fulladder) | type(h1(A),halfadder) # label(fulladder_halfadder1) # label(axiom). [assumption].
% 0.80/1.10 50 -type(A,fulladder) | type(h2(A),halfadder) # label(fulladder_halfadder2) # label(axiom). [assumption].
% 0.80/1.10 51 -type(A,fulladder) | type(or1(A),or) # label(fulladder_or1) # label(axiom). [assumption].
% 0.80/1.10 52 -type(A,B) | mode(A,ok) | mode(A,abnormal) # label(ok_or_abnormal) # label(axiom). [assumption].
% 0.80/1.10 54 -type(A,nbit_adder(n2)) | type(f(n2,A),fulladder) # label(nbit_adder_fulladder2) # label(axiom). [assumption].
% 0.80/1.10 56 -mode(A,ok) | -type(A,and) | -value(out(n1,A),n1) | value(in(n1,A),n1) # label(and_1_1x) # label(axiom). [assumption].
% 0.80/1.10 68 -mode(A,ok) | -type(A,or) | -value(out(n1,A),n1) | value(in(n1,A),n1) | value(in(n2,A),n1) # label(or_1_11) # label(axiom). [assumption].
% 0.80/1.10 69 -value(A,n0) | -value(A,n1). [resolve(1,c,2,a)].
% 0.80/1.10 75 -type(A,halfadder) | -value(in(n1,and2(A)),B) | value(in(n1,A),B). [resolve(8,b,6,a)].
% 0.80/1.10 80 -type(A,halfadder) | -value(out(c,A),B) | value(out(n1,and2(A)),B). [resolve(11,b,5,a)].
% 0.80/1.10 83 -type(A,fulladder) | -value(in(n1,h2(A)),B) | value(in(n1,A),B). [resolve(12,b,6,a)].
% 0.80/1.10 85 -type(A,fulladder) | -value(in(n1,h1(A)),B) | value(in(n2,A),B). [resolve(13,b,6,a)].
% 0.80/1.10 90 -type(A,fulladder) | -value(out(c,A),B) | value(out(n1,or1(A)),B). [resolve(16,b,5,a)].
% 0.80/1.10 101 -type(A,fulladder) | -value(in(n2,or1(A)),B) | value(out(c,h1(A)),B). [resolve(21,b,6,a)].
% 0.80/1.10 103 -type(A,fulladder) | -value(in(n1,or1(A)),B) | value(out(c,h2(A)),B). [resolve(22,b,6,a)].
% 0.80/1.10 108 -type(A,nbit_adder(n2)) | -value(out(c,A),B) | value(out(c,f(n2,A)),B). [resolve(25,b,5,a)].
% 0.80/1.10 115 -type(A,nbit_adder(n2)) | -value(in(n1,f(n2,A)),B) | value(in(a2,A),B). [resolve(28,b,6,a)].
% 0.80/1.10 117 -type(A,nbit_adder(n2)) | -value(in(n2,f(n2,A)),B) | value(in(b2,A),B). [resolve(29,b,6,a)].
% 0.80/1.10 124 type(f(n2,a),fulladder). [resolve(54,a,32,a)].
% 0.80/1.10 128 -value(in(b2,a),n1). [resolve(69,a,36,a)].
% 0.80/1.10 130 -value(in(a2,a),n1). [resolve(69,a,34,a)].
% 0.80/1.10 137 -value(out(c,a),A) | value(out(c,f(n2,a)),A). [resolve(108,a,32,a)].
% 0.80/1.10 154 -value(in(n2,f(n2,a)),n1). [ur(117,a,32,a,c,128,a)].
% 0.80/1.10 192 type(or1(f(n2,a)),or). [resolve(124,a,51,a)].
% 0.80/1.10 193 type(h2(f(n2,a)),halfadder). [resolve(124,a,50,a)].
% 0.80/1.10 194 type(h1(f(n2,a)),halfadder). [resolve(124,a,49,a)].
% 0.80/1.10 220 -value(in(n1,f(n2,a)),n1). [ur(115,a,32,a,c,130,a)].
% 0.80/1.10 246 mode(or1(f(n2,a)),ok). [resolve(192,a,52,a),unit_del(b,42)].
% 0.80/1.10 268 type(and2(h2(f(n2,a))),and). [resolve(193,a,46,a)].
% 0.80/1.10 291 type(and2(h1(f(n2,a))),and). [resolve(194,a,46,a)].
% 0.80/1.10 295 -value(in(n1,h1(f(n2,a))),n1). [ur(85,a,124,a,c,154,a)].
% 0.80/1.10 297 -value(out(n1,or1(f(n2,a))),n1) | value(in(n1,or1(f(n2,a))),n1) | value(in(n2,or1(f(n2,a))),n1). [resolve(246,a,68,a),unit_del(a,192)].
% 0.80/1.10 314 -value(in(n1,h2(f(n2,a))),n1). [ur(83,a,124,a,c,220,a)].
% 0.80/1.10 327 -value(in(n1,and2(h1(f(n2,a)))),n1). [ur(75,a,194,a,c,295,a)].
% 0.80/1.10 331 -value(in(n1,and2(h2(f(n2,a)))),n1). [ur(75,a,193,a,c,314,a)].
% 0.80/1.10 338 mode(and2(h2(f(n2,a))),ok). [resolve(268,a,52,a),unit_del(b,44)].
% 0.80/1.10 342 mode(and2(h1(f(n2,a))),ok). [resolve(291,a,52,a),unit_del(b,43)].
% 0.80/1.10 343 value(out(c,f(n2,a)),n1). [resolve(137,a,40,a)].
% 0.80/1.10 355 -value(out(n1,and2(h2(f(n2,a)))),n1). [resolve(338,a,56,a),unit_del(a,268),unit_del(c,331)].
% 0.80/1.10 360 -value(out(c,h2(f(n2,a))),n1). [ur(80,a,193,a,c,355,a)].
% 0.80/1.10 371 -value(out(n1,and2(h1(f(n2,a)))),n1). [resolve(342,a,56,a),unit_del(a,291),unit_del(c,327)].
% 0.80/1.10 376 -value(in(n1,or1(f(n2,a))),n1). [ur(103,a,124,a,c,360,a)].
% 0.80/1.10 378 -value(out(n1,or1(f(n2,a))),n1) | value(in(n2,or1(f(n2,a))),n1). [back_unit_del(297),unit_del(b,376)].
% 0.80/1.10 380 -value(out(c,h1(f(n2,a))),n1). [ur(80,a,194,a,c,371,a)].
% 0.80/1.10 382 -value(in(n2,or1(f(n2,a))),n1). [ur(101,a,124,a,c,380,a)].
% 0.80/1.10 383 -value(out(n1,or1(f(n2,a))),n1). [back_unit_del(378),unit_del(b,382)].
% 0.80/1.10 386 $F. [ur(90,b,343,a,c,383,a),unit_del(a,124)].
% 0.80/1.10
% 0.80/1.10 % SZS output end Refutation
% 0.80/1.10 ============================== end of proof ==========================
% 0.80/1.10
% 0.80/1.10 ============================== STATISTICS ============================
% 0.80/1.10
% 0.80/1.10 Given=174. Generated=426. Kept=354. proofs=1.
% 0.80/1.10 Usable=173. Sos=150. Demods=0. Limbo=0, Disabled=152. Hints=0.
% 0.80/1.10 Megabytes=0.58.
% 0.80/1.10 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.80/1.10
% 0.80/1.10 ============================== end of statistics =====================
% 0.80/1.10
% 0.80/1.10 ============================== end of search =========================
% 0.80/1.10
% 0.80/1.10 THEOREM PROVED
% 0.80/1.10 % SZS status Unsatisfiable
% 0.80/1.10
% 0.80/1.10 Exiting with 1 proof.
% 0.80/1.10
% 0.80/1.10 Process 10024 exit (max_proofs) Thu Jun 16 21:30:13 2022
% 0.80/1.10 Prover9 interrupted
%------------------------------------------------------------------------------