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

View Problem - Process Solution

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

% Computer : n017.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:41:25 EDT 2023

% Result   : Theorem 0.21s 0.51s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   18 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :   56 (  29   ~;  27   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   35 (  35 fml;   0 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   13 (   9 usr;   6 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   30 (   0 sgn;  30   !;   0   ?;  30   :)

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

tff(3,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(4,axiom,
    ! [X: $ki_world,Y: $i,Z: $i,U: $ki_world,V: $ki_world] :
      ( ~ $ki_accessible($ki_local_world,X)
      | ~ '$ki_exists_in_world_$i'(X,Y)
      | ~ '$ki_exists_in_world_$i'(X,Z)
      | ~ $ki_accessible(X,U)
      | ~ closed(U,Y)
      | ~ combo(U,Y,Z)
      | ~ h(U,'SKOLEMAAAU2.$i'(X,Y,Z))
      | ~ $ki_accessible(U,V)
      | open(V,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).

tff(5,plain,
    ! [X: $ki_world,Y: $ki_world,Z: $i,U: $i,V: $ki_world] :
      ( ~ $ki_accessible($ki_local_world,X)
      | ~ $ki_accessible(X,Y)
      | ~ closed(Y,Z)
      | ~ combo(Y,Z,U)
      | ~ h(Y,'SKOLEMAAAU2.$i'(X,Z,U))
      | ~ $ki_accessible(Y,V)
      | open(V,Z) ),
    inference('REWRITE',[status(thm)],[4,3]) ).

tff(8,axiom,
    ! [X: $ki_world] :
      ( ~ $ki_accessible($ki_local_world,X)
      | closed(X,d) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

tff(12,negated_conjecture,
    $ki_accessible($ki_local_world,'SKOLEMAAAU4.$ki_world'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(13,negated_conjecture,
    ! [X: $i,Y: $i,Z: $ki_world] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAU4.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAU4.$ki_world',Y)
      | ~ $ki_accessible('SKOLEMAAAU4.$ki_world',Z)
      | combo(Z,d,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(14,plain,
    ! [X: $ki_world,Y: $i] :
      ( ~ $ki_accessible('SKOLEMAAAU4.$ki_world',X)
      | combo(X,d,Y) ),
    inference('REWRITE',[status(thm)],[13,3]) ).

tff(15,negated_conjecture,
    ! [X: $i,Y: $i,Z: $ki_world] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAU4.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAU4.$ki_world',Y)
      | ~ $ki_accessible('SKOLEMAAAU4.$ki_world',Z)
      | h(Z,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(16,plain,
    ! [X: $ki_world,Y: $i] :
      ( ~ $ki_accessible('SKOLEMAAAU4.$ki_world',X)
      | h(X,Y) ),
    inference('REWRITE',[status(thm)],[15,3]) ).

tff(17,negated_conjecture,
    ! [X: $i,Y: $i] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAU4.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAU4.$ki_world',Y)
      | $ki_accessible('SKOLEMAAAU4.$ki_world','SKOLEMAAAU5.$ki_world') ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(18,plain,
    $ki_accessible('SKOLEMAAAU4.$ki_world','SKOLEMAAAU5.$ki_world'),
    inference('REWRITE',[status(thm)],[17,3]) ).

tff(19,negated_conjecture,
    ! [X: $i,Y: $i] :
      ( ~ '$ki_exists_in_world_$i'('SKOLEMAAAU4.$ki_world',X)
      | ~ '$ki_exists_in_world_$i'('SKOLEMAAAU4.$ki_world',Y)
      | ~ open('SKOLEMAAAU5.$ki_world',d) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(20,plain,
    ~ open('SKOLEMAAAU5.$ki_world',d),
    inference('REWRITE',[status(thm)],[19,3]) ).

tff(21,plain,
    closed('SKOLEMAAAU4.$ki_world',d),
    inference('HYPERRESOLVE',[status(thm)],[8,12]) ).

tff(24,plain,
    ! [X: $i] : h('SKOLEMAAAU4.$ki_world',X),
    inference('HYPERRESOLVE',[status(thm)],[16,1]) ).

tff(28,plain,
    ! [X: $i] : combo('SKOLEMAAAU4.$ki_world',d,X),
    inference('HYPERRESOLVE',[status(thm)],[14,1]) ).

cnf(32,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[5,24,12,1,21,18,20]),28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : PLA054_4 : TPTP v8.2.0. Released v8.2.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n017.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 11:54:03 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.21/0.46  /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2023-05-22T11:54:03
% 0.21/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2023-05-22T11:54:03
% 0.21/0.51  
% 0.21/0.51  
% 0.21/0.51  #||
% 0.21/0.51  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.51  % SZS output start Refutation
% See solution above
% 0.21/0.52  ||#
% 0.21/0.52  
% 0.21/0.52  ; Summary of computation:
% 0.21/0.52  ;        59 formulas have been input or derived (from 18 formulas).
% 0.21/0.52  ;        32 (54%) were retained.  Of these,
% 0.21/0.52  ;            8 (25%) were simplified or subsumed later,
% 0.21/0.52  ;           24 (75%) are still being kept.
% 0.21/0.52  ; 
% 0.21/0.52  ; Run time in seconds excluding printing time:
% 0.21/0.52  ;     0.005  15%   Read assertion file          (1 call)
% 0.21/0.52  ;     0.001   3%   Assert                       (10 calls)
% 0.21/0.52  ;     0.001   3%   Process new row              (47 calls)
% 0.21/0.52  ;     0.003   9%   Resolution                   (34 calls)
% 0.21/0.52  ;     0.000   0%   Paramodulation               (17 calls)
% 0.21/0.52  ;     0.000   0%   Condensing                   (8 calls)
% 0.21/0.52  ;     0.000   0%   Forward subsumption          (8 calls)
% 0.21/0.52  ;     0.000   0%   Backward subsumption         (8 calls)
% 0.21/0.52  ;     0.002   6%   Forward simplification       (47 calls)
% 0.21/0.52  ;     0.000   0%   Backward simplification      (25 calls)
% 0.21/0.52  ;     0.000   0%   Sortal reasoning             (33 calls)
% 0.21/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.21/0.52  ;     0.021  64%   Other
% 0.21/0.52  ;     0.033        Total
% 0.21/0.52  ;     0.036        Real time
% 0.21/0.52  ; 
% 0.21/0.52  ; Term-hash-array has 35 terms in all.
% 0.21/0.52  ; Feature-vector-row-index has 8 entries (8 at peak, 8 added, 0 deleted).
% 0.21/0.52  ; Feature-vector-row-index has 34 nodes (34 at peak, 34 added, 0 deleted).
% 0.21/0.52  ;  Retrieved 0 possibly forward subsuming rows in 8 calls.
% 0.21/0.52  ;  Retrieved 0 possibly backward subsumed rows in 8 calls.
% 0.21/0.52  ; Path-index has 40 entries (40 at peak, 41 added, 1 deleted).
% 0.21/0.52  ; Path-index has 72 nodes (72 at peak, 72 added, 0 deleted).
% 0.21/0.52  ; Trie-index has 40 entries (40 at peak, 41 added, 1 deleted).
% 0.21/0.52  ; Trie-index has 69 nodes (69 at peak, 70 added, 1 deleted).
% 0.21/0.52  ; Retrieved 56 generalization terms in 63 calls.
% 0.21/0.52  ; Retrieved 17 instance terms in 16 calls.
% 0.21/0.52  ; Retrieved 798 unifiable terms in 311 calls.
% 0.21/0.52  ; 
% 0.21/0.52  ; The agenda of rows to process has 4 entries:
% 0.21/0.52  ;     4 with value 11
% 0.21/0.52  ; The agenda of rows to give has 6 entries:
% 0.21/0.52  ;     1 with value (4 5)           5 with value (4 6)
% 0.21/0.52  Evaluation took:
% 0.21/0.52    0.036 seconds of real time
% 0.21/0.52    0.033322 seconds of user run time
% 0.21/0.52    0.002999 seconds of system run time
% 0.21/0.52    0 calls to %EVAL
% 0.21/0.52    0 page faults and
% 0.21/0.52    3,185,552 bytes consed.
% 0.21/0.52  :PROOF-FOUND
% 0.21/0.52  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2023-05-22T11:54:03
% 0.21/0.52  :PROOF-FOUND
% 0.21/0.52  * 
%------------------------------------------------------------------------------