TSTP Solution File: HWV006-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV006-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:08 EDT 2022
% Result : Unsatisfiable 0.45s 1.05s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : HWV006-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 16 20:52:47 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.45/1.02 ============================== Prover9 ===============================
% 0.45/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.02 Process 26145 was started by sandbox on n022.cluster.edu,
% 0.45/1.02 Thu Jun 16 20:52:48 2022
% 0.45/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25991_n022.cluster.edu".
% 0.45/1.02 ============================== end of head ===========================
% 0.45/1.02
% 0.45/1.02 ============================== INPUT =================================
% 0.45/1.02
% 0.45/1.02 % Reading from file /tmp/Prover9_25991_n022.cluster.edu
% 0.45/1.02
% 0.45/1.02 set(prolog_style_variables).
% 0.45/1.02 set(auto2).
% 0.45/1.02 % set(auto2) -> set(auto).
% 0.45/1.02 % set(auto) -> set(auto_inference).
% 0.45/1.02 % set(auto) -> set(auto_setup).
% 0.45/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.02 % set(auto) -> set(auto_limits).
% 0.45/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.02 % set(auto) -> set(auto_denials).
% 0.45/1.02 % set(auto) -> set(auto_process).
% 0.45/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.02 % set(auto2) -> assign(stats, some).
% 0.45/1.02 % set(auto2) -> clear(echo_input).
% 0.45/1.02 % set(auto2) -> set(quiet).
% 0.45/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.02 % set(auto2) -> clear(print_given).
% 0.45/1.02 assign(lrs_ticks,-1).
% 0.45/1.02 assign(sos_limit,10000).
% 0.45/1.02 assign(order,kbo).
% 0.45/1.02 set(lex_order_vars).
% 0.45/1.02 clear(print_given).
% 0.45/1.02
% 0.45/1.02 % formulas(sos). % not echoed (64 formulas)
% 0.45/1.02
% 0.45/1.02 ============================== end of input ==========================
% 0.45/1.02
% 0.45/1.02 % From the command line: assign(max_seconds, 300).
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.02
% 0.45/1.02 % Formulas that are not ordinary clauses:
% 0.45/1.02
% 0.45/1.02 ============================== end of process non-clausal formulas ===
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.02
% 0.45/1.02 ============================== PREDICATE ELIMINATION =================
% 0.45/1.02 1 -fulladder(A) | halfadder(h1(A)) # label(fulladder_halfadder1) # label(axiom). [assumption].
% 0.45/1.02 2 fulladder(f) # label(f_isa_fulladder) # label(hypothesis). [assumption].
% 0.45/1.02 Derived: halfadder(h1(f)). [resolve(1,a,2,a)].
% 0.45/1.02 3 -fulladder(A) | halfadder(h2(A)) # label(fulladder_halfadder2) # label(axiom). [assumption].
% 0.45/1.02 Derived: halfadder(h2(f)). [resolve(3,a,2,a)].
% 0.45/1.02 4 -fulladder(A) | logic_or(or1(A)) # label(fulladder_or1) # label(axiom). [assumption].
% 0.45/1.02 Derived: logic_or(or1(f)). [resolve(4,a,2,a)].
% 0.45/1.02 5 -fulladder(A) | connection(in1(A),in1(h2(A))) # label(fulladder_connection_in1_in1h2) # label(axiom). [assumption].
% 0.45/1.02 Derived: connection(in1(f),in1(h2(f))). [resolve(5,a,2,a)].
% 0.45/1.02 6 -fulladder(A) | connection(in2(A),in1(h1(A))) # label(fulladder_connection_in2_in1h1) # label(axiom). [assumption].
% 0.45/1.02 Derived: connection(in2(f),in1(h1(f))). [resolve(6,a,2,a)].
% 0.45/1.02 7 -fulladder(A) | connection(inc(A),in2(h1(A))) # label(fulladder_connection_inc_in2h1) # label(axiom). [assumption].
% 0.45/1.02 Derived: connection(inc(f),in2(h1(f))). [resolve(7,a,2,a)].
% 0.45/1.02 8 -fulladder(A) | connection(outs(A),outs(h2(A))) # label(fulladder_connection_outs_outsh2) # label(axiom). [assumption].
% 0.45/1.02 Derived: connection(outs(f),outs(h2(f))). [resolve(8,a,2,a)].
% 0.45/1.02 9 -fulladder(A) | connection(outc(A),out1(or1(A))) # label(fulladder_connection_outc_out1or1) # label(axiom). [assumption].
% 0.45/1.02 Derived: connection(outc(f),out1(or1(f))). [resolve(9,a,2,a)].
% 0.45/1.02 10 -fulladder(A) | connection(outs(h1(A)),in2(h2(A))) # label(fulladder_connection_outsh1_in2h2) # label(axiom). [assumption].
% 0.45/1.02 Derived: connection(outs(h1(f)),in2(h2(f))). [resolve(10,a,2,a)].
% 0.45/1.02 11 -fulladder(A) | connection(outc(h1(A)),in2(or1(A))) # label(fulladder_connection_outch1_in2or1) # label(axiom). [assumption].
% 0.45/1.02 Derived: connection(outc(h1(f)),in2(or1(f))). [resolve(11,a,2,a)].
% 0.45/1.03 12 -fulladder(A) | connection(outc(h2(A)),in1(or1(A))) # label(fulladder_connection_outch2_in1or1) # label(axiom). [assumption].
% 0.45/1.03 Derived: connection(outc(h2(f)),in1(or1(f))). [resolve(12,a,2,a)].
% 0.45/1.03 13 -logic_and(A) | and_ok(A) | abnormal(A) # label(and_ok_or_abnormal) # label(axiom). [assumption].
% 0.45/1.03 14 -and_ok(A) | -abnormal(A) # label(not_and_ok_and_abnormal) # label(axiom). [assumption].
% 0.45/1.03 15 -and_ok(A) | -zero(in1(A)) | zero(out1(A)) # label(and_0x_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: -zero(in1(A)) | zero(out1(A)) | -logic_and(A) | abnormal(A). [resolve(15,a,13,b)].
% 0.45/1.03 16 -and_ok(A) | -zero(in2(A)) | zero(out1(A)) # label(and_x0_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: -zero(in2(A)) | zero(out1(A)) | -logic_and(A) | abnormal(A). [resolve(16,a,13,b)].
% 0.45/1.03 17 -and_ok(A) | -one(out1(A)) | one(in1(A)) # label(and_1_1x) # label(axiom). [assumption].
% 0.45/1.03 Derived: -one(out1(A)) | one(in1(A)) | -logic_and(A) | abnormal(A). [resolve(17,a,13,b)].
% 0.45/1.03 18 -and_ok(A) | -one(out1(A)) | one(in2(A)) # label(and_1_x1) # label(axiom). [assumption].
% 0.45/1.03 Derived: -one(out1(A)) | one(in2(A)) | -logic_and(A) | abnormal(A). [resolve(18,a,13,b)].
% 0.45/1.03 19 -and_ok(A) | -one(in1(A)) | -one(in2(A)) | one(out1(A)) # label(and_11_1) # label(axiom). [assumption].
% 0.45/1.03 Derived: -one(in1(A)) | -one(in2(A)) | one(out1(A)) | -logic_and(A) | abnormal(A). [resolve(19,a,13,b)].
% 0.45/1.03 20 -and_ok(A) | -zero(out1(A)) | zero(in1(A)) | zero(in2(A)) # label(and_0_00) # label(axiom). [assumption].
% 0.45/1.03 Derived: -zero(out1(A)) | zero(in1(A)) | zero(in2(A)) | -logic_and(A) | abnormal(A). [resolve(20,a,13,b)].
% 0.45/1.03 21 -logic_or(A) | or_ok(A) | abnormal(A) # label(or_ok_or_abnormal) # label(axiom). [assumption].
% 0.45/1.03 22 -or_ok(A) | -abnormal(A) # label(not_or_ok_and_abnormal) # label(axiom). [assumption].
% 0.45/1.03 23 -or_ok(A) | -one(in1(A)) | one(out1(A)) # label(or_1x_1) # label(axiom). [assumption].
% 0.45/1.03 Derived: -one(in1(A)) | one(out1(A)) | -logic_or(A) | abnormal(A). [resolve(23,a,21,b)].
% 0.45/1.03 24 -or_ok(A) | -one(in2(A)) | one(out1(A)) # label(or_x1_1) # label(axiom). [assumption].
% 0.45/1.03 Derived: -one(in2(A)) | one(out1(A)) | -logic_or(A) | abnormal(A). [resolve(24,a,21,b)].
% 0.45/1.03 25 -or_ok(A) | -zero(out1(A)) | zero(in1(A)) # label(or_0_0x) # label(axiom). [assumption].
% 0.45/1.03 Derived: -zero(out1(A)) | zero(in1(A)) | -logic_or(A) | abnormal(A). [resolve(25,a,21,b)].
% 0.45/1.03 26 -or_ok(A) | -zero(out1(A)) | zero(in2(A)) # label(or_0_01) # label(axiom). [assumption].
% 0.45/1.03 Derived: -zero(out1(A)) | zero(in2(A)) | -logic_or(A) | abnormal(A). [resolve(26,a,21,b)].
% 0.45/1.03 27 -or_ok(A) | -zero(in1(A)) | -zero(in2(A)) | zero(out1(A)) # label(or_00_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: -zero(in1(A)) | -zero(in2(A)) | zero(out1(A)) | -logic_or(A) | abnormal(A). [resolve(27,a,21,b)].
% 0.45/1.03 28 -or_ok(A) | -one(out1(A)) | one(in1(A)) | one(in2(A)) # label(or_1_11) # label(axiom). [assumption].
% 0.45/1.03 Derived: -one(out1(A)) | one(in1(A)) | one(in2(A)) | -logic_or(A) | abnormal(A). [resolve(28,a,21,b)].
% 0.45/1.03 29 -logic_not(A) | not_ok(A) | abnormal(A) # label(not_ok_or_abnormal) # label(axiom). [assumption].
% 0.45/1.03 30 -not_ok(A) | -abnormal(A) # label(not__not_ok_and_abnormal) # label(axiom). [assumption].
% 0.45/1.03 31 -not_ok(A) | -zero(in1(A)) | one(out1(A)) # label(not_0_1_fw) # label(axiom). [assumption].
% 0.45/1.03 Derived: -zero(in1(A)) | one(out1(A)) | -logic_not(A) | abnormal(A). [resolve(31,a,29,b)].
% 0.45/1.03 32 -not_ok(A) | -one(in1(A)) | zero(out1(A)) # label(not_1_0_fw) # label(axiom). [assumption].
% 0.45/1.03 Derived: -one(in1(A)) | zero(out1(A)) | -logic_not(A) | abnormal(A). [resolve(32,a,29,b)].
% 0.45/1.03 33 -not_ok(A) | -zero(out1(A)) | one(in1(A)) # label(not_0_1_bw) # label(axiom). [assumption].
% 0.45/1.03 Derived: -zero(out1(A)) | one(in1(A)) | -logic_not(A) | abnormal(A). [resolve(33,a,29,b)].
% 0.45/1.03 34 -not_ok(A) | -one(out1(A)) | zero(in1(A)) # label(not_1_0_bw) # label(axiom). [assumption].
% 0.45/1.03 Derived: -one(out1(A)) | zero(in1(A)) | -logic_not(A) | abnormal(A). [resolve(34,a,29,b)].
% 0.45/1.03 35 halfadder(h1(f)). [resolve(1,a,2,a)].
% 0.45/1.03 36 -halfadder(A) | logic_and(and1(A)) # label(halfadder_and1) # label(axiom). [assumption].
% 0.45/1.03 37 -halfadder(A) | logic_and(and2(A)) # label(halfadder_and2) # label(axiom). [assumption].
% 0.45/1.03 38 -halfadder(A) | logic_not(not1(A)) # label(halfadder_not1) # label(axiom). [assumption].
% 0.45/1.03 39 -halfadder(A) | logic_or(or1(A)) # label(halfadder_or1) # label(axiom). [assumption].
% 0.45/1.03 40 -halfadder(A) | connection(in1(A),in1(or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.45/1.03 41 -halfadder(A) | connection(in2(A),in2(or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.45/1.03 42 -halfadder(A) | connection(in1(A),in1(and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.45/1.03 43 -halfadder(A) | connection(in2(A),in2(and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.45/1.03 44 -halfadder(A) | connection(outs(A),out1(and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.45/1.03 45 -halfadder(A) | connection(outc(A),out1(and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.45/1.03 46 -halfadder(A) | connection(out1(or1(A)),in1(and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.45/1.03 47 -halfadder(A) | connection(out1(and2(A)),in1(not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.45/1.03 48 -halfadder(A) | connection(out1(not1(A)),in2(and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.45/1.03 Derived: logic_and(and1(h1(f))). [resolve(35,a,36,a)].
% 0.45/1.03 Derived: logic_and(and2(h1(f))). [resolve(35,a,37,a)].
% 0.45/1.03 Derived: logic_not(not1(h1(f))). [resolve(35,a,38,a)].
% 0.45/1.03 Derived: logic_or(or1(h1(f))). [resolve(35,a,39,a)].
% 0.45/1.03 Derived: connection(in1(h1(f)),in1(or1(h1(f)))). [resolve(35,a,40,a)].
% 0.45/1.03 Derived: connection(in2(h1(f)),in2(or1(h1(f)))). [resolve(35,a,41,a)].
% 0.45/1.03 Derived: connection(in1(h1(f)),in1(and2(h1(f)))). [resolve(35,a,42,a)].
% 0.45/1.03 Derived: connection(in2(h1(f)),in2(and2(h1(f)))). [resolve(35,a,43,a)].
% 0.45/1.03 Derived: connection(outs(h1(f)),out1(and1(h1(f)))). [resolve(35,a,44,a)].
% 0.45/1.03 Derived: connection(outc(h1(f)),out1(and2(h1(f)))). [resolve(35,a,45,a)].
% 0.45/1.03 Derived: connection(out1(or1(h1(f))),in1(and1(h1(f)))). [resolve(35,a,46,a)].
% 0.45/1.03 Derived: connection(out1(and2(h1(f))),in1(not1(h1(f)))). [resolve(35,a,47,a)].
% 0.45/1.03 Derived: connection(out1(not1(h1(f))),in2(and1(h1(f)))). [resolve(35,a,48,a)].
% 0.45/1.03 49 halfadder(h2(f)). [resolve(3,a,2,a)].
% 0.45/1.03 Derived: logic_and(and1(h2(f))). [resolve(49,a,36,a)].
% 0.45/1.03 Derived: logic_and(and2(h2(f))). [resolve(49,a,37,a)].
% 0.45/1.03 Derived: logic_not(not1(h2(f))). [resolve(49,a,38,a)].
% 0.45/1.03 Derived: logic_or(or1(h2(f))). [resolve(49,a,39,a)].
% 0.45/1.03 Derived: connection(in1(h2(f)),in1(or1(h2(f)))). [resolve(49,a,40,a)].
% 0.45/1.03 Derived: connection(in2(h2(f)),in2(or1(h2(f)))). [resolve(49,a,41,a)].
% 0.45/1.03 Derived: connection(in1(h2(f)),in1(and2(h2(f)))). [resolve(49,a,42,a)].
% 0.45/1.03 Derived: connection(in2(h2(f)),in2(and2(h2(f)))). [resolve(49,a,43,a)].
% 0.45/1.03 Derived: connection(outs(h2(f)),out1(and1(h2(f)))). [resolve(49,a,44,a)].
% 0.45/1.03 Derived: connection(outc(h2(f)),out1(and2(h2(f)))). [resolve(49,a,45,a)].
% 0.45/1.03 Derived: connection(out1(or1(h2(f))),in1(and1(h2(f)))). [resolve(49,a,46,a)].
% 0.45/1.03 Derived: connection(out1(and2(h2(f))),in1(not1(h2(f)))). [resolve(49,a,47,a)].
% 0.45/1.03 Derived: connection(out1(not1(h2(f))),in2(and1(h2(f)))). [resolve(49,a,48,a)].
% 0.45/1.03 50 connection(in1(f),in1(h2(f))). [resolve(5,a,2,a)].
% 0.45/1.03 51 -connection(A,B) | -zero(A) | zero(B) # label(value_propagation_zero1) # label(axiom). [assumption].
% 0.45/1.03 52 -connection(A,B) | -one(A) | one(B) # label(value_propagation_one1) # label(axiom). [assumption].
% 0.45/1.03 53 -connection(A,B) | -zero(B) | zero(A) # label(value_propagation_zero2) # label(axiom). [assumption].
% 0.45/1.03 54 -connection(A,B) | -one(B) | one(A) # label(value_propagation_one2) # label(axiom). [assumption].
% 0.45/1.03 Derived: -zero(in1(f)) | zero(in1(h2(f))). [resolve(50,a,51,a)].
% 0.45/1.03 Derived: -one(in1(f)) | one(in1(h2(f))). [resolve(50,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(h2(f))) | zero(in1(f)). [resolve(50,a,53,a)].
% 0.45/1.03 Derived: -one(in1(h2(f))) | one(in1(f)). [resolve(50,a,54,a)].
% 0.45/1.03 55 connection(in2(f),in1(h1(f))). [resolve(6,a,2,a)].
% 0.45/1.03 Derived: -zero(in2(f)) | zero(in1(h1(f))). [resolve(55,a,51,a)].
% 0.45/1.03 Derived: -one(in2(f)) | one(in1(h1(f))). [resolve(55,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(h1(f))) | zero(in2(f)). [resolve(55,a,53,a)].
% 0.45/1.03 Derived: -one(in1(h1(f))) | one(in2(f)). [resolve(55,a,54,a)].
% 0.45/1.03 56 connection(inc(f),in2(h1(f))). [resolve(7,a,2,a)].
% 0.45/1.03 Derived: -zero(inc(f)) | zero(in2(h1(f))). [resolve(56,a,51,a)].
% 0.45/1.03 Derived: -one(inc(f)) | one(in2(h1(f))). [resolve(56,a,52,a)].
% 0.45/1.03 Derived: -zero(in2(h1(f))) | zero(inc(f)). [resolve(56,a,53,a)].
% 0.45/1.03 Derived: -one(in2(h1(f))) | one(inc(f)). [resolve(56,a,54,a)].
% 0.45/1.03 57 connection(outs(f),outs(h2(f))). [resolve(8,a,2,a)].
% 0.45/1.03 Derived: -zero(outs(f)) | zero(outs(h2(f))). [resolve(57,a,51,a)].
% 0.45/1.03 Derived: -one(outs(f)) | one(outs(h2(f))). [resolve(57,a,52,a)].
% 0.45/1.03 Derived: -zero(outs(h2(f))) | zero(outs(f)). [resolve(57,a,53,a)].
% 0.45/1.03 Derived: -one(outs(h2(f))) | one(outs(f)). [resolve(57,a,54,a)].
% 0.45/1.03 58 connection(outc(f),out1(or1(f))). [resolve(9,a,2,a)].
% 0.45/1.03 Derived: -zero(outc(f)) | zero(out1(or1(f))). [resolve(58,a,51,a)].
% 0.45/1.03 Derived: -one(outc(f)) | one(out1(or1(f))). [resolve(58,a,52,a)].
% 0.45/1.03 Derived: -zero(out1(or1(f))) | zero(outc(f)). [resolve(58,a,53,a)].
% 0.45/1.03 Derived: -one(out1(or1(f))) | one(outc(f)). [resolve(58,a,54,a)].
% 0.45/1.03 59 connection(outs(h1(f)),in2(h2(f))). [resolve(10,a,2,a)].
% 0.45/1.03 Derived: -zero(outs(h1(f))) | zero(in2(h2(f))). [resolve(59,a,51,a)].
% 0.45/1.03 Derived: -one(outs(h1(f))) | one(in2(h2(f))). [resolve(59,a,52,a)].
% 0.45/1.03 Derived: -zero(in2(h2(f))) | zero(outs(h1(f))). [resolve(59,a,53,a)].
% 0.45/1.03 Derived: -one(in2(h2(f))) | one(outs(h1(f))). [resolve(59,a,54,a)].
% 0.45/1.03 60 connection(outc(h1(f)),in2(or1(f))). [resolve(11,a,2,a)].
% 0.45/1.03 Derived: -zero(outc(h1(f))) | zero(in2(or1(f))). [resolve(60,a,51,a)].
% 0.45/1.03 Derived: -one(outc(h1(f))) | one(in2(or1(f))). [resolve(60,a,52,a)].
% 0.45/1.03 Derived: -zero(in2(or1(f))) | zero(outc(h1(f))). [resolve(60,a,53,a)].
% 0.45/1.03 Derived: -one(in2(or1(f))) | one(outc(h1(f))). [resolve(60,a,54,a)].
% 0.45/1.03 61 connection(outc(h2(f)),in1(or1(f))). [resolve(12,a,2,a)].
% 0.45/1.03 Derived: -zero(outc(h2(f))) | zero(in1(or1(f))). [resolve(61,a,51,a)].
% 0.45/1.03 Derived: -one(outc(h2(f))) | one(in1(or1(f))). [resolve(61,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(or1(f))) | zero(outc(h2(f))). [resolve(61,a,53,a)].
% 0.45/1.03 Derived: -one(in1(or1(f))) | one(outc(h2(f))). [resolve(61,a,54,a)].
% 0.45/1.03 62 connection(in1(h1(f)),in1(or1(h1(f)))). [resolve(35,a,40,a)].
% 0.45/1.03 Derived: -zero(in1(h1(f))) | zero(in1(or1(h1(f)))). [resolve(62,a,51,a)].
% 0.45/1.03 Derived: -one(in1(h1(f))) | one(in1(or1(h1(f)))). [resolve(62,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(or1(h1(f)))) | zero(in1(h1(f))). [resolve(62,a,53,a)].
% 0.45/1.03 Derived: -one(in1(or1(h1(f)))) | one(in1(h1(f))). [resolve(62,a,54,a)].
% 0.45/1.03 63 connection(in2(h1(f)),in2(or1(h1(f)))). [resolve(35,a,41,a)].
% 0.45/1.03 Derived: -zero(in2(h1(f))) | zero(in2(or1(h1(f)))). [resolve(63,a,51,a)].
% 0.45/1.03 Derived: -one(in2(h1(f))) | one(in2(or1(h1(f)))). [resolve(63,a,52,a)].
% 0.45/1.03 Derived: -zero(in2(or1(h1(f)))) | zero(in2(h1(f))). [resolve(63,a,53,a)].
% 0.45/1.03 Derived: -one(in2(or1(h1(f)))) | one(in2(h1(f))). [resolve(63,a,54,a)].
% 0.45/1.03 64 connection(in1(h1(f)),in1(and2(h1(f)))). [resolve(35,a,42,a)].
% 0.45/1.03 Derived: -zero(in1(h1(f))) | zero(in1(and2(h1(f)))). [resolve(64,a,51,a)].
% 0.45/1.03 Derived: -one(in1(h1(f))) | one(in1(and2(h1(f)))). [resolve(64,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(and2(h1(f)))) | zero(in1(h1(f))). [resolve(64,a,53,a)].
% 0.45/1.03 Derived: -one(in1(and2(h1(f)))) | one(in1(h1(f))). [resolve(64,a,54,a)].
% 0.45/1.03 65 connection(in2(h1(f)),in2(and2(h1(f)))). [resolve(35,a,43,a)].
% 0.45/1.03 Derived: -zero(in2(h1(f))) | zero(in2(and2(h1(f)))). [resolve(65,a,51,a)].
% 0.45/1.03 Derived: -one(in2(h1(f))) | one(in2(and2(h1(f)))). [resolve(65,a,52,a)].
% 0.45/1.03 Derived: -zero(in2(and2(h1(f)))) | zero(in2(h1(f))). [resolve(65,a,53,a)].
% 0.45/1.03 Derived: -one(in2(and2(h1(f)))) | one(in2(h1(f))). [resolve(65,a,54,a)].
% 0.45/1.03 66 connection(outs(h1(f)),out1(and1(h1(f)))). [resolve(35,a,44,a)].
% 0.45/1.03 Derived: -zero(outs(h1(f))) | zero(out1(and1(h1(f)))). [resolve(66,a,51,a)].
% 0.45/1.03 Derived: -one(outs(h1(f))) | one(out1(and1(h1(f)))). [resolve(66,a,52,a)].
% 0.45/1.03 Derived: -zero(out1(and1(h1(f)))) | zero(outs(h1(f))). [resolve(66,a,53,a)].
% 0.45/1.03 Derived: -one(out1(and1(h1(f)))) | one(outs(h1(f))). [resolve(66,a,54,a)].
% 0.45/1.03 67 connection(outc(h1(f)),out1(and2(h1(f)))). [resolve(35,a,45,a)].
% 0.45/1.03 Derived: -zero(outc(h1(f))) | zero(out1(and2(h1(f)))). [resolve(67,a,51,a)].
% 0.45/1.03 Derived: -one(outc(h1(f))) | one(out1(and2(h1(f)))). [resolve(67,a,52,a)].
% 0.45/1.03 Derived: -zero(out1(and2(h1(f)))) | zero(outc(h1(f))). [resolve(67,a,53,a)].
% 0.45/1.03 Derived: -one(out1(and2(h1(f)))) | one(outc(h1(f))). [resolve(67,a,54,a)].
% 0.45/1.03 68 connection(out1(or1(h1(f))),in1(and1(h1(f)))). [resolve(35,a,46,a)].
% 0.45/1.03 Derived: -zero(out1(or1(h1(f)))) | zero(in1(and1(h1(f)))). [resolve(68,a,51,a)].
% 0.45/1.03 Derived: -one(out1(or1(h1(f)))) | one(in1(and1(h1(f)))). [resolve(68,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(and1(h1(f)))) | zero(out1(or1(h1(f)))). [resolve(68,a,53,a)].
% 0.45/1.03 Derived: -one(in1(and1(h1(f)))) | one(out1(or1(h1(f)))). [resolve(68,a,54,a)].
% 0.45/1.03 69 connection(out1(and2(h1(f))),in1(not1(h1(f)))). [resolve(35,a,47,a)].
% 0.45/1.03 Derived: -zero(out1(and2(h1(f)))) | zero(in1(not1(h1(f)))). [resolve(69,a,51,a)].
% 0.45/1.03 Derived: -one(out1(and2(h1(f)))) | one(in1(not1(h1(f)))). [resolve(69,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(not1(h1(f)))) | zero(out1(and2(h1(f)))). [resolve(69,a,53,a)].
% 0.45/1.03 Derived: -one(in1(not1(h1(f)))) | one(out1(and2(h1(f)))). [resolve(69,a,54,a)].
% 0.45/1.03 70 connection(out1(not1(h1(f))),in2(and1(h1(f)))). [resolve(35,a,48,a)].
% 0.45/1.03 Derived: -zero(out1(not1(h1(f)))) | zero(in2(and1(h1(f)))). [resolve(70,a,51,a)].
% 0.45/1.03 Derived: -one(out1(not1(h1(f)))) | one(in2(and1(h1(f)))). [resolve(70,a,52,a)].
% 0.45/1.03 Derived: -zero(in2(and1(h1(f)))) | zero(out1(not1(h1(f)))). [resolve(70,a,53,a)].
% 0.45/1.03 Derived: -one(in2(and1(h1(f)))) | one(out1(not1(h1(f)))). [resolve(70,a,54,a)].
% 0.45/1.03 71 connection(in1(h2(f)),in1(or1(h2(f)))). [resolve(49,a,40,a)].
% 0.45/1.03 Derived: -zero(in1(h2(f))) | zero(in1(or1(h2(f)))). [resolve(71,a,51,a)].
% 0.45/1.03 Derived: -one(in1(h2(f))) | one(in1(or1(h2(f)))). [resolve(71,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(or1(h2(f)))) | zero(in1(h2(f))). [resolve(71,a,53,a)].
% 0.45/1.03 Derived: -one(in1(or1(h2(f)))) | one(in1(h2(f))). [resolve(71,a,54,a)].
% 0.45/1.03 72 connection(in2(h2(f)),in2(or1(h2(f)))). [resolve(49,a,41,a)].
% 0.45/1.03 Derived: -zero(in2(h2(f))) | zero(in2(or1(h2(f)))). [resolve(72,a,51,a)].
% 0.45/1.03 Derived: -one(in2(h2(f))) | one(in2(or1(h2(f)))). [resolve(72,a,52,a)].
% 0.45/1.03 Derived: -zero(in2(or1(h2(f)))) | zero(in2(h2(f))). [resolve(72,a,53,a)].
% 0.45/1.03 Derived: -one(in2(or1(h2(f)))) | one(in2(h2(f))). [resolve(72,a,54,a)].
% 0.45/1.03 73 connection(in1(h2(f)),in1(and2(h2(f)))). [resolve(49,a,42,a)].
% 0.45/1.03 Derived: -zero(in1(h2(f))) | zero(in1(and2(h2(f)))). [resolve(73,a,51,a)].
% 0.45/1.03 Derived: -one(in1(h2(f))) | one(in1(and2(h2(f)))). [resolve(73,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(and2(h2(f)))) | zero(in1(h2(f))). [resolve(73,a,53,a)].
% 0.45/1.03 Derived: -one(in1(and2(h2(f)))) | one(in1(h2(f))). [resolve(73,a,54,a)].
% 0.45/1.03 74 connection(in2(h2(f)),in2(and2(h2(f)))). [resolve(49,a,43,a)].
% 0.45/1.03 Derived: -zero(in2(h2(f))) | zero(in2(and2(h2(f)))). [resolve(74,a,51,a)].
% 0.45/1.03 Derived: -one(in2(h2(f))) | one(in2(and2(h2(f)))). [resolve(74,a,52,a)].
% 0.45/1.03 Derived: -zero(in2(and2(h2(f)))) | zero(in2(h2(f))). [resolve(74,a,53,a)].
% 0.45/1.03 Derived: -one(in2(and2(h2(f)))) | one(in2(h2(f))). [resolve(74,a,54,a)].
% 0.45/1.03 75 connection(outs(h2(f)),out1(and1(h2(f)))). [resolve(49,a,44,a)].
% 0.45/1.03 Derived: -zero(outs(h2(f))) | zero(out1(and1(h2(f)))). [resolve(75,a,51,a)].
% 0.45/1.03 Derived: -one(outs(h2(f))) | one(out1(and1(h2(f)))). [resolve(75,a,52,a)].
% 0.45/1.03 Derived: -zero(out1(and1(h2(f)))) | zero(outs(h2(f))). [resolve(75,a,53,a)].
% 0.45/1.03 Derived: -one(out1(and1(h2(f)))) | one(outs(h2(f))). [resolve(75,a,54,a)].
% 0.45/1.03 76 connection(outc(h2(f)),out1(and2(h2(f)))). [resolve(49,a,45,a)].
% 0.45/1.03 Derived: -zero(outc(h2(f))) | zero(out1(and2(h2(f)))). [resolve(76,a,51,a)].
% 0.45/1.03 Derived: -one(outc(h2(f))) | one(out1(and2(h2(f)))). [resolve(76,a,52,a)].
% 0.45/1.03 Derived: -zero(out1(and2(h2(f)))) | zero(outc(h2(f))). [resolve(76,a,53,a)].
% 0.45/1.03 Derived: -one(out1(and2(h2(f)))) | one(outc(h2(f))). [resolve(76,a,54,a)].
% 0.45/1.03 77 connection(out1(or1(h2(f))),in1(and1(h2(f)))). [resolve(49,a,46,a)].
% 0.45/1.03 Derived: -zero(out1(or1(h2(f)))) | zero(in1(and1(h2(f)))). [resolve(77,a,51,a)].
% 0.45/1.03 Derived: -one(out1(or1(h2(f)))) | one(in1(and1(h2(f)))). [resolve(77,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(and1(h2(f)))) | zero(out1(or1(h2(f)))). [resolve(77,a,53,a)].
% 0.45/1.03 Derived: -one(in1(and1(h2(f)))) | one(out1(or1(h2(f)))). [resolve(77,a,54,a)].
% 0.45/1.03 78 connection(out1(and2(h2(f))),in1(not1(h2(f)))). [resolve(49,a,47,a)].
% 0.45/1.03 Derived: -zero(out1(and2(h2(f)))) | zero(in1(not1(h2(f)))). [resolve(78,a,51,a)].
% 0.45/1.03 Derived: -one(out1(and2(h2(f)))) | one(in1(not1(h2(f)))). [resolve(78,a,52,a)].
% 0.45/1.03 Derived: -zero(in1(not1(h2(f)))) | zero(out1(and2(h2(f)))). [resolve(78,a,53,a)].
% 0.45/1.03 Derived: -one(in1(not1(h2(f)))) | one(out1(and2(h2(f)))). [resolve(78,a,54,a)].
% 0.45/1.03 79 connection(out1(not1(h2(f))),in2(and1(h2(f)))). [resolve(49,a,48,a)].
% 0.45/1.03 Derived: -zero(out1(not1(h2(f)))) | zero(in2(and1(h2(f)))). [resolve(79,a,51,a)].
% 0.45/1.03 Derived: -one(out1(not1(h2(f)))) | one(in2(and1(h2(f)))). [resolve(79,a,52,a)].
% 0.45/1.03 Derived: -zero(in2(and1(h2(f)))) | zero(out1(not1(h2(f)))). [resolve(79,a,53,a)].
% 0.45/1.03 Derived: -one(in2(and1(h2(f)))) | one(out1(not1(h2(f)))). [resolve(79,a,54,a)].
% 0.45/1.03 80 -one(in1(A)) | one(out1(A)) | -logic_or(A) | abnormal(A). [resolve(23,a,21,b)].
% 0.45/1.03 81 logic_or(or1(f)). [resolve(4,a,2,a)].
% 0.45/1.03 Derived: -one(in1(or1(f))) | one(out1(or1(f))) | abnormal(or1(f)). [resolve(80,c,81,a)].
% 0.45/1.03 82 -one(in2(A)) | one(out1(A)) | -logic_or(A) | abnormal(A). [resolve(24,a,21,b)].
% 0.45/1.03 Derived: -one(in2(or1(f))) | one(out1(or1(f))) | abnormal(or1(f)). [resolve(82,c,81,a)].
% 0.45/1.03 83 -zero(out1(A)) | zero(in1(A)) | -logic_or(A) | abnormal(A). [resolve(25,a,21,b)].
% 0.45/1.03 Derived: -zero(out1(or1(f))) | zero(in1(or1(f))) | abnormal(or1(f)). [resolve(83,c,81,a)].
% 0.45/1.03 84 -zero(out1(A)) | zero(in2(A)) | -logic_or(A) | abnormal(A). [resolve(26,a,21,b)].
% 0.45/1.03 Derived: -zero(out1(or1(f))) | zero(in2(or1(f))) | abnormal(or1(f)). [resolve(84,c,81,a)].
% 0.45/1.03 85 -zero(in1(A)) | -zero(in2(A)) | zero(out1(A)) | -logic_or(A) | abnormal(A). [resolve(27,a,21,b)].
% 0.45/1.03 Derived: -zero(in1(or1(f))) | -zero(in2(or1(f))) | zero(out1(or1(f))) | abnormal(or1(f)). [resolve(85,d,81,a)].
% 0.45/1.03 86 -one(out1(A)) | one(in1(A)) | one(in2(A)) | -logic_or(A) | abnormal(A). [resolve(28,a,21,b)].
% 0.45/1.03 Derived: -one(out1(or1(f))) | one(in1(or1(f))) | one(in2(or1(f))) | abnormal(or1(f)). [resolve(86,d,81,a)].
% 0.45/1.03 87 logic_or(or1(h1(f))). [resolve(35,a,39,a)].
% 0.45/1.03 Derived: -one(in1(or1(h1(f)))) | one(out1(or1(h1(f)))) | abnormal(or1(h1(f))). [resolve(87,a,80,c)].
% 0.45/1.03 Derived: -one(in2(or1(h1(f)))) | one(out1(or1(h1(f)))) | abnormal(or1(h1(f))). [resolve(87,a,82,c)].
% 0.45/1.03 Derived: -zero(out1(or1(h1(f)))) | zero(in1(or1(h1(f)))) | abnormal(or1(h1(f))). [resolve(87,a,83,c)].
% 0.45/1.03 Derived: -zero(out1(or1(h1(f)))) | zero(in2(or1(h1(f)))) | abnormal(or1(h1(f))). [resolve(87,a,84,c)].
% 0.45/1.03 Derived: -zero(in1(or1(h1(f)))) | -zero(in2(or1(h1(f)))) | zero(out1(or1(h1(f)))) | abnormal(or1(h1(f))). [resolve(87,a,85,d)].
% 0.45/1.03 Derived: -one(out1(or1(h1(f)))) | one(in1(or1(h1(f)))) | one(in2(or1(h1(f)))) | abnormal(or1(h1(f))). [resolve(87,a,86,d)].
% 0.45/1.03 88 logic_or(or1(h2(f))). [resolve(49,a,39,a)].
% 0.45/1.03 Derived: -one(in1(or1(h2(f)))) | one(out1(or1(h2(f)))) | abnormal(or1(h2(f))). [resolve(88,a,80,c)].
% 0.45/1.03 Derived: -one(in2(or1(h2(f)))) | one(out1(or1(h2(f)))) | abnormal(or1(h2(f))). [resolve(88,a,82,c)].
% 0.45/1.03 Derived: -zero(out1(or1(h2(f)))) | zero(in1(or1(h2(f)))) | abnormal(or1(h2(f))). [resolve(88,a,83,c)].
% 0.45/1.03 Derived: -zero(out1(or1(h2(f)))) | zero(in2(or1(h2(f)))) | abnormal(or1(h2(f))). [resolve(88,a,84,c)].
% 0.45/1.03 Derived: -zero(in1(or1(h2(f)))) | -zero(in2(or1(h2(f)))) | zero(out1(or1(h2(f)))) | abnormal(or1(h2(f))). [resolve(88,a,85,d)].
% 0.45/1.03 Derived: -one(out1(or1(h2(f)))) | one(in1(or1(h2(f)))) | one(in2(or1(h2(f)))) | abnormal(or1(h2(f))). [resolve(88,a,86,d)].
% 0.45/1.03 89 logic_and(and1(h1(f))). [resolve(35,a,36,a)].
% 0.45/1.03 90 -zero(in1(A)) | zero(out1(A)) | -logic_and(A) | abnormal(A). [resolve(15,a,13,b)].
% 0.45/1.03 91 -zero(in2(A)) | zero(out1(A)) | -logic_and(A) | abnormal(A). [resolve(16,a,13,b)].
% 0.45/1.03 92 -one(out1(A)) | one(in1(A)) | -logic_and(A) | abnormal(A). [resolve(17,a,13,b)].
% 0.45/1.03 93 -one(out1(A)) | one(in2(A)) | -logic_and(A) | abnormal(A). [resolve(18,a,13,b)].
% 0.45/1.03 94 -one(in1(A)) | -one(in2(A)) | one(out1(A)) | -logic_and(A) | abnormal(A). [resolve(19,a,13,b)].
% 0.45/1.03 95 -zero(out1(A)) | zero(in1(A)) | zero(in2(A)) | -logic_and(A) | abnormal(A). [resolve(20,a,13,b)].
% 0.45/1.03 Derived: -zero(in1(and1(h1(f)))) | zero(out1(and1(h1(f)))) | abnormal(and1(h1(f))). [resolve(89,a,90,c)].
% 0.45/1.04 Derived: -zero(in2(and1(h1(f)))) | zero(out1(and1(h1(f)))) | abnormal(and1(h1(f))). [resolve(89,a,91,c)].
% 0.45/1.04 Derived: -one(out1(and1(h1(f)))) | one(in1(and1(h1(f)))) | abnormal(and1(h1(f))). [resolve(89,a,92,c)].
% 0.45/1.04 Derived: -one(out1(and1(h1(f)))) | one(in2(and1(h1(f)))) | abnormal(and1(h1(f))). [resolve(89,a,93,c)].
% 0.45/1.04 Derived: -one(in1(and1(h1(f)))) | -one(in2(and1(h1(f)))) | one(out1(and1(h1(f)))) | abnormal(and1(h1(f))). [resolve(89,a,94,d)].
% 0.45/1.04 Derived: -zero(out1(and1(h1(f)))) | zero(in1(and1(h1(f)))) | zero(in2(and1(h1(f)))) | abnormal(and1(h1(f))). [resolve(89,a,95,d)].
% 0.45/1.04 96 logic_and(and2(h1(f))). [resolve(35,a,37,a)].
% 0.45/1.04 Derived: -zero(in1(and2(h1(f)))) | zero(out1(and2(h1(f)))) | abnormal(and2(h1(f))). [resolve(96,a,90,c)].
% 0.45/1.04 Derived: -zero(in2(and2(h1(f)))) | zero(out1(and2(h1(f)))) | abnormal(and2(h1(f))). [resolve(96,a,91,c)].
% 0.45/1.04 Derived: -one(out1(and2(h1(f)))) | one(in1(and2(h1(f)))) | abnormal(and2(h1(f))). [resolve(96,a,92,c)].
% 0.45/1.04 Derived: -one(out1(and2(h1(f)))) | one(in2(and2(h1(f)))) | abnormal(and2(h1(f))). [resolve(96,a,93,c)].
% 0.45/1.04 Derived: -one(in1(and2(h1(f)))) | -one(in2(and2(h1(f)))) | one(out1(and2(h1(f)))) | abnormal(and2(h1(f))). [resolve(96,a,94,d)].
% 0.45/1.04 Derived: -zero(out1(and2(h1(f)))) | zero(in1(and2(h1(f)))) | zero(in2(and2(h1(f)))) | abnormal(and2(h1(f))). [resolve(96,a,95,d)].
% 0.45/1.04 97 logic_and(and1(h2(f))). [resolve(49,a,36,a)].
% 0.45/1.04 Derived: -zero(in1(and1(h2(f)))) | zero(out1(and1(h2(f)))) | abnormal(and1(h2(f))). [resolve(97,a,90,c)].
% 0.45/1.04 Derived: -zero(in2(and1(h2(f)))) | zero(out1(and1(h2(f)))) | abnormal(and1(h2(f))). [resolve(97,a,91,c)].
% 0.45/1.04 Derived: -one(out1(and1(h2(f)))) | one(in1(and1(h2(f)))) | abnormal(and1(h2(f))). [resolve(97,a,92,c)].
% 0.45/1.04 Derived: -one(out1(and1(h2(f)))) | one(in2(and1(h2(f)))) | abnormal(and1(h2(f))). [resolve(97,a,93,c)].
% 0.45/1.04 Derived: -one(in1(and1(h2(f)))) | -one(in2(and1(h2(f)))) | one(out1(and1(h2(f)))) | abnormal(and1(h2(f))). [resolve(97,a,94,d)].
% 0.45/1.04 Derived: -zero(out1(and1(h2(f)))) | zero(in1(and1(h2(f)))) | zero(in2(and1(h2(f)))) | abnormal(and1(h2(f))). [resolve(97,a,95,d)].
% 0.45/1.04 98 logic_and(and2(h2(f))). [resolve(49,a,37,a)].
% 0.45/1.04 Derived: -zero(in1(and2(h2(f)))) | zero(out1(and2(h2(f)))) | abnormal(and2(h2(f))). [resolve(98,a,90,c)].
% 0.45/1.04 Derived: -zero(in2(and2(h2(f)))) | zero(out1(and2(h2(f)))) | abnormal(and2(h2(f))). [resolve(98,a,91,c)].
% 0.45/1.04 Derived: -one(out1(and2(h2(f)))) | one(in1(and2(h2(f)))) | abnormal(and2(h2(f))). [resolve(98,a,92,c)].
% 0.45/1.04 Derived: -one(out1(and2(h2(f)))) | one(in2(and2(h2(f)))) | abnormal(and2(h2(f))). [resolve(98,a,93,c)].
% 0.45/1.04 Derived: -one(in1(and2(h2(f)))) | -one(in2(and2(h2(f)))) | one(out1(and2(h2(f)))) | abnormal(and2(h2(f))). [resolve(98,a,94,d)].
% 0.45/1.04 Derived: -zero(out1(and2(h2(f)))) | zero(in1(and2(h2(f)))) | zero(in2(and2(h2(f)))) | abnormal(and2(h2(f))). [resolve(98,a,95,d)].
% 0.45/1.04 99 logic_not(not1(h1(f))). [resolve(35,a,38,a)].
% 0.45/1.04 100 -zero(in1(A)) | one(out1(A)) | -logic_not(A) | abnormal(A). [resolve(31,a,29,b)].
% 0.45/1.04 101 -one(in1(A)) | zero(out1(A)) | -logic_not(A) | abnormal(A). [resolve(32,a,29,b)].
% 0.45/1.04 102 -zero(out1(A)) | one(in1(A)) | -logic_not(A) | abnormal(A). [resolve(33,a,29,b)].
% 0.45/1.04 103 -one(out1(A)) | zero(in1(A)) | -logic_not(A) | abnormal(A). [resolve(34,a,29,b)].
% 0.45/1.04 Derived: -zero(in1(not1(h1(f)))) | one(out1(not1(h1(f)))) | abnormal(not1(h1(f))). [resolve(99,a,100,c)].
% 0.45/1.04 Derived: -one(in1(not1(h1(f)))) | zero(out1(not1(h1(f)))) | abnormal(not1(h1(f))). [resolve(99,a,101,c)].
% 0.45/1.04 Derived: -zero(out1(not1(h1(f)))) | one(in1(not1(h1(f)))) | abnormal(not1(h1(f))). [resolve(99,a,102,c)].
% 0.45/1.04 Derived: -one(out1(not1(h1(f)))) | zero(in1(not1(h1(f)))) | abnormal(not1(h1(f))). [resolve(99,a,103,c)].
% 0.45/1.04 104 logic_not(not1(h2(f))). [resolve(49,a,38,a)].
% 0.45/1.04 Derived: -zero(in1(not1(h2(f)))) | one(out1(not1(h2(f)))) | abnormal(not1(h2(f))). [resolve(104,a,100,c)].
% 0.45/1.04 Derived: -one(in1(not1(h2(f)))) | zero(out1(not1(h2(f)))) | abnormal(not1(h2(f))). [resolve(104,a,101,c)].
% 0.45/1.04 Derived: -zero(out1(not1(h2(f)))) | one(in1(not1(h2(f)))) | abnormal(not1(h2(f))). [resolve(104,a,102,c)].
% 0.45/1.04 Derived: -one(out1(not1(h2(f)))) | zero(in1(not1(h2(f)))) | abnormal(not1(h2(f))). [resolve(104,a,103,c)].
% 0.45/1.05
% 0.45/1.05 ============================== end predicate elimination =============
% 0.45/1.05
% 0.45/1.05 Auto_denials: (non-Horn, no changes).
% 0.45/1.05
% 0.45/1.05 Term ordering decisions:
% 0.45/1.05 Function symbol KB weights: f=1. h1=1. h2=1. in1=1. or1=1. out1=1. in2=1. and2=1. and1=1. not1=1. outc=1. outs=1. inc=1.
% 0.45/1.05
% 0.45/1.05 ============================== end of process initial clauses ========
% 0.45/1.05
% 0.45/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.05
% 0.45/1.05 ============================== end of clauses for search =============
% 0.45/1.05
% 0.45/1.05 ============================== SEARCH ================================
% 0.45/1.05
% 0.45/1.05 % Starting search at 0.04 seconds.
% 0.45/1.05
% 0.45/1.05 ============================== PROOF =================================
% 0.45/1.05 % SZS status Unsatisfiable
% 0.45/1.05 % SZS output start Refutation
% 0.45/1.05
% 0.45/1.05 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.45/1.05 % Length of proof is 151.
% 0.45/1.05 % Level of proof is 24.
% 0.45/1.05 % Maximum clause weight is 15.000.
% 0.45/1.05 % Given clauses 77.
% 0.45/1.05
% 0.45/1.05 1 -fulladder(A) | halfadder(h1(A)) # label(fulladder_halfadder1) # label(axiom). [assumption].
% 0.45/1.05 2 fulladder(f) # label(f_isa_fulladder) # label(hypothesis). [assumption].
% 0.45/1.05 3 -fulladder(A) | halfadder(h2(A)) # label(fulladder_halfadder2) # label(axiom). [assumption].
% 0.45/1.05 4 -fulladder(A) | logic_or(or1(A)) # label(fulladder_or1) # label(axiom). [assumption].
% 0.45/1.05 5 -fulladder(A) | connection(in1(A),in1(h2(A))) # label(fulladder_connection_in1_in1h2) # label(axiom). [assumption].
% 0.45/1.05 6 -fulladder(A) | connection(in2(A),in1(h1(A))) # label(fulladder_connection_in2_in1h1) # label(axiom). [assumption].
% 0.45/1.05 7 -fulladder(A) | connection(inc(A),in2(h1(A))) # label(fulladder_connection_inc_in2h1) # label(axiom). [assumption].
% 0.45/1.05 8 -fulladder(A) | connection(outs(A),outs(h2(A))) # label(fulladder_connection_outs_outsh2) # label(axiom). [assumption].
% 0.45/1.05 9 -fulladder(A) | connection(outc(A),out1(or1(A))) # label(fulladder_connection_outc_out1or1) # label(axiom). [assumption].
% 0.45/1.05 10 -fulladder(A) | connection(outs(h1(A)),in2(h2(A))) # label(fulladder_connection_outsh1_in2h2) # label(axiom). [assumption].
% 0.45/1.05 12 -fulladder(A) | connection(outc(h2(A)),in1(or1(A))) # label(fulladder_connection_outch2_in1or1) # label(axiom). [assumption].
% 0.45/1.05 13 -logic_and(A) | and_ok(A) | abnormal(A) # label(and_ok_or_abnormal) # label(axiom). [assumption].
% 0.45/1.05 15 -and_ok(A) | -zero(in1(A)) | zero(out1(A)) # label(and_0x_0) # label(axiom). [assumption].
% 0.45/1.05 16 -and_ok(A) | -zero(in2(A)) | zero(out1(A)) # label(and_x0_0) # label(axiom). [assumption].
% 0.45/1.05 19 -and_ok(A) | -one(in1(A)) | -one(in2(A)) | one(out1(A)) # label(and_11_1) # label(axiom). [assumption].
% 0.45/1.05 21 -logic_or(A) | or_ok(A) | abnormal(A) # label(or_ok_or_abnormal) # label(axiom). [assumption].
% 0.45/1.05 23 -or_ok(A) | -one(in1(A)) | one(out1(A)) # label(or_1x_1) # label(axiom). [assumption].
% 0.45/1.05 24 -or_ok(A) | -one(in2(A)) | one(out1(A)) # label(or_x1_1) # label(axiom). [assumption].
% 0.45/1.05 29 -logic_not(A) | not_ok(A) | abnormal(A) # label(not_ok_or_abnormal) # label(axiom). [assumption].
% 0.45/1.05 31 -not_ok(A) | -zero(in1(A)) | one(out1(A)) # label(not_0_1_fw) # label(axiom). [assumption].
% 0.45/1.05 32 -not_ok(A) | -one(in1(A)) | zero(out1(A)) # label(not_1_0_fw) # label(axiom). [assumption].
% 0.45/1.05 35 halfadder(h1(f)). [resolve(1,a,2,a)].
% 0.45/1.05 36 -halfadder(A) | logic_and(and1(A)) # label(halfadder_and1) # label(axiom). [assumption].
% 0.45/1.05 37 -halfadder(A) | logic_and(and2(A)) # label(halfadder_and2) # label(axiom). [assumption].
% 0.45/1.05 38 -halfadder(A) | logic_not(not1(A)) # label(halfadder_not1) # label(axiom). [assumption].
% 0.45/1.05 39 -halfadder(A) | logic_or(or1(A)) # label(halfadder_or1) # label(axiom). [assumption].
% 0.45/1.05 41 -halfadder(A) | connection(in2(A),in2(or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.45/1.05 42 -halfadder(A) | connection(in1(A),in1(and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.45/1.05 43 -halfadder(A) | connection(in2(A),in2(and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.45/1.05 44 -halfadder(A) | connection(outs(A),out1(and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.45/1.05 45 -halfadder(A) | connection(outc(A),out1(and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.45/1.05 46 -halfadder(A) | connection(out1(or1(A)),in1(and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.45/1.05 47 -halfadder(A) | connection(out1(and2(A)),in1(not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.45/1.05 48 -halfadder(A) | connection(out1(not1(A)),in2(and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.45/1.05 49 halfadder(h2(f)). [resolve(3,a,2,a)].
% 0.45/1.05 50 connection(in1(f),in1(h2(f))). [resolve(5,a,2,a)].
% 0.45/1.05 51 -connection(A,B) | -zero(A) | zero(B) # label(value_propagation_zero1) # label(axiom). [assumption].
% 0.45/1.05 52 -connection(A,B) | -one(A) | one(B) # label(value_propagation_one1) # label(axiom). [assumption].
% 0.45/1.05 53 -connection(A,B) | -zero(B) | zero(A) # label(value_propagation_zero2) # label(axiom). [assumption].
% 0.45/1.05 54 -connection(A,B) | -one(B) | one(A) # label(value_propagation_one2) # label(axiom). [assumption].
% 0.45/1.05 55 connection(in2(f),in1(h1(f))). [resolve(6,a,2,a)].
% 0.45/1.05 56 connection(inc(f),in2(h1(f))). [resolve(7,a,2,a)].
% 0.45/1.05 57 connection(outs(f),outs(h2(f))). [resolve(8,a,2,a)].
% 0.45/1.05 58 connection(outc(f),out1(or1(f))). [resolve(9,a,2,a)].
% 0.45/1.05 59 connection(outs(h1(f)),in2(h2(f))). [resolve(10,a,2,a)].
% 0.45/1.05 61 connection(outc(h2(f)),in1(or1(f))). [resolve(12,a,2,a)].
% 0.45/1.05 63 connection(in2(h1(f)),in2(or1(h1(f)))). [resolve(35,a,41,a)].
% 0.45/1.05 64 connection(in1(h1(f)),in1(and2(h1(f)))). [resolve(35,a,42,a)].
% 0.45/1.05 66 connection(outs(h1(f)),out1(and1(h1(f)))). [resolve(35,a,44,a)].
% 0.45/1.05 68 connection(out1(or1(h1(f))),in1(and1(h1(f)))). [resolve(35,a,46,a)].
% 0.45/1.05 69 connection(out1(and2(h1(f))),in1(not1(h1(f)))). [resolve(35,a,47,a)].
% 0.45/1.05 70 connection(out1(not1(h1(f))),in2(and1(h1(f)))). [resolve(35,a,48,a)].
% 0.45/1.05 73 connection(in1(h2(f)),in1(and2(h2(f)))). [resolve(49,a,42,a)].
% 0.45/1.05 74 connection(in2(h2(f)),in2(and2(h2(f)))). [resolve(49,a,43,a)].
% 0.45/1.05 75 connection(outs(h2(f)),out1(and1(h2(f)))). [resolve(49,a,44,a)].
% 0.45/1.05 76 connection(outc(h2(f)),out1(and2(h2(f)))). [resolve(49,a,45,a)].
% 0.45/1.05 78 connection(out1(and2(h2(f))),in1(not1(h2(f)))). [resolve(49,a,47,a)].
% 0.45/1.05 79 connection(out1(not1(h2(f))),in2(and1(h2(f)))). [resolve(49,a,48,a)].
% 0.45/1.05 80 -one(in1(A)) | one(out1(A)) | -logic_or(A) | abnormal(A). [resolve(23,a,21,b)].
% 0.45/1.05 81 logic_or(or1(f)). [resolve(4,a,2,a)].
% 0.45/1.05 82 -one(in2(A)) | one(out1(A)) | -logic_or(A) | abnormal(A). [resolve(24,a,21,b)].
% 0.45/1.05 87 logic_or(or1(h1(f))). [resolve(35,a,39,a)].
% 0.45/1.05 89 logic_and(and1(h1(f))). [resolve(35,a,36,a)].
% 0.45/1.05 90 -zero(in1(A)) | zero(out1(A)) | -logic_and(A) | abnormal(A). [resolve(15,a,13,b)].
% 0.45/1.05 91 -zero(in2(A)) | zero(out1(A)) | -logic_and(A) | abnormal(A). [resolve(16,a,13,b)].
% 0.45/1.05 94 -one(in1(A)) | -one(in2(A)) | one(out1(A)) | -logic_and(A) | abnormal(A). [resolve(19,a,13,b)].
% 0.45/1.05 96 logic_and(and2(h1(f))). [resolve(35,a,37,a)].
% 0.45/1.05 97 logic_and(and1(h2(f))). [resolve(49,a,36,a)].
% 0.45/1.05 98 logic_and(and2(h2(f))). [resolve(49,a,37,a)].
% 0.45/1.05 99 logic_not(not1(h1(f))). [resolve(35,a,38,a)].
% 0.45/1.05 100 -zero(in1(A)) | one(out1(A)) | -logic_not(A) | abnormal(A). [resolve(31,a,29,b)].
% 0.45/1.05 101 -one(in1(A)) | zero(out1(A)) | -logic_not(A) | abnormal(A). [resolve(32,a,29,b)].
% 0.45/1.05 104 logic_not(not1(h2(f))). [resolve(49,a,38,a)].
% 0.45/1.05 105 one(in1(f)) # label(in1_1) # label(hypothesis). [assumption].
% 0.45/1.05 106 zero(in2(f)) # label(in2_0) # label(hypothesis). [assumption].
% 0.45/1.05 107 one(inc(f)) # label(inc_1) # label(hypothesis). [assumption].
% 0.45/1.05 108 one(outs(f)) # label(outs_1) # label(hypothesis). [assumption].
% 0.45/1.05 109 zero(outc(f)) # label(outc_0) # label(hypothesis). [assumption].
% 0.45/1.05 110 -zero(A) | -one(A) # label(unique_value) # label(axiom). [assumption].
% 0.45/1.05 111 -abnormal(and2(h2(f))) # label(diagnosis_and2) # label(negated_conjecture). [assumption].
% 0.45/1.05 112 -abnormal(or1(h1(f))) # label(diagnosis_or1h1) # label(negated_conjecture). [assumption].
% 0.45/1.05 113 -abnormal(not1(h1(f))) # label(diagnosis_not1h1) # label(negated_conjecture). [assumption].
% 0.45/1.05 114 -abnormal(and2(h1(f))) # label(diagnosis_and2h1) # label(negated_conjecture). [assumption].
% 0.45/1.05 115 -abnormal(and1(h1(f))) # label(diagnosis_and1h1) # label(negated_conjecture). [assumption].
% 0.45/1.05 116 -abnormal(or1(f)) | -abnormal(not1(h2(f))) # label(diagnosis_or1_not1h2) # label(negated_conjecture). [assumption].
% 0.45/1.05 117 -abnormal(or1(f)) | -abnormal(and1(h2(f))) # label(diagnosis_or1_and1h2) # label(negated_conjecture). [assumption].
% 0.45/1.05 119 -one(in1(f)) | one(in1(h2(f))). [resolve(50,a,52,a)].
% 0.45/1.05 120 one(in1(h2(f))). [copy(119),unit_del(a,105)].
% 0.45/1.05 123 -zero(in2(f)) | zero(in1(h1(f))). [resolve(55,a,51,a)].
% 0.45/1.05 124 zero(in1(h1(f))). [copy(123),unit_del(a,106)].
% 0.45/1.05 129 -one(inc(f)) | one(in2(h1(f))). [resolve(56,a,52,a)].
% 0.45/1.05 130 one(in2(h1(f))). [copy(129),unit_del(a,107)].
% 0.45/1.05 136 -zero(outs(h2(f))) | zero(outs(f)). [resolve(57,a,53,a)].
% 0.45/1.05 142 -one(out1(or1(f))) | one(outc(f)). [resolve(58,a,54,a)].
% 0.45/1.05 144 -one(outs(h1(f))) | one(in2(h2(f))). [resolve(59,a,52,a)].
% 0.45/1.05 152 -one(outc(h2(f))) | one(in1(or1(f))). [resolve(61,a,52,a)].
% 0.45/1.05 161 -one(in2(h1(f))) | one(in2(or1(h1(f)))). [resolve(63,a,52,a)].
% 0.45/1.05 162 one(in2(or1(h1(f)))). [copy(161),unit_del(a,130)].
% 0.45/1.05 165 -zero(in1(h1(f))) | zero(in1(and2(h1(f)))). [resolve(64,a,51,a)].
% 0.45/1.05 166 zero(in1(and2(h1(f)))). [copy(165),unit_del(a,124)].
% 0.45/1.05 178 -one(out1(and1(h1(f)))) | one(outs(h1(f))). [resolve(66,a,54,a)].
% 0.45/1.05 184 -one(out1(or1(h1(f)))) | one(in1(and1(h1(f)))). [resolve(68,a,52,a)].
% 0.45/1.05 187 -zero(out1(and2(h1(f)))) | zero(in1(not1(h1(f)))). [resolve(69,a,51,a)].
% 0.45/1.05 192 -one(out1(not1(h1(f)))) | one(in2(and1(h1(f)))). [resolve(70,a,52,a)].
% 0.45/1.05 205 -one(in1(h2(f))) | one(in1(and2(h2(f)))). [resolve(73,a,52,a)].
% 0.45/1.05 206 one(in1(and2(h2(f)))). [copy(205),unit_del(a,120)].
% 0.45/1.05 210 -one(in2(h2(f))) | one(in2(and2(h2(f)))). [resolve(74,a,52,a)].
% 0.45/1.05 216 -zero(out1(and1(h2(f)))) | zero(outs(h2(f))). [resolve(75,a,53,a)].
% 0.45/1.05 221 -one(out1(and2(h2(f)))) | one(outc(h2(f))). [resolve(76,a,54,a)].
% 0.45/1.05 227 -one(out1(and2(h2(f)))) | one(in1(not1(h2(f)))). [resolve(78,a,52,a)].
% 0.45/1.05 230 -zero(out1(not1(h2(f)))) | zero(in2(and1(h2(f)))). [resolve(79,a,51,a)].
% 0.45/1.05 234 -one(in1(or1(f))) | one(out1(or1(f))) | abnormal(or1(f)). [resolve(80,c,81,a)].
% 0.45/1.05 243 -one(in2(or1(h1(f)))) | one(out1(or1(h1(f)))) | abnormal(or1(h1(f))). [resolve(87,a,82,c)].
% 0.45/1.05 244 one(out1(or1(h1(f)))). [copy(243),unit_del(a,162),unit_del(c,112)].
% 0.45/1.05 264 -one(in1(and1(h1(f)))) | -one(in2(and1(h1(f)))) | one(out1(and1(h1(f)))) | abnormal(and1(h1(f))). [resolve(89,a,94,d)].
% 0.45/1.05 265 -one(in1(and1(h1(f)))) | -one(in2(and1(h1(f)))) | one(out1(and1(h1(f)))). [copy(264),unit_del(d,115)].
% 0.45/1.05 268 -zero(in1(and2(h1(f)))) | zero(out1(and2(h1(f)))) | abnormal(and2(h1(f))). [resolve(96,a,90,c)].
% 0.45/1.05 269 zero(out1(and2(h1(f)))). [copy(268),unit_del(a,166),unit_del(c,114)].
% 0.45/1.05 278 -zero(in2(and1(h2(f)))) | zero(out1(and1(h2(f)))) | abnormal(and1(h2(f))). [resolve(97,a,91,c)].
% 0.45/1.05 291 -one(in1(and2(h2(f)))) | -one(in2(and2(h2(f)))) | one(out1(and2(h2(f)))) | abnormal(and2(h2(f))). [resolve(98,a,94,d)].
% 0.45/1.05 292 -one(in2(and2(h2(f)))) | one(out1(and2(h2(f)))). [copy(291),unit_del(a,206),unit_del(d,111)].
% 0.45/1.05 295 -zero(in1(not1(h1(f)))) | one(out1(not1(h1(f)))) | abnormal(not1(h1(f))). [resolve(99,a,100,c)].
% 0.45/1.05 296 -zero(in1(not1(h1(f)))) | one(out1(not1(h1(f)))). [copy(295),unit_del(c,113)].
% 0.45/1.05 304 -one(in1(not1(h2(f)))) | zero(out1(not1(h2(f)))) | abnormal(not1(h2(f))). [resolve(104,a,101,c)].
% 0.45/1.05 307 one(in1(and1(h1(f)))). [back_unit_del(184),unit_del(a,244)].
% 0.45/1.05 308 zero(in1(not1(h1(f)))). [back_unit_del(187),unit_del(a,269)].
% 0.45/1.05 310 -one(in2(and1(h1(f)))) | one(out1(and1(h1(f)))). [back_unit_del(265),unit_del(a,307)].
% 0.45/1.05 311 one(out1(not1(h1(f)))). [back_unit_del(296),unit_del(a,308)].
% 0.45/1.05 313 one(in2(and1(h1(f)))). [back_unit_del(192),unit_del(a,311)].
% 0.45/1.05 314 one(out1(and1(h1(f)))). [back_unit_del(310),unit_del(a,313)].
% 0.45/1.05 315 one(outs(h1(f))). [back_unit_del(178),unit_del(a,314)].
% 0.45/1.05 316 one(in2(h2(f))). [back_unit_del(144),unit_del(a,315)].
% 0.45/1.05 317 one(in2(and2(h2(f)))). [back_unit_del(210),unit_del(a,316)].
% 0.45/1.05 319 one(out1(and2(h2(f)))). [back_unit_del(292),unit_del(a,317)].
% 0.45/1.05 320 one(in1(not1(h2(f)))). [back_unit_del(227),unit_del(a,319)].
% 0.45/1.05 321 one(outc(h2(f))). [back_unit_del(221),unit_del(a,319)].
% 0.45/1.05 322 zero(out1(not1(h2(f)))) | abnormal(not1(h2(f))). [back_unit_del(304),unit_del(a,320)].
% 0.45/1.05 323 one(in1(or1(f))). [back_unit_del(152),unit_del(a,321)].
% 0.45/1.05 324 one(out1(or1(f))) | abnormal(or1(f)). [back_unit_del(234),unit_del(a,323)].
% 0.45/1.05 325 -one(outc(f)). [resolve(110,a,109,a)].
% 0.45/1.05 327 -one(out1(or1(f))). [back_unit_del(142),unit_del(b,325)].
% 0.45/1.05 329 abnormal(or1(f)). [back_unit_del(324),unit_del(a,327)].
% 0.45/1.05 332 -abnormal(and1(h2(f))). [back_unit_del(117),unit_del(a,329)].
% 0.45/1.05 333 -abnormal(not1(h2(f))). [back_unit_del(116),unit_del(a,329)].
% 0.45/1.05 338 -zero(in2(and1(h2(f)))) | zero(out1(and1(h2(f)))). [back_unit_del(278),unit_del(c,332)].
% 0.45/1.05 340 zero(out1(not1(h2(f)))). [back_unit_del(322),unit_del(b,333)].
% 0.45/1.05 347 zero(in2(and1(h2(f)))). [back_unit_del(230),unit_del(a,340)].
% 0.45/1.05 351 zero(out1(and1(h2(f)))). [back_unit_del(338),unit_del(a,347)].
% 0.45/1.05 354 zero(outs(h2(f))). [back_unit_del(216),unit_del(a,351)].
% 0.45/1.05 358 zero(outs(f)). [back_unit_del(136),unit_del(a,354)].
% 0.45/1.05 360 $F. [resolve(358,a,110,a),unit_del(a,108)].
% 0.45/1.05
% 0.45/1.05 % SZS output end Refutation
% 0.45/1.05 ============================== end of proof ==========================
% 0.45/1.05
% 0.45/1.05 ============================== STATISTICS ============================
% 0.45/1.05
% 0.45/1.05 Given=77. Generated=229. Kept=198. proofs=1.
% 0.45/1.05 Usable=77. Sos=23. Demods=0. Limbo=0, Disabled=369. Hints=0.
% 0.45/1.05 Megabytes=0.29.
% 0.45/1.05 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.45/1.05
% 0.45/1.05 ============================== end of statistics =====================
% 0.45/1.05
% 0.45/1.05 ============================== end of search =========================
% 0.45/1.05
% 0.45/1.05 THEOREM PROVED
% 0.45/1.05 % SZS status Unsatisfiable
% 0.45/1.05
% 0.45/1.05 Exiting with 1 proof.
% 0.45/1.05
% 0.45/1.05 Process 26145 exit (max_proofs) Thu Jun 16 20:52:48 2022
% 0.45/1.05 Prover9 interrupted
%------------------------------------------------------------------------------