TSTP Solution File: HWV007-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV007-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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.75s 1.05s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV007-1 : TPTP v8.1.0. Released v2.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n027.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 : 600
% 0.13/0.35 % DateTime : Thu Jun 16 23:08:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.02 ============================== Prover9 ===============================
% 0.75/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.02 Process 3192 was started by sandbox2 on n027.cluster.edu,
% 0.75/1.02 Thu Jun 16 23:08:21 2022
% 0.75/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3037_n027.cluster.edu".
% 0.75/1.02 ============================== end of head ===========================
% 0.75/1.02
% 0.75/1.02 ============================== INPUT =================================
% 0.75/1.02
% 0.75/1.02 % Reading from file /tmp/Prover9_3037_n027.cluster.edu
% 0.75/1.02
% 0.75/1.02 set(prolog_style_variables).
% 0.75/1.02 set(auto2).
% 0.75/1.02 % set(auto2) -> set(auto).
% 0.75/1.02 % set(auto) -> set(auto_inference).
% 0.75/1.02 % set(auto) -> set(auto_setup).
% 0.75/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.02 % set(auto) -> set(auto_limits).
% 0.75/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.02 % set(auto) -> set(auto_denials).
% 0.75/1.02 % set(auto) -> set(auto_process).
% 0.75/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.02 % set(auto2) -> assign(stats, some).
% 0.75/1.02 % set(auto2) -> clear(echo_input).
% 0.75/1.02 % set(auto2) -> set(quiet).
% 0.75/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.02 % set(auto2) -> clear(print_given).
% 0.75/1.02 assign(lrs_ticks,-1).
% 0.75/1.02 assign(sos_limit,10000).
% 0.75/1.02 assign(order,kbo).
% 0.75/1.02 set(lex_order_vars).
% 0.75/1.02 clear(print_given).
% 0.75/1.02
% 0.75/1.02 % formulas(sos). % not echoed (56 formulas)
% 0.75/1.02
% 0.75/1.02 ============================== end of input ==========================
% 0.75/1.02
% 0.75/1.02 % From the command line: assign(max_seconds, 300).
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.02
% 0.75/1.02 % Formulas that are not ordinary clauses:
% 0.75/1.02
% 0.75/1.02 ============================== end of process non-clausal formulas ===
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.02
% 0.75/1.02 ============================== PREDICATE ELIMINATION =================
% 0.75/1.02 1 -value(A,B) | -value(A,C) | equal_value(B,C) # label(unique_value) # label(axiom). [assumption].
% 0.75/1.02 2 -equal_value(n0,n1) # label(equal_value1) # label(axiom). [assumption].
% 0.75/1.02 3 -equal_value(n1,n0) # label(equal_value2) # label(axiom). [assumption].
% 0.75/1.02 Derived: -value(A,n0) | -value(A,n1). [resolve(1,c,2,a)].
% 0.75/1.02 4 -type(A,halfadder) | connection(in(n1,A),in(n1,or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.75/1.02 5 -connection(A,B) | -value(A,C) | value(B,C) # label(value_propagation1) # label(axiom). [assumption].
% 0.75/1.02 6 -connection(A,B) | -value(B,C) | value(A,C) # label(value_propagation2) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n1,A),B) | value(in(n1,or1(A)),B). [resolve(4,b,5,a)].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n1,or1(A)),B) | value(in(n1,A),B). [resolve(4,b,6,a)].
% 0.75/1.02 7 -type(A,halfadder) | connection(in(n2,A),in(n2,or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n2,A),B) | value(in(n2,or1(A)),B). [resolve(7,b,5,a)].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n2,or1(A)),B) | value(in(n2,A),B). [resolve(7,b,6,a)].
% 0.75/1.02 8 -type(A,halfadder) | connection(in(n1,A),in(n1,and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n1,A),B) | value(in(n1,and2(A)),B). [resolve(8,b,5,a)].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n1,and2(A)),B) | value(in(n1,A),B). [resolve(8,b,6,a)].
% 0.75/1.02 9 -type(A,halfadder) | connection(in(n2,A),in(n2,and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n2,A),B) | value(in(n2,and2(A)),B). [resolve(9,b,5,a)].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n2,and2(A)),B) | value(in(n2,A),B). [resolve(9,b,6,a)].
% 0.75/1.02 10 -type(A,halfadder) | connection(out(s,A),out(n1,and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(out(s,A),B) | value(out(n1,and1(A)),B). [resolve(10,b,5,a)].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(out(n1,and1(A)),B) | value(out(s,A),B). [resolve(10,b,6,a)].
% 0.75/1.02 11 -type(A,halfadder) | connection(out(c,A),out(n1,and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(out(c,A),B) | value(out(n1,and2(A)),B). [resolve(11,b,5,a)].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(out(c,A),B). [resolve(11,b,6,a)].
% 0.75/1.02 12 -type(A,fulladder) | connection(in(n1,A),in(n1,h2(A))) # label(fulladder_connection_in1_in1h2) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(in(n1,A),B) | value(in(n1,h2(A)),B). [resolve(12,b,5,a)].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(in(n1,h2(A)),B) | value(in(n1,A),B). [resolve(12,b,6,a)].
% 0.75/1.02 13 -type(A,fulladder) | connection(in(n2,A),in(n1,h1(A))) # label(fulladder_connection_in2_in1h1) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(in(n2,A),B) | value(in(n1,h1(A)),B). [resolve(13,b,5,a)].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(in(n1,h1(A)),B) | value(in(n2,A),B). [resolve(13,b,6,a)].
% 0.75/1.02 14 -type(A,fulladder) | connection(in(c,A),in(n2,h1(A))) # label(fulladder_connection_inc_in2h1) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(in(c,A),B) | value(in(n2,h1(A)),B). [resolve(14,b,5,a)].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(in(n2,h1(A)),B) | value(in(c,A),B). [resolve(14,b,6,a)].
% 0.75/1.02 15 -type(A,fulladder) | connection(out(s,A),out(s,h2(A))) # label(fulladder_connection_outs_outsh2) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(out(s,A),B) | value(out(s,h2(A)),B). [resolve(15,b,5,a)].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(out(s,h2(A)),B) | value(out(s,A),B). [resolve(15,b,6,a)].
% 0.75/1.02 16 -type(A,fulladder) | connection(out(c,A),out(n1,or1(A))) # label(fulladder_connection_outc_out1or1) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(out(c,A),B) | value(out(n1,or1(A)),B). [resolve(16,b,5,a)].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(out(n1,or1(A)),B) | value(out(c,A),B). [resolve(16,b,6,a)].
% 0.75/1.02 17 -type(A,halfadder) | connection(out(n1,or1(A)),in(n1,and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(out(n1,or1(A)),B) | value(in(n1,and1(A)),B). [resolve(17,b,5,a)].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n1,and1(A)),B) | value(out(n1,or1(A)),B). [resolve(17,b,6,a)].
% 0.75/1.02 18 -type(A,halfadder) | connection(out(n1,and2(A)),in(n1,not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(in(n1,not1(A)),B). [resolve(18,b,5,a)].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n1,not1(A)),B) | value(out(n1,and2(A)),B). [resolve(18,b,6,a)].
% 0.75/1.02 19 -type(A,halfadder) | connection(out(n1,not1(A)),in(n2,and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(out(n1,not1(A)),B) | value(in(n2,and1(A)),B). [resolve(19,b,5,a)].
% 0.75/1.02 Derived: -type(A,halfadder) | -value(in(n2,and1(A)),B) | value(out(n1,not1(A)),B). [resolve(19,b,6,a)].
% 0.75/1.02 20 -type(A,fulladder) | connection(out(s,h1(A)),in(n2,h2(A))) # label(fulladder_connection_outsh1_in2h2) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(out(s,h1(A)),B) | value(in(n2,h2(A)),B). [resolve(20,b,5,a)].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(in(n2,h2(A)),B) | value(out(s,h1(A)),B). [resolve(20,b,6,a)].
% 0.75/1.02 21 -type(A,fulladder) | connection(out(c,h1(A)),in(n2,or1(A))) # label(fulladder_connection_outch1_in2or1) # label(axiom). [assumption].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(out(c,h1(A)),B) | value(in(n2,or1(A)),B). [resolve(21,b,5,a)].
% 0.75/1.02 Derived: -type(A,fulladder) | -value(in(n2,or1(A)),B) | value(out(c,h1(A)),B). [resolve(21,b,6,a)].
% 0.75/1.02 22 -type(A,fulladder) | connection(out(c,h2(A)),in(n1,or1(A))) # label(fulladder_connection_outch2_in1or1) # label(axiom). [assumption].
% 0.75/1.05 Derived: -type(A,fulladder) | -value(out(c,h2(A)),B) | value(in(n1,or1(A)),B). [resolve(22,b,5,a)].
% 0.75/1.05 Derived: -type(A,fulladder) | -value(in(n1,or1(A)),B) | value(out(c,h2(A)),B). [resolve(22,b,6,a)].
% 0.75/1.05
% 0.75/1.05 ============================== end predicate elimination =============
% 0.75/1.05
% 0.75/1.05 Auto_denials: (non-Horn, no changes).
% 0.75/1.05
% 0.75/1.05 Term ordering decisions:
% 0.75/1.05 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.75/1.05
% 0.75/1.05 ============================== end of process initial clauses ========
% 0.75/1.05
% 0.75/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.05
% 0.75/1.05 ============================== end of clauses for search =============
% 0.75/1.05
% 0.75/1.05 ============================== SEARCH ================================
% 0.75/1.05
% 0.75/1.05 % Starting search at 0.02 seconds.
% 0.75/1.05
% 0.75/1.05 ============================== PROOF =================================
% 0.75/1.05 % SZS status Unsatisfiable
% 0.75/1.05 % SZS output start Refutation
% 0.75/1.05
% 0.75/1.05 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.75/1.05 % Length of proof is 120.
% 0.75/1.05 % Level of proof is 18.
% 0.75/1.05 % Maximum clause weight is 21.000.
% 0.75/1.05 % Given clauses 175.
% 0.75/1.05
% 0.75/1.05 1 -value(A,B) | -value(A,C) | equal_value(B,C) # label(unique_value) # label(axiom). [assumption].
% 0.75/1.05 2 -equal_value(n0,n1) # label(equal_value1) # label(axiom). [assumption].
% 0.75/1.05 4 -type(A,halfadder) | connection(in(n1,A),in(n1,or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.75/1.05 5 -connection(A,B) | -value(A,C) | value(B,C) # label(value_propagation1) # label(axiom). [assumption].
% 0.75/1.05 6 -connection(A,B) | -value(B,C) | value(A,C) # label(value_propagation2) # label(axiom). [assumption].
% 0.75/1.05 7 -type(A,halfadder) | connection(in(n2,A),in(n2,or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.75/1.05 8 -type(A,halfadder) | connection(in(n1,A),in(n1,and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.75/1.05 9 -type(A,halfadder) | connection(in(n2,A),in(n2,and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.75/1.05 10 -type(A,halfadder) | connection(out(s,A),out(n1,and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.75/1.05 11 -type(A,halfadder) | connection(out(c,A),out(n1,and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.75/1.05 12 -type(A,fulladder) | connection(in(n1,A),in(n1,h2(A))) # label(fulladder_connection_in1_in1h2) # label(axiom). [assumption].
% 0.75/1.05 13 -type(A,fulladder) | connection(in(n2,A),in(n1,h1(A))) # label(fulladder_connection_in2_in1h1) # label(axiom). [assumption].
% 0.75/1.05 14 -type(A,fulladder) | connection(in(c,A),in(n2,h1(A))) # label(fulladder_connection_inc_in2h1) # label(axiom). [assumption].
% 0.75/1.05 15 -type(A,fulladder) | connection(out(s,A),out(s,h2(A))) # label(fulladder_connection_outs_outsh2) # label(axiom). [assumption].
% 0.75/1.05 16 -type(A,fulladder) | connection(out(c,A),out(n1,or1(A))) # label(fulladder_connection_outc_out1or1) # label(axiom). [assumption].
% 0.75/1.05 17 -type(A,halfadder) | connection(out(n1,or1(A)),in(n1,and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.75/1.05 18 -type(A,halfadder) | connection(out(n1,and2(A)),in(n1,not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.75/1.05 19 -type(A,halfadder) | connection(out(n1,not1(A)),in(n2,and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.75/1.05 20 -type(A,fulladder) | connection(out(s,h1(A)),in(n2,h2(A))) # label(fulladder_connection_outsh1_in2h2) # label(axiom). [assumption].
% 0.75/1.05 21 -type(A,fulladder) | connection(out(c,h1(A)),in(n2,or1(A))) # label(fulladder_connection_outch1_in2or1) # label(axiom). [assumption].
% 0.75/1.05 23 type(f,fulladder) # label(f_isa_fulladder) # label(hypothesis). [assumption].
% 0.75/1.05 24 value(in(n1,f),n0) # label(in1_1) # label(hypothesis). [assumption].
% 0.75/1.05 25 value(in(n2,f),n1) # label(in2_0) # label(hypothesis). [assumption].
% 0.75/1.05 26 value(in(c,f),n1) # label(inc_1) # label(hypothesis). [assumption].
% 0.75/1.05 27 value(out(s,f),n1) # label(outs_1) # label(hypothesis). [assumption].
% 0.75/1.05 28 value(out(c,f),n0) # label(outc_0) # label(hypothesis). [assumption].
% 0.75/1.05 29 -mode(and2(h1(f)),abnormal) # label(diagnosis_and2h1) # label(negated_conjecture). [assumption].
% 0.75/1.05 31 -mode(or1(f),abnormal) | -mode(and1(h1(f)),abnormal) # label(diagnosis_or1_and1h1) # label(negated_conjecture). [assumption].
% 0.75/1.05 32 -mode(or1(f),abnormal) | -mode(not1(h1(f)),abnormal) # label(diagnosis_or1_not1h1) # label(negated_conjecture). [assumption].
% 0.75/1.05 33 -mode(or1(f),abnormal) | -mode(and1(h2(f)),abnormal) # label(diagnosis_or1_and1h2) # label(negated_conjecture). [assumption].
% 0.75/1.05 34 -mode(or1(f),abnormal) | -mode(or1(h2(f)),abnormal) # label(diagnosis_or1_or1h2) # label(negated_conjecture). [assumption].
% 0.75/1.05 35 -type(A,halfadder) | type(and1(A),and) # label(halfadder_and1) # label(axiom). [assumption].
% 0.75/1.05 36 -type(A,halfadder) | type(and2(A),and) # label(halfadder_and2) # label(axiom). [assumption].
% 0.75/1.05 37 -type(A,halfadder) | type(not1(A),not) # label(halfadder_not1) # label(axiom). [assumption].
% 0.75/1.05 38 -type(A,halfadder) | type(or1(A),or) # label(halfadder_or1) # label(axiom). [assumption].
% 0.75/1.05 39 -type(A,fulladder) | type(h1(A),halfadder) # label(fulladder_halfadder1) # label(axiom). [assumption].
% 0.75/1.05 40 -type(A,fulladder) | type(h2(A),halfadder) # label(fulladder_halfadder2) # label(axiom). [assumption].
% 0.75/1.05 41 -type(A,fulladder) | type(or1(A),or) # label(fulladder_or1) # label(axiom). [assumption].
% 0.75/1.05 42 -type(A,B) | mode(A,ok) | mode(A,abnormal) # label(ok_or_abnormal) # label(axiom). [assumption].
% 0.75/1.05 44 -mode(A,ok) | -type(A,and) | -value(out(n1,A),n1) | value(in(n1,A),n1) # label(and_1_1x) # label(axiom). [assumption].
% 0.75/1.05 45 -mode(A,ok) | -type(A,and) | -value(out(n1,A),n1) | value(in(n2,A),n1) # label(and_1_x1) # label(axiom). [assumption].
% 0.75/1.05 48 -mode(A,ok) | -type(A,or) | -value(out(n1,A),n0) | value(in(n2,A),n0) # label(or_0_01) # label(axiom). [assumption].
% 0.75/1.05 52 -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.75/1.05 54 -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.75/1.05 56 -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.75/1.05 57 -value(A,n0) | -value(A,n1). [resolve(1,c,2,a)].
% 0.75/1.05 59 -type(A,halfadder) | -value(in(n1,or1(A)),B) | value(in(n1,A),B). [resolve(4,b,6,a)].
% 0.75/1.05 61 -type(A,halfadder) | -value(in(n2,or1(A)),B) | value(in(n2,A),B). [resolve(7,b,6,a)].
% 0.75/1.05 63 -type(A,halfadder) | -value(in(n1,and2(A)),B) | value(in(n1,A),B). [resolve(8,b,6,a)].
% 0.75/1.05 65 -type(A,halfadder) | -value(in(n2,and2(A)),B) | value(in(n2,A),B). [resolve(9,b,6,a)].
% 0.75/1.05 66 -type(A,halfadder) | -value(out(s,A),B) | value(out(n1,and1(A)),B). [resolve(10,b,5,a)].
% 0.75/1.05 68 -type(A,halfadder) | -value(out(c,A),B) | value(out(n1,and2(A)),B). [resolve(11,b,5,a)].
% 0.75/1.05 71 -type(A,fulladder) | -value(in(n1,h2(A)),B) | value(in(n1,A),B). [resolve(12,b,6,a)].
% 0.75/1.05 73 -type(A,fulladder) | -value(in(n1,h1(A)),B) | value(in(n2,A),B). [resolve(13,b,6,a)].
% 0.75/1.05 75 -type(A,fulladder) | -value(in(n2,h1(A)),B) | value(in(c,A),B). [resolve(14,b,6,a)].
% 0.75/1.05 76 -type(A,fulladder) | -value(out(s,A),B) | value(out(s,h2(A)),B). [resolve(15,b,5,a)].
% 0.75/1.05 78 -type(A,fulladder) | -value(out(c,A),B) | value(out(n1,or1(A)),B). [resolve(16,b,5,a)].
% 0.75/1.05 81 -type(A,halfadder) | -value(in(n1,and1(A)),B) | value(out(n1,or1(A)),B). [resolve(17,b,6,a)].
% 0.75/1.05 83 -type(A,halfadder) | -value(in(n1,not1(A)),B) | value(out(n1,and2(A)),B). [resolve(18,b,6,a)].
% 0.75/1.05 85 -type(A,halfadder) | -value(in(n2,and1(A)),B) | value(out(n1,not1(A)),B). [resolve(19,b,6,a)].
% 0.75/1.05 87 -type(A,fulladder) | -value(in(n2,h2(A)),B) | value(out(s,h1(A)),B). [resolve(20,b,6,a)].
% 0.75/1.05 89 -type(A,fulladder) | -value(in(n2,or1(A)),B) | value(out(c,h1(A)),B). [resolve(21,b,6,a)].
% 0.75/1.05 92 type(h1(f),halfadder). [resolve(39,a,23,a)].
% 0.75/1.05 93 type(h2(f),halfadder). [resolve(40,a,23,a)].
% 0.75/1.05 94 type(or1(f),or). [resolve(41,a,23,a)].
% 0.75/1.05 97 -value(in(n1,f),n1). [resolve(57,a,24,a)].
% 0.75/1.05 99 -value(in(c,f),n0). [ur(57,b,26,a)].
% 0.75/1.05 100 -value(in(n2,f),n0). [ur(57,b,25,a)].
% 0.75/1.05 107 -value(out(s,f),A) | value(out(s,h2(f)),A). [resolve(76,a,23,a)].
% 0.75/1.05 109 -value(out(c,f),A) | value(out(n1,or1(f)),A). [resolve(78,a,23,a)].
% 0.75/1.05 112 -value(in(n2,h2(f)),A) | value(out(s,h1(f)),A). [resolve(87,a,23,a)].
% 0.75/1.05 137 type(not1(h1(f)),not). [resolve(92,a,37,a)].
% 0.75/1.05 138 type(and2(h1(f)),and). [resolve(92,a,36,a)].
% 0.75/1.05 139 type(and1(h1(f)),and). [resolve(92,a,35,a)].
% 0.75/1.05 141 -value(in(n1,h2(f)),n1). [ur(71,a,23,a,c,97,a)].
% 0.75/1.05 143 -value(in(n2,h1(f)),n0). [ur(75,a,23,a,c,99,a)].
% 0.75/1.05 163 type(or1(h2(f)),or). [resolve(93,a,38,a)].
% 0.75/1.05 166 type(and1(h2(f)),and). [resolve(93,a,35,a)].
% 0.75/1.05 167 mode(or1(f),ok) | mode(or1(f),abnormal). [resolve(94,a,42,a)].
% 0.75/1.05 169 mode(not1(h1(f)),ok) | mode(not1(h1(f)),abnormal). [resolve(137,a,42,a)].
% 0.75/1.05 170 -value(in(n1,h1(f)),n0). [ur(73,a,23,a,c,100,a)].
% 0.75/1.05 172 -value(in(n1,or1(h2(f))),n1). [ur(59,a,93,a,c,141,a)].
% 0.75/1.05 174 mode(and2(h1(f)),ok). [resolve(138,a,42,a),unit_del(b,29)].
% 0.75/1.05 175 mode(and1(h1(f)),ok) | mode(and1(h1(f)),abnormal). [resolve(139,a,42,a)].
% 0.75/1.05 176 mode(or1(h2(f)),ok) | mode(or1(h2(f)),abnormal). [resolve(163,a,42,a)].
% 0.75/1.05 179 -value(in(n2,and2(h1(f))),n0). [ur(65,a,92,a,c,143,a)].
% 0.75/1.05 181 -value(in(n1,and2(h1(f))),n0). [ur(63,a,92,a,c,170,a)].
% 0.75/1.05 184 mode(and1(h2(f)),ok) | mode(and1(h2(f)),abnormal). [resolve(166,a,42,a)].
% 0.75/1.05 186 -value(out(n1,and2(h1(f))),n0). [resolve(174,a,54,a),unit_del(a,138),unit_del(c,181),unit_del(d,179)].
% 0.75/1.05 194 -value(in(n1,not1(h1(f))),n0). [ur(83,a,92,a,c,186,a)].
% 0.75/1.05 195 -value(out(c,h1(f)),n0). [ur(68,a,92,a,c,186,a)].
% 0.75/1.05 197 -value(in(n2,or1(f)),n0). [ur(89,a,23,a,c,195,a)].
% 0.75/1.05 198 mode(not1(h1(f)),ok) | -mode(or1(f),abnormal). [resolve(169,b,32,b)].
% 0.75/1.05 199 mode(not1(h1(f)),ok) | mode(or1(f),ok). [resolve(198,b,167,b)].
% 0.75/1.05 203 mode(or1(f),ok) | -value(out(n1,not1(h1(f))),n1). [resolve(199,a,52,a),unit_del(b,137),unit_del(d,194)].
% 0.75/1.05 210 mode(and1(h1(f)),ok) | -mode(or1(f),abnormal). [resolve(175,b,31,b)].
% 0.75/1.05 211 mode(and1(h1(f)),ok) | mode(or1(f),ok). [resolve(210,b,167,b)].
% 0.75/1.05 223 mode(or1(f),ok) | -value(out(n1,and1(h1(f))),n1) | value(in(n2,and1(h1(f))),n1). [resolve(211,a,45,a),unit_del(b,139)].
% 0.75/1.05 226 mode(or1(h2(f)),ok) | -mode(or1(f),abnormal). [resolve(176,b,34,b)].
% 0.75/1.05 228 mode(or1(h2(f)),ok) | mode(or1(f),ok). [resolve(226,b,167,b)].
% 0.75/1.05 229 mode(or1(f),ok) | -value(out(n1,or1(h2(f))),n1) | value(in(n2,or1(h2(f))),n1). [resolve(228,a,56,a),unit_del(b,163),unit_del(d,172)].
% 0.75/1.05 240 mode(and1(h2(f)),ok) | -mode(or1(f),abnormal). [resolve(184,b,33,b)].
% 0.75/1.05 241 mode(and1(h2(f)),ok) | mode(or1(f),ok). [resolve(240,b,167,b)].
% 0.75/1.05 250 mode(or1(f),ok) | -value(out(n1,and1(h2(f))),n1) | value(in(n1,and1(h2(f))),n1). [resolve(241,a,44,a),unit_del(b,166)].
% 0.75/1.05 252 value(out(s,h2(f)),n1). [resolve(107,a,27,a)].
% 0.75/1.05 253 value(out(n1,or1(f)),n0). [resolve(109,a,28,a)].
% 0.75/1.05 254 -mode(or1(f),ok). [ur(48,b,94,a,c,253,a,d,197,a)].
% 0.75/1.05 256 -value(out(n1,and1(h2(f))),n1) | value(in(n1,and1(h2(f))),n1). [back_unit_del(250),unit_del(a,254)].
% 0.75/1.05 272 -value(out(n1,or1(h2(f))),n1) | value(in(n2,or1(h2(f))),n1). [back_unit_del(229),unit_del(a,254)].
% 0.75/1.05 276 -value(out(n1,and1(h1(f))),n1) | value(in(n2,and1(h1(f))),n1). [back_unit_del(223),unit_del(a,254)].
% 0.75/1.05 292 -value(out(n1,not1(h1(f))),n1). [back_unit_del(203),unit_del(a,254)].
% 0.75/1.05 306 -value(in(n2,and1(h1(f))),n1). [ur(85,a,92,a,c,292,a)].
% 0.75/1.05 307 -value(out(n1,and1(h1(f))),n1). [back_unit_del(276),unit_del(b,306)].
% 0.75/1.05 310 -value(out(s,h1(f)),n1). [ur(66,a,92,a,c,307,a)].
% 0.75/1.05 311 -value(in(n2,h2(f)),n1). [ur(112,b,310,a)].
% 0.75/1.05 313 -value(in(n2,or1(h2(f))),n1). [ur(61,a,93,a,c,311,a)].
% 0.75/1.05 314 -value(out(n1,or1(h2(f))),n1). [back_unit_del(272),unit_del(b,313)].
% 0.75/1.05 317 -value(in(n1,and1(h2(f))),n1). [ur(81,a,93,a,c,314,a)].
% 0.75/1.05 318 -value(out(n1,and1(h2(f))),n1). [back_unit_del(256),unit_del(b,317)].
% 0.75/1.05 322 $F. [ur(66,b,252,a,c,318,a),unit_del(a,93)].
% 0.75/1.05
% 0.75/1.05 % SZS output end Refutation
% 0.75/1.05 ============================== end of proof ==========================
% 0.75/1.05
% 0.75/1.05 ============================== STATISTICS ============================
% 0.75/1.05
% 0.75/1.05 Given=175. Generated=465. Kept=299. proofs=1.
% 0.75/1.05 Usable=157. Sos=50. Demods=0. Limbo=0, Disabled=183. Hints=0.
% 0.75/1.05 Megabytes=0.39.
% 0.75/1.05 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.75/1.05
% 0.75/1.05 ============================== end of statistics =====================
% 0.75/1.05
% 0.75/1.05 ============================== end of search =========================
% 0.75/1.05
% 0.75/1.05 THEOREM PROVED
% 0.75/1.05 % SZS status Unsatisfiable
% 0.75/1.05
% 0.75/1.05 Exiting with 1 proof.
% 0.75/1.05
% 0.75/1.05 Process 3192 exit (max_proofs) Thu Jun 16 23:08:21 2022
% 0.75/1.05 Prover9 interrupted
%------------------------------------------------------------------------------