TSTP Solution File: HWV006-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV006-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:08 EDT 2022
% Result : Unsatisfiable 0.81s 1.11s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : HWV006-1 : TPTP v8.1.0. Released v2.1.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jun 17 01:36:49 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.81/1.08 ============================== Prover9 ===============================
% 0.81/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.08 Process 24819 was started by sandbox on n020.cluster.edu,
% 0.81/1.08 Fri Jun 17 01:36:50 2022
% 0.81/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24666_n020.cluster.edu".
% 0.81/1.08 ============================== end of head ===========================
% 0.81/1.08
% 0.81/1.08 ============================== INPUT =================================
% 0.81/1.08
% 0.81/1.08 % Reading from file /tmp/Prover9_24666_n020.cluster.edu
% 0.81/1.08
% 0.81/1.08 set(prolog_style_variables).
% 0.81/1.08 set(auto2).
% 0.81/1.08 % set(auto2) -> set(auto).
% 0.81/1.08 % set(auto) -> set(auto_inference).
% 0.81/1.08 % set(auto) -> set(auto_setup).
% 0.81/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.08 % set(auto) -> set(auto_limits).
% 0.81/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.08 % set(auto) -> set(auto_denials).
% 0.81/1.08 % set(auto) -> set(auto_process).
% 0.81/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.08 % set(auto2) -> assign(stats, some).
% 0.81/1.08 % set(auto2) -> clear(echo_input).
% 0.81/1.08 % set(auto2) -> set(quiet).
% 0.81/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.08 % set(auto2) -> clear(print_given).
% 0.81/1.08 assign(lrs_ticks,-1).
% 0.81/1.08 assign(sos_limit,10000).
% 0.81/1.08 assign(order,kbo).
% 0.81/1.08 set(lex_order_vars).
% 0.81/1.08 clear(print_given).
% 0.81/1.08
% 0.81/1.08 % formulas(sos). % not echoed (58 formulas)
% 0.81/1.08
% 0.81/1.08 ============================== end of input ==========================
% 0.81/1.08
% 0.81/1.08 % From the command line: assign(max_seconds, 300).
% 0.81/1.08
% 0.81/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.08
% 0.81/1.08 % Formulas that are not ordinary clauses:
% 0.81/1.08
% 0.81/1.08 ============================== end of process non-clausal formulas ===
% 0.81/1.08
% 0.81/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.08
% 0.81/1.08 ============================== PREDICATE ELIMINATION =================
% 0.81/1.08 1 -value(A,B) | -value(A,C) | equal_value(B,C) # label(unique_value) # label(axiom). [assumption].
% 0.81/1.08 2 -equal_value(n0,n1) # label(equal_value1) # label(axiom). [assumption].
% 0.81/1.08 3 -equal_value(n1,n0) # label(equal_value2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -value(A,n0) | -value(A,n1). [resolve(1,c,2,a)].
% 0.81/1.08 4 -type(A,halfadder) | connection(in(n1,A),in(n1,or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.81/1.08 5 -connection(A,B) | -value(A,C) | value(B,C) # label(value_propagation1) # label(axiom). [assumption].
% 0.81/1.08 6 -connection(A,B) | -value(B,C) | value(A,C) # label(value_propagation2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n1,A),B) | value(in(n1,or1(A)),B). [resolve(4,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n1,or1(A)),B) | value(in(n1,A),B). [resolve(4,b,6,a)].
% 0.81/1.08 7 -type(A,halfadder) | connection(in(n2,A),in(n2,or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n2,A),B) | value(in(n2,or1(A)),B). [resolve(7,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n2,or1(A)),B) | value(in(n2,A),B). [resolve(7,b,6,a)].
% 0.81/1.08 8 -type(A,halfadder) | connection(in(n1,A),in(n1,and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n1,A),B) | value(in(n1,and2(A)),B). [resolve(8,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n1,and2(A)),B) | value(in(n1,A),B). [resolve(8,b,6,a)].
% 0.81/1.08 9 -type(A,halfadder) | connection(in(n2,A),in(n2,and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n2,A),B) | value(in(n2,and2(A)),B). [resolve(9,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n2,and2(A)),B) | value(in(n2,A),B). [resolve(9,b,6,a)].
% 0.81/1.08 10 -type(A,halfadder) | connection(out(s,A),out(n1,and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(out(s,A),B) | value(out(n1,and1(A)),B). [resolve(10,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(out(n1,and1(A)),B) | value(out(s,A),B). [resolve(10,b,6,a)].
% 0.81/1.08 11 -type(A,halfadder) | connection(out(c,A),out(n1,and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(out(c,A),B) | value(out(n1,and2(A)),B). [resolve(11,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(out(c,A),B). [resolve(11,b,6,a)].
% 0.81/1.08 12 -type(A,fulladder) | connection(in(n1,A),in(n1,h2(A))) # label(fulladder_connection_in1_in1h2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(in(n1,A),B) | value(in(n1,h2(A)),B). [resolve(12,b,5,a)].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(in(n1,h2(A)),B) | value(in(n1,A),B). [resolve(12,b,6,a)].
% 0.81/1.08 13 -type(A,fulladder) | connection(in(n2,A),in(n1,h1(A))) # label(fulladder_connection_in2_in1h1) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(in(n2,A),B) | value(in(n1,h1(A)),B). [resolve(13,b,5,a)].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(in(n1,h1(A)),B) | value(in(n2,A),B). [resolve(13,b,6,a)].
% 0.81/1.08 14 -type(A,fulladder) | connection(in(c,A),in(n2,h1(A))) # label(fulladder_connection_inc_in2h1) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(in(c,A),B) | value(in(n2,h1(A)),B). [resolve(14,b,5,a)].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(in(n2,h1(A)),B) | value(in(c,A),B). [resolve(14,b,6,a)].
% 0.81/1.08 15 -type(A,fulladder) | connection(out(s,A),out(s,h2(A))) # label(fulladder_connection_outs_outsh2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(out(s,A),B) | value(out(s,h2(A)),B). [resolve(15,b,5,a)].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(out(s,h2(A)),B) | value(out(s,A),B). [resolve(15,b,6,a)].
% 0.81/1.08 16 -type(A,fulladder) | connection(out(c,A),out(n1,or1(A))) # label(fulladder_connection_outc_out1or1) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(out(c,A),B) | value(out(n1,or1(A)),B). [resolve(16,b,5,a)].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(out(n1,or1(A)),B) | value(out(c,A),B). [resolve(16,b,6,a)].
% 0.81/1.08 17 -type(A,halfadder) | connection(out(n1,or1(A)),in(n1,and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(out(n1,or1(A)),B) | value(in(n1,and1(A)),B). [resolve(17,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n1,and1(A)),B) | value(out(n1,or1(A)),B). [resolve(17,b,6,a)].
% 0.81/1.08 18 -type(A,halfadder) | connection(out(n1,and2(A)),in(n1,not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(in(n1,not1(A)),B). [resolve(18,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n1,not1(A)),B) | value(out(n1,and2(A)),B). [resolve(18,b,6,a)].
% 0.81/1.08 19 -type(A,halfadder) | connection(out(n1,not1(A)),in(n2,and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(out(n1,not1(A)),B) | value(in(n2,and1(A)),B). [resolve(19,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n2,and1(A)),B) | value(out(n1,not1(A)),B). [resolve(19,b,6,a)].
% 0.81/1.08 20 -type(A,fulladder) | connection(out(s,h1(A)),in(n2,h2(A))) # label(fulladder_connection_outsh1_in2h2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(out(s,h1(A)),B) | value(in(n2,h2(A)),B). [resolve(20,b,5,a)].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(in(n2,h2(A)),B) | value(out(s,h1(A)),B). [resolve(20,b,6,a)].
% 0.81/1.08 21 -type(A,fulladder) | connection(out(c,h1(A)),in(n2,or1(A))) # label(fulladder_connection_outch1_in2or1) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(out(c,h1(A)),B) | value(in(n2,or1(A)),B). [resolve(21,b,5,a)].
% 0.81/1.08 Derived: -type(A,fulladder) | -value(in(n2,or1(A)),B) | value(out(c,h1(A)),B). [resolve(21,b,6,a)].
% 0.81/1.08 22 -type(A,fulladder) | connection(out(c,h2(A)),in(n1,or1(A))) # label(fulladder_connection_outch2_in1or1) # label(axiom). [assumption].
% 0.81/1.11 Derived: -type(A,fulladder) | -value(out(c,h2(A)),B) | value(in(n1,or1(A)),B). [resolve(22,b,5,a)].
% 0.81/1.11 Derived: -type(A,fulladder) | -value(in(n1,or1(A)),B) | value(out(c,h2(A)),B). [resolve(22,b,6,a)].
% 0.81/1.11
% 0.81/1.11 ============================== end predicate elimination =============
% 0.81/1.11
% 0.81/1.11 Auto_denials: (non-Horn, no changes).
% 0.81/1.11
% 0.81/1.11 Term ordering decisions:
% 0.81/1.11 Function symbol KB weights: n1=1. n2=1. halfadder=1. fulladder=1. n0=1. ok=1. c=1. s=1. and=1. or=1. f=1. not=1. abnormal=1. in=1. out=1. or1=1. and2=1. h1=1. h2=1. and1=1. not1=1.
% 0.81/1.11
% 0.81/1.11 ============================== end of process initial clauses ========
% 0.81/1.11
% 0.81/1.11 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.11
% 0.81/1.11 ============================== end of clauses for search =============
% 0.81/1.11
% 0.81/1.11 ============================== SEARCH ================================
% 0.81/1.11
% 0.81/1.11 % Starting search at 0.02 seconds.
% 0.81/1.11
% 0.81/1.11 ============================== PROOF =================================
% 0.81/1.11 % SZS status Unsatisfiable
% 0.81/1.11 % SZS output start Refutation
% 0.81/1.11
% 0.81/1.11 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.81/1.11 % Length of proof is 125.
% 0.81/1.11 % Level of proof is 20.
% 0.81/1.11 % Maximum clause weight is 21.000.
% 0.81/1.11 % Given clauses 165.
% 0.81/1.11
% 0.81/1.11 1 -value(A,B) | -value(A,C) | equal_value(B,C) # label(unique_value) # label(axiom). [assumption].
% 0.81/1.11 2 -equal_value(n0,n1) # label(equal_value1) # label(axiom). [assumption].
% 0.81/1.11 5 -connection(A,B) | -value(A,C) | value(B,C) # label(value_propagation1) # label(axiom). [assumption].
% 0.81/1.11 6 -connection(A,B) | -value(B,C) | value(A,C) # label(value_propagation2) # label(axiom). [assumption].
% 0.81/1.11 7 -type(A,halfadder) | connection(in(n2,A),in(n2,or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.81/1.11 8 -type(A,halfadder) | connection(in(n1,A),in(n1,and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.81/1.11 9 -type(A,halfadder) | connection(in(n2,A),in(n2,and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.81/1.11 10 -type(A,halfadder) | connection(out(s,A),out(n1,and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.81/1.11 11 -type(A,halfadder) | connection(out(c,A),out(n1,and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.81/1.11 12 -type(A,fulladder) | connection(in(n1,A),in(n1,h2(A))) # label(fulladder_connection_in1_in1h2) # label(axiom). [assumption].
% 0.81/1.11 13 -type(A,fulladder) | connection(in(n2,A),in(n1,h1(A))) # label(fulladder_connection_in2_in1h1) # label(axiom). [assumption].
% 0.81/1.11 14 -type(A,fulladder) | connection(in(c,A),in(n2,h1(A))) # label(fulladder_connection_inc_in2h1) # label(axiom). [assumption].
% 0.81/1.11 15 -type(A,fulladder) | connection(out(s,A),out(s,h2(A))) # label(fulladder_connection_outs_outsh2) # label(axiom). [assumption].
% 0.81/1.11 16 -type(A,fulladder) | connection(out(c,A),out(n1,or1(A))) # label(fulladder_connection_outc_out1or1) # label(axiom). [assumption].
% 0.81/1.11 17 -type(A,halfadder) | connection(out(n1,or1(A)),in(n1,and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.81/1.11 18 -type(A,halfadder) | connection(out(n1,and2(A)),in(n1,not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.81/1.11 19 -type(A,halfadder) | connection(out(n1,not1(A)),in(n2,and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.81/1.11 20 -type(A,fulladder) | connection(out(s,h1(A)),in(n2,h2(A))) # label(fulladder_connection_outsh1_in2h2) # label(axiom). [assumption].
% 0.81/1.11 22 -type(A,fulladder) | connection(out(c,h2(A)),in(n1,or1(A))) # label(fulladder_connection_outch2_in1or1) # label(axiom). [assumption].
% 0.81/1.11 23 type(f,fulladder) # label(f_isa_fulladder) # label(hypothesis). [assumption].
% 0.81/1.11 24 value(in(n1,f),n1) # label(in1_1) # label(hypothesis). [assumption].
% 0.81/1.11 25 value(in(n2,f),n0) # label(in2_0) # label(hypothesis). [assumption].
% 0.81/1.11 26 value(in(c,f),n1) # label(inc_1) # label(hypothesis). [assumption].
% 0.81/1.11 27 value(out(s,f),n1) # label(outs_1) # label(hypothesis). [assumption].
% 0.81/1.11 28 value(out(c,f),n0) # label(outc_0) # label(hypothesis). [assumption].
% 0.81/1.11 29 -mode(and2(h2(f)),abnormal) # label(diagnosis_and2) # label(negated_conjecture). [assumption].
% 0.81/1.11 30 -mode(or1(h1(f)),abnormal) # label(diagnosis_or1h1) # label(negated_conjecture). [assumption].
% 0.81/1.11 31 -mode(not1(h1(f)),abnormal) # label(diagnosis_not1h1) # label(negated_conjecture). [assumption].
% 0.81/1.11 32 -mode(and2(h1(f)),abnormal) # label(diagnosis_and2h1) # label(negated_conjecture). [assumption].
% 0.81/1.11 33 -mode(and1(h1(f)),abnormal) # label(diagnosis_and1h1) # label(negated_conjecture). [assumption].
% 0.81/1.11 35 -mode(or1(f),abnormal) | -mode(not1(h2(f)),abnormal) # label(diagnosis_or1_not1h2) # label(negated_conjecture). [assumption].
% 0.81/1.11 36 -mode(or1(f),abnormal) | -mode(and1(h2(f)),abnormal) # label(diagnosis_or1_and1h2) # label(negated_conjecture). [assumption].
% 0.81/1.11 37 -type(A,halfadder) | type(and1(A),and) # label(halfadder_and1) # label(axiom). [assumption].
% 0.81/1.11 38 -type(A,halfadder) | type(and2(A),and) # label(halfadder_and2) # label(axiom). [assumption].
% 0.81/1.11 39 -type(A,halfadder) | type(not1(A),not) # label(halfadder_not1) # label(axiom). [assumption].
% 0.81/1.11 40 -type(A,halfadder) | type(or1(A),or) # label(halfadder_or1) # label(axiom). [assumption].
% 0.81/1.11 41 -type(A,fulladder) | type(h1(A),halfadder) # label(fulladder_halfadder1) # label(axiom). [assumption].
% 0.81/1.11 42 -type(A,fulladder) | type(h2(A),halfadder) # label(fulladder_halfadder2) # label(axiom). [assumption].
% 0.81/1.11 43 -type(A,fulladder) | type(or1(A),or) # label(fulladder_or1) # label(axiom). [assumption].
% 0.81/1.11 44 -type(A,B) | mode(A,ok) | mode(A,abnormal) # label(ok_or_abnormal) # label(axiom). [assumption].
% 0.81/1.11 46 -mode(A,ok) | -type(A,and) | -value(out(n1,A),n1) | value(in(n1,A),n1) # label(and_1_1x) # label(axiom). [assumption].
% 0.81/1.11 47 -mode(A,ok) | -type(A,and) | -value(out(n1,A),n1) | value(in(n2,A),n1) # label(and_1_x1) # label(axiom). [assumption].
% 0.81/1.11 49 -mode(A,ok) | -type(A,or) | -value(out(n1,A),n0) | value(in(n1,A),n0) # label(or_0_0x) # label(axiom). [assumption].
% 0.81/1.11 50 -mode(A,ok) | -type(A,or) | -value(out(n1,A),n0) | value(in(n2,A),n0) # label(or_0_01) # label(axiom). [assumption].
% 0.81/1.11 53 -mode(A,ok) | -type(A,not) | -value(out(n1,A),n0) | value(in(n1,A),n1) # label(not_0_1_bw) # label(axiom). [assumption].
% 0.81/1.11 54 -mode(A,ok) | -type(A,not) | -value(out(n1,A),n1) | value(in(n1,A),n0) # label(not_1_0_bw) # label(axiom). [assumption].
% 0.81/1.11 56 -mode(A,ok) | -type(A,and) | -value(out(n1,A),n0) | value(in(n1,A),n0) | value(in(n2,A),n0) # label(and_0_00) # label(axiom). [assumption].
% 0.81/1.11 59 -value(A,n0) | -value(A,n1). [resolve(1,c,2,a)].
% 0.81/1.11 63 -type(A,halfadder) | -value(in(n2,or1(A)),B) | value(in(n2,A),B). [resolve(7,b,6,a)].
% 0.81/1.11 65 -type(A,halfadder) | -value(in(n1,and2(A)),B) | value(in(n1,A),B). [resolve(8,b,6,a)].
% 0.81/1.11 67 -type(A,halfadder) | -value(in(n2,and2(A)),B) | value(in(n2,A),B). [resolve(9,b,6,a)].
% 0.81/1.11 68 -type(A,halfadder) | -value(out(s,A),B) | value(out(n1,and1(A)),B). [resolve(10,b,5,a)].
% 0.81/1.11 70 -type(A,halfadder) | -value(out(c,A),B) | value(out(n1,and2(A)),B). [resolve(11,b,5,a)].
% 0.81/1.11 73 -type(A,fulladder) | -value(in(n1,h2(A)),B) | value(in(n1,A),B). [resolve(12,b,6,a)].
% 0.81/1.11 75 -type(A,fulladder) | -value(in(n1,h1(A)),B) | value(in(n2,A),B). [resolve(13,b,6,a)].
% 0.81/1.11 77 -type(A,fulladder) | -value(in(n2,h1(A)),B) | value(in(c,A),B). [resolve(14,b,6,a)].
% 0.81/1.11 78 -type(A,fulladder) | -value(out(s,A),B) | value(out(s,h2(A)),B). [resolve(15,b,5,a)].
% 0.81/1.11 80 -type(A,fulladder) | -value(out(c,A),B) | value(out(n1,or1(A)),B). [resolve(16,b,5,a)].
% 0.81/1.11 83 -type(A,halfadder) | -value(in(n1,and1(A)),B) | value(out(n1,or1(A)),B). [resolve(17,b,6,a)].
% 0.81/1.11 85 -type(A,halfadder) | -value(in(n1,not1(A)),B) | value(out(n1,and2(A)),B). [resolve(18,b,6,a)].
% 0.81/1.11 87 -type(A,halfadder) | -value(in(n2,and1(A)),B) | value(out(n1,not1(A)),B). [resolve(19,b,6,a)].
% 0.81/1.11 89 -type(A,fulladder) | -value(in(n2,h2(A)),B) | value(out(s,h1(A)),B). [resolve(20,b,6,a)].
% 0.81/1.11 93 -type(A,fulladder) | -value(in(n1,or1(A)),B) | value(out(c,h2(A)),B). [resolve(22,b,6,a)].
% 0.81/1.11 94 type(h1(f),halfadder). [resolve(41,a,23,a)].
% 0.81/1.11 95 type(h2(f),halfadder). [resolve(42,a,23,a)].
% 0.81/1.11 96 type(or1(f),or). [resolve(43,a,23,a)].
% 0.81/1.11 99 -value(in(n2,f),n1). [resolve(59,a,25,a)].
% 0.81/1.11 101 -value(in(c,f),n0). [ur(59,b,26,a)].
% 0.81/1.11 102 -value(in(n1,f),n0). [ur(59,b,24,a)].
% 0.81/1.11 109 -value(out(s,f),A) | value(out(s,h2(f)),A). [resolve(78,a,23,a)].
% 0.81/1.11 111 -value(out(c,f),A) | value(out(n1,or1(f)),A). [resolve(80,a,23,a)].
% 0.81/1.11 138 type(or1(h1(f)),or). [resolve(94,a,40,a)].
% 0.81/1.11 139 type(not1(h1(f)),not). [resolve(94,a,39,a)].
% 0.81/1.11 140 type(and2(h1(f)),and). [resolve(94,a,38,a)].
% 0.81/1.11 141 type(and1(h1(f)),and). [resolve(94,a,37,a)].
% 0.81/1.11 143 -value(in(n1,h1(f)),n1). [ur(75,a,23,a,c,99,a)].
% 0.81/1.11 145 -value(in(n2,h1(f)),n0). [ur(77,a,23,a,c,101,a)].
% 0.81/1.11 166 type(not1(h2(f)),not). [resolve(95,a,39,a)].
% 0.81/1.11 167 type(and2(h2(f)),and). [resolve(95,a,38,a)].
% 0.81/1.11 168 type(and1(h2(f)),and). [resolve(95,a,37,a)].
% 0.81/1.11 169 mode(or1(f),ok) | mode(or1(f),abnormal). [resolve(96,a,44,a)].
% 0.81/1.11 170 mode(or1(h1(f)),ok). [resolve(138,a,44,a),unit_del(b,30)].
% 0.81/1.11 171 mode(not1(h1(f)),ok). [resolve(139,a,44,a),unit_del(b,31)].
% 0.81/1.11 172 -value(in(n1,h2(f)),n0). [ur(73,a,23,a,c,102,a)].
% 0.81/1.11 173 -value(in(n1,and2(h1(f))),n1). [ur(65,a,94,a,c,143,a)].
% 0.81/1.11 176 mode(and2(h1(f)),ok). [resolve(140,a,44,a),unit_del(b,32)].
% 0.81/1.11 177 mode(and1(h1(f)),ok). [resolve(141,a,44,a),unit_del(b,33)].
% 0.81/1.11 179 mode(not1(h2(f)),ok) | mode(not1(h2(f)),abnormal). [resolve(166,a,44,a)].
% 0.81/1.11 182 -value(in(n2,or1(h1(f))),n0). [ur(63,a,94,a,c,145,a)].
% 0.81/1.11 183 -value(in(n1,and2(h2(f))),n0). [ur(65,a,95,a,c,172,a)].
% 0.81/1.11 185 mode(and2(h2(f)),ok). [resolve(167,a,44,a),unit_del(b,29)].
% 0.81/1.11 186 mode(and1(h2(f)),ok) | mode(and1(h2(f)),abnormal). [resolve(168,a,44,a)].
% 0.81/1.11 192 -value(out(n1,or1(h1(f))),n0). [resolve(170,a,50,a),unit_del(a,138),unit_del(c,182)].
% 0.81/1.11 201 -value(out(n1,not1(h1(f))),n0) | value(in(n1,not1(h1(f))),n1). [resolve(171,a,53,a),unit_del(a,139)].
% 0.81/1.11 218 -value(out(n1,and2(h1(f))),n1). [resolve(176,a,46,a),unit_del(a,140),unit_del(c,173)].
% 0.81/1.11 224 -value(out(n1,and1(h1(f))),n0) | value(in(n1,and1(h1(f))),n0) | value(in(n2,and1(h1(f))),n0). [resolve(177,a,56,a),unit_del(a,141)].
% 0.81/1.11 237 -value(out(n1,and2(h2(f))),n0) | value(in(n2,and2(h2(f))),n0). [resolve(185,a,56,a),unit_del(a,167),unit_del(c,183)].
% 0.81/1.11 248 -value(in(n1,and1(h1(f))),n0). [ur(83,a,94,a,c,192,a)].
% 0.81/1.11 251 -value(out(n1,and1(h1(f))),n0) | value(in(n2,and1(h1(f))),n0). [back_unit_del(224),unit_del(b,248)].
% 0.81/1.11 252 -value(in(n1,not1(h1(f))),n1). [ur(85,a,94,a,c,218,a)].
% 0.81/1.11 255 -value(out(n1,not1(h1(f))),n0). [back_unit_del(201),unit_del(b,252)].
% 0.81/1.11 260 -value(in(n2,and1(h1(f))),n0). [ur(87,a,94,a,c,255,a)].
% 0.81/1.11 261 -value(out(n1,and1(h1(f))),n0). [back_unit_del(251),unit_del(b,260)].
% 0.81/1.11 264 mode(not1(h2(f)),ok) | -mode(or1(f),abnormal). [resolve(179,b,35,b)].
% 0.81/1.11 265 mode(not1(h2(f)),ok) | mode(or1(f),ok). [resolve(264,b,169,b)].
% 0.81/1.11 270 mode(or1(f),ok) | -value(out(n1,not1(h2(f))),n1) | value(in(n1,not1(h2(f))),n0). [resolve(265,a,54,a),unit_del(b,166)].
% 0.81/1.11 281 -value(out(s,h1(f)),n0). [ur(68,a,94,a,c,261,a)].
% 0.81/1.11 282 -value(in(n2,h2(f)),n0). [ur(89,a,23,a,c,281,a)].
% 0.81/1.11 283 -value(in(n2,and2(h2(f))),n0). [ur(67,a,95,a,c,282,a)].
% 0.81/1.11 285 -value(out(n1,and2(h2(f))),n0). [back_unit_del(237),unit_del(b,283)].
% 0.81/1.11 288 mode(and1(h2(f)),ok) | -mode(or1(f),abnormal). [resolve(186,b,36,b)].
% 0.81/1.11 289 mode(and1(h2(f)),ok) | mode(or1(f),ok). [resolve(288,b,169,b)].
% 0.81/1.11 297 mode(or1(f),ok) | -value(out(n1,and1(h2(f))),n1) | value(in(n2,and1(h2(f))),n1). [resolve(289,a,47,a),unit_del(b,168)].
% 0.81/1.11 300 -value(in(n1,not1(h2(f))),n0). [ur(85,a,95,a,c,285,a)].
% 0.81/1.11 301 -value(out(c,h2(f)),n0). [ur(70,a,95,a,c,285,a)].
% 0.81/1.11 303 mode(or1(f),ok) | -value(out(n1,not1(h2(f))),n1). [back_unit_del(270),unit_del(c,300)].
% 0.81/1.11 305 -value(in(n1,or1(f)),n0). [ur(93,a,23,a,c,301,a)].
% 0.81/1.11 306 value(out(s,h2(f)),n1). [resolve(109,a,27,a)].
% 0.81/1.11 307 value(out(n1,or1(f)),n0). [resolve(111,a,28,a)].
% 0.81/1.11 308 -mode(or1(f),ok). [ur(49,b,96,a,c,307,a,d,305,a)].
% 0.81/1.11 310 -value(out(n1,not1(h2(f))),n1). [back_unit_del(303),unit_del(a,308)].
% 0.81/1.11 314 -value(out(n1,and1(h2(f))),n1) | value(in(n2,and1(h2(f))),n1). [back_unit_del(297),unit_del(a,308)].
% 0.81/1.11 329 -value(in(n2,and1(h2(f))),n1). [ur(87,a,95,a,c,310,a)].
% 0.81/1.11 330 -value(out(n1,and1(h2(f))),n1). [back_unit_del(314),unit_del(b,329)].
% 0.81/1.11 336 $F. [ur(68,b,306,a,c,330,a),unit_del(a,95)].
% 0.81/1.11
% 0.81/1.11 % SZS output end Refutation
% 0.81/1.11 ============================== end of proof ==========================
% 0.81/1.12
% 0.81/1.12 ============================== STATISTICS ============================
% 0.81/1.12
% 0.81/1.12 Given=165. Generated=447. Kept=313. proofs=1.
% 0.81/1.12 Usable=154. Sos=72. Demods=0. Limbo=0, Disabled=180. Hints=0.
% 0.81/1.12 Megabytes=0.40.
% 0.81/1.12 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.81/1.12
% 0.81/1.12 ============================== end of statistics =====================
% 0.81/1.12
% 0.81/1.12 ============================== end of search =========================
% 0.81/1.12
% 0.81/1.12 THEOREM PROVED
% 0.81/1.12 % SZS status Unsatisfiable
% 0.81/1.12
% 0.81/1.12 Exiting with 1 proof.
% 0.81/1.12
% 0.81/1.12 Process 24819 exit (max_proofs) Fri Jun 17 01:36:50 2022
% 0.81/1.12 Prover9 interrupted
%------------------------------------------------------------------------------