TSTP Solution File: HWV052-1.001.001 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : HWV052-1.001.001 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% 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:11:22 EDT 2022

% Result   : Unsatisfiable 0.61s 0.82s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   17 (  11 unt;   6 nHn;   8 RR)
%            Number of literals    :   28 (  27 equ;   2 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(bit_domain,axiom,
    ( X = o
    | X = i ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bit_domain) ).

cnf(bit_inverse,axiom,
    inv(X) != X,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bit_inverse) ).

cnf(unpack1,axiom,
    unpack1(X,pack1(X)) = X,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1) ).

cnf(unpack1_01,axiom,
    unpack1(inv(X),pack1(X)) = X,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_01) ).

cnf(unpack1_02,axiom,
    unpack1(X,inv(pack1(X))) = X,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_02) ).

cnf(6,plain,
    inv(o) = i,
    inference('HYPERRESOLVE',[status(thm)],[bit_inverse,bit_domain]) ).

cnf(7,plain,
    inv(i) = o,
    inference('UR-RESOLVE',[status(thm)],[bit_domain,bit_inverse]) ).

cnf(8,plain,
    ( X = i
    | Y = X
    | Y = i ),
    inference('PARAMODULATE',[status(thm)],[bit_domain,bit_domain,theory(equality)]) ).

cnf(9,plain,
    i != o,
    inference('PARAMODULATE',[status(thm)],[bit_inverse,6,theory(equality)]) ).

cnf(10,plain,
    unpack1(i,pack1(o)) = o,
    inference('PARAMODULATE',[status(thm)],[unpack1_01,6,theory(equality)]) ).

cnf(12,plain,
    unpack1(o,pack1(i)) = i,
    inference('PARAMODULATE',[status(thm)],[unpack1_01,7,theory(equality)]) ).

cnf(20,plain,
    ( Y = X
    | X = i
    | Z = Y
    | U = Z
    | U = Y ),
    inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).

cnf(246,plain,
    ( Y = X
    | Z = X
    | Z = Y ),
    inference('CONDENSE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,20,theory(equality)])]) ).

cnf(248,plain,
    ( Y = X
    | X = inv(Y) ),
    inference('HYPERRESOLVE',[status(thm)],[bit_inverse,246]) ).

cnf(258,plain,
    ( pack1(X) = Y
    | unpack1(X,Y) = X ),
    inference('PARAMODULATE',[status(thm)],[unpack1_02,248,theory(equality)]) ).

cnf(276,plain,
    pack1(o) = pack1(i),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,258,theory(equality)]),9]) ).

cnf(277,plain,
    $false,
    inference('REWRITE',[status(thm)],[10,9,unpack1,276,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem  : HWV052-1.001.001 : TPTP v8.1.0. Released v4.1.0.
% 0.00/0.09  % Command  : run-snark %s %d
% 0.08/0.28  % Computer : n021.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 600
% 0.08/0.28  % DateTime : Fri Jun 17 04:17:45 EDT 2022
% 0.08/0.28  % CPUTime  : 
% 0.13/0.36  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36  * 
% 0.13/0.36  * 
% 0.13/0.37  #<PACKAGE "SNARK-USER">
% 0.13/0.37  * 
% 0.13/0.37  SNARK-TPTP-OPTIONS
% 0.13/0.37  * 
% 0.13/0.37  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.13/0.37   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.13/0.37   (USE-FACTORING :POS)
% 0.13/0.37   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.13/0.37   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.13/0.37   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.13/0.37   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.13/0.37   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.13/0.37   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.13/0.37   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.13/0.37   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.13/0.37   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.13/0.37   (DECLARE-TPTP-SYMBOLS2))
% 0.13/0.37  * 
% 0.13/0.37  "."
% 0.13/0.37  * 
% 0.13/0.37  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-17T04:17:45
% 0.13/0.37  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-17T04:17:45
% 0.61/0.82  
% 0.61/0.82  
% 0.61/0.82  #||
% 0.61/0.82  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.82  % SZS output start Refutation
% See solution above
% 0.61/0.82  ||#
% 0.61/0.82  
% 0.61/0.82  ; Summary of computation:
% 0.61/0.82  ;      2096 formulas have been input or derived (from 58 formulas).
% 0.61/0.82  ;       277 (13%) were retained.  Of these,
% 0.61/0.82  ;          119 (43%) were simplified or subsumed later,
% 0.61/0.82  ;          158 (57%) are still being kept.
% 0.61/0.82  ; 
% 0.61/0.82  ; Run time in seconds excluding printing time:
% 0.61/0.82  ;     0.000   0%   Read assertion file          (1 call)
% 0.61/0.82  ;     0.001   0%   Assert                       (5 calls)
% 0.61/0.82  ;     0.023   5%   Process new row              (1,838 calls)
% 0.61/0.82  ;     0.035   8%   Resolution                   (114 calls)
% 0.61/0.82  ;     0.013   3%   Paramodulation               (57 calls)
% 0.61/0.82  ;     0.002   0%   Factoring                    (33 calls)
% 0.61/0.82  ;     0.065  15%   Condensing                   (1,042 calls)
% 0.61/0.82  ;     0.044  10%   Forward subsumption          (1,042 calls)
% 0.61/0.82  ;     0.011   2%   Backward subsumption         (264 calls)
% 0.61/0.82  ;     0.158  35%   Clause clause subsumption    (4,501 calls)
% 0.61/0.82  ;     0.050  11%   Forward simplification       (1,757 calls)
% 0.61/0.82  ;     0.004   1%   Backward simplification      (277 calls)
% 0.61/0.82  ;     0.015   3%   Ordering                     (5,619 calls)
% 0.61/0.82  ;     0.001   0%   Sortal reasoning             (32 calls)
% 0.61/0.82  ;     0.000   0%   Purity testing               (1 call)
% 0.61/0.82  ;     0.025   6%   Other
% 0.61/0.82  ;     0.447        Total
% 0.61/0.82  ;     0.453        Real time
% 0.61/0.82  ; 
% 0.61/0.82  ; Term-hash-array has 223 terms in all.
% 0.61/0.82  ; Feature-vector-row-index has 146 entries (235 at peak, 264 added, 118 deleted).
% 0.61/0.82  ; Feature-vector-row-index has 494 nodes (925 at peak, 970 added, 476 deleted).
% 0.61/0.82  ;  Retrieved 5,134 possibly forward subsuming rows in 1,042 calls.
% 0.61/0.82  ;  Retrieved 1,115 possibly backward subsumed rows in 264 calls.
% 0.61/0.82  ; Path-index has 165 entries (208 at peak, 225 added, 60 deleted).
% 0.61/0.82  ; Path-index has 118 nodes (132 at peak, 138 added, 20 deleted).
% 0.61/0.82  ; Trie-index has 165 entries (208 at peak, 225 added, 60 deleted).
% 0.61/0.82  ; Trie-index has 222 nodes (280 at peak, 301 added, 79 deleted).
% 0.61/0.82  ; Retrieved 2,612 generalization terms in 7,049 calls.
% 0.61/0.82  ; Retrieved 15 instance terms in 12 calls.
% 0.61/0.82  ; Retrieved 11,628 unifiable terms in 870 calls.
% 0.61/0.82  ; 
% 0.61/0.82  ; The agenda of backward simplifiable rows to process has 64 entries:
% 0.61/0.82  ;    64 with value 0
% 0.61/0.82  ; The agenda of rows to process has 27 entries:
% 0.61/0.82  ;     2 with value 17              3 with value 22               1 with value 26
% 0.61/0.82  ;     2 with value 18              4 with value 23               2 with value 27
% 0.61/0.82  ;     1 with value 19              1 with value 24               2 with value 28
% 0.61/0.82  ;     1 with value 20              4 with value 25               1 with value 29
% 0.61/0.82  ;     3 with value 21
% 0.61/0.82  ; The agenda of rows to give has 120 entries:
% 0.61/0.82  ;     1 with value (4 13)         18 with value (4 25)           8 with value (4 30)
% 0.61/0.82  ;     1 with value (4 19)         14 with value (4 26)           2 with value (4 31)
% 0.61/0.82  ;     3 with value (4 20)         12 with value (4 27)           1 with value (4 32)
% 0.61/0.82  ;    11 with value (4 22)          6 with value (4 28)           2 with value (4 33)
% 0.61/0.82  ;    16 with value (4 23)         10 with value (4 29)           1 with value (4 34)
% 0.61/0.82  ;    14 with value (4 24)
% 0.61/0.82  Evaluation took:
% 0.61/0.82    0.454 seconds of real time
% 0.61/0.82    0.410681 seconds of user run time
% 0.61/0.82    0.042865 seconds of system run time
% 0.61/0.82    [Run times include 0.015 seconds GC run time.]
% 0.61/0.82    0 calls to %EVAL
% 0.61/0.82    0 page faults and
% 0.61/0.82    37,899,072 bytes consed.
% 0.61/0.82  :PROOF-FOUND
% 0.61/0.82  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-17T04:17:46
% 0.61/0.82  :PROOF-FOUND
% 0.61/0.82  * 
%------------------------------------------------------------------------------