TSTP Solution File: HWV005-1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : HWV005-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n015.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:30 EDT 2022

% Result   : Unsatisfiable 0.20s 0.55s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   25
% Syntax   : Number of clauses     :   49 (  32 unt;   3 nHn;  49 RR)
%            Number of literals    :   77 (   0 equ;  38 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  12 con; 0-2 aty)
%            Number of variables   :   23 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(value_propagation1,axiom,
    ( ~ connection(X,Y)
    | ~ value(X,Z)
    | value(Y,Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',value_propagation1) ).

cnf(value_propagation2,axiom,
    ( ~ connection(X,Y)
    | ~ value(Y,Z)
    | value(X,Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',value_propagation2) ).

cnf(unique_value,axiom,
    ( ~ value(X,Y)
    | ~ value(X,Z)
    | equal_value(Y,Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',unique_value) ).

cnf(equal_value1,axiom,
    ~ equal_value(n0,n1),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',equal_value1) ).

cnf(equal_value2,axiom,
    ~ equal_value(n1,n0),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',equal_value2) ).

cnf(ok_or_abnormal,axiom,
    ( ~ type(X,Y)
    | mode(X,ok)
    | mode(X,abnormal) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',ok_or_abnormal) ).

cnf(and_0_00,axiom,
    ( ~ mode(X,ok)
    | ~ type(X,and)
    | ~ value(out(n1,X),n0)
    | value(in(n1,X),n0)
    | value(in(n2,X),n0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',and_0_00) ).

cnf(or_0_0x,axiom,
    ( ~ mode(X,ok)
    | ~ type(X,or)
    | ~ value(out(n1,X),n0)
    | value(in(n1,X),n0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',or_0_0x) ).

cnf(not_0_1_bw,axiom,
    ( ~ mode(X,ok)
    | ~ type(X,not)
    | ~ value(out(n1,X),n0)
    | value(in(n1,X),n1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',not_0_1_bw) ).

cnf(halfadder_and1,axiom,
    ( ~ type(X,halfadder)
    | type(and1(X),and) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_and1) ).

cnf(halfadder_not1,axiom,
    ( ~ type(X,halfadder)
    | type(not1(X),not) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_not1) ).

cnf(halfadder_or1,axiom,
    ( ~ type(X,halfadder)
    | type(or1(X),or) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_or1) ).

cnf(halfadder_connection_in1_in1or1,axiom,
    ( ~ type(X,halfadder)
    | connection(in(n1,X),in(n1,or1(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_in1_in1or1) ).

cnf(halfadder_connection_outs_out1and1,axiom,
    ( ~ type(X,halfadder)
    | connection(out(s,X),out(n1,and1(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_outs_out1and1) ).

cnf(halfadder_connection_outc_out1and2,axiom,
    ( ~ type(X,halfadder)
    | connection(out(c,X),out(n1,and2(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_outc_out1and2) ).

cnf(halfadder_connection_out1or1_in1_and1,axiom,
    ( ~ type(X,halfadder)
    | connection(out(n1,or1(X)),in(n1,and1(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_out1or1_in1_and1) ).

cnf(halfadder_connection_out1and2_in1not1,axiom,
    ( ~ type(X,halfadder)
    | connection(out(n1,and2(X)),in(n1,not1(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_out1and2_in1not1) ).

cnf(halfadder_connection_out1not1_in2and1,axiom,
    ( ~ type(X,halfadder)
    | connection(out(n1,not1(X)),in(n2,and1(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_out1not1_in2and1) ).

cnf(h_isa_halfadder,hypothesis,
    type(h,halfadder),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_isa_halfadder) ).

cnf(in1_1,hypothesis,
    value(in(n1,h),n1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',in1_1) ).

cnf(outs_0,hypothesis,
    value(out(s,h),n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',outs_0) ).

cnf(outc_0,hypothesis,
    value(out(c,h),n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',outc_0) ).

cnf(diagnosis_and1,negated_conjecture,
    ~ mode(and1(h),abnormal),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and1) ).

cnf(diagnosis_not1,negated_conjecture,
    ~ mode(not1(h),abnormal),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_not1) ).

cnf(diagnosis_or1,negated_conjecture,
    ~ mode(or1(h),abnormal),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_or1) ).

cnf(43,plain,
    type(and1(h),and),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_and1,h_isa_halfadder]) ).

cnf(45,plain,
    type(not1(h),not),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_not1,h_isa_halfadder]) ).

cnf(46,plain,
    type(or1(h),or),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_or1,h_isa_halfadder]) ).

cnf(49,plain,
    ~ value(in(n1,h),n0),
    inference('UR-RESOLVE',[status(thm)],[unique_value,in1_1,equal_value1]) ).

cnf(52,plain,
    ~ value(out(c,h),n1),
    inference('UR-RESOLVE',[status(thm)],[unique_value,outc_0,equal_value2]) ).

cnf(54,plain,
    connection(in(n1,h),in(n1,or1(h))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_in1_in1or1,h_isa_halfadder]) ).

cnf(58,plain,
    connection(out(s,h),out(n1,and1(h))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_outs_out1and1,h_isa_halfadder]) ).

cnf(59,plain,
    connection(out(c,h),out(n1,and2(h))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_outc_out1and2,h_isa_halfadder]) ).

cnf(60,plain,
    connection(out(n1,or1(h)),in(n1,and1(h))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_out1or1_in1_and1,h_isa_halfadder]) ).

cnf(61,plain,
    connection(out(n1,and2(h)),in(n1,not1(h))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_out1and2_in1not1,h_isa_halfadder]) ).

cnf(62,plain,
    connection(out(n1,not1(h)),in(n2,and1(h))),
    inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_out1not1_in2and1,h_isa_halfadder]) ).

cnf(63,plain,
    mode(and1(h),ok),
    inference('UR-RESOLVE',[status(thm)],[ok_or_abnormal,43,diagnosis_and1]) ).

cnf(65,plain,
    mode(not1(h),ok),
    inference('UR-RESOLVE',[status(thm)],[ok_or_abnormal,45,diagnosis_not1]) ).

cnf(66,plain,
    mode(or1(h),ok),
    inference('UR-RESOLVE',[status(thm)],[ok_or_abnormal,46,diagnosis_or1]) ).

cnf(74,plain,
    ~ value(in(n1,or1(h)),n0),
    inference('UR-RESOLVE',[status(thm)],[value_propagation2,54,49]) ).

cnf(82,plain,
    ~ value(out(n1,or1(h)),n0),
    inference('UR-RESOLVE',[status(thm)],[or_0_0x,74,66,46]) ).

cnf(107,plain,
    value(out(n1,and1(h)),n0),
    inference('HYPERRESOLVE',[status(thm)],[value_propagation1,58,outs_0]) ).

cnf(115,plain,
    ( value(in(n1,and1(h)),n0)
    | value(in(n2,and1(h)),n0) ),
    inference('HYPERRESOLVE',[status(thm)],[and_0_00,107,63,43]) ).

cnf(117,plain,
    ~ value(out(n1,and2(h)),n1),
    inference('UR-RESOLVE',[status(thm)],[value_propagation2,59,52]) ).

cnf(141,plain,
    ~ value(in(n1,and1(h)),n0),
    inference('UR-RESOLVE',[status(thm)],[value_propagation2,60,82]) ).

cnf(142,plain,
    value(in(n2,and1(h)),n0),
    inference('REWRITE',[status(thm)],[115,141]) ).

cnf(153,plain,
    ~ value(in(n1,not1(h)),n1),
    inference('UR-RESOLVE',[status(thm)],[value_propagation2,61,117]) ).

cnf(163,plain,
    ~ value(out(n1,not1(h)),n0),
    inference('UR-RESOLVE',[status(thm)],[not_0_1_bw,153,65,45]) ).

cnf(164,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[value_propagation2,62,142]),163]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : HWV005-1 : TPTP v8.1.0. Released v2.1.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n015.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jun 16 23:36:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.47  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48  * 
% 0.20/0.48  * 
% 0.20/0.48  #<PACKAGE "SNARK-USER">
% 0.20/0.48  * 
% 0.20/0.48  SNARK-TPTP-OPTIONS
% 0.20/0.48  * 
% 0.20/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T23:36:42
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-06-16T23:36:42
% 0.20/0.55  
% 0.20/0.55  
% 0.20/0.55  #||
% 0.20/0.55  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.55  % SZS output start Refutation
% See solution above
% 0.20/0.55  ||#
% 0.20/0.55  
% 0.20/0.55  ; Summary of computation:
% 0.20/0.55  ;       349 formulas have been input or derived (from 91 formulas).
% 0.20/0.55  ;       164 (47%) were retained.  Of these,
% 0.20/0.55  ;            1 ( 1%) were simplified or subsumed later,
% 0.20/0.55  ;          163 (99%) are still being kept.
% 0.20/0.55  ; 
% 0.20/0.55  ; Run time in seconds excluding printing time:
% 0.20/0.55  ;     0.009  14%   Read assertion file          (1 call)
% 0.20/0.55  ;     0.001   2%   Assert                       (42 calls)
% 0.20/0.55  ;     0.014  21%   Process new row              (288 calls)
% 0.20/0.55  ;     0.013  20%   Resolution                   (180 calls)
% 0.20/0.55  ;     0.001   2%   Paramodulation               (90 calls)
% 0.20/0.55  ;     0.000   0%   Factoring                    (1 call)
% 0.20/0.55  ;     0.000   0%   Condensing                   (35 calls)
% 0.20/0.55  ;     0.001   2%   Forward subsumption          (35 calls)
% 0.20/0.55  ;     0.001   2%   Backward subsumption         (35 calls)
% 0.20/0.55  ;     0.000   0%   Clause clause subsumption    (2 calls)
% 0.20/0.55  ;     0.000   0%   Forward simplification       (288 calls)
% 0.20/0.55  ;     0.002   3%   Backward simplification      (164 calls)
% 0.20/0.55  ;     0.000   0%   Ordering                     (4 calls)
% 0.20/0.55  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.55  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.55  ;     0.024  36%   Other
% 0.20/0.55  ;     0.066        Total
% 0.20/0.55  ;     0.071        Real time
% 0.20/0.55  ; 
% 0.20/0.55  ; Term-hash-array has 205 terms in all.
% 0.20/0.55  ; Feature-vector-row-index has 34 entries (35 at peak, 35 added, 1 deleted).
% 0.20/0.55  ; Feature-vector-row-index has 220 nodes (233 at peak, 233 added, 13 deleted).
% 0.20/0.55  ;  Retrieved 2 possibly forward subsuming rows in 35 calls.
% 0.20/0.55  ;  Retrieved 2 possibly backward subsumed rows in 35 calls.
% 0.20/0.55  ; Path-index has 217 entries (217 at peak, 218 added, 1 deleted).
% 0.20/0.55  ; Path-index has 222 nodes (222 at peak, 222 added, 0 deleted).
% 0.20/0.55  ; Trie-index has 217 entries (217 at peak, 218 added, 1 deleted).
% 0.20/0.55  ; Trie-index has 499 nodes (499 at peak, 502 added, 3 deleted).
% 0.20/0.55  ; Retrieved 129 generalization terms in 258 calls.
% 0.20/0.55  ; Retrieved 128 instance terms in 128 calls.
% 0.20/0.55  ; Retrieved 2,773 unifiable terms in 1,391 calls.
% 0.20/0.55  ; 
% 0.20/0.55  ; The agenda of rows to give has 72 entries:
% 0.20/0.55  ;     5 with value (4 13)         26 with value (4 15)          20 with value (4 16)
% 0.20/0.55  ;    21 with value (4 14)
% 0.20/0.55  Evaluation took:
% 0.20/0.55    0.071 seconds of real time
% 0.20/0.55    0.061126 seconds of user run time
% 0.20/0.55    0.010205 seconds of system run time
% 0.20/0.55    0 calls to %EVAL
% 0.20/0.55    0 page faults and
% 0.20/0.55    6,195,280 bytes consed.
% 0.20/0.55  :PROOF-FOUND
% 0.20/0.56  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T23:36:42
% 0.20/0.56  :PROOF-FOUND
% 0.20/0.56  * 
%------------------------------------------------------------------------------