↑ Up

SNARK---20120808r022.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : HWV008-2.001 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n016.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.37s 0.58s
% Output   : Refutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   33
% Syntax   : Number of clauses     :   72 (  45 unt;   4 nHn;  72 RR)
%            Number of literals    :  109 (   0 equ;  41 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   :   30 (   0 sgn)

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

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

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

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

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

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

cnf(and_1_x1,axiom,
    ( ~ and_ok(X)
    | ~ one(out1(X))
    | one(in2(X)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-0.ax',and_1_x1) ).

cnf(and_ok_or_abnormal,axiom,
    ( ~ logic_and(X)
    | and_ok(X)
    | abnormal(X) ),
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/HWV002-0.ax',or_ok_or_abnormal) ).

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

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

cnf(halfadder_connection_in2_in2and2,axiom,
    ( ~ halfadder(X)
    | connection(in2(X),in2(and2(X))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-1.ax',halfadder_connection_in2_in2and2) ).

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

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

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

cnf(fulladder_or1,axiom,
    ( ~ fulladder(X)
    | logic_or(or1(X)) ),
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/HWV002-2.ax',fulladder_connection_in1_in1h2) ).

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

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

cnf(nbit_adder_fulladder1,axiom,
    ( ~ nbit_adder1(X)
    | fulladder(f1(X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nbit_adder_fulladder1) ).

cnf(nbit_adder_connection_outc_outcf1,axiom,
    ( ~ nbit_adder1(X)
    | connection(outc(X),outc(f1(X))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nbit_adder_connection_outc_outcf1) ).

cnf(nbit_adder_connection_ina1_in1f1,axiom,
    ( ~ nbit_adder1(X)
    | connection(ina1(X),in1(f1(X))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nbit_adder_connection_ina1_in1f1) ).

cnf(nbit_adder_connection_inc_incf1,axiom,
    ( ~ nbit_adder1(X)
    | connection(inc(X),inc(f1(X))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nbit_adder_connection_inc_incf1) ).

cnf(a_isa_1bit_adder,hypothesis,
    nbit_adder1(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_isa_1bit_adder) ).

cnf(ina1_0,hypothesis,
    zero(ina1(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ina1_0) ).

cnf(inc_0,hypothesis,
    zero(inc(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inc_0) ).

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

cnf(diagnosis_or1f1,negated_conjecture,
    ~ abnormal(or1(f1(a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_or1f1) ).

cnf(diagnosis_and2h1f1,negated_conjecture,
    ~ abnormal(and2(h1(f1(a)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_and2h1f1) ).

cnf(diagnosis_and2h2f1,negated_conjecture,
    ~ abnormal(and2(h2(f1(a)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_and2h2f1) ).

cnf(70,plain,
    ~ one(inc(a)),
    inference('UR-RESOLVE',[status(thm)],[unique_value,inc_0]) ).

cnf(72,plain,
    fulladder(f1(a)),
    inference('HYPERRESOLVE',[status(thm)],[nbit_adder_fulladder1,a_isa_1bit_adder]) ).

cnf(74,plain,
    connection(outc(a),outc(f1(a))),
    inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_outc_outcf1,a_isa_1bit_adder]) ).

cnf(75,plain,
    connection(ina1(a),in1(f1(a))),
    inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_ina1_in1f1,a_isa_1bit_adder]) ).

cnf(77,plain,
    connection(inc(a),inc(f1(a))),
    inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_inc_incf1,a_isa_1bit_adder]) ).

cnf(86,plain,
    logic_or(or1(f1(a))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_or1,72]) ).

cnf(87,plain,
    halfadder(h2(f1(a))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_halfadder2,72]) ).

cnf(88,plain,
    halfadder(h1(f1(a))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_halfadder1,72]) ).

cnf(89,plain,
    connection(outc(f1(a)),out1(or1(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outc_out1or1,72]) ).

cnf(91,plain,
    connection(inc(f1(a)),in2(h1(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_inc_in2h1,72]) ).

cnf(93,plain,
    connection(in1(f1(a)),in1(h2(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_in1_in1h2,72]) ).

cnf(94,plain,
    connection(outc(h2(f1(a))),in1(or1(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outch2_in1or1,72]) ).

cnf(95,plain,
    connection(outc(h1(f1(a))),in2(or1(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outch1_in2or1,72]) ).

cnf(97,plain,
    or_ok(or1(f1(a))),
    inference('UR-RESOLVE',[status(thm)],[or_ok_or_abnormal,86,diagnosis_or1f1]) ).

cnf(100,plain,
    logic_and(and2(h2(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_and2,87]) ).

cnf(102,plain,
    connection(outc(h2(f1(a))),out1(and2(h2(f1(a))))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_outc_out1and2,87]) ).

cnf(105,plain,
    connection(in1(h2(f1(a))),in1(and2(h2(f1(a))))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_in1_in1and2,87]) ).

cnf(113,plain,
    logic_and(and2(h1(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_and2,88]) ).

cnf(115,plain,
    connection(outc(h1(f1(a))),out1(and2(h1(f1(a))))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_outc_out1and2,88]) ).

cnf(117,plain,
    connection(in2(h1(f1(a))),in2(and2(h1(f1(a))))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_in2_in2and2,88]) ).

cnf(128,plain,
    one(outc(f1(a))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_one1,74,outc_0]) ).

cnf(140,plain,
    zero(in1(f1(a))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_zero1,75,ina1_0]) ).

cnf(153,plain,
    ~ one(inc(f1(a))),
    inference('UR-RESOLVE',[status(thm)],[value_propagation_one2,77,70]) ).

cnf(160,plain,
    and_ok(and2(h2(f1(a)))),
    inference('UR-RESOLVE',[status(thm)],[and_ok_or_abnormal,100,diagnosis_and2h2f1]) ).

cnf(164,plain,
    and_ok(and2(h1(f1(a)))),
    inference('UR-RESOLVE',[status(thm)],[and_ok_or_abnormal,113,diagnosis_and2h1f1]) ).

cnf(166,plain,
    one(out1(or1(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_one1,89,128]) ).

cnf(184,plain,
    ( one(in1(or1(f1(a))))
    | one(in2(or1(f1(a)))) ),
    inference('HYPERRESOLVE',[status(thm)],[or_1_11,166,97]) ).

cnf(194,plain,
    ~ one(in2(h1(f1(a)))),
    inference('UR-RESOLVE',[status(thm)],[value_propagation_one2,91,153]) ).

cnf(209,plain,
    zero(in1(h2(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_zero1,93,140]) ).

cnf(225,plain,
    zero(in1(and2(h2(f1(a))))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_zero1,105,209]) ).

cnf(227,plain,
    zero(out1(and2(h2(f1(a))))),
    inference('HYPERRESOLVE',[status(thm)],[and_0x_0,225,160]) ).

cnf(235,plain,
    zero(outc(h2(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_zero2,227,102]) ).

cnf(243,plain,
    zero(in1(or1(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_zero1,235,94]) ).

cnf(254,plain,
    ~ one(in1(or1(f1(a)))),
    inference('UR-RESOLVE',[status(thm)],[unique_value,243]) ).

cnf(255,plain,
    one(in2(or1(f1(a)))),
    inference('REWRITE',[status(thm)],[184,254]) ).

cnf(262,plain,
    one(outc(h1(f1(a)))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_one2,255,95]) ).

cnf(346,plain,
    one(out1(and2(h1(f1(a))))),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation_one1,115,262]) ).

cnf(348,plain,
    one(in2(and2(h1(f1(a))))),
    inference('HYPERRESOLVE',[status(thm)],[and_1_x1,346,164]) ).

cnf(387,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[value_propagation_one2,117,194]),348]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : HWV008-2.001 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n016.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 04:56:05 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 0.19/0.48  #<PACKAGE "SNARK-USER">
% 0.19/0.48  * 
% 0.19/0.48  SNARK-TPTP-OPTIONS
% 0.19/0.48  * 
% 0.19/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48   (USE-FACTORING :POS)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48  * 
% 0.19/0.48  "."
% 0.19/0.48  * 
% 0.19/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-17T04:56:05
% 0.19/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-06-17T04:56:05
% 0.37/0.58  
% 0.37/0.58  
% 0.37/0.58  #||
% 0.37/0.58  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.58  % SZS output start Refutation
% See solution above
% 0.37/0.58  ||#
% 0.37/0.58  
% 0.37/0.58  ; Summary of computation:
% 0.37/0.58  ;       713 formulas have been input or derived (from 247 formulas).
% 0.37/0.58  ;       387 (54%) were retained.  Of these,
% 0.37/0.58  ;            1 ( 0%) were simplified or subsumed later,
% 0.37/0.58  ;          386 (100%) are still being kept.
% 0.37/0.58  ; 
% 0.37/0.58  ; Run time in seconds excluding printing time:
% 0.37/0.58  ;     0.012  12%   Read assertion file          (1 call)
% 0.37/0.58  ;     0.002   2%   Assert                       (66 calls)
% 0.37/0.58  ;     0.032  33%   Process new row              (690 calls)
% 0.37/0.58  ;     0.013  14%   Resolution                   (492 calls)
% 0.37/0.58  ;     0.000   0%   Paramodulation               (246 calls)
% 0.37/0.58  ;     0.001   1%   Condensing                   (64 calls)
% 0.37/0.58  ;     0.001   1%   Forward subsumption          (64 calls)
% 0.37/0.58  ;     0.000   0%   Backward subsumption         (64 calls)
% 0.37/0.58  ;     0.000   0%   Clause clause subsumption    (4 calls)
% 0.37/0.58  ;     0.007   7%   Forward simplification       (690 calls)
% 0.37/0.58  ;     0.001   1%   Backward simplification      (387 calls)
% 0.37/0.58  ;     0.000   0%   Ordering                     (4 calls)
% 0.37/0.58  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.37/0.58  ;     0.000   0%   Purity testing               (1 call)
% 0.37/0.58  ;     0.027  28%   Other
% 0.37/0.58  ;     0.096        Total
% 0.37/0.58  ;     0.102        Real time
% 0.37/0.58  ; 
% 0.37/0.58  ; Term-hash-array has 478 terms in all.
% 0.37/0.58  ; Feature-vector-row-index has 63 entries (64 at peak, 64 added, 1 deleted).
% 0.37/0.58  ; Feature-vector-row-index has 222 nodes (234 at peak, 234 added, 12 deleted).
% 0.37/0.58  ;  Retrieved 5 possibly forward subsuming rows in 64 calls.
% 0.37/0.58  ;  Retrieved 3 possibly backward subsumed rows in 64 calls.
% 0.37/0.59  ; Path-index has 479 entries (479 at peak, 480 added, 1 deleted).
% 0.37/0.59  ; Path-index has 748 nodes (748 at peak, 749 added, 1 deleted).
% 0.37/0.59  ; Trie-index has 479 entries (479 at peak, 480 added, 1 deleted).
% 0.37/0.59  ; Trie-index has 1,454 nodes (1,454 at peak, 1,457 added, 3 deleted).
% 0.37/0.59  ; Retrieved 307 generalization terms in 629 calls.
% 0.37/0.59  ; Retrieved 322 instance terms in 322 calls.
% 0.37/0.59  ; Retrieved 3,932 unifiable terms in 2,515 calls.
% 0.37/0.59  ; 
% 0.37/0.59  ; The agenda of rows to process has 1 entry:
% 0.37/0.59  ;     1 with value 15
% 0.37/0.59  ; The agenda of rows to give has 139 entries:
% 0.37/0.59  ;     1 with value (4 15)         26 with value (4 20)          10 with value (4 23)
% 0.37/0.59  ;    30 with value (4 18)         24 with value (4 21)           4 with value (4 24)
% 0.37/0.59  ;    26 with value (4 19)         18 with value (4 22)
% 0.37/0.59  Evaluation took:
% 0.37/0.59    0.103 seconds of real time
% 0.37/0.59    0.089805 seconds of user run time
% 0.37/0.59    0.013578 seconds of system run time
% 0.37/0.59    0 calls to %EVAL
% 0.37/0.59    0 page faults and
% 0.37/0.59    9,183,160 bytes consed.
% 0.37/0.59  :PROOF-FOUND
% 0.37/0.59  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-17T04:56:05
% 0.37/0.59  :PROOF-FOUND
% 0.37/0.59  * 
%------------------------------------------------------------------------------