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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SEU435+1 : TPTP v8.1.2. Released v3.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 17:07:19 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X0,X1,X2] :
      ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X0,X1))))
     => ! [X3,X4,X5] :
          ( m1_subset_1(X5,k1_zfmisc_1(X3))
         => m1_subset_1(a_6_0_relset_2(X0,X1,X2,X3,X4,X5),k1_zfmisc_1(k1_zfmisc_1(X4))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t36_relset_2) ).

fof(f2,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X0,X1))))
       => ! [X3,X4,X5] :
            ( m1_subset_1(X5,k1_zfmisc_1(X3))
           => m1_subset_1(a_6_0_relset_2(X0,X1,X2,X3,X4,X5),k1_zfmisc_1(k1_zfmisc_1(X4))) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f43,axiom,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ( m1_subset_1(X5,k1_zfmisc_1(X3))
        & m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X0,X1)))) )
     => m1_subset_1(a_6_0_relset_2(X0,X1,X2,X3,X4,X5),k1_zfmisc_1(k1_zfmisc_1(X4))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',s8_domain_1__e1_46__relset_2) ).

fof(f61,plain,
    ? [X0,X1,X2] :
      ( ? [X3,X4,X5] :
          ( ~ m1_subset_1(a_6_0_relset_2(X0,X1,X2,X3,X4,X5),k1_zfmisc_1(k1_zfmisc_1(X4)))
          & m1_subset_1(X5,k1_zfmisc_1(X3)) )
      & m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X0,X1)))) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f83,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( m1_subset_1(a_6_0_relset_2(X0,X1,X2,X3,X4,X5),k1_zfmisc_1(k1_zfmisc_1(X4)))
      | ~ m1_subset_1(X5,k1_zfmisc_1(X3))
      | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X0,X1)))) ),
    inference(ennf_transformation,[],[f43]) ).

fof(f84,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( m1_subset_1(a_6_0_relset_2(X0,X1,X2,X3,X4,X5),k1_zfmisc_1(k1_zfmisc_1(X4)))
      | ~ m1_subset_1(X5,k1_zfmisc_1(X3))
      | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X0,X1)))) ),
    inference(flattening,[],[f83]) ).

fof(f96,plain,
    ( ? [X0,X1,X2] :
        ( ? [X3,X4,X5] :
            ( ~ m1_subset_1(a_6_0_relset_2(X0,X1,X2,X3,X4,X5),k1_zfmisc_1(k1_zfmisc_1(X4)))
            & m1_subset_1(X5,k1_zfmisc_1(X3)) )
        & m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X0,X1)))) )
   => ( ? [X5,X4,X3] :
          ( ~ m1_subset_1(a_6_0_relset_2(sK0,sK1,sK2,X3,X4,X5),k1_zfmisc_1(k1_zfmisc_1(X4)))
          & m1_subset_1(X5,k1_zfmisc_1(X3)) )
      & m1_subset_1(sK2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(sK0,sK1)))) ) ),
    introduced(choice_axiom,[]) ).

fof(f97,plain,
    ( ? [X5,X4,X3] :
        ( ~ m1_subset_1(a_6_0_relset_2(sK0,sK1,sK2,X3,X4,X5),k1_zfmisc_1(k1_zfmisc_1(X4)))
        & m1_subset_1(X5,k1_zfmisc_1(X3)) )
   => ( ~ m1_subset_1(a_6_0_relset_2(sK0,sK1,sK2,sK3,sK4,sK5),k1_zfmisc_1(k1_zfmisc_1(sK4)))
      & m1_subset_1(sK5,k1_zfmisc_1(sK3)) ) ),
    introduced(choice_axiom,[]) ).

fof(f98,plain,
    ( ~ m1_subset_1(a_6_0_relset_2(sK0,sK1,sK2,sK3,sK4,sK5),k1_zfmisc_1(k1_zfmisc_1(sK4)))
    & m1_subset_1(sK5,k1_zfmisc_1(sK3))
    & m1_subset_1(sK2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(sK0,sK1)))) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f61,f97,f96]) ).

fof(f127,plain,
    m1_subset_1(sK2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(sK0,sK1)))),
    inference(cnf_transformation,[],[f98]) ).

fof(f128,plain,
    m1_subset_1(sK5,k1_zfmisc_1(sK3)),
    inference(cnf_transformation,[],[f98]) ).

fof(f129,plain,
    ~ m1_subset_1(a_6_0_relset_2(sK0,sK1,sK2,sK3,sK4,sK5),k1_zfmisc_1(k1_zfmisc_1(sK4))),
    inference(cnf_transformation,[],[f98]) ).

fof(f174,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( m1_subset_1(a_6_0_relset_2(X0,X1,X2,X3,X4,X5),k1_zfmisc_1(k1_zfmisc_1(X4)))
      | ~ m1_subset_1(X5,k1_zfmisc_1(X3))
      | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X0,X1)))) ),
    inference(cnf_transformation,[],[f84]) ).

cnf(c_49,negated_conjecture,
    ~ m1_subset_1(a_6_0_relset_2(sK0,sK1,sK2,sK3,sK4,sK5),k1_zfmisc_1(k1_zfmisc_1(sK4))),
    inference(cnf_transformation,[],[f129]) ).

cnf(c_50,negated_conjecture,
    m1_subset_1(sK5,k1_zfmisc_1(sK3)),
    inference(cnf_transformation,[],[f128]) ).

cnf(c_51,negated_conjecture,
    m1_subset_1(sK2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(sK0,sK1)))),
    inference(cnf_transformation,[],[f127]) ).

cnf(c_96,plain,
    ( ~ m1_subset_1(X0,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))
    | ~ m1_subset_1(X3,k1_zfmisc_1(X4))
    | m1_subset_1(a_6_0_relset_2(X1,X2,X0,X4,X5,X3),k1_zfmisc_1(k1_zfmisc_1(X5))) ),
    inference(cnf_transformation,[],[f174]) ).

cnf(c_2870,plain,
    ( ~ m1_subset_1(sK2,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(sK0,sK1))))
    | ~ m1_subset_1(sK5,k1_zfmisc_1(sK3)) ),
    inference(superposition,[status(thm)],[c_96,c_49]) ).

cnf(c_2874,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2870,c_50,c_51]) ).


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