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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : NLP266_23 : TPTP v8.2.0. Released v8.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n004.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.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   19 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :  126 (   0 equ)
%            Maximal formula atoms :   10 (   6 avg)
%            Number of connectives :   79 (  41   ~;  38   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   69 (  69 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   :   50 (   0 sgn;  50   !;   0   ?;  50   :)

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

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

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

tff(4,plain,
    ! [X: $ki_world,Y: $ki_world] : userid(X,u,'SKOLEMAAAV2.$i'(Y)),
    inference('REWRITE',[status(thm)],[3,1]) ).

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

tff(6,plain,
    ! [X: $ki_world,Y: $ki_world] : string(X,'SKOLEMAAAV2.$i'(Y)),
    inference('REWRITE',[status(thm)],[5,1]) ).

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

tff(8,plain,
    ! [X: $ki_world] : entry_box(X,'SKOLEMAAAV3.$i'),
    inference('REWRITE',[status(thm)],[7,1]) ).

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

tff(10,plain,
    ! [X: $ki_world] : number(X,'SKOLEMAAAV3.$i',one),
    inference('REWRITE',[status(thm)],[9,1]) ).

tff(11,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,'SKOLEMAAAV4.$i'(X,Y,Z,U),W)
      | in(V,Z,U,W) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).

tff(12,plain,
    ! [X: $ki_world,Y: $i,Z: $i,U: $ki_world,V: $i,W: $i] :
      ( ~ string(X,Y)
      | ~ entry_box(X,Z)
      | ~ do(U,V,'SKOLEMAAAV4.$i'(X,V,Y,Z),W)
      | in(U,Y,Z,W) ),
    inference('REWRITE',[status(thm)],[11,2,1]) ).

tff(13,negated_conjecture,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAV5.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAV5.$ki_world',Y)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAV5.$ki_world',Z)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAV5.$ki_world',U)
      | ~ userid('SKOLEMAAAV6.$ki_world'(X,Y),u,X)
      | ~ entry_box('SKOLEMAAAV6.$ki_world'(X,Y),Y)
      | ~ number('SKOLEMAAAV6.$ki_world'(X,Y),Y,one)
      | do('SKOLEMAAAV7.$ki_world'(U,Z,X,Y),U,Z,'SKOLEMAAAV8.$i'(U,Z,X,Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(14,plain,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ userid('SKOLEMAAAV6.$ki_world'(X,Y),u,X)
      | ~ entry_box('SKOLEMAAAV6.$ki_world'(X,Y),Y)
      | ~ number('SKOLEMAAAV6.$ki_world'(X,Y),Y,one)
      | do('SKOLEMAAAV7.$ki_world'(Z,U,X,Y),Z,U,'SKOLEMAAAV8.$i'(Z,U,X,Y)) ),
    inference('REWRITE',[status(thm)],[13,2]) ).

tff(15,negated_conjecture,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAV5.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAV5.$ki_world',Y)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAV5.$ki_world',Z)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAV5.$ki_world',U)
      | ~ userid('SKOLEMAAAV6.$ki_world'(X,Y),u,X)
      | ~ entry_box('SKOLEMAAAV6.$ki_world'(X,Y),Y)
      | ~ number('SKOLEMAAAV6.$ki_world'(X,Y),Y,one)
      | ~ in('SKOLEMAAAV7.$ki_world'(U,Z,X,Y),X,Y,'SKOLEMAAAV8.$i'(U,Z,X,Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(16,plain,
    ! [X: $i,Y: $i,Z: $i,U: $i] :
      ( ~ userid('SKOLEMAAAV6.$ki_world'(X,Y),u,X)
      | ~ entry_box('SKOLEMAAAV6.$ki_world'(X,Y),Y)
      | ~ number('SKOLEMAAAV6.$ki_world'(X,Y),Y,one)
      | ~ in('SKOLEMAAAV7.$ki_world'(Z,U,X,Y),X,Y,'SKOLEMAAAV8.$i'(Z,U,X,Y)) ),
    inference('REWRITE',[status(thm)],[15,2]) ).

tff(17,plain,
    ! [X: $i,Y: $i,Z: $ki_world] : do('SKOLEMAAAV7.$ki_world'(X,Y,'SKOLEMAAAV2.$i'(Z),'SKOLEMAAAV3.$i'),X,Y,'SKOLEMAAAV8.$i'(X,Y,'SKOLEMAAAV2.$i'(Z),'SKOLEMAAAV3.$i')),
    inference('HYPERRESOLVE',[status(thm)],[14,4,8,10]) ).

tff(18,plain,
    ! [X: $i,Y: $i,Z: $ki_world] : ~ in('SKOLEMAAAV7.$ki_world'(X,Y,'SKOLEMAAAV2.$i'(Z),'SKOLEMAAAV3.$i'),'SKOLEMAAAV2.$i'(Z),'SKOLEMAAAV3.$i','SKOLEMAAAV8.$i'(X,Y,'SKOLEMAAAV2.$i'(Z),'SKOLEMAAAV3.$i')),
    inference('UR-RESOLVE',[status(thm)],[16,4,8,10]) ).

cnf(20,plain,
    $false,
    inference('UR-RESOLVE',[status(thm)],[12,18,6,8,17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : NLP266_23 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.14  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon May 22 12:03:53 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.47  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48  * 
% 0.21/0.48  * 
% 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/sandbox/benchmark/theBenchmark.p 2023-05-22T12:03:53
% 0.21/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2023-05-22T12:03:53
% 0.21/0.52  
% 0.21/0.52  
% 0.21/0.52  #||
% 0.21/0.52  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.52  % SZS output start Refutation
% See solution above
% 0.36/0.52  ||#
% 0.36/0.52  
% 0.36/0.52  ; Summary of computation:
% 0.36/0.52  ;        36 formulas have been input or derived (from 12 formulas).
% 0.36/0.52  ;        20 (56%) were retained.  Of these,
% 0.36/0.52  ;            7 (35%) were simplified or subsumed later,
% 0.36/0.52  ;           13 (65%) are still being kept.
% 0.36/0.52  ; 
% 0.36/0.52  ; Run time in seconds excluding printing time:
% 0.36/0.52  ;     0.005  15%   Read assertion file          (1 call)
% 0.36/0.52  ;     0.001   3%   Assert                       (7 calls)
% 0.36/0.52  ;     0.003   9%   Process new row              (24 calls)
% 0.36/0.52  ;     0.000   0%   Resolution                   (22 calls)
% 0.36/0.52  ;     0.000   0%   Paramodulation               (11 calls)
% 0.36/0.52  ;     0.000   0%   Condensing                   (3 calls)
% 0.36/0.52  ;     0.000   0%   Forward subsumption          (3 calls)
% 0.36/0.52  ;     0.000   0%   Backward subsumption         (3 calls)
% 0.36/0.52  ;     0.000   0%   Forward simplification       (24 calls)
% 0.36/0.52  ;     0.000   0%   Backward simplification      (13 calls)
% 0.36/0.52  ;     0.000   0%   Sortal reasoning             (33 calls)
% 0.36/0.52  ;     0.001   3%   Purity testing               (1 call)
% 0.36/0.52  ;     0.023  70%   Other
% 0.36/0.52  ;     0.033        Total
% 0.36/0.52  ;     0.038        Real time
% 0.36/0.52  ; 
% 0.36/0.52  ; Term-hash-array has 30 terms in all.
% 0.36/0.52  ; Feature-vector-row-index has 3 entries (3 at peak, 3 added, 0 deleted).
% 0.36/0.52  ; Feature-vector-row-index has 25 nodes (25 at peak, 25 added, 0 deleted).
% 0.36/0.52  ;  Retrieved 0 possibly forward subsuming rows in 3 calls.
% 0.36/0.52  ;  Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.36/0.52  ; Path-index has 35 entries (35 at peak, 35 added, 0 deleted).
% 0.36/0.52  ; Path-index has 222 nodes (222 at peak, 222 added, 0 deleted).
% 0.36/0.52  ; Trie-index has 35 entries (35 at peak, 35 added, 0 deleted).
% 0.36/0.52  ; Trie-index has 175 nodes (175 at peak, 175 added, 0 deleted).
% 0.36/0.52  ; Retrieved 63 generalization terms in 79 calls.
% 0.36/0.52  ; Retrieved 9 instance terms in 9 calls.
% 0.36/0.52  ; Retrieved 81 unifiable terms in 98 calls.
% 0.36/0.52  ; 
% 0.36/0.52  ; The agenda of rows to process has 3 entries:
% 0.36/0.52  ;     1 with value 6               1 with value 8                1 with value 25
% 0.36/0.52  ; The agenda of rows to give has 1 entry:
% 0.36/0.52  ;     1 with value (4 32)
% 0.36/0.52  Evaluation took:
% 0.36/0.52    0.038 seconds of real time
% 0.36/0.52    0.032572 seconds of user run time
% 0.36/0.52    0.005036 seconds of system run time
% 0.36/0.52    0 calls to %EVAL
% 0.36/0.52    0 page faults and
% 0.36/0.52    4,078,352 bytes consed.
% 0.36/0.52  :PROOF-FOUND
% 0.36/0.52  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2023-05-22T12:03:53
% 0.36/0.52  :PROOF-FOUND
% 0.36/0.52  * 
%------------------------------------------------------------------------------