↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : PHI023+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 02:30:30 PM UTC 2026

% Result   : Theorem 1.18s 1.27s
% Output   : CNFRefutation 1.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   54 (   5 unt;   0 def)
%            Number of atoms       :  151 (   0 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  156 (  59   ~;  54   |;  29   &)
%                                         (   5 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  15 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   44 (   0 sgn  43   !;   1   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] :
      ( selfCaused(X0)
    <=> ( natureConcOnlyByExistence(X0)
        & essenceInvExistence(X0) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PHI002+0.ax',self_caused) ).

fof(f3,axiom,
    ! [X0] :
      ( substance(X0)
    <=> ( conceivedThruItself(X0)
        & inItself(X0) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PHI002+0.ax',substance) ).

fof(f6,axiom,
    ! [X0] :
      ( god(X0)
    <=> ( absolutelyInfinite(X0)
        & being(X0) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PHI002+0.ax',god) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( absolutelyInfinite(X0)
    <=> ( ( attributeOf(X1,X0)
         => ( expressesInfiniteEssentiality(X1)
            & expressesEternalEssentiality(X1) ) )
        & constInInfAttributes(X0)
        & substance(X0) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PHI002+0.ax',absolutely_infinite) ).

fof(f18,axiom,
    ! [X0] :
      ( inItself(X0)
     => selfCaused(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',is_in_itself_is_self_caused) ).

fof(f19,axiom,
    ! [X0] :
      ( being(X0)
     => hasEssence(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',being_has_essense) ).

fof(f20,axiom,
    ! [X0] :
      ( ( hasEssence(X0)
        & essenceInvExistence(X0) )
     => exists(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',essence_involves_existence_exists) ).

fof(f21,conjecture,
    ! [X0] :
      ( god(X0)
     => exists(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',if_god_then_exists) ).

fof(f22,negated_conjecture,
    ~ ! [X0] :
        ( god(X0)
       => exists(X0) ),
    inference(negated_conjecture,[status(cth)],[f21]) ).

fof(f23,plain,
    ! [X0] :
      ( god(X0)
     => ( absolutelyInfinite(X0)
        & being(X0) ) ),
    inference(unused_predicate_definition_removal,[],[f6]) ).

fof(f24,plain,
    ! [X0] :
      ( selfCaused(X0)
     => ( natureConcOnlyByExistence(X0)
        & essenceInvExistence(X0) ) ),
    inference(unused_predicate_definition_removal,[],[f1]) ).

fof(f25,plain,
    ! [X0] :
      ( selfCaused(X0)
     => essenceInvExistence(X0) ),
    inference(pure_predicate_removal,[],[f24]) ).

fof(f31,plain,
    ! [X0] :
      ( ~ selfCaused(X0)
      | essenceInvExistence(X0) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f32,plain,
    ! [X0] :
      ( ~ god(X0)
      | ( absolutelyInfinite(X0)
        & being(X0) ) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f33,plain,
    ! [X0,X1] :
      ( absolutelyInfinite(X0)
    <=> ( ( ~ attributeOf(X1,X0)
          | ( expressesInfiniteEssentiality(X1)
            & expressesEternalEssentiality(X1) ) )
        & constInInfAttributes(X0)
        & substance(X0) ) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f37,plain,
    ! [X0] :
      ( ~ inItself(X0)
      | selfCaused(X0) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f38,plain,
    ! [X0] :
      ( ~ being(X0)
      | hasEssence(X0) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f39,plain,
    ! [X0] :
      ( ~ hasEssence(X0)
      | ~ essenceInvExistence(X0)
      | exists(X0) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f40,plain,
    ! [X0] :
      ( ~ hasEssence(X0)
      | ~ essenceInvExistence(X0)
      | exists(X0) ),
    inference(flattening,[],[f39]) ).

fof(f41,plain,
    ? [X0] :
      ( god(X0)
      & ~ exists(X0) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f44,plain,
    ! [X0] :
      ( ( ~ substance(X0)
        | ( conceivedThruItself(X0)
          & inItself(X0) ) )
      & ( ~ conceivedThruItself(X0)
        | ~ inItself(X0)
        | substance(X0) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f45,plain,
    ! [X0] :
      ( ( ~ substance(X0)
        | ( conceivedThruItself(X0)
          & inItself(X0) ) )
      & ( ~ conceivedThruItself(X0)
        | ~ inItself(X0)
        | substance(X0) ) ),
    inference(flattening,[],[f44]) ).

fof(f48,plain,
    ! [X0,X1] :
      ( ( ~ absolutelyInfinite(X0)
        | ( ( ~ attributeOf(X1,X0)
            | ( expressesInfiniteEssentiality(X1)
              & expressesEternalEssentiality(X1) ) )
          & constInInfAttributes(X0)
          & substance(X0) ) )
      & ( ( attributeOf(X1,X0)
          & ( ~ expressesInfiniteEssentiality(X1)
            | ~ expressesEternalEssentiality(X1) ) )
        | ~ constInInfAttributes(X0)
        | ~ substance(X0)
        | absolutelyInfinite(X0) ) ),
    inference(nnf_transformation,[],[f33]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( ( ~ absolutelyInfinite(X0)
        | ( ( ~ attributeOf(X1,X0)
            | ( expressesInfiniteEssentiality(X1)
              & expressesEternalEssentiality(X1) ) )
          & constInInfAttributes(X0)
          & substance(X0) ) )
      & ( ( attributeOf(X1,X0)
          & ( ~ expressesInfiniteEssentiality(X1)
            | ~ expressesEternalEssentiality(X1) ) )
        | ~ constInInfAttributes(X0)
        | ~ substance(X0)
        | absolutelyInfinite(X0) ) ),
    inference(flattening,[],[f48]) ).

fof(f56,plain,
    ( god(sK0)
    & ~ exists(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f41]) ).

fof(f57,plain,
    ! [X0] :
      ( ~ selfCaused(X0)
      | essenceInvExistence(X0) ),
    inference(cnf_transformation,[],[f31]) ).

fof(f62,plain,
    ! [X0] :
      ( ~ substance(X0)
      | inItself(X0) ),
    inference(cnf_transformation,[],[f45]) ).

fof(f70,plain,
    ! [X0] :
      ( ~ god(X0)
      | absolutelyInfinite(X0) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f71,plain,
    ! [X0] :
      ( ~ god(X0)
      | being(X0) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f75,plain,
    ! [X0] :
      ( ~ absolutelyInfinite(X0)
      | substance(X0) ),
    inference(cnf_transformation,[],[f49]) ).

fof(f96,plain,
    ! [X0] :
      ( ~ inItself(X0)
      | selfCaused(X0) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f97,plain,
    ! [X0] :
      ( ~ being(X0)
      | hasEssence(X0) ),
    inference(cnf_transformation,[],[f38]) ).

fof(f98,plain,
    ! [X0] :
      ( ~ hasEssence(X0)
      | ~ essenceInvExistence(X0)
      | exists(X0) ),
    inference(cnf_transformation,[],[f40]) ).

fof(f99,plain,
    god(sK0),
    inference(cnf_transformation,[],[f56]) ).

fof(f100,plain,
    ~ exists(sK0),
    inference(cnf_transformation,[],[f56]) ).

tcf(c_49,plain,
    ! [X0: $i] :
      ( essenceInvExistence(X0)
      | ~ selfCaused(X0) ),
    inference(cnf_transformation,[],[f57]) ).

tcf(c_54,plain,
    ! [X0: $i] :
      ( inItself(X0)
      | ~ substance(X0) ),
    inference(cnf_transformation,[],[f62]) ).

tcf(c_62,plain,
    ! [X0: $i] :
      ( being(X0)
      | ~ god(X0) ),
    inference(cnf_transformation,[],[f71]) ).

tcf(c_63,plain,
    ! [X0: $i] :
      ( absolutelyInfinite(X0)
      | ~ god(X0) ),
    inference(cnf_transformation,[],[f70]) ).

tcf(c_66,plain,
    ! [X0: $i] :
      ( substance(X0)
      | ~ absolutelyInfinite(X0) ),
    inference(cnf_transformation,[],[f75]) ).

tcf(c_87,plain,
    ! [X0: $i] :
      ( selfCaused(X0)
      | ~ inItself(X0) ),
    inference(cnf_transformation,[],[f96]) ).

tcf(c_88,plain,
    ! [X0: $i] :
      ( hasEssence(X0)
      | ~ being(X0) ),
    inference(cnf_transformation,[],[f97]) ).

tcf(c_89,plain,
    ! [X0: $i] :
      ( exists(X0)
      | ~ hasEssence(X0)
      | ~ essenceInvExistence(X0) ),
    inference(cnf_transformation,[],[f98]) ).

tcf(c_90,negated_conjecture,
    ~ exists(sK0),
    inference(cnf_transformation,[],[f100]) ).

tcf(c_91,negated_conjecture,
    god(sK0),
    inference(cnf_transformation,[],[f99]) ).

tcf(c_93,plain,
    ( hasEssence(sK0)
    | ~ being(sK0) ),
    inference(instantiation,[status(thm)],[c_88]) ).

tcf(c_94,plain,
    ( selfCaused(sK0)
    | ~ inItself(sK0) ),
    inference(instantiation,[status(thm)],[c_87]) ).

tcf(c_97,plain,
    ( substance(sK0)
    | ~ absolutelyInfinite(sK0) ),
    inference(instantiation,[status(thm)],[c_66]) ).

tcf(c_98,plain,
    ( absolutelyInfinite(sK0)
    | ~ god(sK0) ),
    inference(instantiation,[status(thm)],[c_63]) ).

tcf(c_99,plain,
    ( being(sK0)
    | ~ god(sK0) ),
    inference(instantiation,[status(thm)],[c_62]) ).

tcf(c_101,plain,
    ( inItself(sK0)
    | ~ substance(sK0) ),
    inference(instantiation,[status(thm)],[c_54]) ).

tcf(c_102,plain,
    ( essenceInvExistence(sK0)
    | ~ selfCaused(sK0) ),
    inference(instantiation,[status(thm)],[c_49]) ).

tcf(c_111,plain,
    ( exists(sK0)
    | ~ hasEssence(sK0)
    | ~ essenceInvExistence(sK0) ),
    inference(instantiation,[status(thm)],[c_89]) ).

tcf(c_112,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_111,c_102,c_101,c_99,c_98,c_97,c_94,c_93,c_90,c_91]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PHI023+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37  % Computer : n011.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Thu Sep 24 06:06:27 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.40  Running first-order theorem proving
% 0.11/0.40  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.41  
% 0.11/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41  
% 0.11/0.41  % Detected problem language: tptp
% 0.11/0.42  % Proving...
% 1.18/1.27  % SZS status Started for theBenchmark.p
% 1.18/1.27  % SZS status Theorem for theBenchmark.p
% 1.18/1.27  
% 1.18/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.18/1.27  
% 1.18/1.27  % ------  iProver source info
% 1.18/1.27  
% 1.18/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 1.18/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.18/1.27  % git: non_committed_changes: false
% 1.18/1.27  
% 1.18/1.27  % ------ Parsing...
% 1.18/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_non_horn_eq
% 1.18/1.27  % 
% 1.18/1.27  
% 1.18/1.27  % ------ Preprocessing...% 
% 1.18/1.27  
% 1.18/1.27  % SZS status Theorem for theBenchmark.p
% 1.18/1.27  
% 1.18/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.18/1.27  
% 1.18/1.27  
%------------------------------------------------------------------------------