TSTP Solution File: HWV036-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV036-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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.71s 0.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV036-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 03:12:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/0.99 ============================== Prover9 ===============================
% 0.71/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99 Process 22151 was started by sandbox on n018.cluster.edu,
% 0.71/0.99 Fri Jun 17 03:12:32 2022
% 0.71/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21998_n018.cluster.edu".
% 0.71/0.99 ============================== end of head ===========================
% 0.71/0.99
% 0.71/0.99 ============================== INPUT =================================
% 0.71/0.99
% 0.71/0.99 % Reading from file /tmp/Prover9_21998_n018.cluster.edu
% 0.71/0.99
% 0.71/0.99 set(prolog_style_variables).
% 0.71/0.99 set(auto2).
% 0.71/0.99 % set(auto2) -> set(auto).
% 0.71/0.99 % set(auto) -> set(auto_inference).
% 0.71/0.99 % set(auto) -> set(auto_setup).
% 0.71/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99 % set(auto) -> set(auto_limits).
% 0.71/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99 % set(auto) -> set(auto_denials).
% 0.71/0.99 % set(auto) -> set(auto_process).
% 0.71/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99 % set(auto2) -> assign(stats, some).
% 0.71/0.99 % set(auto2) -> clear(echo_input).
% 0.71/0.99 % set(auto2) -> set(quiet).
% 0.71/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99 % set(auto2) -> clear(print_given).
% 0.71/0.99 assign(lrs_ticks,-1).
% 0.71/0.99 assign(sos_limit,10000).
% 0.71/0.99 assign(order,kbo).
% 0.71/0.99 set(lex_order_vars).
% 0.71/0.99 clear(print_given).
% 0.71/0.99
% 0.71/0.99 % formulas(sos). % not echoed (45 formulas)
% 0.71/0.99
% 0.71/0.99 ============================== end of input ==========================
% 0.71/0.99
% 0.71/0.99 % From the command line: assign(max_seconds, 300).
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99
% 0.71/0.99 % Formulas that are not ordinary clauses:
% 0.71/0.99
% 0.71/0.99 ============================== end of process non-clausal formulas ===
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99
% 0.71/0.99 ============================== PREDICATE ELIMINATION =================
% 0.71/0.99 1 -value(A,B) | -value(A,C) | equal_value(B,C) # label(unique_value) # label(axiom). [assumption].
% 0.71/0.99 2 -equal_value(n0,n1) # label(equal_value1) # label(axiom). [assumption].
% 0.71/0.99 3 -equal_value(n1,n0) # label(equal_value2) # label(axiom). [assumption].
% 0.71/0.99 Derived: -value(A,n0) | -value(A,n1). [resolve(1,c,2,a)].
% 0.71/0.99 4 -type(A,halfadder) | connection(in(n1,A),in(n1,or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.71/0.99 5 -connection(A,B) | -value(A,C) | value(B,C) # label(value_propagation1) # label(axiom). [assumption].
% 0.71/0.99 6 -connection(A,B) | -value(B,C) | value(A,C) # label(value_propagation2) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n1,A),B) | value(in(n1,or1(A)),B). [resolve(4,b,5,a)].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n1,or1(A)),B) | value(in(n1,A),B). [resolve(4,b,6,a)].
% 0.71/0.99 7 -type(A,halfadder) | connection(in(n2,A),in(n2,or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n2,A),B) | value(in(n2,or1(A)),B). [resolve(7,b,5,a)].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n2,or1(A)),B) | value(in(n2,A),B). [resolve(7,b,6,a)].
% 0.71/0.99 8 -type(A,halfadder) | connection(in(n1,A),in(n1,and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n1,A),B) | value(in(n1,and2(A)),B). [resolve(8,b,5,a)].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n1,and2(A)),B) | value(in(n1,A),B). [resolve(8,b,6,a)].
% 0.71/0.99 9 -type(A,halfadder) | connection(in(n2,A),in(n2,and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n2,A),B) | value(in(n2,and2(A)),B). [resolve(9,b,5,a)].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n2,and2(A)),B) | value(in(n2,A),B). [resolve(9,b,6,a)].
% 0.71/0.99 10 -type(A,halfadder) | connection(out(s,A),out(n1,and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(out(s,A),B) | value(out(n1,and1(A)),B). [resolve(10,b,5,a)].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(out(n1,and1(A)),B) | value(out(s,A),B). [resolve(10,b,6,a)].
% 0.71/0.99 11 -type(A,halfadder) | connection(out(c,A),out(n1,and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(out(c,A),B) | value(out(n1,and2(A)),B). [resolve(11,b,5,a)].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(out(c,A),B). [resolve(11,b,6,a)].
% 0.71/0.99 12 -type(A,fulladder) | connection(in(n1,A),in(n1,h2(A))) # label(fulladder_connection_in1_in1h2) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(in(n1,A),B) | value(in(n1,h2(A)),B). [resolve(12,b,5,a)].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(in(n1,h2(A)),B) | value(in(n1,A),B). [resolve(12,b,6,a)].
% 0.71/0.99 13 -type(A,fulladder) | connection(in(n2,A),in(n1,h1(A))) # label(fulladder_connection_in2_in1h1) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(in(n2,A),B) | value(in(n1,h1(A)),B). [resolve(13,b,5,a)].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(in(n1,h1(A)),B) | value(in(n2,A),B). [resolve(13,b,6,a)].
% 0.71/0.99 14 -type(A,fulladder) | connection(in(c,A),in(n2,h1(A))) # label(fulladder_connection_inc_in2h1) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(in(c,A),B) | value(in(n2,h1(A)),B). [resolve(14,b,5,a)].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(in(n2,h1(A)),B) | value(in(c,A),B). [resolve(14,b,6,a)].
% 0.71/0.99 15 -type(A,fulladder) | connection(out(s,A),out(s,h2(A))) # label(fulladder_connection_outs_outsh2) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(out(s,A),B) | value(out(s,h2(A)),B). [resolve(15,b,5,a)].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(out(s,h2(A)),B) | value(out(s,A),B). [resolve(15,b,6,a)].
% 0.71/0.99 16 -type(A,fulladder) | connection(out(c,A),out(n1,or1(A))) # label(fulladder_connection_outc_out1or1) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(out(c,A),B) | value(out(n1,or1(A)),B). [resolve(16,b,5,a)].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(out(n1,or1(A)),B) | value(out(c,A),B). [resolve(16,b,6,a)].
% 0.71/0.99 17 -type(A,halfadder) | connection(out(n1,or1(A)),in(n1,and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(out(n1,or1(A)),B) | value(in(n1,and1(A)),B). [resolve(17,b,5,a)].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n1,and1(A)),B) | value(out(n1,or1(A)),B). [resolve(17,b,6,a)].
% 0.71/0.99 18 -type(A,halfadder) | connection(out(n1,and2(A)),in(n1,not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(in(n1,not1(A)),B). [resolve(18,b,5,a)].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n1,not1(A)),B) | value(out(n1,and2(A)),B). [resolve(18,b,6,a)].
% 0.71/0.99 19 -type(A,halfadder) | connection(out(n1,not1(A)),in(n2,and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(out(n1,not1(A)),B) | value(in(n2,and1(A)),B). [resolve(19,b,5,a)].
% 0.71/0.99 Derived: -type(A,halfadder) | -value(in(n2,and1(A)),B) | value(out(n1,not1(A)),B). [resolve(19,b,6,a)].
% 0.71/0.99 20 -type(A,fulladder) | connection(out(s,h1(A)),in(n2,h2(A))) # label(fulladder_connection_outsh1_in2h2) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(out(s,h1(A)),B) | value(in(n2,h2(A)),B). [resolve(20,b,5,a)].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(in(n2,h2(A)),B) | value(out(s,h1(A)),B). [resolve(20,b,6,a)].
% 0.71/0.99 21 -type(A,fulladder) | connection(out(c,h1(A)),in(n2,or1(A))) # label(fulladder_connection_outch1_in2or1) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(out(c,h1(A)),B) | value(in(n2,or1(A)),B). [resolve(21,b,5,a)].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(in(n2,or1(A)),B) | value(out(c,h1(A)),B). [resolve(21,b,6,a)].
% 0.71/0.99 22 -type(A,fulladder) | connection(out(c,h2(A)),in(n1,or1(A))) # label(fulladder_connection_outch2_in1or1) # label(axiom). [assumption].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(out(c,h2(A)),B) | value(in(n1,or1(A)),B). [resolve(22,b,5,a)].
% 0.71/0.99 Derived: -type(A,fulladder) | -value(in(n1,or1(A)),B) | value(out(c,h2(A)),B). [resolve(22,b,6,a)].
% 0.71/0.99
% 0.71/0.99 ============================== end predicate elimination =============
% 0.71/0.99
% 0.71/0.99 Auto_denials: (non-Horn, no changes).
% 0.71/0.99
% 0.71/0.99 Term ordering decisions:
% 0.71/0.99 Function symbol KB weights: n1=1. halfadder=1. n2=1. fulladder=1. n0=1. ok=1. c=1. s=1. and=1. or=1. not=1. abnormal=1. in=1. out=1. or1=1. and2=1. h1=1. h2=1. and1=1. not1=1.
% 0.71/0.99
% 0.71/0.99 ============================== end of process initial clauses ========
% 0.71/0.99
% 0.71/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.99
% 0.71/0.99 ============================== end of clauses for search =============
% 0.71/0.99
% 0.71/0.99 ============================== SEARCH ================================
% 0.71/0.99
% 0.71/0.99 % Starting search at 0.02 seconds.
% 0.71/0.99
% 0.71/0.99 ============================== STATISTICS ============================
% 0.71/0.99
% 0.71/0.99 Given=58. Generated=58. Kept=58. proofs=0.
% 0.71/0.99 Usable=58. Sos=0. Demods=0. Limbo=0, Disabled=80. Hints=0.
% 0.71/0.99 Megabytes=0.13.
% 0.71/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.71/0.99
% 0.71/0.99 ============================== end of statistics =====================
% 0.71/0.99
% 0.71/0.99 ============================== end of search =========================
% 0.71/0.99
% 0.71/0.99 SEARCH FAILED
% 0.71/0.99
% 0.71/0.99 Exiting with failure.
% 0.71/0.99
% 0.71/0.99 Process 22151 exit (sos_empty) Fri Jun 17 03:12:32 2022
% 0.71/0.99 Prover9 interrupted
%------------------------------------------------------------------------------