TSTP Solution File: HWV008-2.002 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : HWV008-2.002 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n013.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:10:32 EDT 2022

% Result   : Unsatisfiable 0.45s 0.61s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   32
% Syntax   : Number of clauses     :   71 (  45 unt;   4 nHn;  71 RR)
%            Number of literals    :  107 (   0 equ;  40 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   1 con; 0-1 aty)
%            Number of variables   :   29 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(value_propagation_zero1,axiom,
    ( ~ connection(X,Y)
    | ~ zero(X)
    | zero(Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',value_propagation_zero1) ).

cnf(value_propagation_one1,axiom,
    ( ~ connection(X,Y)
    | ~ one(X)
    | one(Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',value_propagation_one1) ).

cnf(value_propagation_zero2,axiom,
    ( ~ connection(X,Y)
    | ~ zero(Y)
    | zero(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',value_propagation_zero2) ).

cnf(value_propagation_one2,axiom,
    ( ~ connection(X,Y)
    | ~ one(Y)
    | one(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',value_propagation_one2) ).

cnf(unique_value,axiom,
    ( ~ zero(X)
    | ~ one(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',unique_value) ).

cnf(and_0x_0,axiom,
    ( ~ and_ok(X)
    | ~ zero(in1(X))
    | zero(out1(X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',and_0x_0) ).

cnf(and_1_1x,axiom,
    ( ~ and_ok(X)
    | ~ one(out1(X))
    | one(in1(X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',and_1_1x) ).

cnf(and_ok_or_abnormal,axiom,
    ( ~ logic_and(X)
    | and_ok(X)
    | abnormal(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',and_ok_or_abnormal) ).

cnf(or_1_11,axiom,
    ( ~ or_ok(X)
    | ~ one(out1(X))
    | one(in1(X))
    | one(in2(X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',or_1_11) ).

cnf(or_ok_or_abnormal,axiom,
    ( ~ logic_or(X)
    | or_ok(X)
    | abnormal(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-0.ax',or_ok_or_abnormal) ).

cnf(halfadder_and2,axiom,
    ( ~ halfadder(X)
    | logic_and(and2(X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-1.ax',halfadder_and2) ).

cnf(halfadder_connection_in1_in1and2,axiom,
    ( ~ halfadder(X)
    | connection(in1(X),in1(and2(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-1.ax',halfadder_connection_in1_in1and2) ).

cnf(halfadder_connection_outc_out1and2,axiom,
    ( ~ halfadder(X)
    | connection(outc(X),out1(and2(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-1.ax',halfadder_connection_outc_out1and2) ).

cnf(fulladder_halfadder1,axiom,
    ( ~ fulladder(X)
    | halfadder(h1(X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_halfadder1) ).

cnf(fulladder_halfadder2,axiom,
    ( ~ fulladder(X)
    | halfadder(h2(X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_halfadder2) ).

cnf(fulladder_or1,axiom,
    ( ~ fulladder(X)
    | logic_or(or1(X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_or1) ).

cnf(fulladder_connection_outch1_in2or1,axiom,
    ( ~ fulladder(X)
    | connection(outc(h1(X)),in2(or1(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_outch1_in2or1) ).

cnf(fulladder_connection_outch2_in1or1,axiom,
    ( ~ fulladder(X)
    | connection(outc(h2(X)),in1(or1(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_outch2_in1or1) ).

cnf(fulladder_connection_in1_in1h2,axiom,
    ( ~ fulladder(X)
    | connection(in1(X),in1(h2(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_in1_in1h2) ).

cnf(fulladder_connection_in2_in1h1,axiom,
    ( ~ fulladder(X)
    | connection(in2(X),in1(h1(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_in2_in1h1) ).

cnf(fulladder_connection_outc_out1or1,axiom,
    ( ~ fulladder(X)
    | connection(outc(X),out1(or1(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV002-2.ax',fulladder_connection_outc_out1or1) ).

cnf(nbit_adder_fulladder2,axiom,
    ( ~ nbit_adder2(X)
    | fulladder(f2(X)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_fulladder2) ).

cnf(nbit_adder_connection_outc_outcf1,axiom,
    ( ~ nbit_adder2(X)
    | connection(outc(X),outc(f2(X))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_outc_outcf1) ).

cnf(nbit_adder_connection_ina2_in1f2,axiom,
    ( ~ nbit_adder2(X)
    | connection(ina2(X),in1(f2(X))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_ina2_in1f2) ).

cnf(nbit_adder_connection_inb2_in2f2,axiom,
    ( ~ nbit_adder2(X)
    | connection(inb2(X),in2(f2(X))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_inb2_in2f2) ).

cnf(a_isa_2bit_adder,hypothesis,
    nbit_adder2(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_isa_2bit_adder) ).

cnf(ina2_0,hypothesis,
    zero(ina2(a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ina2_0) ).

cnf(inb2_0,hypothesis,
    zero(inb2(a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inb2_0) ).

cnf(outc_1,hypothesis,
    one(outc(a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',outc_1) ).

cnf(diagnosis_or1f2a,negated_conjecture,
    ~ abnormal(or1(f2(a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_or1f2a) ).

cnf(diagnosis_and2h1f2a,negated_conjecture,
    ~ abnormal(and2(h1(f2(a)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h1f2a) ).

cnf(diagnosis_and2h2f2a,negated_conjecture,
    ~ abnormal(and2(h2(f2(a)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h2f2a) ).

cnf(76,plain,
    ~ one(inb2(a)),
    inference('UR-RESOLVE',[status(thm)],[unique_value,inb2_0]) ).

cnf(84,plain,
    fulladder(f2(a)),
    inference('HYPERRESOLVE',[status(thm)],[nbit_adder_fulladder2,a_isa_2bit_adder]) ).

cnf(87,plain,
    connection(outc(a),outc(f2(a))),
    inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_outc_outcf1,a_isa_2bit_adder]) ).

cnf(90,plain,
    connection(ina2(a),in1(f2(a))),
    inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_ina2_in1f2,a_isa_2bit_adder]) ).

cnf(91,plain,
    connection(inb2(a),in2(f2(a))),
    inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_inb2_in2f2,a_isa_2bit_adder]) ).

cnf(119,plain,
    logic_or(or1(f2(a))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_or1,84]) ).

cnf(120,plain,
    halfadder(h2(f2(a))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_halfadder2,84]) ).

cnf(121,plain,
    halfadder(h1(f2(a))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_halfadder1,84]) ).

cnf(122,plain,
    connection(outc(f2(a)),out1(or1(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outc_out1or1,84]) ).

cnf(125,plain,
    connection(in2(f2(a)),in1(h1(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_in2_in1h1,84]) ).

cnf(126,plain,
    connection(in1(f2(a)),in1(h2(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_in1_in1h2,84]) ).

cnf(127,plain,
    connection(outc(h2(f2(a))),in1(or1(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outch2_in1or1,84]) ).

cnf(128,plain,
    connection(outc(h1(f2(a))),in2(or1(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outch1_in2or1,84]) ).

cnf(157,plain,
    or_ok(or1(f2(a))),
    inference('UR-RESOLVE',[status(thm)],[or_ok_or_abnormal,119,diagnosis_or1f2a]) ).

cnf(160,plain,
    logic_and(and2(h2(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_and2,120]) ).

cnf(162,plain,
    connection(outc(h2(f2(a))),out1(and2(h2(f2(a))))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_outc_out1and2,120]) ).

cnf(165,plain,
    connection(in1(h2(f2(a))),in1(and2(h2(f2(a))))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_in1_in1and2,120]) ).

cnf(173,plain,
    logic_and(and2(h1(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_and2,121]) ).

cnf(175,plain,
    connection(outc(h1(f2(a))),out1(and2(h1(f2(a))))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_outc_out1and2,121]) ).

cnf(178,plain,
    connection(in1(h1(f2(a))),in1(and2(h1(f2(a))))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_in1_in1and2,121]) ).

cnf(192,plain,
    one(outc(f2(a))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_one1,87,outc_1]) ).

cnf(225,plain,
    zero(in1(f2(a))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_zero1,90,ina2_0]) ).

cnf(233,plain,
    ~ one(in2(f2(a))),
    inference('UR-RESOLVE',[status(thm)],[value_propagation_one2,91,76]) ).

cnf(254,plain,
    and_ok(and2(h2(f2(a)))),
    inference('UR-RESOLVE',[status(thm)],[and_ok_or_abnormal,160,diagnosis_and2h2f2a]) ).

cnf(258,plain,
    and_ok(and2(h1(f2(a)))),
    inference('UR-RESOLVE',[status(thm)],[and_ok_or_abnormal,173,diagnosis_and2h1f2a]) ).

cnf(278,plain,
    one(out1(or1(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_one1,122,192]) ).

cnf(314,plain,
    ( one(in1(or1(f2(a))))
    | one(in2(or1(f2(a)))) ),
    inference('HYPERRESOLVE',[status(thm)],[or_1_11,278,157]) ).

cnf(316,plain,
    ~ one(in1(h1(f2(a)))),
    inference('UR-RESOLVE',[status(thm)],[value_propagation_one2,125,233]) ).

cnf(323,plain,
    zero(in1(h2(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_zero1,126,225]) ).

cnf(379,plain,
    zero(in1(and2(h2(f2(a))))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_zero1,165,323]) ).

cnf(381,plain,
    zero(out1(and2(h2(f2(a))))),
    inference('HYPERRESOLVE',[status(thm)],[and_0x_0,379,254]) ).

cnf(389,plain,
    zero(outc(h2(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_zero2,381,162]) ).

cnf(397,plain,
    zero(in1(or1(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_zero1,389,127]) ).

cnf(408,plain,
    ~ one(in1(or1(f2(a)))),
    inference('UR-RESOLVE',[status(thm)],[unique_value,397]) ).

cnf(409,plain,
    one(in2(or1(f2(a)))),
    inference('REWRITE',[status(thm)],[314,408]) ).

cnf(416,plain,
    one(outc(h1(f2(a)))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_one2,409,128]) ).

cnf(548,plain,
    one(out1(and2(h1(f2(a))))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_one1,175,416]) ).

cnf(551,plain,
    one(in1(and2(h1(f2(a))))),
    inference('HYPERRESOLVE',[status(thm)],[and_1_1x,548,258]) ).

cnf(613,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[value_propagation_one2,178,316]),551]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : HWV008-2.002 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.08/0.15  % Command  : run-snark %s %d
% 0.15/0.34  % Computer : n013.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Fri Jun 17 01:36:44 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 0.21/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47  * 
% 0.21/0.48  * 
% 0.21/0.48  #<PACKAGE "SNARK-USER">
% 0.21/0.48  * 
% 0.21/0.48  SNARK-TPTP-OPTIONS
% 0.21/0.48  * 
% 0.21/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48   (USE-FACTORING :POS)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48  * 
% 0.21/0.48  "."
% 0.21/0.48  * 
% 0.21/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-17T01:36:45
% 0.21/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-06-17T01:36:45
% 0.45/0.61  
% 0.45/0.61  
% 0.45/0.61  #||
% 0.45/0.61  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.61  % SZS output start Refutation
% See solution above
% 0.45/0.61  ||#
% 0.45/0.61  
% 0.45/0.61  ; Summary of computation:
% 0.45/0.61  ;      1148 formulas have been input or derived (from 376 formulas).
% 0.45/0.61  ;       613 (53%) were retained.  Of these,
% 0.45/0.61  ;            1 ( 0%) were simplified or subsumed later,
% 0.45/0.61  ;          612 (100%) are still being kept.
% 0.45/0.61  ; 
% 0.45/0.61  ; Run time in seconds excluding printing time:
% 0.45/0.61  ;     0.013  11%   Read assertion file          (1 call)
% 0.45/0.61  ;     0.002   2%   Assert                       (74 calls)
% 0.45/0.61  ;     0.036  29%   Process new row              (1,113 calls)
% 0.45/0.61  ;     0.018  15%   Resolution                   (750 calls)
% 0.45/0.61  ;     0.003   2%   Paramodulation               (375 calls)
% 0.45/0.61  ;     0.000   0%   Factoring                    (1 call)
% 0.45/0.61  ;     0.000   0%   Condensing                   (78 calls)
% 0.45/0.61  ;     0.003   2%   Forward subsumption          (78 calls)
% 0.45/0.61  ;     0.002   2%   Backward subsumption         (78 calls)
% 0.45/0.61  ;     0.000   0%   Clause clause subsumption    (4 calls)
% 0.45/0.62  ;     0.011   9%   Forward simplification       (1,113 calls)
% 0.45/0.62  ;     0.005   4%   Backward simplification      (613 calls)
% 0.45/0.62  ;     0.000   0%   Ordering                     (8 calls)
% 0.45/0.62  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.45/0.62  ;     0.000   0%   Purity testing               (1 call)
% 0.45/0.62  ;     0.030  24%   Other
% 0.45/0.62  ;     0.123        Total
% 0.45/0.62  ;     0.132        Real time
% 0.45/0.62  ; 
% 0.45/0.62  ; Term-hash-array has 777 terms in all.
% 0.45/0.62  ; Feature-vector-row-index has 77 entries (78 at peak, 78 added, 1 deleted).
% 0.45/0.62  ; Feature-vector-row-index has 288 nodes (299 at peak, 299 added, 11 deleted).
% 0.45/0.62  ;  Retrieved 5 possibly forward subsuming rows in 78 calls.
% 0.45/0.62  ;  Retrieved 3 possibly backward subsumed rows in 78 calls.
% 0.45/0.62  ; Path-index has 778 entries (778 at peak, 779 added, 1 deleted).
% 0.45/0.62  ; Path-index has 1,112 nodes (1,112 at peak, 1,113 added, 1 deleted).
% 0.45/0.62  ; Trie-index has 778 entries (778 at peak, 779 added, 1 deleted).
% 0.45/0.62  ; Trie-index has 2,271 nodes (2,271 at peak, 2,273 added, 2 deleted).
% 0.45/0.62  ; Retrieved 504 generalization terms in 1,053 calls.
% 0.45/0.62  ; Retrieved 534 instance terms in 534 calls.
% 0.45/0.62  ; Retrieved 6,434 unifiable terms in 4,174 calls.
% 0.45/0.62  ; 
% 0.45/0.62  ; The agenda of rows to process has 1 entry:
% 0.45/0.62  ;     1 with value 15
% 0.45/0.62  ; The agenda of rows to give has 236 entries:
% 0.45/0.62  ;     1 with value (4 15)         52 with value (4 20)          20 with value (4 23)
% 0.45/0.62  ;    47 with value (4 18)         40 with value (4 21)           4 with value (4 24)
% 0.45/0.62  ;    44 with value (4 19)         28 with value (4 22)
% 0.45/0.62  Evaluation took:
% 0.45/0.62    0.132 seconds of real time
% 0.45/0.62    0.110174 seconds of user run time
% 0.45/0.62    0.020924 seconds of system run time
% 0.45/0.62    0 calls to %EVAL
% 0.45/0.62    0 page faults and
% 0.45/0.62    11,063,048 bytes consed.
% 0.45/0.62  :PROOF-FOUND
% 0.45/0.62  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-17T01:36:45
% 0.45/0.62  :PROOF-FOUND
% 0.45/0.62  * 
%------------------------------------------------------------------------------