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

View Problem - Process Solution

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

% Computer : n012.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:06:05 EDT 2023

% Result   : Theorem 3.10s 1.19s
% Output   : CNFRefutation 3.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   6 unt;   0 def)
%            Number of atoms       :   46 (  16 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   43 (  16   ~;   7   |;  16   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   25 (   1 sgn;  14   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f41,axiom,
    ! [X0] :
      ( null_class != X0
     => ? [X2] :
          ( disjoint(X2,X0)
          & member(X2,X0)
          & member(X2,universal_class) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',regularity) ).

fof(f44,conjecture,
    ! [X4] :
      ( ? [X1] : member(X1,X4)
      | null_class = X4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_is_unique) ).

fof(f45,negated_conjecture,
    ~ ! [X4] :
        ( ? [X1] : member(X1,X4)
        | null_class = X4 ),
    inference(negated_conjecture,[],[f44]) ).

fof(f67,plain,
    ! [X0] :
      ( null_class != X0
     => ? [X1] :
          ( disjoint(X1,X0)
          & member(X1,X0)
          & member(X1,universal_class) ) ),
    inference(rectify,[],[f41]) ).

fof(f70,plain,
    ~ ! [X0] :
        ( ? [X1] : member(X1,X0)
        | null_class = X0 ),
    inference(rectify,[],[f45]) ).

fof(f82,plain,
    ! [X0] :
      ( ? [X1] :
          ( disjoint(X1,X0)
          & member(X1,X0)
          & member(X1,universal_class) )
      | null_class = X0 ),
    inference(ennf_transformation,[],[f67]) ).

fof(f85,plain,
    ? [X0] :
      ( ! [X1] : ~ member(X1,X0)
      & null_class != X0 ),
    inference(ennf_transformation,[],[f70]) ).

fof(f130,plain,
    ! [X0] :
      ( ? [X1] :
          ( disjoint(X1,X0)
          & member(X1,X0)
          & member(X1,universal_class) )
     => ( disjoint(sK4(X0),X0)
        & member(sK4(X0),X0)
        & member(sK4(X0),universal_class) ) ),
    introduced(choice_axiom,[]) ).

fof(f131,plain,
    ! [X0] :
      ( ( disjoint(sK4(X0),X0)
        & member(sK4(X0),X0)
        & member(sK4(X0),universal_class) )
      | null_class = X0 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f82,f130]) ).

fof(f134,plain,
    ( ? [X0] :
        ( ! [X1] : ~ member(X1,X0)
        & null_class != X0 )
   => ( ! [X1] : ~ member(X1,sK6)
      & null_class != sK6 ) ),
    introduced(choice_axiom,[]) ).

fof(f135,plain,
    ( ! [X1] : ~ member(X1,sK6)
    & null_class != sK6 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f85,f134]) ).

fof(f218,plain,
    ! [X0] :
      ( member(sK4(X0),X0)
      | null_class = X0 ),
    inference(cnf_transformation,[],[f131]) ).

fof(f223,plain,
    null_class != sK6,
    inference(cnf_transformation,[],[f135]) ).

fof(f224,plain,
    ! [X1] : ~ member(X1,sK6),
    inference(cnf_transformation,[],[f135]) ).

cnf(c_124,plain,
    ( X0 = null_class
    | member(sK4(X0),X0) ),
    inference(cnf_transformation,[],[f218]) ).

cnf(c_128,negated_conjecture,
    ~ member(X0,sK6),
    inference(cnf_transformation,[],[f224]) ).

cnf(c_129,negated_conjecture,
    null_class != sK6,
    inference(cnf_transformation,[],[f223]) ).

cnf(c_2436,plain,
    null_class = sK6,
    inference(superposition,[status(thm)],[c_124,c_128]) ).

cnf(c_2438,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2436,c_129]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET064+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n012.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 12:24:41 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
% 3.10/1.19  % SZS status Started for theBenchmark.p
% 3.10/1.19  % SZS status Theorem for theBenchmark.p
% 3.10/1.19  
% 3.10/1.19  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.10/1.19  
% 3.10/1.19  ------  iProver source info
% 3.10/1.19  
% 3.10/1.19  git: date: 2023-05-31 18:12:56 +0000
% 3.10/1.19  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.10/1.19  git: non_committed_changes: false
% 3.10/1.19  git: last_make_outside_of_git: false
% 3.10/1.19  
% 3.10/1.19  ------ Parsing...
% 3.10/1.19  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.10/1.19  
% 3.10/1.19  ------ 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 
% 3.10/1.19  
% 3.10/1.19  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.10/1.19  
% 3.10/1.19  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.10/1.19  ------ Proving...
% 3.10/1.19  ------ Problem Properties 
% 3.10/1.19  
% 3.10/1.19  
% 3.10/1.19  clauses                                 76
% 3.10/1.19  conjectures                             2
% 3.10/1.19  EPR                                     9
% 3.10/1.19  Horn                                    68
% 3.10/1.19  unary                                   16
% 3.10/1.19  binary                                  39
% 3.10/1.19  lits                                    158
% 3.10/1.19  lits eq                                 15
% 3.10/1.19  fd_pure                                 0
% 3.10/1.19  fd_pseudo                               0
% 3.10/1.19  fd_cond                                 4
% 3.10/1.19  fd_pseudo_cond                          3
% 3.10/1.19  AC symbols                              0
% 3.10/1.19  
% 3.10/1.19  ------ Schedule dynamic 5 is on 
% 3.10/1.19  
% 3.10/1.19  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.10/1.19  
% 3.10/1.19  
% 3.10/1.19  ------ 
% 3.10/1.19  Current options:
% 3.10/1.19  ------ 
% 3.10/1.19  
% 3.10/1.19  
% 3.10/1.19  
% 3.10/1.19  
% 3.10/1.19  ------ Proving...
% 3.10/1.19  
% 3.10/1.19  
% 3.10/1.19  % SZS status Theorem for theBenchmark.p
% 3.10/1.19  
% 3.10/1.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.10/1.19  
% 3.10/1.19  
%------------------------------------------------------------------------------