TSTP Solution File: SET027+1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SET027+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n005.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 15:05:42 EDT 2023

% Result   : Theorem 7.40s 1.68s
% Output   : CNFRefutation 7.40s
% 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] :
      ( subclass(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subclass_defn) ).

fof(f44,conjecture,
    ! [X0,X1,X4] :
      ( ( subclass(X1,X4)
        & subclass(X0,X1) )
     => subclass(X0,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).

fof(f45,negated_conjecture,
    ~ ! [X0,X1,X4] :
        ( ( subclass(X1,X4)
          & subclass(X0,X1) )
       => subclass(X0,X4) ),
    inference(negated_conjecture,[],[f44]) ).

fof(f70,plain,
    ~ ! [X0,X1,X2] :
        ( ( subclass(X1,X2)
          & subclass(X0,X1) )
       => subclass(X0,X2) ),
    inference(rectify,[],[f45]) ).

fof(f72,plain,
    ! [X0,X1] :
      ( subclass(X0,X1)
    <=> ! [X2] :
          ( member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f85,plain,
    ? [X0,X1,X2] :
      ( ~ subclass(X0,X2)
      & subclass(X1,X2)
      & subclass(X0,X1) ),
    inference(ennf_transformation,[],[f70]) ).

fof(f86,plain,
    ? [X0,X1,X2] :
      ( ~ subclass(X0,X2)
      & subclass(X1,X2)
      & subclass(X0,X1) ),
    inference(flattening,[],[f85]) ).

fof(f87,plain,
    ! [X0,X1] :
      ( ( subclass(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X2] :
            ( member(X2,X1)
            | ~ member(X2,X0) )
        | ~ subclass(X0,X1) ) ),
    inference(nnf_transformation,[],[f72]) ).

fof(f88,plain,
    ! [X0,X1] :
      ( ( subclass(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subclass(X0,X1) ) ),
    inference(rectify,[],[f87]) ).

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

fof(f90,plain,
    ! [X0,X1] :
      ( ( subclass(X0,X1)
        | ( ~ member(sK0(X0,X1),X1)
          & member(sK0(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subclass(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f88,f89]) ).

fof(f135,plain,
    ( ? [X0,X1,X2] :
        ( ~ subclass(X0,X2)
        & subclass(X1,X2)
        & subclass(X0,X1) )
   => ( ~ subclass(sK6,sK8)
      & subclass(sK7,sK8)
      & subclass(sK6,sK7) ) ),
    introduced(choice_axiom,[]) ).

fof(f136,plain,
    ( ~ subclass(sK6,sK8)
    & subclass(sK7,sK8)
    & subclass(sK6,sK7) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f86,f135]) ).

fof(f137,plain,
    ! [X3,X0,X1] :
      ( member(X3,X1)
      | ~ member(X3,X0)
      | ~ subclass(X0,X1) ),
    inference(cnf_transformation,[],[f90]) ).

fof(f138,plain,
    ! [X0,X1] :
      ( subclass(X0,X1)
      | member(sK0(X0,X1),X0) ),
    inference(cnf_transformation,[],[f90]) ).

fof(f139,plain,
    ! [X0,X1] :
      ( subclass(X0,X1)
      | ~ member(sK0(X0,X1),X1) ),
    inference(cnf_transformation,[],[f90]) ).

fof(f224,plain,
    subclass(sK6,sK7),
    inference(cnf_transformation,[],[f136]) ).

fof(f225,plain,
    subclass(sK7,sK8),
    inference(cnf_transformation,[],[f136]) ).

fof(f226,plain,
    ~ subclass(sK6,sK8),
    inference(cnf_transformation,[],[f136]) ).

cnf(c_49,plain,
    ( ~ member(sK0(X0,X1),X1)
    | subclass(X0,X1) ),
    inference(cnf_transformation,[],[f139]) ).

cnf(c_50,plain,
    ( member(sK0(X0,X1),X0)
    | subclass(X0,X1) ),
    inference(cnf_transformation,[],[f138]) ).

cnf(c_51,plain,
    ( ~ subclass(X0,X1)
    | ~ member(X2,X0)
    | member(X2,X1) ),
    inference(cnf_transformation,[],[f137]) ).

cnf(c_128,negated_conjecture,
    ~ subclass(sK6,sK8),
    inference(cnf_transformation,[],[f226]) ).

cnf(c_129,negated_conjecture,
    subclass(sK7,sK8),
    inference(cnf_transformation,[],[f225]) ).

cnf(c_130,negated_conjecture,
    subclass(sK6,sK7),
    inference(cnf_transformation,[],[f224]) ).

cnf(c_2934,plain,
    ( ~ member(sK0(sK6,sK8),sK8)
    | subclass(sK6,sK8) ),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_2936,plain,
    ( member(sK0(sK6,sK8),sK6)
    | subclass(sK6,sK8) ),
    inference(instantiation,[status(thm)],[c_50]) ).

cnf(c_3782,plain,
    ( ~ member(sK0(sK6,sK8),sK6)
    | ~ subclass(sK6,X0)
    | member(sK0(sK6,sK8),X0) ),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_11163,plain,
    ( ~ member(sK0(sK6,sK8),sK6)
    | ~ subclass(sK6,sK7)
    | member(sK0(sK6,sK8),sK7) ),
    inference(instantiation,[status(thm)],[c_3782]) ).

cnf(c_16164,plain,
    ( ~ member(sK0(sK6,sK8),X0)
    | ~ subclass(X0,sK8)
    | member(sK0(sK6,sK8),sK8) ),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_28905,plain,
    ( ~ member(sK0(sK6,sK8),sK7)
    | ~ subclass(sK7,sK8)
    | member(sK0(sK6,sK8),sK8) ),
    inference(instantiation,[status(thm)],[c_16164]) ).

cnf(c_28906,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_28905,c_11163,c_2936,c_2934,c_128,c_129,c_130]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET027+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.07/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sat Aug 26 13:42:23 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.40/1.68  % SZS status Started for theBenchmark.p
% 7.40/1.68  % SZS status Theorem for theBenchmark.p
% 7.40/1.68  
% 7.40/1.68  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.40/1.68  
% 7.40/1.68  ------  iProver source info
% 7.40/1.68  
% 7.40/1.68  git: date: 2023-05-31 18:12:56 +0000
% 7.40/1.68  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.40/1.68  git: non_committed_changes: false
% 7.40/1.68  git: last_make_outside_of_git: false
% 7.40/1.68  
% 7.40/1.68  ------ Parsing...
% 7.40/1.68  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 7.40/1.68  
% 7.40/1.68  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 4 0s  sf_e  pe_s  pe_e 
% 7.40/1.68  
% 7.40/1.68  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.40/1.68  
% 7.40/1.68  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 7.40/1.68  ------ Proving...
% 7.40/1.68  ------ Problem Properties 
% 7.40/1.68  
% 7.40/1.68  
% 7.40/1.68  clauses                                 77
% 7.40/1.68  conjectures                             3
% 7.40/1.68  EPR                                     10
% 7.40/1.68  Horn                                    69
% 7.40/1.68  unary                                   17
% 7.40/1.68  binary                                  39
% 7.40/1.68  lits                                    159
% 7.40/1.68  lits eq                                 14
% 7.40/1.68  fd_pure                                 0
% 7.40/1.68  fd_pseudo                               0
% 7.40/1.68  fd_cond                                 4
% 7.40/1.68  fd_pseudo_cond                          3
% 7.40/1.68  AC symbols                              0
% 7.40/1.68  
% 7.40/1.68  ------ Schedule dynamic 5 is on 
% 7.40/1.68  
% 7.40/1.68  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.40/1.68  
% 7.40/1.68  
% 7.40/1.68  ------ 
% 7.40/1.68  Current options:
% 7.40/1.68  ------ 
% 7.40/1.68  
% 7.40/1.68  
% 7.40/1.68  
% 7.40/1.68  
% 7.40/1.68  ------ Proving...
% 7.40/1.68  
% 7.40/1.68  
% 7.40/1.68  % SZS status Theorem for theBenchmark.p
% 7.40/1.68  
% 7.40/1.68  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.40/1.68  
% 7.40/1.68  
%------------------------------------------------------------------------------