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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SET788+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n020.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:09:51 EDT 2023

% Result   : Theorem 1.96s 1.16s
% Output   : CNFRefutation 1.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   35 (   1 unt;   0 def)
%            Number of atoms       :  150 (   0 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  184 (  69   ~;  78   |;  20   &)
%                                         (  11 <=>;   5  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   66 (   0 sgn;  39   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0,X1] :
        ( equalish(X0,X1)
      <=> ! [X2] :
            ( a_member_of(X2,X0)
          <=> a_member_of(X2,X1) ) )
   => ! [X0,X1] :
        ( equalish(X0,X1)
      <=> equalish(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0,X1] :
          ( equalish(X0,X1)
        <=> ! [X2] :
              ( a_member_of(X2,X0)
            <=> a_member_of(X2,X1) ) )
     => ! [X0,X1] :
          ( equalish(X0,X1)
        <=> equalish(X1,X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f3,plain,
    ~ ( ! [X0,X1] :
          ( equalish(X0,X1)
        <=> ! [X2] :
              ( a_member_of(X2,X0)
            <=> a_member_of(X2,X1) ) )
     => ! [X3,X4] :
          ( equalish(X3,X4)
        <=> equalish(X4,X3) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ? [X3,X4] :
        ( equalish(X3,X4)
      <~> equalish(X4,X3) )
    & ! [X0,X1] :
        ( equalish(X0,X1)
      <=> ! [X2] :
            ( a_member_of(X2,X0)
          <=> a_member_of(X2,X1) ) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ? [X3,X4] :
        ( ( ~ equalish(X4,X3)
          | ~ equalish(X3,X4) )
        & ( equalish(X4,X3)
          | equalish(X3,X4) ) )
    & ! [X0,X1] :
        ( ( equalish(X0,X1)
          | ? [X2] :
              ( ( ~ a_member_of(X2,X1)
                | ~ a_member_of(X2,X0) )
              & ( a_member_of(X2,X1)
                | a_member_of(X2,X0) ) ) )
        & ( ! [X2] :
              ( ( a_member_of(X2,X0)
                | ~ a_member_of(X2,X1) )
              & ( a_member_of(X2,X1)
                | ~ a_member_of(X2,X0) ) )
          | ~ equalish(X0,X1) ) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f6,plain,
    ( ? [X0,X1] :
        ( ( ~ equalish(X1,X0)
          | ~ equalish(X0,X1) )
        & ( equalish(X1,X0)
          | equalish(X0,X1) ) )
    & ! [X2,X3] :
        ( ( equalish(X2,X3)
          | ? [X4] :
              ( ( ~ a_member_of(X4,X3)
                | ~ a_member_of(X4,X2) )
              & ( a_member_of(X4,X3)
                | a_member_of(X4,X2) ) ) )
        & ( ! [X5] :
              ( ( a_member_of(X5,X2)
                | ~ a_member_of(X5,X3) )
              & ( a_member_of(X5,X3)
                | ~ a_member_of(X5,X2) ) )
          | ~ equalish(X2,X3) ) ) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ( ? [X0,X1] :
        ( ( ~ equalish(X1,X0)
          | ~ equalish(X0,X1) )
        & ( equalish(X1,X0)
          | equalish(X0,X1) ) )
   => ( ( ~ equalish(sK1,sK0)
        | ~ equalish(sK0,sK1) )
      & ( equalish(sK1,sK0)
        | equalish(sK0,sK1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ! [X2,X3] :
      ( ? [X4] :
          ( ( ~ a_member_of(X4,X3)
            | ~ a_member_of(X4,X2) )
          & ( a_member_of(X4,X3)
            | a_member_of(X4,X2) ) )
     => ( ( ~ a_member_of(sK2(X2,X3),X3)
          | ~ a_member_of(sK2(X2,X3),X2) )
        & ( a_member_of(sK2(X2,X3),X3)
          | a_member_of(sK2(X2,X3),X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ( ~ equalish(sK1,sK0)
      | ~ equalish(sK0,sK1) )
    & ( equalish(sK1,sK0)
      | equalish(sK0,sK1) )
    & ! [X2,X3] :
        ( ( equalish(X2,X3)
          | ( ( ~ a_member_of(sK2(X2,X3),X3)
              | ~ a_member_of(sK2(X2,X3),X2) )
            & ( a_member_of(sK2(X2,X3),X3)
              | a_member_of(sK2(X2,X3),X2) ) ) )
        & ( ! [X5] :
              ( ( a_member_of(X5,X2)
                | ~ a_member_of(X5,X3) )
              & ( a_member_of(X5,X3)
                | ~ a_member_of(X5,X2) ) )
          | ~ equalish(X2,X3) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).

fof(f10,plain,
    ! [X2,X3,X5] :
      ( a_member_of(X5,X3)
      | ~ a_member_of(X5,X2)
      | ~ equalish(X2,X3) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f11,plain,
    ! [X2,X3,X5] :
      ( a_member_of(X5,X2)
      | ~ a_member_of(X5,X3)
      | ~ equalish(X2,X3) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f12,plain,
    ! [X2,X3] :
      ( equalish(X2,X3)
      | a_member_of(sK2(X2,X3),X3)
      | a_member_of(sK2(X2,X3),X2) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f13,plain,
    ! [X2,X3] :
      ( equalish(X2,X3)
      | ~ a_member_of(sK2(X2,X3),X3)
      | ~ a_member_of(sK2(X2,X3),X2) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f14,plain,
    ( equalish(sK1,sK0)
    | equalish(sK0,sK1) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f15,plain,
    ( ~ equalish(sK1,sK0)
    | ~ equalish(sK0,sK1) ),
    inference(cnf_transformation,[],[f9]) ).

cnf(c_49,negated_conjecture,
    ( ~ equalish(sK1,sK0)
    | ~ equalish(sK0,sK1) ),
    inference(cnf_transformation,[],[f15]) ).

cnf(c_50,negated_conjecture,
    ( equalish(sK1,sK0)
    | equalish(sK0,sK1) ),
    inference(cnf_transformation,[],[f14]) ).

cnf(c_51,negated_conjecture,
    ( ~ a_member_of(sK2(X0,X1),X0)
    | ~ a_member_of(sK2(X0,X1),X1)
    | equalish(X0,X1) ),
    inference(cnf_transformation,[],[f13]) ).

cnf(c_52,negated_conjecture,
    ( a_member_of(sK2(X0,X1),X0)
    | a_member_of(sK2(X0,X1),X1)
    | equalish(X0,X1) ),
    inference(cnf_transformation,[],[f12]) ).

cnf(c_53,negated_conjecture,
    ( ~ equalish(X0,X1)
    | ~ a_member_of(X2,X1)
    | a_member_of(X2,X0) ),
    inference(cnf_transformation,[],[f11]) ).

cnf(c_54,negated_conjecture,
    ( ~ equalish(X0,X1)
    | ~ a_member_of(X2,X0)
    | a_member_of(X2,X1) ),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_109,plain,
    ( ~ a_member_of(sK2(sK0,sK1),sK1)
    | ~ a_member_of(sK2(sK0,sK1),sK0)
    | equalish(sK0,sK1) ),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_110,plain,
    ( a_member_of(sK2(sK0,sK1),sK1)
    | a_member_of(sK2(sK0,sK1),sK0)
    | equalish(sK0,sK1) ),
    inference(instantiation,[status(thm)],[c_52]) ).

cnf(c_111,plain,
    ( a_member_of(sK2(sK1,sK0),sK1)
    | a_member_of(sK2(sK1,sK0),sK0)
    | equalish(sK1,sK0) ),
    inference(instantiation,[status(thm)],[c_52]) ).

cnf(c_112,plain,
    ( ~ a_member_of(sK2(sK1,sK0),sK1)
    | ~ a_member_of(sK2(sK1,sK0),sK0)
    | equalish(sK1,sK0) ),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_113,plain,
    ( ~ a_member_of(sK2(sK1,sK0),sK1)
    | ~ equalish(X0,sK1)
    | a_member_of(sK2(sK1,sK0),X0) ),
    inference(instantiation,[status(thm)],[c_53]) ).

cnf(c_114,plain,
    ( ~ a_member_of(sK2(sK1,sK0),sK1)
    | ~ equalish(sK0,sK1)
    | a_member_of(sK2(sK1,sK0),sK0) ),
    inference(instantiation,[status(thm)],[c_113]) ).

cnf(c_121,plain,
    ( ~ a_member_of(sK2(sK0,sK1),sK1)
    | ~ equalish(sK1,X0)
    | a_member_of(sK2(sK0,sK1),X0) ),
    inference(instantiation,[status(thm)],[c_54]) ).

cnf(c_122,plain,
    ( ~ a_member_of(sK2(sK0,sK1),sK1)
    | ~ equalish(sK1,sK0)
    | a_member_of(sK2(sK0,sK1),sK0) ),
    inference(instantiation,[status(thm)],[c_121]) ).

cnf(c_123,plain,
    ( ~ a_member_of(sK2(sK0,sK1),X0)
    | ~ equalish(X1,X0)
    | a_member_of(sK2(sK0,sK1),X1) ),
    inference(instantiation,[status(thm)],[c_53]) ).

cnf(c_133,plain,
    ( ~ a_member_of(sK2(sK0,sK1),X0)
    | ~ equalish(sK1,X0)
    | a_member_of(sK2(sK0,sK1),sK1) ),
    inference(instantiation,[status(thm)],[c_123]) ).

cnf(c_134,plain,
    ( ~ a_member_of(sK2(sK0,sK1),sK0)
    | ~ equalish(sK1,sK0)
    | a_member_of(sK2(sK0,sK1),sK1) ),
    inference(instantiation,[status(thm)],[c_133]) ).

cnf(c_144,plain,
    ( ~ a_member_of(sK2(sK1,sK0),sK0)
    | ~ equalish(sK0,X0)
    | a_member_of(sK2(sK1,sK0),X0) ),
    inference(instantiation,[status(thm)],[c_54]) ).

cnf(c_150,plain,
    ( ~ a_member_of(sK2(sK1,sK0),sK0)
    | ~ equalish(sK0,sK1)
    | a_member_of(sK2(sK1,sK0),sK1) ),
    inference(instantiation,[status(thm)],[c_144]) ).

cnf(c_160,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_150,c_134,c_122,c_114,c_111,c_112,c_110,c_109,c_49,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SET788+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.35  % Computer : n020.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit : 300
% 0.12/0.35  % WCLimit  : 300
% 0.12/0.35  % DateTime : Sat Aug 26 15:48:45 EDT 2023
% 0.12/0.35  % CPUTime  : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.96/1.16  % SZS status Started for theBenchmark.p
% 1.96/1.16  % SZS status Theorem for theBenchmark.p
% 1.96/1.16  
% 1.96/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.96/1.16  
% 1.96/1.16  ------  iProver source info
% 1.96/1.16  
% 1.96/1.16  git: date: 2023-05-31 18:12:56 +0000
% 1.96/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.96/1.16  git: non_committed_changes: false
% 1.96/1.16  git: last_make_outside_of_git: false
% 1.96/1.16  
% 1.96/1.16  ------ Parsing...
% 1.96/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.96/1.16  
% 1.96/1.16  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 1.96/1.16  
% 1.96/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.96/1.16  ------ Proving...
% 1.96/1.16  ------ Problem Properties 
% 1.96/1.16  
% 1.96/1.16  
% 1.96/1.16  clauses                                 6
% 1.96/1.16  conjectures                             6
% 1.96/1.16  EPR                                     4
% 1.96/1.16  Horn                                    4
% 1.96/1.16  unary                                   0
% 1.96/1.16  binary                                  2
% 1.96/1.16  lits                                    16
% 1.96/1.16  lits eq                                 0
% 1.96/1.16  fd_pure                                 0
% 1.96/1.16  fd_pseudo                               0
% 1.96/1.16  fd_cond                                 0
% 1.96/1.16  fd_pseudo_cond                          0
% 1.96/1.16  AC symbols                              0
% 1.96/1.16  
% 1.96/1.16  ------ Schedule dynamic 5 is on 
% 1.96/1.16  
% 1.96/1.16  ------ no equalities: superposition off 
% 1.96/1.16  
% 1.96/1.16  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.96/1.16  
% 1.96/1.16  
% 1.96/1.16  ------ 
% 1.96/1.16  Current options:
% 1.96/1.16  ------ 
% 1.96/1.16  
% 1.96/1.16  
% 1.96/1.16  
% 1.96/1.16  
% 1.96/1.16  ------ Proving...
% 1.96/1.16  
% 1.96/1.16  
% 1.96/1.16  % SZS status Theorem for theBenchmark.p
% 1.96/1.16  
% 1.96/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.96/1.16  
% 1.96/1.16  
%------------------------------------------------------------------------------