TSTP Solution File: HWV005-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV005-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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.81s 1.09s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : HWV005-1 : TPTP v8.1.0. Released v2.1.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 23:21:30 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.81/1.08 ============================== Prover9 ===============================
% 0.81/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.08 Process 2632 was started by sandbox2 on n021.cluster.edu,
% 0.81/1.08 Thu Jun 16 23:21:31 2022
% 0.81/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2478_n021.cluster.edu".
% 0.81/1.08 ============================== end of head ===========================
% 0.81/1.08
% 0.81/1.08 ============================== INPUT =================================
% 0.81/1.08
% 0.81/1.08 % Reading from file /tmp/Prover9_2478_n021.cluster.edu
% 0.81/1.08
% 0.81/1.08 set(prolog_style_variables).
% 0.81/1.08 set(auto2).
% 0.81/1.08 % set(auto2) -> set(auto).
% 0.81/1.08 % set(auto) -> set(auto_inference).
% 0.81/1.08 % set(auto) -> set(auto_setup).
% 0.81/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.08 % set(auto) -> set(auto_limits).
% 0.81/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.08 % set(auto) -> set(auto_denials).
% 0.81/1.08 % set(auto) -> set(auto_process).
% 0.81/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.08 % set(auto2) -> assign(stats, some).
% 0.81/1.08 % set(auto2) -> clear(echo_input).
% 0.81/1.08 % set(auto2) -> set(quiet).
% 0.81/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.08 % set(auto2) -> clear(print_given).
% 0.81/1.08 assign(lrs_ticks,-1).
% 0.81/1.08 assign(sos_limit,10000).
% 0.81/1.08 assign(order,kbo).
% 0.81/1.08 set(lex_order_vars).
% 0.81/1.08 clear(print_given).
% 0.81/1.08
% 0.81/1.08 % formulas(sos). % not echoed (42 formulas)
% 0.81/1.08
% 0.81/1.08 ============================== end of input ==========================
% 0.81/1.08
% 0.81/1.08 % From the command line: assign(max_seconds, 300).
% 0.81/1.08
% 0.81/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.08
% 0.81/1.08 % Formulas that are not ordinary clauses:
% 0.81/1.08
% 0.81/1.08 ============================== end of process non-clausal formulas ===
% 0.81/1.08
% 0.81/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.08
% 0.81/1.08 ============================== PREDICATE ELIMINATION =================
% 0.81/1.08 1 -value(A,B) | -value(A,C) | equal_value(B,C) # label(unique_value) # label(axiom). [assumption].
% 0.81/1.08 2 -equal_value(n0,n1) # label(equal_value1) # label(axiom). [assumption].
% 0.81/1.08 3 -equal_value(n1,n0) # label(equal_value2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -value(A,n0) | -value(A,n1). [resolve(1,c,2,a)].
% 0.81/1.08 4 -type(A,halfadder) | connection(in(n1,A),in(n1,or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.81/1.08 5 -connection(A,B) | -value(A,C) | value(B,C) # label(value_propagation1) # label(axiom). [assumption].
% 0.81/1.08 6 -connection(A,B) | -value(B,C) | value(A,C) # label(value_propagation2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n1,A),B) | value(in(n1,or1(A)),B). [resolve(4,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n1,or1(A)),B) | value(in(n1,A),B). [resolve(4,b,6,a)].
% 0.81/1.08 7 -type(A,halfadder) | connection(in(n2,A),in(n2,or1(A))) # label(halfadder_connection_in2_in2or1) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n2,A),B) | value(in(n2,or1(A)),B). [resolve(7,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n2,or1(A)),B) | value(in(n2,A),B). [resolve(7,b,6,a)].
% 0.81/1.08 8 -type(A,halfadder) | connection(in(n1,A),in(n1,and2(A))) # label(halfadder_connection_in1_in1and2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n1,A),B) | value(in(n1,and2(A)),B). [resolve(8,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n1,and2(A)),B) | value(in(n1,A),B). [resolve(8,b,6,a)].
% 0.81/1.08 9 -type(A,halfadder) | connection(in(n2,A),in(n2,and2(A))) # label(halfadder_connection_in2_in2and2) # label(axiom). [assumption].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n2,A),B) | value(in(n2,and2(A)),B). [resolve(9,b,5,a)].
% 0.81/1.08 Derived: -type(A,halfadder) | -value(in(n2,and2(A)),B) | value(in(n2,A),B). [resolve(9,b,6,a)].
% 0.81/1.09 10 -type(A,halfadder) | connection(out(s,A),out(n1,and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.81/1.09 Derived: -type(A,halfadder) | -value(out(s,A),B) | value(out(n1,and1(A)),B). [resolve(10,b,5,a)].
% 0.81/1.09 Derived: -type(A,halfadder) | -value(out(n1,and1(A)),B) | value(out(s,A),B). [resolve(10,b,6,a)].
% 0.81/1.09 11 -type(A,halfadder) | connection(out(c,A),out(n1,and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.81/1.09 Derived: -type(A,halfadder) | -value(out(c,A),B) | value(out(n1,and2(A)),B). [resolve(11,b,5,a)].
% 0.81/1.09 Derived: -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(out(c,A),B). [resolve(11,b,6,a)].
% 0.81/1.09 12 -type(A,halfadder) | connection(out(n1,or1(A)),in(n1,and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.81/1.09 Derived: -type(A,halfadder) | -value(out(n1,or1(A)),B) | value(in(n1,and1(A)),B). [resolve(12,b,5,a)].
% 0.81/1.09 Derived: -type(A,halfadder) | -value(in(n1,and1(A)),B) | value(out(n1,or1(A)),B). [resolve(12,b,6,a)].
% 0.81/1.09 13 -type(A,halfadder) | connection(out(n1,and2(A)),in(n1,not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.81/1.09 Derived: -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(in(n1,not1(A)),B). [resolve(13,b,5,a)].
% 0.81/1.09 Derived: -type(A,halfadder) | -value(in(n1,not1(A)),B) | value(out(n1,and2(A)),B). [resolve(13,b,6,a)].
% 0.81/1.09 14 -type(A,halfadder) | connection(out(n1,not1(A)),in(n2,and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.81/1.09 Derived: -type(A,halfadder) | -value(out(n1,not1(A)),B) | value(in(n2,and1(A)),B). [resolve(14,b,5,a)].
% 0.81/1.09 Derived: -type(A,halfadder) | -value(in(n2,and1(A)),B) | value(out(n1,not1(A)),B). [resolve(14,b,6,a)].
% 0.81/1.09
% 0.81/1.09 ============================== end predicate elimination =============
% 0.81/1.09
% 0.81/1.09 Auto_denials: (non-Horn, no changes).
% 0.81/1.09
% 0.81/1.09 Term ordering decisions:
% 0.81/1.09 Function symbol KB weights: n1=1. halfadder=1. n0=1. n2=1. ok=1. and=1. or=1. h=1. not=1. c=1. s=1. abnormal=1. in=1. out=1. and2=1. and1=1. or1=1. not1=1.
% 0.81/1.09
% 0.81/1.09 ============================== end of process initial clauses ========
% 0.81/1.09
% 0.81/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.09
% 0.81/1.09 ============================== end of clauses for search =============
% 0.81/1.09
% 0.81/1.09 ============================== SEARCH ================================
% 0.81/1.09
% 0.81/1.09 % Starting search at 0.02 seconds.
% 0.81/1.09
% 0.81/1.09 ============================== PROOF =================================
% 0.81/1.09 % SZS status Unsatisfiable
% 0.81/1.09 % SZS output start Refutation
% 0.81/1.09
% 0.81/1.09 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.81/1.09 % Length of proof is 50.
% 0.81/1.09 % Level of proof is 9.
% 0.81/1.09 % Maximum clause weight is 21.000.
% 0.81/1.09 % Given clauses 79.
% 0.81/1.09
% 0.81/1.09 1 -value(A,B) | -value(A,C) | equal_value(B,C) # label(unique_value) # label(axiom). [assumption].
% 0.81/1.09 2 -equal_value(n0,n1) # label(equal_value1) # label(axiom). [assumption].
% 0.81/1.09 4 -type(A,halfadder) | connection(in(n1,A),in(n1,or1(A))) # label(halfadder_connection_in1_in1or1) # label(axiom). [assumption].
% 0.81/1.09 5 -connection(A,B) | -value(A,C) | value(B,C) # label(value_propagation1) # label(axiom). [assumption].
% 0.81/1.09 6 -connection(A,B) | -value(B,C) | value(A,C) # label(value_propagation2) # label(axiom). [assumption].
% 0.81/1.09 10 -type(A,halfadder) | connection(out(s,A),out(n1,and1(A))) # label(halfadder_connection_outs_out1and1) # label(axiom). [assumption].
% 0.81/1.09 11 -type(A,halfadder) | connection(out(c,A),out(n1,and2(A))) # label(halfadder_connection_outc_out1and2) # label(axiom). [assumption].
% 0.81/1.09 12 -type(A,halfadder) | connection(out(n1,or1(A)),in(n1,and1(A))) # label(halfadder_connection_out1or1_in1_and1) # label(axiom). [assumption].
% 0.81/1.09 13 -type(A,halfadder) | connection(out(n1,and2(A)),in(n1,not1(A))) # label(halfadder_connection_out1and2_in1not1) # label(axiom). [assumption].
% 0.81/1.09 14 -type(A,halfadder) | connection(out(n1,not1(A)),in(n2,and1(A))) # label(halfadder_connection_out1not1_in2and1) # label(axiom). [assumption].
% 0.81/1.09 15 type(h,halfadder) # label(h_isa_halfadder) # label(hypothesis). [assumption].
% 0.81/1.09 16 value(in(n1,h),n1) # label(in1_1) # label(hypothesis). [assumption].
% 0.81/1.09 18 value(out(s,h),n0) # label(outs_0) # label(hypothesis). [assumption].
% 0.81/1.09 19 value(out(c,h),n0) # label(outc_0) # label(hypothesis). [assumption].
% 0.81/1.09 20 -mode(and1(h),abnormal) # label(diagnosis_and1) # label(negated_conjecture). [assumption].
% 0.81/1.09 21 -mode(not1(h),abnormal) # label(diagnosis_not1) # label(negated_conjecture). [assumption].
% 0.81/1.09 22 -mode(or1(h),abnormal) # label(diagnosis_or1) # label(negated_conjecture). [assumption].
% 0.81/1.09 24 -type(A,halfadder) | type(and1(A),and) # label(halfadder_and1) # label(axiom). [assumption].
% 0.81/1.09 26 -type(A,halfadder) | type(not1(A),not) # label(halfadder_not1) # label(axiom). [assumption].
% 0.81/1.09 27 -type(A,halfadder) | type(or1(A),or) # label(halfadder_or1) # label(axiom). [assumption].
% 0.81/1.09 28 -type(A,B) | mode(A,ok) | mode(A,abnormal) # label(ok_or_abnormal) # label(axiom). [assumption].
% 0.81/1.09 33 -mode(A,ok) | -type(A,or) | -value(out(n1,A),n0) | value(in(n1,A),n0) # label(or_0_0x) # label(axiom). [assumption].
% 0.81/1.09 37 -mode(A,ok) | -type(A,not) | -value(out(n1,A),n0) | value(in(n1,A),n1) # label(not_0_1_bw) # label(axiom). [assumption].
% 0.81/1.09 40 -mode(A,ok) | -type(A,and) | -value(out(n1,A),n0) | value(in(n1,A),n0) | value(in(n2,A),n0) # label(and_0_00) # label(axiom). [assumption].
% 0.81/1.09 43 -value(A,n0) | -value(A,n1). [resolve(1,c,2,a)].
% 0.81/1.09 45 -type(A,halfadder) | -value(in(n1,or1(A)),B) | value(in(n1,A),B). [resolve(4,b,6,a)].
% 0.81/1.09 52 -type(A,halfadder) | -value(out(s,A),B) | value(out(n1,and1(A)),B). [resolve(10,b,5,a)].
% 0.81/1.09 55 -type(A,halfadder) | -value(out(n1,and2(A)),B) | value(out(c,A),B). [resolve(11,b,6,a)].
% 0.81/1.09 57 -type(A,halfadder) | -value(in(n1,and1(A)),B) | value(out(n1,or1(A)),B). [resolve(12,b,6,a)].
% 0.81/1.09 59 -type(A,halfadder) | -value(in(n1,not1(A)),B) | value(out(n1,and2(A)),B). [resolve(13,b,6,a)].
% 0.81/1.09 61 -type(A,halfadder) | -value(in(n2,and1(A)),B) | value(out(n1,not1(A)),B). [resolve(14,b,6,a)].
% 0.81/1.09 62 type(and1(h),and). [resolve(24,a,15,a)].
% 0.81/1.09 64 type(not1(h),not). [resolve(26,a,15,a)].
% 0.81/1.09 65 type(or1(h),or). [resolve(27,a,15,a)].
% 0.81/1.09 67 -value(out(c,h),n1). [resolve(43,a,19,a)].
% 0.81/1.09 70 -value(in(n1,h),n0). [ur(43,b,16,a)].
% 0.81/1.09 89 mode(and1(h),ok). [resolve(62,a,28,a),unit_del(b,20)].
% 0.81/1.09 90 -value(out(n1,and2(h)),n1). [ur(55,a,15,a,c,67,a)].
% 0.81/1.09 95 -value(in(n1,or1(h)),n0). [ur(45,a,15,a,c,70,a)].
% 0.81/1.09 97 mode(not1(h),ok). [resolve(64,a,28,a),unit_del(b,21)].
% 0.81/1.09 98 mode(or1(h),ok). [resolve(65,a,28,a),unit_del(b,22)].
% 0.81/1.09 100 -value(out(n1,and1(h)),n0) | value(in(n1,and1(h)),n0) | value(in(n2,and1(h)),n0). [resolve(89,a,40,a),unit_del(a,62)].
% 0.81/1.09 109 -value(in(n1,not1(h)),n1). [ur(59,a,15,a,c,90,a)].
% 0.81/1.09 114 -value(out(n1,not1(h)),n0). [resolve(97,a,37,a),unit_del(a,64),unit_del(c,109)].
% 0.81/1.09 127 -value(out(n1,or1(h)),n0). [resolve(98,a,33,a),unit_del(a,65),unit_del(c,95)].
% 0.81/1.09 136 -value(in(n2,and1(h)),n0). [ur(61,a,15,a,c,114,a)].
% 0.81/1.09 138 -value(out(n1,and1(h)),n0) | value(in(n1,and1(h)),n0). [back_unit_del(100),unit_del(c,136)].
% 0.81/1.09 139 -value(in(n1,and1(h)),n0). [ur(57,a,15,a,c,127,a)].
% 0.81/1.09 141 -value(out(n1,and1(h)),n0). [back_unit_del(138),unit_del(b,139)].
% 0.81/1.09 144 $F. [ur(52,b,18,a,c,141,a),unit_del(a,15)].
% 0.81/1.09
% 0.81/1.09 % SZS output end Refutation
% 0.81/1.09 ============================== end of proof ==========================
% 0.81/1.09
% 0.81/1.09 ============================== STATISTICS ============================
% 0.81/1.09
% 0.81/1.09 Given=79. Generated=172. Kept=129. proofs=1.
% 0.81/1.09 Usable=79. Sos=26. Demods=0. Limbo=0, Disabled=85. Hints=0.
% 0.81/1.09 Megabytes=0.18.
% 0.81/1.09 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.81/1.09
% 0.81/1.09 ============================== end of statistics =====================
% 0.81/1.09
% 0.81/1.09 ============================== end of search =========================
% 0.81/1.09
% 0.81/1.09 THEOREM PROVED
% 0.81/1.09 % SZS status Unsatisfiable
% 0.81/1.09
% 0.81/1.09 Exiting with 1 proof.
% 0.81/1.09
% 0.81/1.09 Process 2632 exit (max_proofs) Thu Jun 16 23:21:31 2022
% 0.81/1.09 Prover9 interrupted
%------------------------------------------------------------------------------