TSTP Solution File: GEO081+1 by iProver---3.9

View Problem - Process Solution

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

% Computer : n003.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:16:20 EDT 2024

% Result   : Theorem 3.97s 1.14s
% Output   : CNFRefutation 3.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   32 (   7 unt;   0 def)
%            Number of atoms       :   89 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   93 (  36   ~;  28   |;  21   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   54 (   0 sgn  33   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( part_of(X1,X0)
    <=> ! [X2] :
          ( incident_c(X2,X1)
         => incident_c(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',part_of_defn) ).

fof(f17,conjecture,
    ! [X1,X3,X5] :
      ( ( part_of(X3,X5)
        & part_of(X1,X3) )
     => part_of(X1,X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',part_of_transitivity) ).

fof(f18,negated_conjecture,
    ~ ! [X1,X3,X5] :
        ( ( part_of(X3,X5)
          & part_of(X1,X3) )
       => part_of(X1,X5) ),
    inference(negated_conjecture,[],[f17]) ).

fof(f32,plain,
    ~ ! [X0,X1,X2] :
        ( ( part_of(X1,X2)
          & part_of(X0,X1) )
       => part_of(X0,X2) ),
    inference(rectify,[],[f18]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( part_of(X1,X0)
    <=> ! [X2] :
          ( incident_c(X2,X0)
          | ~ incident_c(X2,X1) ) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f54,plain,
    ? [X0,X1,X2] :
      ( ~ part_of(X0,X2)
      & part_of(X1,X2)
      & part_of(X0,X1) ),
    inference(ennf_transformation,[],[f32]) ).

fof(f55,plain,
    ? [X0,X1,X2] :
      ( ~ part_of(X0,X2)
      & part_of(X1,X2)
      & part_of(X0,X1) ),
    inference(flattening,[],[f54]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( ( part_of(X1,X0)
        | ? [X2] :
            ( ~ incident_c(X2,X0)
            & incident_c(X2,X1) ) )
      & ( ! [X2] :
            ( incident_c(X2,X0)
            | ~ incident_c(X2,X1) )
        | ~ part_of(X1,X0) ) ),
    inference(nnf_transformation,[],[f35]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( ( part_of(X1,X0)
        | ? [X2] :
            ( ~ incident_c(X2,X0)
            & incident_c(X2,X1) ) )
      & ( ! [X3] :
            ( incident_c(X3,X0)
            | ~ incident_c(X3,X1) )
        | ~ part_of(X1,X0) ) ),
    inference(rectify,[],[f56]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ incident_c(X2,X0)
          & incident_c(X2,X1) )
     => ( ~ incident_c(sK0(X0,X1),X0)
        & incident_c(sK0(X0,X1),X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f59,plain,
    ! [X0,X1] :
      ( ( part_of(X1,X0)
        | ( ~ incident_c(sK0(X0,X1),X0)
          & incident_c(sK0(X0,X1),X1) ) )
      & ( ! [X3] :
            ( incident_c(X3,X0)
            | ~ incident_c(X3,X1) )
        | ~ part_of(X1,X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f57,f58]) ).

fof(f93,plain,
    ( ? [X0,X1,X2] :
        ( ~ part_of(X0,X2)
        & part_of(X1,X2)
        & part_of(X0,X1) )
   => ( ~ part_of(sK13,sK15)
      & part_of(sK14,sK15)
      & part_of(sK13,sK14) ) ),
    introduced(choice_axiom,[]) ).

fof(f94,plain,
    ( ~ part_of(sK13,sK15)
    & part_of(sK14,sK15)
    & part_of(sK13,sK14) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15])],[f55,f93]) ).

fof(f95,plain,
    ! [X3,X0,X1] :
      ( incident_c(X3,X0)
      | ~ incident_c(X3,X1)
      | ~ part_of(X1,X0) ),
    inference(cnf_transformation,[],[f59]) ).

fof(f96,plain,
    ! [X0,X1] :
      ( part_of(X1,X0)
      | incident_c(sK0(X0,X1),X1) ),
    inference(cnf_transformation,[],[f59]) ).

fof(f97,plain,
    ! [X0,X1] :
      ( part_of(X1,X0)
      | ~ incident_c(sK0(X0,X1),X0) ),
    inference(cnf_transformation,[],[f59]) ).

fof(f136,plain,
    part_of(sK13,sK14),
    inference(cnf_transformation,[],[f94]) ).

fof(f137,plain,
    part_of(sK14,sK15),
    inference(cnf_transformation,[],[f94]) ).

fof(f138,plain,
    ~ part_of(sK13,sK15),
    inference(cnf_transformation,[],[f94]) ).

cnf(c_49,plain,
    ( ~ incident_c(sK0(X0,X1),X0)
    | part_of(X1,X0) ),
    inference(cnf_transformation,[],[f97]) ).

cnf(c_50,plain,
    ( incident_c(sK0(X0,X1),X1)
    | part_of(X1,X0) ),
    inference(cnf_transformation,[],[f96]) ).

cnf(c_51,plain,
    ( ~ part_of(X0,X1)
    | ~ incident_c(X2,X0)
    | incident_c(X2,X1) ),
    inference(cnf_transformation,[],[f95]) ).

cnf(c_90,negated_conjecture,
    ~ part_of(sK13,sK15),
    inference(cnf_transformation,[],[f138]) ).

cnf(c_91,negated_conjecture,
    part_of(sK14,sK15),
    inference(cnf_transformation,[],[f137]) ).

cnf(c_92,negated_conjecture,
    part_of(sK13,sK14),
    inference(cnf_transformation,[],[f136]) ).

cnf(c_2063,plain,
    ( ~ incident_c(sK0(sK15,sK13),sK15)
    | part_of(sK13,sK15) ),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_2064,plain,
    ( incident_c(sK0(sK15,sK13),sK13)
    | part_of(sK13,sK15) ),
    inference(instantiation,[status(thm)],[c_50]) ).

cnf(c_2156,plain,
    ( ~ incident_c(sK0(sK15,sK13),sK13)
    | ~ part_of(sK13,X0)
    | incident_c(sK0(sK15,sK13),X0) ),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_2826,plain,
    ( ~ incident_c(sK0(sK15,sK13),X0)
    | ~ part_of(X0,sK15)
    | incident_c(sK0(sK15,sK13),sK15) ),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_3482,plain,
    ( ~ incident_c(sK0(sK15,sK13),sK14)
    | ~ part_of(sK14,sK15)
    | incident_c(sK0(sK15,sK13),sK15) ),
    inference(instantiation,[status(thm)],[c_2826]) ).

cnf(c_8007,plain,
    ( ~ incident_c(sK0(sK15,sK13),sK13)
    | ~ part_of(sK13,sK14)
    | incident_c(sK0(sK15,sK13),sK14) ),
    inference(instantiation,[status(thm)],[c_2156]) ).

cnf(c_8008,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_8007,c_3482,c_2064,c_2063,c_90,c_91,c_92]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GEO081+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.32  % Computer : n003.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 : Fri May  3 01:24:20 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
% 3.97/1.14  % SZS status Started for theBenchmark.p
% 3.97/1.14  % SZS status Theorem for theBenchmark.p
% 3.97/1.14  
% 3.97/1.14  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.97/1.14  
% 3.97/1.14  ------  iProver source info
% 3.97/1.14  
% 3.97/1.14  git: date: 2024-05-02 19:28:25 +0000
% 3.97/1.14  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.97/1.14  git: non_committed_changes: false
% 3.97/1.14  
% 3.97/1.14  ------ Parsing...
% 3.97/1.14  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.97/1.14  
% 3.97/1.14  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 3.97/1.14  
% 3.97/1.14  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.97/1.14  
% 3.97/1.14  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.97/1.14  ------ Proving...
% 3.97/1.14  ------ Problem Properties 
% 3.97/1.14  
% 3.97/1.14  
% 3.97/1.14  clauses                                 44
% 3.97/1.14  conjectures                             3
% 3.97/1.14  EPR                                     16
% 3.97/1.14  Horn                                    28
% 3.97/1.14  unary                                   4
% 3.97/1.14  binary                                  16
% 3.97/1.14  lits                                    132
% 3.97/1.14  lits eq                                 12
% 3.97/1.14  fd_pure                                 0
% 3.97/1.14  fd_pseudo                               0
% 3.97/1.14  fd_cond                                 0
% 3.97/1.14  fd_pseudo_cond                          7
% 3.97/1.14  AC symbols                              0
% 3.97/1.14  
% 3.97/1.14  ------ Schedule dynamic 5 is on 
% 3.97/1.14  
% 3.97/1.14  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.97/1.14  
% 3.97/1.14  
% 3.97/1.14  ------ 
% 3.97/1.14  Current options:
% 3.97/1.14  ------ 
% 3.97/1.14  
% 3.97/1.14  
% 3.97/1.14  
% 3.97/1.14  
% 3.97/1.14  ------ Proving...
% 3.97/1.14  
% 3.97/1.14  
% 3.97/1.14  % SZS status Theorem for theBenchmark.p
% 3.97/1.14  
% 3.97/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.97/1.14  
% 3.97/1.14  
%------------------------------------------------------------------------------