TSTP Solution File: NLP266_4 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : NLP266_4 : TPTP v8.2.0. Released v8.2.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  : 300s
% DateTime : Mon May 22 15:39:57 EDT 2023

% Result   : Theorem 0.21s 0.52s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   34 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :  285 (   0 equ)
%            Maximal formula atoms :   10 (   8 avg)
%            Number of connectives :  140 (  69   ~;  71   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  180 ( 180 fml;   0 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   20 (  16 usr;   7 prp; 0-4 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   81 (   0 sgn;  81   !;   0   ?;  81   :)

% Comments : 
%------------------------------------------------------------------------------
tff(1,axiom,
    ! [X: $ki_world] : $ki_accessible(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).

tff(2,axiom,
    ! [X: $ki_world,Y: $ki_world,Z: $ki_world] :
      ( ~ $ki_accessible(X,Y)
      | ~ $ki_accessible(Y,Z)
      | $ki_accessible(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_transitive) ).

tff(3,axiom,
    ! [X: $ki_world,Y: $i] : '$ki_exists_in_world_$i'(X,Y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).

tff(4,axiom,
    ! [X: $ki_world,Y: $ki_world] :
      ( ~ $ki_accessible($ki_local_world,X)
      | ~ $ki_accessible(X,Y)
      | userid(Y,u,'SKOLEMAAAX2.$i'(X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).

tff(5,axiom,
    ! [X: $ki_world,Y: $ki_world] :
      ( ~ $ki_accessible($ki_local_world,X)
      | ~ $ki_accessible(X,Y)
      | string(Y,'SKOLEMAAAX2.$i'(X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).

tff(6,axiom,
    ! [X: $ki_world] :
      ( ~ $ki_accessible($ki_local_world,X)
      | entry_box(X,'SKOLEMAAAX3.$i') ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

tff(7,axiom,
    ! [X: $ki_world] :
      ( ~ $ki_accessible($ki_local_world,X)
      | number(X,'SKOLEMAAAX3.$i',one) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

tff(8,axiom,
    ! [X: $ki_world,Y: $i,Z: $i,U: $i,V: $ki_world,W: $i] :
      ( ~ $ki_accessible($ki_local_world,X)
      | ~ '$ki_exists_in_world_$i'(X,Y)
      | ~ '$ki_exists_in_world_$i'(X,Z)
      | ~ '$ki_exists_in_world_$i'(X,U)
      | ~ string(X,Z)
      | ~ entry_box(X,U)
      | ~ $ki_accessible(X,V)
      | ~ '$ki_exists_in_world_$i'(V,W)
      | ~ do(V,Y,'SKOLEMAAAX4.$i'(X,Y,Z,U),W)
      | in(V,Z,U,W) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).

tff(9,plain,
    ! [X: $ki_world,Y: $i,Z: $i,U: $ki_world,V: $i,W: $i] :
      ( ~ $ki_accessible($ki_local_world,X)
      | ~ string(X,Y)
      | ~ entry_box(X,Z)
      | ~ $ki_accessible(X,U)
      | ~ do(U,V,'SKOLEMAAAX4.$i'(X,V,Y,Z),W)
      | in(U,Y,Z,W) ),
    inference('REWRITE',[status(thm)],[8,3]) ).

tff(10,negated_conjecture,
    $ki_accessible($ki_local_world,'SKOLEMAAAX5.$ki_world'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).

tff(11,negated_conjecture,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Y)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Z)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',U)
      | $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX6.$ki_world'(X,Y))
      | $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX7.$ki_world'(U,Z,X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).

tff(12,plain,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX6.$ki_world'(X,Y))
      | $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX7.$ki_world'(Z,U,X,Y)) ),
    inference('REWRITE',[status(thm)],[11,3]) ).

tff(13,negated_conjecture,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Y)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Z)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',U)
      | $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX6.$ki_world'(X,Y))
      | do('SKOLEMAAAX7.$ki_world'(U,Z,X,Y),U,Z,'SKOLEMAAAX8.$i'(U,Z,X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).

tff(14,plain,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX6.$ki_world'(X,Y))
      | do('SKOLEMAAAX7.$ki_world'(Z,U,X,Y),Z,U,'SKOLEMAAAX8.$i'(Z,U,X,Y)) ),
    inference('REWRITE',[status(thm)],[13,3]) ).

tff(15,negated_conjecture,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Y)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Z)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',U)
      | $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX6.$ki_world'(X,Y))
      | ~ in('SKOLEMAAAX7.$ki_world'(U,Z,X,Y),X,Y,'SKOLEMAAAX8.$i'(U,Z,X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).

tff(16,plain,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX6.$ki_world'(X,Y))
      | ~ in('SKOLEMAAAX7.$ki_world'(Z,U,X,Y),X,Y,'SKOLEMAAAX8.$i'(Z,U,X,Y)) ),
    inference('REWRITE',[status(thm)],[15,3]) ).

tff(17,negated_conjecture,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Y)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Z)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',U)
      | ~ userid('SKOLEMAAAX6.$ki_world'(X,Y),u,X)
      | ~ entry_box('SKOLEMAAAX6.$ki_world'(X,Y),Y)
      | ~ number('SKOLEMAAAX6.$ki_world'(X,Y),Y,one)
      | $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX7.$ki_world'(U,Z,X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).

tff(18,plain,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ userid('SKOLEMAAAX6.$ki_world'(X,Y),u,X)
      | ~ entry_box('SKOLEMAAAX6.$ki_world'(X,Y),Y)
      | ~ number('SKOLEMAAAX6.$ki_world'(X,Y),Y,one)
      | $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX7.$ki_world'(Z,U,X,Y)) ),
    inference('REWRITE',[status(thm)],[17,3]) ).

tff(19,negated_conjecture,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Y)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Z)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',U)
      | ~ userid('SKOLEMAAAX6.$ki_world'(X,Y),u,X)
      | ~ entry_box('SKOLEMAAAX6.$ki_world'(X,Y),Y)
      | ~ number('SKOLEMAAAX6.$ki_world'(X,Y),Y,one)
      | do('SKOLEMAAAX7.$ki_world'(U,Z,X,Y),U,Z,'SKOLEMAAAX8.$i'(U,Z,X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).

tff(20,plain,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ userid('SKOLEMAAAX6.$ki_world'(X,Y),u,X)
      | ~ entry_box('SKOLEMAAAX6.$ki_world'(X,Y),Y)
      | ~ number('SKOLEMAAAX6.$ki_world'(X,Y),Y,one)
      | do('SKOLEMAAAX7.$ki_world'(Z,U,X,Y),Z,U,'SKOLEMAAAX8.$i'(Z,U,X,Y)) ),
    inference('REWRITE',[status(thm)],[19,3]) ).

tff(21,negated_conjecture,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Y)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',Z)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAX5.$ki_world',U)
      | ~ userid('SKOLEMAAAX6.$ki_world'(X,Y),u,X)
      | ~ entry_box('SKOLEMAAAX6.$ki_world'(X,Y),Y)
      | ~ number('SKOLEMAAAX6.$ki_world'(X,Y),Y,one)
      | ~ in('SKOLEMAAAX7.$ki_world'(U,Z,X,Y),X,Y,'SKOLEMAAAX8.$i'(U,Z,X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).

tff(22,plain,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ userid('SKOLEMAAAX6.$ki_world'(X,Y),u,X)
      | ~ entry_box('SKOLEMAAAX6.$ki_world'(X,Y),Y)
      | ~ number('SKOLEMAAAX6.$ki_world'(X,Y),Y,one)
      | ~ in('SKOLEMAAAX7.$ki_world'(Z,U,X,Y),X,Y,'SKOLEMAAAX8.$i'(Z,U,X,Y)) ),
    inference('REWRITE',[status(thm)],[21,3]) ).

tff(23,plain,
    entry_box('SKOLEMAAAX5.$ki_world','SKOLEMAAAX3.$i'),
    inference('HYPERRESOLVE',[status(thm)],[6,10]) ).

tff(27,plain,
    string('SKOLEMAAAX5.$ki_world','SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world')),
    inference('HYPERRESOLVE',[status(thm)],[5,10,1]) ).

tff(36,plain,
    ! [X: $i,Y: $i,Z: $i] :
      ( $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX6.$ki_world'(X,Y))
      | in('SKOLEMAAAX7.$ki_world'(Z,'SKOLEMAAAX4.$i'('SKOLEMAAAX5.$ki_world',Z,'SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i'),X,Y),'SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i','SKOLEMAAAX8.$i'(Z,'SKOLEMAAAX4.$i'('SKOLEMAAAX5.$ki_world',Z,'SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i'),X,Y)) ),
    inference('HYPERRESOLVE',[status(thm)],[9,27,10,23,12,14]) ).

tff(45,plain,
    $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX6.$ki_world'('SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i')),
    inference('HYPERRESOLVE',[status(thm)],[16,36]) ).

tff(46,plain,
    $ki_accessible($ki_local_world,'SKOLEMAAAX6.$ki_world'('SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i')),
    inference('HYPERRESOLVE',[status(thm)],[2,45,10]) ).

tff(48,plain,
    userid('SKOLEMAAAX6.$ki_world'('SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i'),u,'SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world')),
    inference('HYPERRESOLVE',[status(thm)],[4,45,10]) ).

tff(49,plain,
    entry_box('SKOLEMAAAX6.$ki_world'('SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i'),'SKOLEMAAAX3.$i'),
    inference('HYPERRESOLVE',[status(thm)],[6,46]) ).

tff(50,plain,
    number('SKOLEMAAAX6.$ki_world'('SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i'),'SKOLEMAAAX3.$i',one),
    inference('HYPERRESOLVE',[status(thm)],[7,46]) ).

tff(55,plain,
    ! [X: $i,Y: $i] : $ki_accessible('SKOLEMAAAX5.$ki_world','SKOLEMAAAX7.$ki_world'(X,Y,'SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i')),
    inference('HYPERRESOLVE',[status(thm)],[18,50,48,49]) ).

tff(56,plain,
    ! [X: $i,Y: $i] : do('SKOLEMAAAX7.$ki_world'(X,Y,'SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i'),X,Y,'SKOLEMAAAX8.$i'(X,Y,'SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i')),
    inference('HYPERRESOLVE',[status(thm)],[20,50,48,49]) ).

tff(57,plain,
    ! [X: $i,Y: $i] : ~ in('SKOLEMAAAX7.$ki_world'(X,Y,'SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i'),'SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i','SKOLEMAAAX8.$i'(X,Y,'SKOLEMAAAX2.$i'('SKOLEMAAAX5.$ki_world'),'SKOLEMAAAX3.$i')),
    inference('UR-RESOLVE',[status(thm)],[22,50,48,49]) ).

cnf(67,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[9,56,10,27,23,55]),57]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NLP266_4 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n016.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  : 300
% 0.13/0.34  % DateTime : Mon May 22 12:38:02 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.21/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47  * 
% 0.21/0.47  * 
% 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/sandbox2/benchmark/theBenchmark.p 2023-05-22T12:38:02
% 0.21/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 2023-05-22T12:38:02
% 0.21/0.52  
% 0.21/0.52  
% 0.21/0.52  #||
% 0.21/0.52  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.53  % SZS output start Refutation
% See solution above
% 0.21/0.53  ||#
% 0.21/0.53  
% 0.21/0.53  ; Summary of computation:
% 0.21/0.53  ;       141 formulas have been input or derived (from 55 formulas).
% 0.21/0.53  ;        67 (48%) were retained.  Of these,
% 0.21/0.53  ;            7 (10%) were simplified or subsumed later,
% 0.21/0.53  ;           60 (90%) are still being kept.
% 0.21/0.53  ; 
% 0.21/0.53  ; Run time in seconds excluding printing time:
% 0.21/0.53  ;     0.005  10%   Read assertion file          (1 call)
% 0.21/0.53  ;     0.001   2%   Assert                       (8 calls)
% 0.21/0.53  ;     0.008  17%   Process new row              (105 calls)
% 0.21/0.53  ;     0.009  19%   Resolution                   (108 calls)
% 0.21/0.53  ;     0.000   0%   Paramodulation               (54 calls)
% 0.21/0.53  ;     0.000   0%   Factoring                    (12 calls)
% 0.21/0.53  ;     0.000   0%   Condensing                   (27 calls)
% 0.21/0.53  ;     0.001   2%   Forward subsumption          (27 calls)
% 0.21/0.53  ;     0.000   0%   Backward subsumption         (24 calls)
% 0.21/0.53  ;     0.000   0%   Clause clause subsumption    (3 calls)
% 0.21/0.53  ;     0.000   0%   Forward simplification       (105 calls)
% 0.21/0.53  ;     0.000   0%   Backward simplification      (60 calls)
% 0.21/0.53  ;     0.000   0%   Ordering                     (24 calls)
% 0.21/0.53  ;     0.000   0%   Sortal reasoning             (33 calls)
% 0.21/0.53  ;     0.000   0%   Purity testing               (1 call)
% 0.21/0.53  ;     0.024  50%   Other
% 0.21/0.53  ;     0.048        Total
% 0.21/0.53  ;     0.055        Real time
% 0.21/0.53  ; 
% 0.21/0.53  ; Term-hash-array has 89 terms in all.
% 0.21/0.53  ; Feature-vector-row-index has 24 entries (24 at peak, 24 added, 0 deleted).
% 0.21/0.53  ; Feature-vector-row-index has 175 nodes (175 at peak, 175 added, 0 deleted).
% 0.21/0.53  ;  Retrieved 3 possibly forward subsuming rows in 27 calls.
% 0.21/0.53  ;  Retrieved 0 possibly backward subsumed rows in 24 calls.
% 0.21/0.53  ; Path-index has 94 entries (94 at peak, 94 added, 0 deleted).
% 0.21/0.53  ; Path-index has 391 nodes (391 at peak, 391 added, 0 deleted).
% 0.21/0.53  ; Trie-index has 94 entries (94 at peak, 94 added, 0 deleted).
% 0.21/0.53  ; Trie-index has 417 nodes (417 at peak, 417 added, 0 deleted).
% 0.21/0.53  ; Retrieved 126 generalization terms in 158 calls.
% 0.21/0.53  ; Retrieved 35 instance terms in 35 calls.
% 0.21/0.53  ; Retrieved 1,562 unifiable terms in 952 calls.
% 0.21/0.53  ; 
% 0.21/0.53  ; The agenda of rows to process has 7 entries:
% 0.21/0.53  ;     3 with value 37              1 with value 38               3 with value 46
% 0.21/0.53  ; The agenda of rows to give has 5 entries:
% 0.21/0.53  ;     1 with value (4 25)          1 with value (4 27)           2 with value (4 37)
% 0.21/0.53  ;     1 with value (4 26)
% 0.21/0.53  Evaluation took:
% 0.21/0.53    0.056 seconds of real time
% 0.21/0.53    0.049892 seconds of user run time
% 0.21/0.53    0.006029 seconds of system run time
% 0.21/0.53    0 calls to %EVAL
% 0.21/0.53    0 page faults and
% 0.21/0.53    7,189,528 bytes consed.
% 0.21/0.53  :PROOF-FOUND
% 0.21/0.53  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2023-05-22T12:38:02
% 0.21/0.53  :PROOF-FOUND
% 0.21/0.53  * 
%------------------------------------------------------------------------------