TSTP Solution File: NLP064-1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : NLP064-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n028.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 : Thu Aug 31 09:54:39 EDT 2023

% Result   : Satisfiable 2.80s 1.15s
% Output   : Model 2.80s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
%------ Positive definition of ssSkC0 
fof(lit_def,axiom,
    ( ssSkC0
  <=> $true ) ).

%------ Positive definition of ssSkP1 
fof(lit_def_001,axiom,
    ! [X0,X1,X2] :
      ( ssSkP1(X0,X1,X2)
    <=> ( X2 = skc60
        & ( X0 != skc62
          | X1 != skc61 )
        & X1 != skc61 ) ) ).

%------ Negative definition of ssSkP0 
fof(lit_def_002,axiom,
    ! [X0,X1,X2] :
      ( ~ ssSkP0(X0,X1,X2)
    <=> ( ( X0 = skc62
          & X1 = skc61
          & X2 = skc60 )
        | ( X1 = skc61
          & X2 = skc60 ) ) ) ).

%------ Positive definition of member 
fof(lit_def_003,axiom,
    ! [X0,X1,X2] :
      ( member(X0,X1,X2)
    <=> ( ? [X3] :
            ( X0 = skc60
            & X1 = skf16(skc61,skc60,X3)
            & X2 = skc61 )
        | ? [X3] :
            ( X0 = skc60
            & X1 = skf26(X3,skc60,skc61)
            & X2 = skc61 )
        | ( X0 = skc60
          & X1 = skf26(skc62,skc60,skc61)
          & X2 = skc61 )
        | ? [X3] :
            ( X1 = skf26(X3,X0,X2)
            & X0 != skc60
            & ( X0 != skc60
              | X2 != skc61 ) ) ) ) ).

%------ Positive definition of man 
fof(lit_def_004,axiom,
    ! [X0,X1] :
      ( man(X0,X1)
    <=> ( ? [X2,X3] :
            ( X0 = skc60
            & X1 = skf19(skc60,X2,X3) )
        | ? [X2,X3] :
            ( X0 = skc60
            & X1 = skf21(skc60,X2,X3) ) ) ) ).

%------ Positive definition of cannon 
fof(lit_def_005,axiom,
    ! [X0,X1] :
      ( cannon(X0,X1)
    <=> ? [X2,X3] :
          ( X0 = skc60
          & X1 = skf22(skc60,X2,X3)
          & X2 != skc62 ) ) ).

%------ Positive definition of event 
fof(lit_def_006,axiom,
    ! [X0,X1] :
      ( event(X0,X1)
    <=> ? [X2,X3] :
          ( X0 = skc60
          & X1 = skf20(skc60,X2,X3) ) ) ).

%------ Negative definition of present 
fof(lit_def_007,axiom,
    ! [X0,X1] :
      ( ~ present(X0,X1)
    <=> $false ) ).

%------ Negative definition of nonreflexive 
fof(lit_def_008,axiom,
    ! [X0,X1] :
      ( ~ nonreflexive(X0,X1)
    <=> $false ) ).

%------ Negative definition of fire 
fof(lit_def_009,axiom,
    ! [X0,X1] :
      ( ~ fire(X0,X1)
    <=> $false ) ).

%------ Positive definition of of 
fof(lit_def_010,axiom,
    ! [X0,X1,X2] :
      ( of(X0,X1,X2)
    <=> ? [X3] :
          ( X0 = skc60
          & X1 = skf22(skc60,skc62,X3)
          & X2 = skc62 ) ) ).

%------ Negative definition of patient 
fof(lit_def_011,axiom,
    ! [X0,X1,X2] :
      ( ~ patient(X0,X1,X2)
    <=> $false ) ).

%------ Negative definition of from_loc 
fof(lit_def_012,axiom,
    ! [X0,X1,X2] :
      ( ~ from_loc(X0,X1,X2)
    <=> $false ) ).

%------ Negative definition of agent 
fof(lit_def_013,axiom,
    ! [X0,X1,X2] :
      ( ~ agent(X0,X1,X2)
    <=> $false ) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NLP064-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.12  % Command  : run_iprover %s %d THM
% 0.13/0.33  % Computer : n028.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Thu Aug 24 12:57:20 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 0.19/0.45  Running first-order theorem proving
% 0.19/0.45  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.80/1.15  % SZS status Started for theBenchmark.p
% 2.80/1.15  % SZS status Satisfiable for theBenchmark.p
% 2.80/1.15  
% 2.80/1.15  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.80/1.15  
% 2.80/1.15  ------  iProver source info
% 2.80/1.15  
% 2.80/1.15  git: date: 2023-05-31 18:12:56 +0000
% 2.80/1.15  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.80/1.15  git: non_committed_changes: false
% 2.80/1.15  git: last_make_outside_of_git: false
% 2.80/1.15  
% 2.80/1.15  ------ Parsing...successful
% 2.80/1.15  
% 2.80/1.15  
% 2.80/1.15  
% 2.80/1.15  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 2.80/1.15  
% 2.80/1.15  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.80/1.15  ------ Proving...
% 2.80/1.15  ------ Problem Properties 
% 2.80/1.15  
% 2.80/1.15  
% 2.80/1.15  clauses                                 28
% 2.80/1.15  conjectures                             26
% 2.80/1.15  EPR                                     4
% 2.80/1.15  Horn                                    24
% 2.80/1.15  unary                                   0
% 2.80/1.15  binary                                  7
% 2.80/1.15  lits                                    101
% 2.80/1.15  lits eq                                 0
% 2.80/1.15  fd_pure                                 0
% 2.80/1.15  fd_pseudo                               0
% 2.80/1.15  fd_cond                                 0
% 2.80/1.15  fd_pseudo_cond                          0
% 2.80/1.15  AC symbols                              0
% 2.80/1.15  
% 2.80/1.15  ------ Schedule dynamic 5 is on 
% 2.80/1.15  
% 2.80/1.15  ------ no equalities: superposition off 
% 2.80/1.15  
% 2.80/1.15  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.80/1.15  
% 2.80/1.15  
% 2.80/1.15  ------ 
% 2.80/1.15  Current options:
% 2.80/1.15  ------ 
% 2.80/1.15  
% 2.80/1.15  
% 2.80/1.15  
% 2.80/1.15  
% 2.80/1.15  ------ Proving...
% 2.80/1.15  
% 2.80/1.15  
% 2.80/1.15  % SZS status Satisfiable for theBenchmark.p
% 2.80/1.15  
% 2.80/1.15  ------ Building Model...Done
% 2.80/1.15  
% 2.80/1.15  %------ The model is defined over ground terms (initial term algebra).
% 2.80/1.15  %------ Predicates are defined as (\forall x_1,..,x_n  ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 
% 2.80/1.15  %------ where \phi is a formula over the term algebra.
% 2.80/1.15  %------ If we have equality in the problem then it is also defined as a predicate above, 
% 2.80/1.15  %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.80/1.15  %------ See help for --sat_out_model for different model outputs.
% 2.80/1.15  %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.80/1.15  %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.80/1.15  % SZS output start Model for theBenchmark.p
% See solution above
% 2.80/1.15  
%------------------------------------------------------------------------------