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

View Problem - Process Solution

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

% Computer : n022.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:23 EDT 2022

% Result   : Unsatisfiable 0.75s 0.97s
% Output   : Refutation 0.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   17 (  11 unt;   6 nHn;   5 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-3 aty)
%            Number of variables   :   25 (   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(unpack2,axiom,
    unpack2(X,Y,pack1(X,Y)) = Y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack2) ).

cnf(unpack2_05,axiom,
    unpack2(X,inv(Y),pack1(X,Y)) = Y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack2_05) ).

cnf(unpack2_06,axiom,
    unpack2(X,Y,inv(pack1(X,Y))) = Y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack2_06) ).

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

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

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

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

cnf(18,plain,
    unpack2(X,i,pack1(X,o)) = o,
    inference('PARAMODULATE',[status(thm)],[unpack2_05,11,theory(equality)]) ).

cnf(22,plain,
    unpack2(X,o,pack1(X,i)) = i,
    inference('PARAMODULATE',[status(thm)],[unpack2_05,12,theory(equality)]) ).

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

cnf(313,plain,
    ( Y = X
    | Z = X
    | Z = Y ),
    inference('CONDENSE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,32,theory(equality)])]) ).

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

cnf(331,plain,
    ( pack1(X,Y) = Z
    | unpack2(X,Y,Z) = Y ),
    inference('PARAMODULATE',[status(thm)],[unpack2_06,315,theory(equality)]) ).

cnf(477,plain,
    pack1(X,o) = pack1(X,i),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[22,331,theory(equality)]),14]) ).

cnf(494,plain,
    $false,
    inference('REWRITE',[status(thm)],[18,14,unpack2,477,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : HWV052-1.002.001 : TPTP v8.1.0. Released v4.1.0.
% 0.09/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jun 17 06:15:32 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45  * 
% 0.18/0.45  * 
% 0.18/0.45  #<PACKAGE "SNARK-USER">
% 0.18/0.45  * 
% 0.18/0.45  SNARK-TPTP-OPTIONS
% 0.18/0.45  * 
% 0.18/0.45  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.45   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.45   (USE-FACTORING :POS)
% 0.18/0.45   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.45   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.45   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.45   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.45   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.45   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.45   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.45   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.45   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.45   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.45  * 
% 0.18/0.45  "."
% 0.18/0.45  * 
% 0.18/0.45  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-17T06:15:32
% 0.18/0.45  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-17T06:15:32
% 0.75/0.97  
% 0.75/0.97  
% 0.75/0.97  #||
% 0.75/0.97  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.75/0.97  % SZS output start Refutation
% See solution above
% 0.75/0.98  ||#
% 0.75/0.98  
% 0.75/0.98  ; Summary of computation:
% 0.75/0.98  ;      2976 formulas have been input or derived (from 80 formulas).
% 0.75/0.98  ;       494 (17%) were retained.  Of these,
% 0.75/0.98  ;          166 (34%) were simplified or subsumed later,
% 0.75/0.98  ;          328 (66%) are still being kept.
% 0.75/0.98  ; 
% 0.75/0.98  ; Run time in seconds excluding printing time:
% 0.75/0.98  ;     0.002   0%   Read assertion file          (1 call)
% 0.75/0.98  ;     0.000   0%   Assert                       (10 calls)
% 0.75/0.98  ;     0.050  10%   Process new row              (2,747 calls)
% 0.75/0.98  ;     0.051  10%   Resolution                   (158 calls)
% 0.75/0.98  ;     0.015   3%   Paramodulation               (79 calls)
% 0.75/0.98  ;     0.001   0%   Factoring                    (42 calls)
% 0.75/0.98  ;     0.066  13%   Condensing                   (1,393 calls)
% 0.75/0.98  ;     0.039   7%   Forward subsumption          (1,393 calls)
% 0.75/0.98  ;     0.028   5%   Backward subsumption         (467 calls)
% 0.75/0.98  ;     0.168  32%   Clause clause subsumption    (6,831 calls)
% 0.75/0.98  ;     0.052  10%   Forward simplification       (2,688 calls)
% 0.75/0.98  ;     0.002   0%   Backward simplification      (494 calls)
% 0.75/0.98  ;     0.009   2%   Ordering                     (6,779 calls)
% 0.75/0.98  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.75/0.98  ;     0.000   0%   Purity testing               (1 call)
% 0.75/0.98  ;     0.038   7%   Other
% 0.75/0.98  ;     0.521        Total
% 0.75/0.98  ;     0.527        Real time
% 0.75/0.98  ; 
% 0.75/0.98  ; Term-hash-array has 630 terms in all.
% 0.75/0.98  ; Feature-vector-row-index has 303 entries (329 at peak, 467 added, 164 deleted).
% 0.75/0.98  ; Feature-vector-row-index has 602 nodes (675 at peak, 872 added, 270 deleted).
% 0.75/0.98  ;  Retrieved 6,079 possibly forward subsuming rows in 1,393 calls.
% 0.75/0.98  ;  Retrieved 2,315 possibly backward subsumed rows in 467 calls.
% 0.75/0.98  ; Path-index has 441 entries (490 at peak, 643 added, 202 deleted).
% 0.75/0.98  ; Path-index has 262 nodes (278 at peak, 282 added, 20 deleted).
% 0.75/0.98  ; Trie-index has 441 entries (490 at peak, 643 added, 202 deleted).
% 0.75/0.98  ; Trie-index has 656 nodes (882 at peak, 1,000 added, 344 deleted).
% 0.75/0.98  ; Retrieved 4,386 generalization terms in 10,169 calls.
% 0.75/0.98  ; Retrieved 45 instance terms in 26 calls.
% 0.75/0.98  ; Retrieved 19,826 unifiable terms in 1,152 calls.
% 0.75/0.98  ; 
% 0.75/0.98  ; The agenda of backward simplifiable rows to process has 7 entries:
% 0.75/0.98  ;     7 with value 0
% 0.75/0.98  ; The agenda of rows to process has 23 entries:
% 0.75/0.98  ;     3 with value 19              4 with value 25               1 with value 28
% 0.75/0.98  ;     2 with value 21              1 with value 26               2 with value 29
% 0.75/0.98  ;     3 with value 23              4 with value 27               1 with value 31
% 0.75/0.98  ;     2 with value 24
% 0.75/0.98  ; The agenda of rows to give has 273 entries:
% 0.75/0.98  ;     1 with value (4 15)         42 with value (4 25)           7 with value (4 30)
% 0.75/0.98  ;     1 with value (4 20)         35 with value (4 26)          12 with value (4 31)
% 0.75/0.98  ;     3 with value (4 21)         50 with value (4 27)           7 with value (4 32)
% 0.75/0.98  ;    13 with value (4 22)         48 with value (4 28)           4 with value (4 33)
% 0.75/0.98  ;     7 with value (4 23)         13 with value (4 29)           4 with value (4 34)
% 0.75/0.98  ;    26 with value (4 24)
% 0.75/0.98  Evaluation took:
% 0.75/0.98    0.527 seconds of real time
% 0.75/0.98    0.485063 seconds of user run time
% 0.75/0.98    0.041896 seconds of system run time
% 0.75/0.98    [Run times include 0.018 seconds GC run time.]
% 0.75/0.98    0 calls to %EVAL
% 0.75/0.98    0 page faults and
% 0.75/0.98    50,300,520 bytes consed.
% 0.75/0.98  :PROOF-FOUND
% 0.75/0.98  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-17T06:15:33
% 0.75/0.98  :PROOF-FOUND
% 0.75/0.98  * 
%------------------------------------------------------------------------------