TSTP Solution File: NLP265_17 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : NLP265_17 : TPTP v8.2.0. Released v8.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n019.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 : Fri May  3 02:45:38 EDT 2024

% Result   : Theorem 0.74s 1.14s
% Output   : CNFRefutation 0.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :   35 (  18   ~;  12   |;   0   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   29 (  29 fml;   0 var)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   6 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   26 (   4 sgn  19   !;   0   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f1,axiom,
    ! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','mrel_universal_#idx(b_alice)') ).

tff(f2,axiom,
    ! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_bob)',X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','mrel_universal_#idx(b_bob)') ).

tff(f7,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
     => bigcity(X0,portland) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

tff(f8,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
     => ! [X2: '$ki_world'] :
          ( '$ki_accessible'('#idx(b_bob)',X0,X2)
         => ~ bigcity(X2,portland) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

tff(f13,plain,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0)
     => ! [X1: '$ki_world'] :
          ( '$ki_accessible'('#idx(b_bob)',X0,X1)
         => ~ bigcity(X1,portland) ) ),
    inference(rectify,[],[f8]) ).

tff(f19,plain,
    ! [X0: '$ki_world'] :
      ( bigcity(X0,portland)
      | ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f20,plain,
    ! [X0: '$ki_world'] :
      ( ! [X1: '$ki_world'] :
          ( ~ bigcity(X1,portland)
          | ~ '$ki_accessible'('#idx(b_bob)',X0,X1) )
      | ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f13]) ).

tff(f33,plain,
    ! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X0,X1),
    inference(cnf_transformation,[],[f1]) ).

tff(f34,plain,
    ! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_bob)',X0,X1),
    inference(cnf_transformation,[],[f2]) ).

tff(f43,plain,
    ! [X0: '$ki_world'] :
      ( bigcity(X0,portland)
      | ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f19]) ).

tff(f44,plain,
    ! [X0: '$ki_world',X1: '$ki_world'] :
      ( ~ bigcity(X1,portland)
      | ~ '$ki_accessible'('#idx(b_bob)',X0,X1)
      | ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f20]) ).

cnf(c_49,plain,
    '$ki_accessible'('#idx(b_alice)',X0_13,X1_13),
    inference(cnf_transformation,[],[f33]) ).

cnf(c_50,plain,
    '$ki_accessible'('#idx(b_bob)',X0_13,X1_13),
    inference(cnf_transformation,[],[f34]) ).

cnf(c_59,plain,
    ( ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0_13)
    | bigcity(X0_13,portland) ),
    inference(cnf_transformation,[],[f43]) ).

cnf(c_60,plain,
    ( ~ '$ki_accessible'('#idx(b_bob)',X0_13,X1_13)
    | ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X0_13)
    | ~ bigcity(X1_13,portland) ),
    inference(cnf_transformation,[],[f44]) ).

cnf(c_66,plain,
    '$ki_accessible'('#idx(b_bob)','$ki_local_world','$ki_local_world'),
    inference(instantiation,[status(thm)],[c_50]) ).

cnf(c_67,plain,
    '$ki_accessible'('#idx(b_alice)','$ki_local_world','$ki_local_world'),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_68,plain,
    ( ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world','$ki_local_world')
    | bigcity('$ki_local_world',portland) ),
    inference(instantiation,[status(thm)],[c_59]) ).

cnf(c_69,plain,
    ( ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world','$ki_local_world')
    | ~ '$ki_accessible'('#idx(b_bob)','$ki_local_world','$ki_local_world')
    | ~ bigcity('$ki_local_world',portland) ),
    inference(instantiation,[status(thm)],[c_60]) ).

cnf(c_70,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_69,c_68,c_67,c_66]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem  : NLP265_17 : TPTP v8.2.0. Released v8.2.0.
% 0.02/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n019.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Thu May  2 18:38:14 EDT 2024
% 0.11/0.33  % CPUTime  : 
% 0.17/0.44  Running first-order theorem proving
% 0.17/0.44  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.74/1.14  % SZS status Started for theBenchmark.p
% 0.74/1.14  % SZS status Theorem for theBenchmark.p
% 0.74/1.14  
% 0.74/1.14  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.74/1.14  
% 0.74/1.14  ------  iProver source info
% 0.74/1.14  
% 0.74/1.14  git: date: 2024-05-02 19:28:25 +0000
% 0.74/1.14  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.74/1.14  git: non_committed_changes: false
% 0.74/1.14  
% 0.74/1.14  ------ Parsing...
% 0.74/1.14  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 0.74/1.14  
% 0.74/1.14  
% 0.74/1.14  ------ Preprocessing...
% 0.74/1.14  
% 0.74/1.14  % SZS status Theorem for theBenchmark.p
% 0.74/1.14  
% 0.74/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.74/1.14  
% 0.74/1.14  
%------------------------------------------------------------------------------