TSTP Solution File: HWV036-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV036-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:28 EDT 2022
% Result : Unknown 0.80s 1.08s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : HWV036-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Fri Jun 17 07:19:07 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.80/1.08 ============================== Prover9 ===============================
% 0.80/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.08 Process 14650 was started by sandbox on n011.cluster.edu,
% 0.80/1.08 Fri Jun 17 07:19:07 2022
% 0.80/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14497_n011.cluster.edu".
% 0.80/1.08 ============================== end of head ===========================
% 0.80/1.08
% 0.80/1.08 ============================== INPUT =================================
% 0.80/1.08
% 0.80/1.08 % Reading from file /tmp/Prover9_14497_n011.cluster.edu
% 0.80/1.08
% 0.80/1.08 set(prolog_style_variables).
% 0.80/1.08 set(auto2).
% 0.80/1.08 % set(auto2) -> set(auto).
% 0.80/1.08 % set(auto) -> set(auto_inference).
% 0.80/1.08 % set(auto) -> set(auto_setup).
% 0.80/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.08 % set(auto) -> set(auto_limits).
% 0.80/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.08 % set(auto) -> set(auto_denials).
% 0.80/1.08 % set(auto) -> set(auto_process).
% 0.80/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.08 % set(auto2) -> assign(stats, some).
% 0.80/1.08 % set(auto2) -> clear(echo_input).
% 0.80/1.08 % set(auto2) -> set(quiet).
% 0.80/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.08 % set(auto2) -> clear(print_given).
% 0.80/1.08 assign(lrs_ticks,-1).
% 0.80/1.08 assign(sos_limit,10000).
% 0.80/1.08 assign(order,kbo).
% 0.80/1.08 set(lex_order_vars).
% 0.80/1.08 clear(print_given).
% 0.80/1.08
% 0.80/1.08 % formulas(sos). % not echoed (51 formulas)
% 0.80/1.08
% 0.80/1.08 ============================== end of input ==========================
% 0.80/1.08
% 0.80/1.08 % From the command line: assign(max_seconds, 300).
% 0.80/1.08
% 0.80/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.08
% 0.80/1.08 % Formulas that are not ordinary clauses:
% 0.80/1.08
% 0.80/1.08 ============================== end of process non-clausal formulas ===
% 0.80/1.08
% 0.80/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.08
% 0.80/1.08 ============================== PREDICATE ELIMINATION =================
% 0.80/1.08 1 -logic_and(A) | and_ok(A) | abnormal(A) # label(and_ok_or_abnormal) # label(axiom). [assumption].
% 0.80/1.08 2 -and_ok(A) | -abnormal(A) # label(not_and_ok_and_abnormal) # label(axiom). [assumption].
% 0.80/1.08 3 -and_ok(A) | -zero(in1(A)) | zero(out1(A)) # label(and_0x_0) # label(axiom). [assumption].
% 0.80/1.08 Derived: -zero(in1(A)) | zero(out1(A)) | -logic_and(A) | abnormal(A). [resolve(3,a,1,b)].
% 0.80/1.08 4 -and_ok(A) | -zero(in2(A)) | zero(out1(A)) # label(and_x0_0) # label(axiom). [assumption].
% 0.80/1.08 Derived: -zero(in2(A)) | zero(out1(A)) | -logic_and(A) | abnormal(A). [resolve(4,a,1,b)].
% 0.80/1.08 5 -and_ok(A) | -one(out1(A)) | one(in1(A)) # label(and_1_1x) # label(axiom). [assumption].
% 0.80/1.08 Derived: -one(out1(A)) | one(in1(A)) | -logic_and(A) | abnormal(A). [resolve(5,a,1,b)].
% 0.80/1.08 6 -and_ok(A) | -one(out1(A)) | one(in2(A)) # label(and_1_x1) # label(axiom). [assumption].
% 0.80/1.08 Derived: -one(out1(A)) | one(in2(A)) | -logic_and(A) | abnormal(A). [resolve(6,a,1,b)].
% 0.80/1.08 7 -and_ok(A) | -one(in1(A)) | -one(in2(A)) | one(out1(A)) # label(and_11_1) # label(axiom). [assumption].
% 0.80/1.08 Derived: -one(in1(A)) | -one(in2(A)) | one(out1(A)) | -logic_and(A) | abnormal(A). [resolve(7,a,1,b)].
% 0.80/1.08 8 -and_ok(A) | -zero(out1(A)) | zero(in1(A)) | zero(in2(A)) # label(and_0_00) # label(axiom). [assumption].
% 0.80/1.08 Derived: -zero(out1(A)) | zero(in1(A)) | zero(in2(A)) | -logic_and(A) | abnormal(A). [resolve(8,a,1,b)].
% 0.80/1.08 9 -logic_or(A) | or_ok(A) | abnormal(A) # label(or_ok_or_abnormal) # label(axiom). [assumption].
% 0.80/1.08 10 -or_ok(A) | -abnormal(A) # label(not_or_ok_and_abnormal) # label(axiom). [assumption].
% 0.80/1.08 11 -or_ok(A) | -one(in1(A)) | one(out1(A)) # label(or_1x_1) # label(axiom). [assumption].
% 0.80/1.08 Derived: -one(in1(A)) | one(out1(A)) | -logic_or(A) | abnormal(A). [resolve(11,a,9,b)].
% 0.80/1.08 12 -or_ok(A) | -one(in2(A)) | one(out1(A)) # label(or_x1_1) # label(axiom). [assumption].
% 0.80/1.08 Derived: -one(in2(A)) | one(out1(A)) | -logic_or(A) | abnormal(A). [resolve(12,a,9,b)].
% 0.80/1.08 13 -or_ok(A) | -zero(out1(A)) | zero(in1(A)) # label(or_0_0x) # label(axiom). [assumption].
% 0.80/1.08 Derived: -zero(out1(A)) | zero(in1(A)) | -logic_or(A) | abnormal(A). [resolve(13,a,9,b)].
% 0.80/1.08 14 -or_ok(A) | -zero(out1(A)) | zero(in2(A)) # label(or_0_01) # label(axiom). [assumption].
% 0.80/1.08 Derived: -zero(out1(A)) | zero(in2(A)) | -logic_or(A) | abnormal(A). [resolve(14,a,9,b)].
% 0.80/1.08 15 -or_ok(A) | -zero(in1(A)) | -zero(in2(A)) | zero(out1(A)) # label(or_00_0) # label(axiom). [assumption].
% 0.80/1.08 Derived: -zero(in1(A)) | -zero(in2(A)) | zero(out1(A)) | -logic_or(A) | abnormal(A). [resolve(15,a,9,b)].
% 0.80/1.08 16 -or_ok(A) | -one(out1(A)) | one(in1(A)) | one(in2(A)) # label(or_1_11) # label(axiom). [assumption].
% 0.80/1.08 Derived: -one(out1(A)) | one(in1(A)) | one(in2(A)) | -logic_or(A) | abnormal(A). [resolve(16,a,9,b)].
% 0.80/1.08 17 -logic_not(A) | not_ok(A) | abnormal(A) # label(not_ok_or_abnormal) # label(axiom). [assumption].
% 0.80/1.08 18 -not_ok(A) | -abnormal(A) # label(not__not_ok_and_abnormal) # label(axiom). [assumption].
% 0.80/1.08 19 -not_ok(A) | -zero(in1(A)) | one(out1(A)) # label(not_0_1_fw) # label(axiom). [assumption].
% 0.80/1.08 Derived: -zero(in1(A)) | one(out1(A)) | -logic_not(A) | abnormal(A). [resolve(19,a,17,b)].
% 0.80/1.08 20 -not_ok(A) | -one(in1(A)) | zero(out1(A)) # label(not_1_0_fw) # label(axiom). [assumption].
% 0.80/1.08 Derived: -one(in1(A)) | zero(out1(A)) | -logic_not(A) | abnormal(A). [resolve(20,a,17,b)].
% 0.80/1.08 21 -not_ok(A) | -zero(out1(A)) | one(in1(A)) # label(not_0_1_bw) # label(axiom). [assumption].
% 0.80/1.08 Derived: -zero(out1(A)) | one(in1(A)) | -logic_not(A) | abnormal(A). [resolve(21,a,17,b)].
% 0.80/1.08 22 -not_ok(A) | -one(out1(A)) | zero(in1(A)) # label(not_1_0_bw) # label(axiom). [assumption].
% 0.80/1.08 Derived: -one(out1(A)) | zero(in1(A)) | -logic_not(A) | abnormal(A). [resolve(22,a,17,b)].
% 0.80/1.08 23 -fulladder(A) | halfadder(h1(A)) # label(fulladder_halfadder1) # label(axiom). [assumption].
% 0.80/1.08 24 -halfadder(A) | logic_and(and1(A)) # label(halfadder_and1) # label(axiom). [assumption].
% 0.80/1.08 25 -halfadder(A) | logic_and(and2(A)) # label(halfadder_and2) # label(axiom). [assumption].
% 0.80/1.08 26 -halfadder(A) | logic_not(not1(A)) # label(halfadder_not1) # label(axiom). [assumption].
% 0.80/1.08 27 -halfadder(A) | logic_or(or1(A)) # label(halfadder_or1) # label(axiom). [assumption].
% 0.80/1.08 Derived: -fulladder(A) | logic_and(and1(h1(A))). [resolve(23,b,24,a)].
% 0.80/1.08 Derived: -fulladder(A) | logic_and(and2(h1(A))). [resolve(23,b,25,a)].
% 0.80/1.08 Derived: -fulladder(A) | logic_not(not1(h1(A))). [resolve(23,b,26,a)].
% 0.80/1.08 Derived: -fulladder(A) | logic_or(or1(h1(A))). [resolve(23,b,27,a)].
% 0.80/1.08 28 -fulladder(A) | halfadder(h2(A)) # label(fulladder_halfadder2) # label(axiom). [assumption].
% 0.80/1.08 Derived: -fulladder(A) | logic_and(and1(h2(A))). [resolve(28,b,24,a)].
% 0.80/1.08 Derived: -fulladder(A) | logic_and(and2(h2(A))). [resolve(28,b,25,a)].
% 0.80/1.08 Derived: -fulladder(A) | logic_not(not1(h2(A))). [resolve(28,b,26,a)].
% 0.80/1.08 Derived: -fulladder(A) | logic_or(or1(h2(A))). [resolve(28,b,27,a)].
% 0.80/1.08 29 -halfadder(A) | connection(in1(A),in1(or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.80/1.08 Derived: connection(in1(h1(A)),in1(or1(h1(A)))) | -fulladder(A). [resolve(29,a,23,b)].
% 0.80/1.08 Derived: connection(in1(h2(A)),in1(or1(h2(A)))) | -fulladder(A). [resolve(29,a,28,b)].
% 0.80/1.08 30 -halfadder(A) | connection(in2(A),in2(or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.80/1.08 Derived: connection(in2(h1(A)),in2(or1(h1(A)))) | -fulladder(A). [resolve(30,a,23,b)].
% 0.80/1.08 Derived: connection(in2(h2(A)),in2(or1(h2(A)))) | -fulladder(A). [resolve(30,a,28,b)].
% 0.80/1.08 31 -halfadder(A) | connection(in1(A),in1(and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.80/1.08 Derived: connection(in1(h1(A)),in1(and2(h1(A)))) | -fulladder(A). [resolve(31,a,23,b)].
% 0.80/1.08 Derived: connection(in1(h2(A)),in1(and2(h2(A)))) | -fulladder(A). [resolve(31,a,28,b)].
% 0.80/1.08 32 -halfadder(A) | connection(in2(A),in2(and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.80/1.08 Derived: connection(in2(h1(A)),in2(and2(h1(A)))) | -fulladder(A). [resolve(32,a,23,b)].
% 0.80/1.08 Derived: connection(in2(h2(A)),in2(and2(h2(A)))) | -fulladder(A). [resolve(32,a,28,b)].
% 0.80/1.08 33 -halfadder(A) | connection(outs(A),out1(and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.80/1.08 Derived: connection(outs(h1(A)),out1(and1(h1(A)))) | -fulladder(A). [resolve(33,a,23,b)].
% 0.80/1.08 Derived: connection(outs(h2(A)),out1(and1(h2(A)))) | -fulladder(A). [resolve(33,a,28,b)].
% 0.80/1.08 34 -halfadder(A) | connection(outc(A),out1(and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.80/1.08 Derived: connection(outc(h1(A)),out1(and2(h1(A)))) | -fulladder(A). [resolve(34,a,23,b)].
% 0.80/1.08 Derived: connection(outc(h2(A)),out1(and2(h2(A)))) | -fulladder(A). [resolve(34,a,28,b)].
% 0.80/1.08 35 -halfadder(A) | connection(out1(or1(A)),in1(and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.80/1.08 Derived: connection(out1(or1(h1(A))),in1(and1(h1(A)))) | -fulladder(A). [resolve(35,a,23,b)].
% 0.80/1.08 Derived: connection(out1(or1(h2(A))),in1(and1(h2(A)))) | -fulladder(A). [resolve(35,a,28,b)].
% 0.80/1.08 36 -halfadder(A) | connection(out1(and2(A)),in1(not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.80/1.08 Derived: connection(out1(and2(h1(A))),in1(not1(h1(A)))) | -fulladder(A). [resolve(36,a,23,b)].
% 0.80/1.08 Derived: connection(out1(and2(h2(A))),in1(not1(h2(A)))) | -fulladder(A). [resolve(36,a,28,b)].
% 0.80/1.08 37 -halfadder(A) | connection(out1(not1(A)),in2(and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.80/1.08 Derived: connection(out1(not1(h1(A))),in2(and1(h1(A)))) | -fulladder(A). [resolve(37,a,23,b)].
% 0.80/1.08 Derived: connection(out1(not1(h2(A))),in2(and1(h2(A)))) | -fulladder(A). [resolve(37,a,28,b)].
% 0.80/1.08 38 -one(in1(A)) | zero(out1(A)) | -logic_not(A) | abnormal(A). [resolve(20,a,17,b)].
% 0.80/1.08 39 -zero(A) | -one(A) # label(unique_value) # label(axiom). [assumption].
% 0.80/1.08 40 -zero(in1(A)) | one(out1(A)) | -logic_not(A) | abnormal(A). [resolve(19,a,17,b)].
% 0.80/1.08 Derived: -one(in1(A)) | -logic_not(A) | abnormal(A) | -one(out1(A)). [resolve(38,b,39,a)].
% 0.80/1.08 41 -zero(out1(A)) | one(in1(A)) | -logic_not(A) | abnormal(A). [resolve(21,a,17,b)].
% 0.80/1.08 42 -one(out1(A)) | zero(in1(A)) | -logic_not(A) | abnormal(A). [resolve(22,a,17,b)].
% 0.80/1.08
% 0.80/1.08 ============================== end predicate elimination =============
% 0.80/1.08
% 0.80/1.08 Auto_denials: (no changes).
% 0.80/1.08
% 0.80/1.08 Term ordering decisions:
% 0.80/1.08 Function symbol KB weights:
% 0.80/1.08
% 0.80/1.08 ============================== end of process initial clauses ========
% 0.80/1.08
% 0.80/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.08
% 0.80/1.08 ============================== end of clauses for search =============
% 0.80/1.08
% 0.80/1.08 ============================== SEARCH ================================
% 0.80/1.08
% 0.80/1.08 % Starting search at 0.01 seconds.
% 0.80/1.08
% 0.80/1.08 ============================== STATISTICS ============================
% 0.80/1.08
% 0.80/1.08 Given=0. Generated=0. Kept=0. proofs=0.
% 0.80/1.08 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=94. Hints=0.
% 0.80/1.08 Megabytes=0.05.
% 0.80/1.08 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.80/1.08
% 0.80/1.08 ============================== end of statistics =====================
% 0.80/1.08
% 0.80/1.08 ============================== end of search =========================
% 0.80/1.08
% 0.80/1.08 SEARCH FAILED
% 0.80/1.08
% 0.80/1.08 Exiting with failure.
% 0.80/1.08
% 0.80/1.08 Process 14650 exit (sos_empty) Fri Jun 17 07:19:07 2022
% 0.80/1.08 Prover9 interrupted
%------------------------------------------------------------------------------