TSTP Solution File: HWV005-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV005-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:07 EDT 2022
% Result : Unsatisfiable 0.66s 0.98s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : HWV005-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.10/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Fri Jun 17 08:01:17 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.66/0.96 ============================== Prover9 ===============================
% 0.66/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.96 Process 31559 was started by sandbox on n022.cluster.edu,
% 0.66/0.96 Fri Jun 17 08:01:18 2022
% 0.66/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31406_n022.cluster.edu".
% 0.66/0.96 ============================== end of head ===========================
% 0.66/0.96
% 0.66/0.96 ============================== INPUT =================================
% 0.66/0.96
% 0.66/0.96 % Reading from file /tmp/Prover9_31406_n022.cluster.edu
% 0.66/0.96
% 0.66/0.96 set(prolog_style_variables).
% 0.66/0.96 set(auto2).
% 0.66/0.96 % set(auto2) -> set(auto).
% 0.66/0.96 % set(auto) -> set(auto_inference).
% 0.66/0.96 % set(auto) -> set(auto_setup).
% 0.66/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.96 % set(auto) -> set(auto_limits).
% 0.66/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.96 % set(auto) -> set(auto_denials).
% 0.66/0.96 % set(auto) -> set(auto_process).
% 0.66/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.96 % set(auto2) -> assign(stats, some).
% 0.66/0.96 % set(auto2) -> clear(echo_input).
% 0.66/0.96 % set(auto2) -> set(quiet).
% 0.66/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.96 % set(auto2) -> clear(print_given).
% 0.66/0.96 assign(lrs_ticks,-1).
% 0.66/0.96 assign(sos_limit,10000).
% 0.66/0.96 assign(order,kbo).
% 0.66/0.96 set(lex_order_vars).
% 0.66/0.96 clear(print_given).
% 0.66/0.96
% 0.66/0.96 % formulas(sos). % not echoed (48 formulas)
% 0.66/0.96
% 0.66/0.96 ============================== end of input ==========================
% 0.66/0.96
% 0.66/0.96 % From the command line: assign(max_seconds, 300).
% 0.66/0.96
% 0.66/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.96
% 0.66/0.96 % Formulas that are not ordinary clauses:
% 0.66/0.96
% 0.66/0.96 ============================== end of process non-clausal formulas ===
% 0.66/0.96
% 0.66/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.96
% 0.66/0.96 ============================== PREDICATE ELIMINATION =================
% 0.66/0.96 1 -halfadder(A) | logic_and(and1(A)) # label(halfadder_and1) # label(axiom). [assumption].
% 0.66/0.96 2 halfadder(h) # label(h_isa_halfadder) # label(hypothesis). [assumption].
% 0.66/0.96 Derived: logic_and(and1(h)). [resolve(1,a,2,a)].
% 0.66/0.96 3 -halfadder(A) | logic_and(and2(A)) # label(halfadder_and2) # label(axiom). [assumption].
% 0.66/0.96 Derived: logic_and(and2(h)). [resolve(3,a,2,a)].
% 0.66/0.96 4 -halfadder(A) | logic_not(not1(A)) # label(halfadder_not1) # label(axiom). [assumption].
% 0.66/0.96 Derived: logic_not(not1(h)). [resolve(4,a,2,a)].
% 0.66/0.96 5 -halfadder(A) | logic_or(or1(A)) # label(halfadder_or1) # label(axiom). [assumption].
% 0.66/0.96 Derived: logic_or(or1(h)). [resolve(5,a,2,a)].
% 0.66/0.96 6 -halfadder(A) | connection(in1(A),in1(or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.66/0.96 Derived: connection(in1(h),in1(or1(h))). [resolve(6,a,2,a)].
% 0.66/0.96 7 -halfadder(A) | connection(in2(A),in2(or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.66/0.96 Derived: connection(in2(h),in2(or1(h))). [resolve(7,a,2,a)].
% 0.66/0.96 8 -halfadder(A) | connection(in1(A),in1(and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.66/0.96 Derived: connection(in1(h),in1(and2(h))). [resolve(8,a,2,a)].
% 0.66/0.96 9 -halfadder(A) | connection(in2(A),in2(and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.66/0.96 Derived: connection(in2(h),in2(and2(h))). [resolve(9,a,2,a)].
% 0.66/0.96 10 -halfadder(A) | connection(outs(A),out1(and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.66/0.96 Derived: connection(outs(h),out1(and1(h))). [resolve(10,a,2,a)].
% 0.66/0.96 11 -halfadder(A) | connection(outc(A),out1(and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.66/0.96 Derived: connection(outc(h),out1(and2(h))). [resolve(11,a,2,a)].
% 0.66/0.96 12 -halfadder(A) | connection(out1(or1(A)),in1(and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.66/0.96 Derived: connection(out1(or1(h)),in1(and1(h))). [resolve(12,a,2,a)].
% 0.66/0.96 13 -halfadder(A) | connection(out1(and2(A)),in1(not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.66/0.96 Derived: connection(out1(and2(h)),in1(not1(h))). [resolve(13,a,2,a)].
% 0.66/0.96 14 -halfadder(A) | connection(out1(not1(A)),in2(and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.66/0.96 Derived: connection(out1(not1(h)),in2(and1(h))). [resolve(14,a,2,a)].
% 0.66/0.96 15 -logic_and(A) | and_ok(A) | abnormal(A) # label(and_ok_or_abnormal) # label(axiom). [assumption].
% 0.66/0.96 16 -abnormal(and1(h)) # label(diagnosis_and1) # label(negated_conjecture). [assumption].
% 0.66/0.96 17 -abnormal(not1(h)) # label(diagnosis_not1) # label(negated_conjecture). [assumption].
% 0.66/0.96 18 -abnormal(or1(h)) # label(diagnosis_or1) # label(negated_conjecture). [assumption].
% 0.66/0.96 19 -and_ok(A) | -abnormal(A) # label(not_and_ok_and_abnormal) # label(axiom). [assumption].
% 0.66/0.96 20 -or_ok(A) | -abnormal(A) # label(not_or_ok_and_abnormal) # label(axiom). [assumption].
% 0.66/0.96 21 -not_ok(A) | -abnormal(A) # label(not__not_ok_and_abnormal) # label(axiom). [assumption].
% 0.66/0.96 Derived: -logic_and(and1(h)) | and_ok(and1(h)). [resolve(15,c,16,a)].
% 0.66/0.96 Derived: -logic_and(not1(h)) | and_ok(not1(h)). [resolve(15,c,17,a)].
% 0.66/0.96 Derived: -logic_and(or1(h)) | and_ok(or1(h)). [resolve(15,c,18,a)].
% 0.66/0.96 Derived: -logic_and(A) | and_ok(A) | -or_ok(A). [resolve(15,c,20,b)].
% 0.66/0.96 Derived: -logic_and(A) | and_ok(A) | -not_ok(A). [resolve(15,c,21,b)].
% 0.66/0.96 22 -logic_or(A) | or_ok(A) | abnormal(A) # label(or_ok_or_abnormal) # label(axiom). [assumption].
% 0.66/0.96 Derived: -logic_or(and1(h)) | or_ok(and1(h)). [resolve(22,c,16,a)].
% 0.66/0.96 Derived: -logic_or(not1(h)) | or_ok(not1(h)). [resolve(22,c,17,a)].
% 0.66/0.96 Derived: -logic_or(or1(h)) | or_ok(or1(h)). [resolve(22,c,18,a)].
% 0.66/0.96 Derived: -logic_or(A) | or_ok(A) | -and_ok(A). [resolve(22,c,19,b)].
% 0.66/0.96 Derived: -logic_or(A) | or_ok(A) | -not_ok(A). [resolve(22,c,21,b)].
% 0.66/0.96 23 -logic_not(A) | not_ok(A) | abnormal(A) # label(not_ok_or_abnormal) # label(axiom). [assumption].
% 0.66/0.96 Derived: -logic_not(and1(h)) | not_ok(and1(h)). [resolve(23,c,16,a)].
% 0.66/0.96 Derived: -logic_not(not1(h)) | not_ok(not1(h)). [resolve(23,c,17,a)].
% 0.66/0.96 Derived: -logic_not(or1(h)) | not_ok(or1(h)). [resolve(23,c,18,a)].
% 0.66/0.96 Derived: -logic_not(A) | not_ok(A) | -and_ok(A). [resolve(23,c,19,b)].
% 0.66/0.96 Derived: -logic_not(A) | not_ok(A) | -or_ok(A). [resolve(23,c,20,b)].
% 0.66/0.96 24 connection(in1(h),in1(or1(h))). [resolve(6,a,2,a)].
% 0.66/0.96 25 -connection(A,B) | -zero(A) | zero(B) # label(value_propagation_zero1) # label(axiom). [assumption].
% 0.66/0.96 26 -connection(A,B) | -one(A) | one(B) # label(value_propagation_one1) # label(axiom). [assumption].
% 0.66/0.96 27 -connection(A,B) | -zero(B) | zero(A) # label(value_propagation_zero2) # label(axiom). [assumption].
% 0.66/0.96 28 -connection(A,B) | -one(B) | one(A) # label(value_propagation_one2) # label(axiom). [assumption].
% 0.66/0.96 Derived: -zero(in1(h)) | zero(in1(or1(h))). [resolve(24,a,25,a)].
% 0.66/0.96 Derived: -one(in1(h)) | one(in1(or1(h))). [resolve(24,a,26,a)].
% 0.66/0.96 Derived: -zero(in1(or1(h))) | zero(in1(h)). [resolve(24,a,27,a)].
% 0.66/0.96 Derived: -one(in1(or1(h))) | one(in1(h)). [resolve(24,a,28,a)].
% 0.66/0.96 29 connection(in2(h),in2(or1(h))). [resolve(7,a,2,a)].
% 0.66/0.96 Derived: -zero(in2(h)) | zero(in2(or1(h))). [resolve(29,a,25,a)].
% 0.66/0.96 Derived: -one(in2(h)) | one(in2(or1(h))). [resolve(29,a,26,a)].
% 0.66/0.96 Derived: -zero(in2(or1(h))) | zero(in2(h)). [resolve(29,a,27,a)].
% 0.66/0.96 Derived: -one(in2(or1(h))) | one(in2(h)). [resolve(29,a,28,a)].
% 0.66/0.96 30 connection(in1(h),in1(and2(h))). [resolve(8,a,2,a)].
% 0.66/0.96 Derived: -zero(in1(h)) | zero(in1(and2(h))). [resolve(30,a,25,a)].
% 0.66/0.96 Derived: -one(in1(h)) | one(in1(and2(h))). [resolve(30,a,26,a)].
% 0.66/0.96 Derived: -zero(in1(and2(h))) | zero(in1(h)). [resolve(30,a,27,a)].
% 0.66/0.96 Derived: -one(in1(and2(h))) | one(in1(h)). [resolve(30,a,28,a)].
% 0.66/0.96 31 connection(in2(h),in2(and2(h))). [resolve(9,a,2,a)].
% 0.66/0.96 Derived: -zero(in2(h)) | zero(in2(and2(h))). [resolve(31,a,25,a)].
% 0.66/0.96 Derived: -one(in2(h)) | one(in2(and2(h))). [resolve(31,a,26,a)].
% 0.66/0.97 Derived: -zero(in2(and2(h))) | zero(in2(h)). [resolve(31,a,27,a)].
% 0.66/0.97 Derived: -one(in2(and2(h))) | one(in2(h)). [resolve(31,a,28,a)].
% 0.66/0.97 32 connection(outs(h),out1(and1(h))). [resolve(10,a,2,a)].
% 0.66/0.97 Derived: -zero(outs(h)) | zero(out1(and1(h))). [resolve(32,a,25,a)].
% 0.66/0.97 Derived: -one(outs(h)) | one(out1(and1(h))). [resolve(32,a,26,a)].
% 0.66/0.97 Derived: -zero(out1(and1(h))) | zero(outs(h)). [resolve(32,a,27,a)].
% 0.66/0.97 Derived: -one(out1(and1(h))) | one(outs(h)). [resolve(32,a,28,a)].
% 0.66/0.97 33 connection(outc(h),out1(and2(h))). [resolve(11,a,2,a)].
% 0.66/0.97 Derived: -zero(outc(h)) | zero(out1(and2(h))). [resolve(33,a,25,a)].
% 0.66/0.97 Derived: -one(outc(h)) | one(out1(and2(h))). [resolve(33,a,26,a)].
% 0.66/0.97 Derived: -zero(out1(and2(h))) | zero(outc(h)). [resolve(33,a,27,a)].
% 0.66/0.97 Derived: -one(out1(and2(h))) | one(outc(h)). [resolve(33,a,28,a)].
% 0.66/0.97 34 connection(out1(or1(h)),in1(and1(h))). [resolve(12,a,2,a)].
% 0.66/0.97 Derived: -zero(out1(or1(h))) | zero(in1(and1(h))). [resolve(34,a,25,a)].
% 0.66/0.97 Derived: -one(out1(or1(h))) | one(in1(and1(h))). [resolve(34,a,26,a)].
% 0.66/0.97 Derived: -zero(in1(and1(h))) | zero(out1(or1(h))). [resolve(34,a,27,a)].
% 0.66/0.97 Derived: -one(in1(and1(h))) | one(out1(or1(h))). [resolve(34,a,28,a)].
% 0.66/0.97 35 connection(out1(and2(h)),in1(not1(h))). [resolve(13,a,2,a)].
% 0.66/0.97 Derived: -zero(out1(and2(h))) | zero(in1(not1(h))). [resolve(35,a,25,a)].
% 0.66/0.97 Derived: -one(out1(and2(h))) | one(in1(not1(h))). [resolve(35,a,26,a)].
% 0.66/0.97 Derived: -zero(in1(not1(h))) | zero(out1(and2(h))). [resolve(35,a,27,a)].
% 0.66/0.97 Derived: -one(in1(not1(h))) | one(out1(and2(h))). [resolve(35,a,28,a)].
% 0.66/0.97 36 connection(out1(not1(h)),in2(and1(h))). [resolve(14,a,2,a)].
% 0.66/0.97 Derived: -zero(out1(not1(h))) | zero(in2(and1(h))). [resolve(36,a,25,a)].
% 0.66/0.97 Derived: -one(out1(not1(h))) | one(in2(and1(h))). [resolve(36,a,26,a)].
% 0.66/0.97 Derived: -zero(in2(and1(h))) | zero(out1(not1(h))). [resolve(36,a,27,a)].
% 0.66/0.97 Derived: -one(in2(and1(h))) | one(out1(not1(h))). [resolve(36,a,28,a)].
% 0.66/0.97 37 -logic_and(and1(h)) | and_ok(and1(h)). [resolve(15,c,16,a)].
% 0.66/0.97 38 -and_ok(A) | -zero(in1(A)) | zero(out1(A)) # label(and_0x_0) # label(axiom). [assumption].
% 0.66/0.97 39 -and_ok(A) | -zero(in2(A)) | zero(out1(A)) # label(and_x0_0) # label(axiom). [assumption].
% 0.66/0.97 40 -and_ok(A) | -one(out1(A)) | one(in1(A)) # label(and_1_1x) # label(axiom). [assumption].
% 0.66/0.97 41 -and_ok(A) | -one(out1(A)) | one(in2(A)) # label(and_1_x1) # label(axiom). [assumption].
% 0.66/0.97 42 -and_ok(A) | -one(in1(A)) | -one(in2(A)) | one(out1(A)) # label(and_11_1) # label(axiom). [assumption].
% 0.66/0.97 43 -and_ok(A) | -zero(out1(A)) | zero(in1(A)) | zero(in2(A)) # label(and_0_00) # label(axiom). [assumption].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -zero(in1(and1(h))) | zero(out1(and1(h))). [resolve(37,b,38,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -zero(in2(and1(h))) | zero(out1(and1(h))). [resolve(37,b,39,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -one(out1(and1(h))) | one(in1(and1(h))). [resolve(37,b,40,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -one(out1(and1(h))) | one(in2(and1(h))). [resolve(37,b,41,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -one(in1(and1(h))) | -one(in2(and1(h))) | one(out1(and1(h))). [resolve(37,b,42,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -zero(out1(and1(h))) | zero(in1(and1(h))) | zero(in2(and1(h))). [resolve(37,b,43,a)].
% 0.66/0.97 44 -logic_and(not1(h)) | and_ok(not1(h)). [resolve(15,c,17,a)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -zero(in1(not1(h))) | zero(out1(not1(h))). [resolve(44,b,38,a)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -zero(in2(not1(h))) | zero(out1(not1(h))). [resolve(44,b,39,a)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))). [resolve(44,b,40,a)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -one(out1(not1(h))) | one(in2(not1(h))). [resolve(44,b,41,a)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -one(in1(not1(h))) | -one(in2(not1(h))) | one(out1(not1(h))). [resolve(44,b,42,a)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -zero(out1(not1(h))) | zero(in1(not1(h))) | zero(in2(not1(h))). [resolve(44,b,43,a)].
% 0.66/0.97 45 -logic_and(or1(h)) | and_ok(or1(h)). [resolve(15,c,18,a)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -zero(in1(or1(h))) | zero(out1(or1(h))). [resolve(45,b,38,a)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -zero(in2(or1(h))) | zero(out1(or1(h))). [resolve(45,b,39,a)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -one(out1(or1(h))) | one(in1(or1(h))). [resolve(45,b,40,a)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -one(out1(or1(h))) | one(in2(or1(h))). [resolve(45,b,41,a)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -one(in1(or1(h))) | -one(in2(or1(h))) | one(out1(or1(h))). [resolve(45,b,42,a)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -zero(out1(or1(h))) | zero(in1(or1(h))) | zero(in2(or1(h))). [resolve(45,b,43,a)].
% 0.66/0.97 46 -logic_and(A) | and_ok(A) | -or_ok(A). [resolve(15,c,20,b)].
% 0.66/0.97 Derived: -logic_and(A) | -or_ok(A) | -zero(in1(A)) | zero(out1(A)). [resolve(46,b,38,a)].
% 0.66/0.97 Derived: -logic_and(A) | -or_ok(A) | -zero(in2(A)) | zero(out1(A)). [resolve(46,b,39,a)].
% 0.66/0.97 Derived: -logic_and(A) | -or_ok(A) | -one(out1(A)) | one(in1(A)). [resolve(46,b,40,a)].
% 0.66/0.97 Derived: -logic_and(A) | -or_ok(A) | -one(out1(A)) | one(in2(A)). [resolve(46,b,41,a)].
% 0.66/0.97 Derived: -logic_and(A) | -or_ok(A) | -one(in1(A)) | -one(in2(A)) | one(out1(A)). [resolve(46,b,42,a)].
% 0.66/0.97 Derived: -logic_and(A) | -or_ok(A) | -zero(out1(A)) | zero(in1(A)) | zero(in2(A)). [resolve(46,b,43,a)].
% 0.66/0.97 47 -logic_and(A) | and_ok(A) | -not_ok(A). [resolve(15,c,21,b)].
% 0.66/0.97 Derived: -logic_and(A) | -not_ok(A) | -zero(in1(A)) | zero(out1(A)). [resolve(47,b,38,a)].
% 0.66/0.97 Derived: -logic_and(A) | -not_ok(A) | -zero(in2(A)) | zero(out1(A)). [resolve(47,b,39,a)].
% 0.66/0.97 Derived: -logic_and(A) | -not_ok(A) | -one(out1(A)) | one(in1(A)). [resolve(47,b,40,a)].
% 0.66/0.97 Derived: -logic_and(A) | -not_ok(A) | -one(out1(A)) | one(in2(A)). [resolve(47,b,41,a)].
% 0.66/0.97 Derived: -logic_and(A) | -not_ok(A) | -one(in1(A)) | -one(in2(A)) | one(out1(A)). [resolve(47,b,42,a)].
% 0.66/0.97 Derived: -logic_and(A) | -not_ok(A) | -zero(out1(A)) | zero(in1(A)) | zero(in2(A)). [resolve(47,b,43,a)].
% 0.66/0.97 48 -logic_or(A) | or_ok(A) | -and_ok(A). [resolve(22,c,19,b)].
% 0.66/0.97 Derived: -logic_or(and1(h)) | or_ok(and1(h)) | -logic_and(and1(h)). [resolve(48,c,37,b)].
% 0.66/0.97 Derived: -logic_or(not1(h)) | or_ok(not1(h)) | -logic_and(not1(h)). [resolve(48,c,44,b)].
% 0.66/0.97 Derived: -logic_or(or1(h)) | or_ok(or1(h)) | -logic_and(or1(h)). [resolve(48,c,45,b)].
% 0.66/0.97 49 -logic_not(A) | not_ok(A) | -and_ok(A). [resolve(23,c,19,b)].
% 0.66/0.97 Derived: -logic_not(and1(h)) | not_ok(and1(h)) | -logic_and(and1(h)). [resolve(49,c,37,b)].
% 0.66/0.97 Derived: -logic_not(not1(h)) | not_ok(not1(h)) | -logic_and(not1(h)). [resolve(49,c,44,b)].
% 0.66/0.97 Derived: -logic_not(or1(h)) | not_ok(or1(h)) | -logic_and(or1(h)). [resolve(49,c,45,b)].
% 0.66/0.97 50 -logic_or(and1(h)) | or_ok(and1(h)). [resolve(22,c,16,a)].
% 0.66/0.97 51 -or_ok(A) | -one(in1(A)) | one(out1(A)) # label(or_1x_1) # label(axiom). [assumption].
% 0.66/0.97 52 -or_ok(A) | -one(in2(A)) | one(out1(A)) # label(or_x1_1) # label(axiom). [assumption].
% 0.66/0.97 53 -or_ok(A) | -zero(out1(A)) | zero(in1(A)) # label(or_0_0x) # label(axiom). [assumption].
% 0.66/0.97 54 -or_ok(A) | -zero(out1(A)) | zero(in2(A)) # label(or_0_01) # label(axiom). [assumption].
% 0.66/0.97 55 -or_ok(A) | -zero(in1(A)) | -zero(in2(A)) | zero(out1(A)) # label(or_00_0) # label(axiom). [assumption].
% 0.66/0.97 56 -or_ok(A) | -one(out1(A)) | one(in1(A)) | one(in2(A)) # label(or_1_11) # label(axiom). [assumption].
% 0.66/0.97 Derived: -logic_or(and1(h)) | -one(in1(and1(h))) | one(out1(and1(h))). [resolve(50,b,51,a)].
% 0.66/0.97 Derived: -logic_or(and1(h)) | -one(in2(and1(h))) | one(out1(and1(h))). [resolve(50,b,52,a)].
% 0.66/0.97 Derived: -logic_or(and1(h)) | -zero(out1(and1(h))) | zero(in1(and1(h))). [resolve(50,b,53,a)].
% 0.66/0.97 Derived: -logic_or(and1(h)) | -zero(out1(and1(h))) | zero(in2(and1(h))). [resolve(50,b,54,a)].
% 0.66/0.97 Derived: -logic_or(and1(h)) | -zero(in1(and1(h))) | -zero(in2(and1(h))) | zero(out1(and1(h))). [resolve(50,b,55,a)].
% 0.66/0.97 Derived: -logic_or(and1(h)) | -one(out1(and1(h))) | one(in1(and1(h))) | one(in2(and1(h))). [resolve(50,b,56,a)].
% 0.66/0.97 57 -logic_or(not1(h)) | or_ok(not1(h)). [resolve(22,c,17,a)].
% 0.66/0.97 Derived: -logic_or(not1(h)) | -one(in1(not1(h))) | one(out1(not1(h))). [resolve(57,b,51,a)].
% 0.66/0.97 Derived: -logic_or(not1(h)) | -one(in2(not1(h))) | one(out1(not1(h))). [resolve(57,b,52,a)].
% 0.66/0.97 Derived: -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in1(not1(h))). [resolve(57,b,53,a)].
% 0.66/0.97 Derived: -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in2(not1(h))). [resolve(57,b,54,a)].
% 0.66/0.97 Derived: -logic_or(not1(h)) | -zero(in1(not1(h))) | -zero(in2(not1(h))) | zero(out1(not1(h))). [resolve(57,b,55,a)].
% 0.66/0.97 Derived: -logic_or(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))) | one(in2(not1(h))). [resolve(57,b,56,a)].
% 0.66/0.97 58 -logic_or(or1(h)) | or_ok(or1(h)). [resolve(22,c,18,a)].
% 0.66/0.97 Derived: -logic_or(or1(h)) | -one(in1(or1(h))) | one(out1(or1(h))). [resolve(58,b,51,a)].
% 0.66/0.97 Derived: -logic_or(or1(h)) | -one(in2(or1(h))) | one(out1(or1(h))). [resolve(58,b,52,a)].
% 0.66/0.97 Derived: -logic_or(or1(h)) | -zero(out1(or1(h))) | zero(in1(or1(h))). [resolve(58,b,53,a)].
% 0.66/0.97 Derived: -logic_or(or1(h)) | -zero(out1(or1(h))) | zero(in2(or1(h))). [resolve(58,b,54,a)].
% 0.66/0.97 Derived: -logic_or(or1(h)) | -zero(in1(or1(h))) | -zero(in2(or1(h))) | zero(out1(or1(h))). [resolve(58,b,55,a)].
% 0.66/0.97 Derived: -logic_or(or1(h)) | -one(out1(or1(h))) | one(in1(or1(h))) | one(in2(or1(h))). [resolve(58,b,56,a)].
% 0.66/0.97 59 -logic_or(A) | or_ok(A) | -not_ok(A). [resolve(22,c,21,b)].
% 0.66/0.97 Derived: -logic_or(A) | -not_ok(A) | -one(in1(A)) | one(out1(A)). [resolve(59,b,51,a)].
% 0.66/0.97 Derived: -logic_or(A) | -not_ok(A) | -one(in2(A)) | one(out1(A)). [resolve(59,b,52,a)].
% 0.66/0.97 Derived: -logic_or(A) | -not_ok(A) | -zero(out1(A)) | zero(in1(A)). [resolve(59,b,53,a)].
% 0.66/0.97 Derived: -logic_or(A) | -not_ok(A) | -zero(out1(A)) | zero(in2(A)). [resolve(59,b,54,a)].
% 0.66/0.97 Derived: -logic_or(A) | -not_ok(A) | -zero(in1(A)) | -zero(in2(A)) | zero(out1(A)). [resolve(59,b,55,a)].
% 0.66/0.97 Derived: -logic_or(A) | -not_ok(A) | -one(out1(A)) | one(in1(A)) | one(in2(A)). [resolve(59,b,56,a)].
% 0.66/0.97 60 -logic_not(A) | not_ok(A) | -or_ok(A). [resolve(23,c,20,b)].
% 0.66/0.97 Derived: -logic_not(and1(h)) | not_ok(and1(h)) | -logic_or(and1(h)). [resolve(60,c,50,b)].
% 0.66/0.97 Derived: -logic_not(not1(h)) | not_ok(not1(h)) | -logic_or(not1(h)). [resolve(60,c,57,b)].
% 0.66/0.97 Derived: -logic_not(or1(h)) | not_ok(or1(h)) | -logic_or(or1(h)). [resolve(60,c,58,b)].
% 0.66/0.97 61 -logic_and(A) | -or_ok(A) | -zero(in1(A)) | zero(out1(A)). [resolve(46,b,38,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -zero(in1(and1(h))) | zero(out1(and1(h))) | -logic_or(and1(h)). [resolve(61,b,50,b)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -zero(in1(not1(h))) | zero(out1(not1(h))) | -logic_or(not1(h)). [resolve(61,b,57,b)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -zero(in1(or1(h))) | zero(out1(or1(h))) | -logic_or(or1(h)). [resolve(61,b,58,b)].
% 0.66/0.97 62 -logic_and(A) | -or_ok(A) | -zero(in2(A)) | zero(out1(A)). [resolve(46,b,39,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -zero(in2(and1(h))) | zero(out1(and1(h))) | -logic_or(and1(h)). [resolve(62,b,50,b)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -zero(in2(not1(h))) | zero(out1(not1(h))) | -logic_or(not1(h)). [resolve(62,b,57,b)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -zero(in2(or1(h))) | zero(out1(or1(h))) | -logic_or(or1(h)). [resolve(62,b,58,b)].
% 0.66/0.97 63 -logic_and(A) | -or_ok(A) | -one(out1(A)) | one(in1(A)). [resolve(46,b,40,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -one(out1(and1(h))) | one(in1(and1(h))) | -logic_or(and1(h)). [resolve(63,b,50,b)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))) | -logic_or(not1(h)). [resolve(63,b,57,b)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -one(out1(or1(h))) | one(in1(or1(h))) | -logic_or(or1(h)). [resolve(63,b,58,b)].
% 0.66/0.97 64 -logic_and(A) | -or_ok(A) | -one(out1(A)) | one(in2(A)). [resolve(46,b,41,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -one(out1(and1(h))) | one(in2(and1(h))) | -logic_or(and1(h)). [resolve(64,b,50,b)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -one(out1(not1(h))) | one(in2(not1(h))) | -logic_or(not1(h)). [resolve(64,b,57,b)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -one(out1(or1(h))) | one(in2(or1(h))) | -logic_or(or1(h)). [resolve(64,b,58,b)].
% 0.66/0.97 65 -logic_and(A) | -or_ok(A) | -one(in1(A)) | -one(in2(A)) | one(out1(A)). [resolve(46,b,42,a)].
% 0.66/0.97 66 -logic_and(A) | -or_ok(A) | -zero(out1(A)) | zero(in1(A)) | zero(in2(A)). [resolve(46,b,43,a)].
% 0.66/0.97 67 -logic_or(and1(h)) | or_ok(and1(h)) | -logic_and(and1(h)). [resolve(48,c,37,b)].
% 0.66/0.97 68 -logic_or(not1(h)) | or_ok(not1(h)) | -logic_and(not1(h)). [resolve(48,c,44,b)].
% 0.66/0.97 69 -logic_or(or1(h)) | or_ok(or1(h)) | -logic_and(or1(h)). [resolve(48,c,45,b)].
% 0.66/0.97 70 -logic_not(and1(h)) | not_ok(and1(h)). [resolve(23,c,16,a)].
% 0.66/0.97 71 -not_ok(A) | -zero(in1(A)) | one(out1(A)) # label(not_0_1_fw) # label(axiom). [assumption].
% 0.66/0.97 72 -not_ok(A) | -one(in1(A)) | zero(out1(A)) # label(not_1_0_fw) # label(axiom). [assumption].
% 0.66/0.97 73 -not_ok(A) | -zero(out1(A)) | one(in1(A)) # label(not_0_1_bw) # label(axiom). [assumption].
% 0.66/0.97 74 -not_ok(A) | -one(out1(A)) | zero(in1(A)) # label(not_1_0_bw) # label(axiom). [assumption].
% 0.66/0.97 Derived: -logic_not(and1(h)) | -zero(in1(and1(h))) | one(out1(and1(h))). [resolve(70,b,71,a)].
% 0.66/0.97 Derived: -logic_not(and1(h)) | -one(in1(and1(h))) | zero(out1(and1(h))). [resolve(70,b,72,a)].
% 0.66/0.97 Derived: -logic_not(and1(h)) | -zero(out1(and1(h))) | one(in1(and1(h))). [resolve(70,b,73,a)].
% 0.66/0.97 Derived: -logic_not(and1(h)) | -one(out1(and1(h))) | zero(in1(and1(h))). [resolve(70,b,74,a)].
% 0.66/0.97 75 -logic_not(not1(h)) | not_ok(not1(h)). [resolve(23,c,17,a)].
% 0.66/0.97 Derived: -logic_not(not1(h)) | -zero(in1(not1(h))) | one(out1(not1(h))). [resolve(75,b,71,a)].
% 0.66/0.97 Derived: -logic_not(not1(h)) | -one(in1(not1(h))) | zero(out1(not1(h))). [resolve(75,b,72,a)].
% 0.66/0.97 Derived: -logic_not(not1(h)) | -zero(out1(not1(h))) | one(in1(not1(h))). [resolve(75,b,73,a)].
% 0.66/0.97 Derived: -logic_not(not1(h)) | -one(out1(not1(h))) | zero(in1(not1(h))). [resolve(75,b,74,a)].
% 0.66/0.97 76 -logic_not(or1(h)) | not_ok(or1(h)). [resolve(23,c,18,a)].
% 0.66/0.97 Derived: -logic_not(or1(h)) | -zero(in1(or1(h))) | one(out1(or1(h))). [resolve(76,b,71,a)].
% 0.66/0.97 Derived: -logic_not(or1(h)) | -one(in1(or1(h))) | zero(out1(or1(h))). [resolve(76,b,72,a)].
% 0.66/0.97 Derived: -logic_not(or1(h)) | -zero(out1(or1(h))) | one(in1(or1(h))). [resolve(76,b,73,a)].
% 0.66/0.97 Derived: -logic_not(or1(h)) | -one(out1(or1(h))) | zero(in1(or1(h))). [resolve(76,b,74,a)].
% 0.66/0.97 77 -logic_and(A) | -not_ok(A) | -zero(in1(A)) | zero(out1(A)). [resolve(47,b,38,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -zero(in1(and1(h))) | zero(out1(and1(h))) | -logic_not(and1(h)). [resolve(77,b,70,b)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -zero(in1(not1(h))) | zero(out1(not1(h))) | -logic_not(not1(h)). [resolve(77,b,75,b)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -zero(in1(or1(h))) | zero(out1(or1(h))) | -logic_not(or1(h)). [resolve(77,b,76,b)].
% 0.66/0.97 78 -logic_and(A) | -not_ok(A) | -zero(in2(A)) | zero(out1(A)). [resolve(47,b,39,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -zero(in2(and1(h))) | zero(out1(and1(h))) | -logic_not(and1(h)). [resolve(78,b,70,b)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -zero(in2(not1(h))) | zero(out1(not1(h))) | -logic_not(not1(h)). [resolve(78,b,75,b)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -zero(in2(or1(h))) | zero(out1(or1(h))) | -logic_not(or1(h)). [resolve(78,b,76,b)].
% 0.66/0.97 79 -logic_and(A) | -not_ok(A) | -one(out1(A)) | one(in1(A)). [resolve(47,b,40,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -one(out1(and1(h))) | one(in1(and1(h))) | -logic_not(and1(h)). [resolve(79,b,70,b)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))) | -logic_not(not1(h)). [resolve(79,b,75,b)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -one(out1(or1(h))) | one(in1(or1(h))) | -logic_not(or1(h)). [resolve(79,b,76,b)].
% 0.66/0.97 80 -logic_and(A) | -not_ok(A) | -one(out1(A)) | one(in2(A)). [resolve(47,b,41,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -one(out1(and1(h))) | one(in2(and1(h))) | -logic_not(and1(h)). [resolve(80,b,70,b)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -one(out1(not1(h))) | one(in2(not1(h))) | -logic_not(not1(h)). [resolve(80,b,75,b)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -one(out1(or1(h))) | one(in2(or1(h))) | -logic_not(or1(h)). [resolve(80,b,76,b)].
% 0.66/0.97 81 -logic_and(A) | -not_ok(A) | -one(in1(A)) | -one(in2(A)) | one(out1(A)). [resolve(47,b,42,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -one(in1(and1(h))) | -one(in2(and1(h))) | one(out1(and1(h))) | -logic_not(and1(h)). [resolve(81,b,70,b)].
% 0.66/0.97 Derived: -logic_and(not1(h)) | -one(in1(not1(h))) | -one(in2(not1(h))) | one(out1(not1(h))) | -logic_not(not1(h)). [resolve(81,b,75,b)].
% 0.66/0.97 Derived: -logic_and(or1(h)) | -one(in1(or1(h))) | -one(in2(or1(h))) | one(out1(or1(h))) | -logic_not(or1(h)). [resolve(81,b,76,b)].
% 0.66/0.97 82 -logic_and(A) | -not_ok(A) | -zero(out1(A)) | zero(in1(A)) | zero(in2(A)). [resolve(47,b,43,a)].
% 0.66/0.97 Derived: -logic_and(and1(h)) | -zero(out1(and1(h))) | zero(in1(and1(h))) | zero(in2(and1(h))) | -logic_not(and1(h)). [resolve(82,b,70,b)].
% 0.66/0.98 Derived: -logic_and(not1(h)) | -zero(out1(not1(h))) | zero(in1(not1(h))) | zero(in2(not1(h))) | -logic_not(not1(h)). [resolve(82,b,75,b)].
% 0.66/0.98 Derived: -logic_and(or1(h)) | -zero(out1(or1(h))) | zero(in1(or1(h))) | zero(in2(or1(h))) | -logic_not(or1(h)). [resolve(82,b,76,b)].
% 0.66/0.98 83 -logic_not(and1(h)) | not_ok(and1(h)) | -logic_and(and1(h)). [resolve(49,c,37,b)].
% 0.66/0.98 84 -logic_not(not1(h)) | not_ok(not1(h)) | -logic_and(not1(h)). [resolve(49,c,44,b)].
% 0.66/0.98 85 -logic_not(or1(h)) | not_ok(or1(h)) | -logic_and(or1(h)). [resolve(49,c,45,b)].
% 0.66/0.98 86 -logic_or(A) | -not_ok(A) | -one(in1(A)) | one(out1(A)). [resolve(59,b,51,a)].
% 0.66/0.98 Derived: -logic_or(and1(h)) | -one(in1(and1(h))) | one(out1(and1(h))) | -logic_not(and1(h)). [resolve(86,b,70,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -one(in1(not1(h))) | one(out1(not1(h))) | -logic_not(not1(h)). [resolve(86,b,75,b)].
% 0.66/0.98 Derived: -logic_or(or1(h)) | -one(in1(or1(h))) | one(out1(or1(h))) | -logic_not(or1(h)). [resolve(86,b,76,b)].
% 0.66/0.98 87 -logic_or(A) | -not_ok(A) | -one(in2(A)) | one(out1(A)). [resolve(59,b,52,a)].
% 0.66/0.98 Derived: -logic_or(and1(h)) | -one(in2(and1(h))) | one(out1(and1(h))) | -logic_not(and1(h)). [resolve(87,b,70,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -one(in2(not1(h))) | one(out1(not1(h))) | -logic_not(not1(h)). [resolve(87,b,75,b)].
% 0.66/0.98 Derived: -logic_or(or1(h)) | -one(in2(or1(h))) | one(out1(or1(h))) | -logic_not(or1(h)). [resolve(87,b,76,b)].
% 0.66/0.98 88 -logic_or(A) | -not_ok(A) | -zero(out1(A)) | zero(in1(A)). [resolve(59,b,53,a)].
% 0.66/0.98 Derived: -logic_or(and1(h)) | -zero(out1(and1(h))) | zero(in1(and1(h))) | -logic_not(and1(h)). [resolve(88,b,70,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in1(not1(h))) | -logic_not(not1(h)). [resolve(88,b,75,b)].
% 0.66/0.98 Derived: -logic_or(or1(h)) | -zero(out1(or1(h))) | zero(in1(or1(h))) | -logic_not(or1(h)). [resolve(88,b,76,b)].
% 0.66/0.98 89 -logic_or(A) | -not_ok(A) | -zero(out1(A)) | zero(in2(A)). [resolve(59,b,54,a)].
% 0.66/0.98 Derived: -logic_or(and1(h)) | -zero(out1(and1(h))) | zero(in2(and1(h))) | -logic_not(and1(h)). [resolve(89,b,70,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in2(not1(h))) | -logic_not(not1(h)). [resolve(89,b,75,b)].
% 0.66/0.98 Derived: -logic_or(or1(h)) | -zero(out1(or1(h))) | zero(in2(or1(h))) | -logic_not(or1(h)). [resolve(89,b,76,b)].
% 0.66/0.98 90 -logic_or(A) | -not_ok(A) | -zero(in1(A)) | -zero(in2(A)) | zero(out1(A)). [resolve(59,b,55,a)].
% 0.66/0.98 Derived: -logic_or(and1(h)) | -zero(in1(and1(h))) | -zero(in2(and1(h))) | zero(out1(and1(h))) | -logic_not(and1(h)). [resolve(90,b,70,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -zero(in1(not1(h))) | -zero(in2(not1(h))) | zero(out1(not1(h))) | -logic_not(not1(h)). [resolve(90,b,75,b)].
% 0.66/0.98 Derived: -logic_or(or1(h)) | -zero(in1(or1(h))) | -zero(in2(or1(h))) | zero(out1(or1(h))) | -logic_not(or1(h)). [resolve(90,b,76,b)].
% 0.66/0.98 91 -logic_or(A) | -not_ok(A) | -one(out1(A)) | one(in1(A)) | one(in2(A)). [resolve(59,b,56,a)].
% 0.66/0.98 Derived: -logic_or(and1(h)) | -one(out1(and1(h))) | one(in1(and1(h))) | one(in2(and1(h))) | -logic_not(and1(h)). [resolve(91,b,70,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))) | one(in2(not1(h))) | -logic_not(not1(h)). [resolve(91,b,75,b)].
% 0.66/0.98 Derived: -logic_or(or1(h)) | -one(out1(or1(h))) | one(in1(or1(h))) | one(in2(or1(h))) | -logic_not(or1(h)). [resolve(91,b,76,b)].
% 0.66/0.98 92 -logic_not(and1(h)) | not_ok(and1(h)) | -logic_or(and1(h)). [resolve(60,c,50,b)].
% 0.66/0.98 93 -logic_not(not1(h)) | not_ok(not1(h)) | -logic_or(not1(h)). [resolve(60,c,57,b)].
% 0.66/0.98 94 -logic_not(or1(h)) | not_ok(or1(h)) | -logic_or(or1(h)). [resolve(60,c,58,b)].
% 0.66/0.98 95 -logic_and(and1(h)) | -zero(in1(and1(h))) | zero(out1(and1(h))). [resolve(37,b,38,a)].
% 0.66/0.98 96 logic_and(and1(h)). [resolve(1,a,2,a)].
% 0.66/0.98 97 logic_and(and2(h)). [resolve(3,a,2,a)].
% 0.66/0.98 Derived: -zero(in1(and1(h))) | zero(out1(and1(h))). [resolve(95,a,96,a)].
% 0.66/0.98 98 -logic_and(and1(h)) | -zero(in2(and1(h))) | zero(out1(and1(h))). [resolve(37,b,39,a)].
% 0.66/0.98 Derived: -zero(in2(and1(h))) | zero(out1(and1(h))). [resolve(98,a,96,a)].
% 0.66/0.98 99 -logic_and(and1(h)) | -one(out1(and1(h))) | one(in1(and1(h))). [resolve(37,b,40,a)].
% 0.66/0.98 Derived: -one(out1(and1(h))) | one(in1(and1(h))). [resolve(99,a,96,a)].
% 0.66/0.98 100 -logic_and(and1(h)) | -one(out1(and1(h))) | one(in2(and1(h))). [resolve(37,b,41,a)].
% 0.66/0.98 Derived: -one(out1(and1(h))) | one(in2(and1(h))). [resolve(100,a,96,a)].
% 0.66/0.98 101 -logic_and(and1(h)) | -one(in1(and1(h))) | -one(in2(and1(h))) | one(out1(and1(h))). [resolve(37,b,42,a)].
% 0.66/0.98 Derived: -one(in1(and1(h))) | -one(in2(and1(h))) | one(out1(and1(h))). [resolve(101,a,96,a)].
% 0.66/0.98 102 -logic_and(and1(h)) | -zero(out1(and1(h))) | zero(in1(and1(h))) | zero(in2(and1(h))). [resolve(37,b,43,a)].
% 0.66/0.98 Derived: -zero(out1(and1(h))) | zero(in1(and1(h))) | zero(in2(and1(h))). [resolve(102,a,96,a)].
% 0.66/0.98 103 -logic_and(not1(h)) | -zero(in1(not1(h))) | zero(out1(not1(h))). [resolve(44,b,38,a)].
% 0.66/0.98 104 -logic_and(not1(h)) | -zero(in2(not1(h))) | zero(out1(not1(h))). [resolve(44,b,39,a)].
% 0.66/0.98 105 -logic_and(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))). [resolve(44,b,40,a)].
% 0.66/0.98 106 -logic_and(not1(h)) | -one(out1(not1(h))) | one(in2(not1(h))). [resolve(44,b,41,a)].
% 0.66/0.98 107 -logic_and(not1(h)) | -one(in1(not1(h))) | -one(in2(not1(h))) | one(out1(not1(h))). [resolve(44,b,42,a)].
% 0.66/0.98 108 -logic_and(not1(h)) | -zero(out1(not1(h))) | zero(in1(not1(h))) | zero(in2(not1(h))). [resolve(44,b,43,a)].
% 0.66/0.98 109 -logic_and(or1(h)) | -zero(in1(or1(h))) | zero(out1(or1(h))). [resolve(45,b,38,a)].
% 0.66/0.98 110 -logic_and(or1(h)) | -zero(in2(or1(h))) | zero(out1(or1(h))). [resolve(45,b,39,a)].
% 0.66/0.98 111 -logic_and(or1(h)) | -one(out1(or1(h))) | one(in1(or1(h))). [resolve(45,b,40,a)].
% 0.66/0.98 112 -logic_and(or1(h)) | -one(out1(or1(h))) | one(in2(or1(h))). [resolve(45,b,41,a)].
% 0.66/0.98 113 -logic_and(or1(h)) | -one(in1(or1(h))) | -one(in2(or1(h))) | one(out1(or1(h))). [resolve(45,b,42,a)].
% 0.66/0.98 114 -logic_and(or1(h)) | -zero(out1(or1(h))) | zero(in1(or1(h))) | zero(in2(or1(h))). [resolve(45,b,43,a)].
% 0.66/0.98 115 -logic_and(and1(h)) | -zero(in1(and1(h))) | zero(out1(and1(h))) | -logic_or(and1(h)). [resolve(61,b,50,b)].
% 0.66/0.98 116 -logic_and(not1(h)) | -zero(in1(not1(h))) | zero(out1(not1(h))) | -logic_or(not1(h)). [resolve(61,b,57,b)].
% 0.66/0.98 117 -logic_and(or1(h)) | -zero(in1(or1(h))) | zero(out1(or1(h))) | -logic_or(or1(h)). [resolve(61,b,58,b)].
% 0.66/0.98 118 -logic_and(and1(h)) | -zero(in2(and1(h))) | zero(out1(and1(h))) | -logic_or(and1(h)). [resolve(62,b,50,b)].
% 0.66/0.98 119 -logic_and(not1(h)) | -zero(in2(not1(h))) | zero(out1(not1(h))) | -logic_or(not1(h)). [resolve(62,b,57,b)].
% 0.66/0.98 120 -logic_and(or1(h)) | -zero(in2(or1(h))) | zero(out1(or1(h))) | -logic_or(or1(h)). [resolve(62,b,58,b)].
% 0.66/0.98 121 -logic_and(and1(h)) | -one(out1(and1(h))) | one(in1(and1(h))) | -logic_or(and1(h)). [resolve(63,b,50,b)].
% 0.66/0.98 122 -logic_and(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))) | -logic_or(not1(h)). [resolve(63,b,57,b)].
% 0.66/0.98 123 -logic_and(or1(h)) | -one(out1(or1(h))) | one(in1(or1(h))) | -logic_or(or1(h)). [resolve(63,b,58,b)].
% 0.66/0.98 124 -logic_and(and1(h)) | -one(out1(and1(h))) | one(in2(and1(h))) | -logic_or(and1(h)). [resolve(64,b,50,b)].
% 0.66/0.98 125 -logic_and(not1(h)) | -one(out1(not1(h))) | one(in2(not1(h))) | -logic_or(not1(h)). [resolve(64,b,57,b)].
% 0.66/0.98 126 -logic_and(or1(h)) | -one(out1(or1(h))) | one(in2(or1(h))) | -logic_or(or1(h)). [resolve(64,b,58,b)].
% 0.66/0.98 127 -logic_and(and1(h)) | -zero(in1(and1(h))) | zero(out1(and1(h))) | -logic_not(and1(h)). [resolve(77,b,70,b)].
% 0.66/0.98 128 -logic_and(not1(h)) | -zero(in1(not1(h))) | zero(out1(not1(h))) | -logic_not(not1(h)). [resolve(77,b,75,b)].
% 0.66/0.98 129 -logic_and(or1(h)) | -zero(in1(or1(h))) | zero(out1(or1(h))) | -logic_not(or1(h)). [resolve(77,b,76,b)].
% 0.66/0.98 130 -logic_and(and1(h)) | -zero(in2(and1(h))) | zero(out1(and1(h))) | -logic_not(and1(h)). [resolve(78,b,70,b)].
% 0.66/0.98 131 -logic_and(not1(h)) | -zero(in2(not1(h))) | zero(out1(not1(h))) | -logic_not(not1(h)). [resolve(78,b,75,b)].
% 0.66/0.98 132 -logic_and(or1(h)) | -zero(in2(or1(h))) | zero(out1(or1(h))) | -logic_not(or1(h)). [resolve(78,b,76,b)].
% 0.66/0.98 133 -logic_and(and1(h)) | -one(out1(and1(h))) | one(in1(and1(h))) | -logic_not(and1(h)). [resolve(79,b,70,b)].
% 0.66/0.98 134 -logic_and(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))) | -logic_not(not1(h)). [resolve(79,b,75,b)].
% 0.66/0.98 135 -logic_and(or1(h)) | -one(out1(or1(h))) | one(in1(or1(h))) | -logic_not(or1(h)). [resolve(79,b,76,b)].
% 0.66/0.98 136 -logic_and(and1(h)) | -one(out1(and1(h))) | one(in2(and1(h))) | -logic_not(and1(h)). [resolve(80,b,70,b)].
% 0.66/0.98 137 -logic_and(not1(h)) | -one(out1(not1(h))) | one(in2(not1(h))) | -logic_not(not1(h)). [resolve(80,b,75,b)].
% 0.66/0.98 138 -logic_and(or1(h)) | -one(out1(or1(h))) | one(in2(or1(h))) | -logic_not(or1(h)). [resolve(80,b,76,b)].
% 0.66/0.98 139 -logic_and(and1(h)) | -one(in1(and1(h))) | -one(in2(and1(h))) | one(out1(and1(h))) | -logic_not(and1(h)). [resolve(81,b,70,b)].
% 0.66/0.98 140 -logic_and(not1(h)) | -one(in1(not1(h))) | -one(in2(not1(h))) | one(out1(not1(h))) | -logic_not(not1(h)). [resolve(81,b,75,b)].
% 0.66/0.98 141 -logic_and(or1(h)) | -one(in1(or1(h))) | -one(in2(or1(h))) | one(out1(or1(h))) | -logic_not(or1(h)). [resolve(81,b,76,b)].
% 0.66/0.98 142 -logic_and(and1(h)) | -zero(out1(and1(h))) | zero(in1(and1(h))) | zero(in2(and1(h))) | -logic_not(and1(h)). [resolve(82,b,70,b)].
% 0.66/0.98 143 -logic_and(not1(h)) | -zero(out1(not1(h))) | zero(in1(not1(h))) | zero(in2(not1(h))) | -logic_not(not1(h)). [resolve(82,b,75,b)].
% 0.66/0.98 144 -logic_and(or1(h)) | -zero(out1(or1(h))) | zero(in1(or1(h))) | zero(in2(or1(h))) | -logic_not(or1(h)). [resolve(82,b,76,b)].
% 0.66/0.98 145 -logic_not(and1(h)) | -zero(in1(and1(h))) | one(out1(and1(h))). [resolve(70,b,71,a)].
% 0.66/0.98 146 logic_not(not1(h)). [resolve(4,a,2,a)].
% 0.66/0.98 147 -logic_not(and1(h)) | -one(in1(and1(h))) | zero(out1(and1(h))). [resolve(70,b,72,a)].
% 0.66/0.98 148 -logic_not(and1(h)) | -zero(out1(and1(h))) | one(in1(and1(h))). [resolve(70,b,73,a)].
% 0.66/0.98 149 -logic_not(and1(h)) | -one(out1(and1(h))) | zero(in1(and1(h))). [resolve(70,b,74,a)].
% 0.66/0.98 150 -logic_not(not1(h)) | -zero(in1(not1(h))) | one(out1(not1(h))). [resolve(75,b,71,a)].
% 0.66/0.98 Derived: -zero(in1(not1(h))) | one(out1(not1(h))). [resolve(150,a,146,a)].
% 0.66/0.98 151 -logic_not(not1(h)) | -one(in1(not1(h))) | zero(out1(not1(h))). [resolve(75,b,72,a)].
% 0.66/0.98 Derived: -one(in1(not1(h))) | zero(out1(not1(h))). [resolve(151,a,146,a)].
% 0.66/0.98 152 -logic_not(not1(h)) | -zero(out1(not1(h))) | one(in1(not1(h))). [resolve(75,b,73,a)].
% 0.66/0.98 Derived: -zero(out1(not1(h))) | one(in1(not1(h))). [resolve(152,a,146,a)].
% 0.66/0.98 153 -logic_not(not1(h)) | -one(out1(not1(h))) | zero(in1(not1(h))). [resolve(75,b,74,a)].
% 0.66/0.98 Derived: -one(out1(not1(h))) | zero(in1(not1(h))). [resolve(153,a,146,a)].
% 0.66/0.98 154 -logic_not(or1(h)) | -zero(in1(or1(h))) | one(out1(or1(h))). [resolve(76,b,71,a)].
% 0.66/0.98 155 -logic_not(or1(h)) | -one(in1(or1(h))) | zero(out1(or1(h))). [resolve(76,b,72,a)].
% 0.66/0.98 156 -logic_not(or1(h)) | -zero(out1(or1(h))) | one(in1(or1(h))). [resolve(76,b,73,a)].
% 0.66/0.98 157 -logic_not(or1(h)) | -one(out1(or1(h))) | zero(in1(or1(h))). [resolve(76,b,74,a)].
% 0.66/0.98 158 -logic_or(and1(h)) | -one(in1(and1(h))) | one(out1(and1(h))) | -logic_not(and1(h)). [resolve(86,b,70,b)].
% 0.66/0.98 159 -logic_or(not1(h)) | -one(in1(not1(h))) | one(out1(not1(h))) | -logic_not(not1(h)). [resolve(86,b,75,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -one(in1(not1(h))) | one(out1(not1(h))). [resolve(159,d,146,a)].
% 0.66/0.98 160 -logic_or(or1(h)) | -one(in1(or1(h))) | one(out1(or1(h))) | -logic_not(or1(h)). [resolve(86,b,76,b)].
% 0.66/0.98 161 -logic_or(and1(h)) | -one(in2(and1(h))) | one(out1(and1(h))) | -logic_not(and1(h)). [resolve(87,b,70,b)].
% 0.66/0.98 162 -logic_or(not1(h)) | -one(in2(not1(h))) | one(out1(not1(h))) | -logic_not(not1(h)). [resolve(87,b,75,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -one(in2(not1(h))) | one(out1(not1(h))). [resolve(162,d,146,a)].
% 0.66/0.98 163 -logic_or(or1(h)) | -one(in2(or1(h))) | one(out1(or1(h))) | -logic_not(or1(h)). [resolve(87,b,76,b)].
% 0.66/0.98 164 -logic_or(and1(h)) | -zero(out1(and1(h))) | zero(in1(and1(h))) | -logic_not(and1(h)). [resolve(88,b,70,b)].
% 0.66/0.98 165 -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in1(not1(h))) | -logic_not(not1(h)). [resolve(88,b,75,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in1(not1(h))). [resolve(165,d,146,a)].
% 0.66/0.98 166 -logic_or(or1(h)) | -zero(out1(or1(h))) | zero(in1(or1(h))) | -logic_not(or1(h)). [resolve(88,b,76,b)].
% 0.66/0.98 167 -logic_or(and1(h)) | -zero(out1(and1(h))) | zero(in2(and1(h))) | -logic_not(and1(h)). [resolve(89,b,70,b)].
% 0.66/0.98 168 -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in2(not1(h))) | -logic_not(not1(h)). [resolve(89,b,75,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in2(not1(h))). [resolve(168,d,146,a)].
% 0.66/0.98 169 -logic_or(or1(h)) | -zero(out1(or1(h))) | zero(in2(or1(h))) | -logic_not(or1(h)). [resolve(89,b,76,b)].
% 0.66/0.98 170 -logic_or(and1(h)) | -zero(in1(and1(h))) | -zero(in2(and1(h))) | zero(out1(and1(h))) | -logic_not(and1(h)). [resolve(90,b,70,b)].
% 0.66/0.98 171 -logic_or(not1(h)) | -zero(in1(not1(h))) | -zero(in2(not1(h))) | zero(out1(not1(h))) | -logic_not(not1(h)). [resolve(90,b,75,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -zero(in1(not1(h))) | -zero(in2(not1(h))) | zero(out1(not1(h))). [resolve(171,e,146,a)].
% 0.66/0.98 172 -logic_or(or1(h)) | -zero(in1(or1(h))) | -zero(in2(or1(h))) | zero(out1(or1(h))) | -logic_not(or1(h)). [resolve(90,b,76,b)].
% 0.66/0.98 173 -logic_or(and1(h)) | -one(out1(and1(h))) | one(in1(and1(h))) | one(in2(and1(h))) | -logic_not(and1(h)). [resolve(91,b,70,b)].
% 0.66/0.98 174 -logic_or(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))) | one(in2(not1(h))) | -logic_not(not1(h)). [resolve(91,b,75,b)].
% 0.66/0.98 Derived: -logic_or(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))) | one(in2(not1(h))). [resolve(174,e,146,a)].
% 0.66/0.98 175 -logic_or(or1(h)) | -one(out1(or1(h))) | one(in1(or1(h))) | one(in2(or1(h))) | -logic_not(or1(h)). [resolve(91,b,76,b)].
% 0.66/0.98 176 -logic_or(and1(h)) | -one(in1(and1(h))) | one(out1(and1(h))). [resolve(50,b,51,a)].
% 0.66/0.98 177 logic_or(or1(h)). [resolve(5,a,2,a)].
% 0.66/0.98 178 -logic_or(and1(h)) | -one(in2(and1(h))) | one(out1(and1(h))). [resolve(50,b,52,a)].
% 0.66/0.98 179 -logic_or(and1(h)) | -zero(out1(and1(h))) | zero(in1(and1(h))). [resolve(50,b,53,a)].
% 0.66/0.98 180 -logic_or(and1(h)) | -zero(out1(and1(h))) | zero(in2(and1(h))). [resolve(50,b,54,a)].
% 0.66/0.98 181 -logic_or(and1(h)) | -zero(in1(and1(h))) | -zero(in2(and1(h))) | zero(out1(and1(h))). [resolve(50,b,55,a)].
% 0.66/0.98 182 -logic_or(and1(h)) | -one(out1(and1(h))) | one(in1(and1(h))) | one(in2(and1(h))). [resolve(50,b,56,a)].
% 0.66/0.98 183 -logic_or(not1(h)) | -one(in1(not1(h))) | one(out1(not1(h))). [resolve(57,b,51,a)].
% 0.66/0.98 184 -logic_or(not1(h)) | -one(in2(not1(h))) | one(out1(not1(h))). [resolve(57,b,52,a)].
% 0.66/0.98 185 -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in1(not1(h))). [resolve(57,b,53,a)].
% 0.66/0.98 186 -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in2(not1(h))). [resolve(57,b,54,a)].
% 0.66/0.98 187 -logic_or(not1(h)) | -zero(in1(not1(h))) | -zero(in2(not1(h))) | zero(out1(not1(h))). [resolve(57,b,55,a)].
% 0.66/0.98 188 -logic_or(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))) | one(in2(not1(h))). [resolve(57,b,56,a)].
% 0.66/0.98 189 -logic_or(or1(h)) | -one(in1(or1(h))) | one(out1(or1(h))). [resolve(58,b,51,a)].
% 0.66/0.98 Derived: -one(in1(or1(h))) | one(out1(or1(h))). [resolve(189,a,177,a)].
% 0.66/0.98 190 -logic_or(or1(h)) | -one(in2(or1(h))) | one(out1(or1(h))). [resolve(58,b,52,a)].
% 0.66/0.98 Derived: -one(in2(or1(h))) | one(out1(or1(h))). [resolve(190,a,177,a)].
% 0.66/0.98 191 -logic_or(or1(h)) | -zero(out1(or1(h))) | zero(in1(or1(h))). [resolve(58,b,53,a)].
% 0.66/0.98 Derived: -zero(out1(or1(h))) | zero(in1(or1(h))). [resolve(191,a,177,a)].
% 0.66/0.98 192 -logic_or(or1(h)) | -zero(out1(or1(h))) | zero(in2(or1(h))). [resolve(58,b,54,a)].
% 0.66/0.98 Derived: -zero(out1(or1(h))) | zero(in2(or1(h))). [resolve(192,a,177,a)].
% 0.66/0.98 193 -logic_or(or1(h)) | -zero(in1(or1(h))) | -zero(in2(or1(h))) | zero(out1(or1(h))). [resolve(58,b,55,a)].
% 0.66/0.98 Derived: -zero(in1(or1(h))) | -zero(in2(or1(h))) | zero(out1(or1(h))). [resolve(193,a,177,a)].
% 0.66/0.98 194 -logic_or(or1(h)) | -one(out1(or1(h))) | one(in1(or1(h))) | one(in2(or1(h))). [resolve(58,b,56,a)].
% 0.66/0.98 Derived: -one(out1(or1(h))) | one(in1(or1(h))) | one(in2(or1(h))). [resolve(194,a,177,a)].
% 0.66/0.98 195 -logic_or(not1(h)) | -one(in1(not1(h))) | one(out1(not1(h))). [resolve(159,d,146,a)].
% 0.66/0.98 196 -logic_or(not1(h)) | -one(in2(not1(h))) | one(out1(not1(h))). [resolve(162,d,146,a)].
% 0.66/0.98 197 -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in1(not1(h))). [resolve(165,d,146,a)].
% 0.66/0.98 198 -logic_or(not1(h)) | -zero(out1(not1(h))) | zero(in2(not1(h))). [resolve(168,d,146,a)].
% 0.66/0.98 199 -logic_or(not1(h)) | -zero(in1(not1(h))) | -zero(in2(not1(h))) | zero(out1(not1(h))). [resolve(171,e,146,a)].
% 0.66/0.98 200 -logic_or(not1(h)) | -one(out1(not1(h))) | one(in1(not1(h))) | one(in2(not1(h))). [resolve(174,e,146,a)].
% 0.66/0.98
% 0.66/0.98 ============================== end predicate elimination =============
% 0.66/0.98
% 0.66/0.98 Auto_denials: (non-Horn, no changes).
% 0.66/0.98
% 0.66/0.98 Term ordering decisions:
% 0.66/0.98 Function symbol KB weights: h=1. in1=1. out1=1. in2=1. and1=1. or1=1. and2=1. not1=1. outc=1. outs=1.
% 0.66/0.98
% 0.66/0.98 ============================== end of process initial clauses ========
% 0.66/0.98
% 0.66/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.66/0.98
% 0.66/0.98 ============================== end of clauses for search =============
% 0.66/0.98
% 0.66/0.98 ============================== SEARCH ================================
% 0.66/0.98
% 0.66/0.98 % Starting search at 0.03 seconds.
% 0.66/0.98
% 0.66/0.98 ============================== PROOF =================================
% 0.66/0.98 % SZS status Unsatisfiable
% 0.66/0.98 % SZS output start Refutation
% 0.66/0.98
% 0.66/0.98 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.66/0.98 % Length of proof is 60.
% 0.66/0.98 % Level of proof is 9.
% 0.66/0.98 % Maximum clause weight is 12.000.
% 0.66/0.98 % Given clauses 5.
% 0.66/0.98
% 0.66/0.98 1 -halfadder(A) | logic_and(and1(A)) # label(halfadder_and1) # label(axiom). [assumption].
% 0.66/0.98 2 halfadder(h) # label(h_isa_halfadder) # label(hypothesis). [assumption].
% 0.66/0.98 4 -halfadder(A) | logic_not(not1(A)) # label(halfadder_not1) # label(axiom). [assumption].
% 0.66/0.98 5 -halfadder(A) | logic_or(or1(A)) # label(halfadder_or1) # label(axiom). [assumption].
% 0.66/0.98 6 -halfadder(A) | connection(in1(A),in1(or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.66/0.98 10 -halfadder(A) | connection(outs(A),out1(and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.66/0.98 11 -halfadder(A) | connection(outc(A),out1(and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.66/0.98 12 -halfadder(A) | connection(out1(or1(A)),in1(and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.66/0.98 13 -halfadder(A) | connection(out1(and2(A)),in1(not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.66/0.98 14 -halfadder(A) | connection(out1(not1(A)),in2(and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.66/0.98 15 -logic_and(A) | and_ok(A) | abnormal(A) # label(and_ok_or_abnormal) # label(axiom). [assumption].
% 0.66/0.98 16 -abnormal(and1(h)) # label(diagnosis_and1) # label(negated_conjecture). [assumption].
% 0.66/0.98 17 -abnormal(not1(h)) # label(diagnosis_not1) # label(negated_conjecture). [assumption].
% 0.66/0.98 18 -abnormal(or1(h)) # label(diagnosis_or1) # label(negated_conjecture). [assumption].
% 0.66/0.98 22 -logic_or(A) | or_ok(A) | abnormal(A) # label(or_ok_or_abnormal) # label(axiom). [assumption].
% 0.66/0.98 23 -logic_not(A) | not_ok(A) | abnormal(A) # label(not_ok_or_abnormal) # label(axiom). [assumption].
% 0.66/0.98 24 connection(in1(h),in1(or1(h))). [resolve(6,a,2,a)].
% 0.66/0.98 25 -connection(A,B) | -zero(A) | zero(B) # label(value_propagation_zero1) # label(axiom). [assumption].
% 0.66/0.98 26 -connection(A,B) | -one(A) | one(B) # label(value_propagation_one1) # label(axiom). [assumption].
% 0.66/0.98 28 -connection(A,B) | -one(B) | one(A) # label(value_propagation_one2) # label(axiom). [assumption].
% 0.66/0.98 32 connection(outs(h),out1(and1(h))). [resolve(10,a,2,a)].
% 0.66/0.98 33 connection(outc(h),out1(and2(h))). [resolve(11,a,2,a)].
% 0.66/0.98 34 connection(out1(or1(h)),in1(and1(h))). [resolve(12,a,2,a)].
% 0.66/0.98 35 connection(out1(and2(h)),in1(not1(h))). [resolve(13,a,2,a)].
% 0.66/0.98 36 connection(out1(not1(h)),in2(and1(h))). [resolve(14,a,2,a)].
% 0.66/0.98 37 -logic_and(and1(h)) | and_ok(and1(h)). [resolve(15,c,16,a)].
% 0.66/0.98 42 -and_ok(A) | -one(in1(A)) | -one(in2(A)) | one(out1(A)) # label(and_11_1) # label(axiom). [assumption].
% 0.66/0.98 51 -or_ok(A) | -one(in1(A)) | one(out1(A)) # label(or_1x_1) # label(axiom). [assumption].
% 0.66/0.98 58 -logic_or(or1(h)) | or_ok(or1(h)). [resolve(22,c,18,a)].
% 0.66/0.98 71 -not_ok(A) | -zero(in1(A)) | one(out1(A)) # label(not_0_1_fw) # label(axiom). [assumption].
% 0.66/0.98 75 -logic_not(not1(h)) | not_ok(not1(h)). [resolve(23,c,17,a)].
% 0.66/0.98 96 logic_and(and1(h)). [resolve(1,a,2,a)].
% 0.66/0.98 101 -logic_and(and1(h)) | -one(in1(and1(h))) | -one(in2(and1(h))) | one(out1(and1(h))). [resolve(37,b,42,a)].
% 0.66/0.98 146 logic_not(not1(h)). [resolve(4,a,2,a)].
% 0.66/0.98 150 -logic_not(not1(h)) | -zero(in1(not1(h))) | one(out1(not1(h))). [resolve(75,b,71,a)].
% 0.66/0.98 177 logic_or(or1(h)). [resolve(5,a,2,a)].
% 0.66/0.98 189 -logic_or(or1(h)) | -one(in1(or1(h))) | one(out1(or1(h))). [resolve(58,b,51,a)].
% 0.66/0.98 201 one(in1(h)) # label(in1_1) # label(hypothesis). [assumption].
% 0.66/0.98 203 zero(outs(h)) # label(outs_0) # label(hypothesis). [assumption].
% 0.66/0.98 204 zero(outc(h)) # label(outc_0) # label(hypothesis). [assumption].
% 0.66/0.98 205 -zero(A) | -one(A) # label(unique_value) # label(axiom). [assumption].
% 0.66/0.98 207 -one(in1(h)) | one(in1(or1(h))). [resolve(24,a,26,a)].
% 0.66/0.98 208 one(in1(or1(h))). [copy(207),unit_del(a,201)].
% 0.66/0.98 230 -one(out1(and1(h))) | one(outs(h)). [resolve(32,a,28,a)].
% 0.66/0.98 231 -zero(outc(h)) | zero(out1(and2(h))). [resolve(33,a,25,a)].
% 0.66/0.98 232 zero(out1(and2(h))). [copy(231),unit_del(a,204)].
% 0.66/0.98 237 -one(out1(or1(h))) | one(in1(and1(h))). [resolve(34,a,26,a)].
% 0.66/0.98 240 -zero(out1(and2(h))) | zero(in1(not1(h))). [resolve(35,a,25,a)].
% 0.66/0.98 241 zero(in1(not1(h))). [copy(240),unit_del(a,232)].
% 0.66/0.98 246 -one(out1(not1(h))) | one(in2(and1(h))). [resolve(36,a,26,a)].
% 0.66/0.98 251 -one(in1(and1(h))) | -one(in2(and1(h))) | one(out1(and1(h))). [resolve(101,a,96,a)].
% 0.66/0.98 254 -zero(in1(not1(h))) | one(out1(not1(h))). [resolve(150,a,146,a)].
% 0.66/0.98 255 one(out1(not1(h))). [copy(254),unit_del(a,241)].
% 0.66/0.98 259 -one(in1(or1(h))) | one(out1(or1(h))). [resolve(189,a,177,a)].
% 0.66/0.98 260 one(out1(or1(h))). [copy(259),unit_del(a,208)].
% 0.66/0.98 265 one(in2(and1(h))). [back_unit_del(246),unit_del(a,255)].
% 0.66/0.98 266 one(in1(and1(h))). [back_unit_del(237),unit_del(a,260)].
% 0.66/0.98 267 one(out1(and1(h))). [back_unit_del(251),unit_del(a,266),unit_del(b,265)].
% 0.66/0.98 268 one(outs(h)). [back_unit_del(230),unit_del(a,267)].
% 0.66/0.98 271 $F. [ur(205,a,203,a),unit_del(a,268)].
% 0.66/0.98
% 0.66/0.98 % SZS output end Refutation
% 0.66/0.98 ============================== end of proof ==========================
% 0.66/0.98
% 0.66/0.98 ============================== STATISTICS ============================
% 0.66/0.98
% 0.66/0.98 Given=5. Generated=65. Kept=50. proofs=1.
% 0.66/0.98 Usable=5. Sos=34. Demods=0. Limbo=2, Disabled=266. Hints=0.
% 0.66/0.98 Megabytes=0.24.
% 0.66/0.98 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.66/0.98
% 0.66/0.98 ============================== end of statistics =====================
% 0.66/0.98
% 0.66/0.98 ============================== end of search =========================
% 0.66/0.98
% 0.66/0.98 THEOREM PROVED
% 0.66/0.98 % SZS status Unsatisfiable
% 0.66/0.98
% 0.66/0.98 Exiting with 1 proof.
% 0.66/0.98
% 0.66/0.98 Process 31559 exit (max_proofs) Fri Jun 17 08:01:18 2022
% 0.66/0.99 Prover9 interrupted
%------------------------------------------------------------------------------