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

View Problem - Process Solution

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

% Computer : n025.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:04:08 EDT 2023

% Result   : Theorem 1.64s 1.18s
% Output   : CNFRefutation 1.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   6 unt;   0 def)
%            Number of atoms       :   38 (  14 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   33 (  15   ~;   8   |;   5   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn;  16   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,conjecture,
    ! [X0,X1] :
      ( in(X0,X1)
     => set_union2(singleton(X0),X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l23_zfmisc_1) ).

fof(f7,negated_conjecture,
    ~ ! [X0,X1] :
        ( in(X0,X1)
       => set_union2(singleton(X0),X1) = X1 ),
    inference(negated_conjecture,[],[f6]) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( subset(singleton(X0),X1)
    <=> in(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_union2(X0,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).

fof(f14,plain,
    ? [X0,X1] :
      ( set_union2(singleton(X0),X1) != X1
      & in(X0,X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( set_union2(X0,X1) = X1
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f16,plain,
    ( ? [X0,X1] :
        ( set_union2(singleton(X0),X1) != X1
        & in(X0,X1) )
   => ( sK1 != set_union2(singleton(sK0),sK1)
      & in(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f17,plain,
    ( sK1 != set_union2(singleton(sK0),sK1)
    & in(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f14,f16]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ( subset(singleton(X0),X1)
        | ~ in(X0,X1) )
      & ( in(X0,X1)
        | ~ subset(singleton(X0),X1) ) ),
    inference(nnf_transformation,[],[f8]) ).

fof(f22,plain,
    in(sK0,sK1),
    inference(cnf_transformation,[],[f17]) ).

fof(f23,plain,
    sK1 != set_union2(singleton(sK0),sK1),
    inference(cnf_transformation,[],[f17]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( subset(singleton(X0),X1)
      | ~ in(X0,X1) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( set_union2(X0,X1) = X1
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f15]) ).

cnf(c_52,negated_conjecture,
    set_union2(singleton(sK0),sK1) != sK1,
    inference(cnf_transformation,[],[f23]) ).

cnf(c_53,negated_conjecture,
    in(sK0,sK1),
    inference(cnf_transformation,[],[f22]) ).

cnf(c_54,plain,
    ( ~ in(X0,X1)
    | subset(singleton(X0),X1) ),
    inference(cnf_transformation,[],[f25]) ).

cnf(c_57,plain,
    ( ~ subset(X0,X1)
    | set_union2(X0,X1) = X1 ),
    inference(cnf_transformation,[],[f27]) ).

cnf(c_399,plain,
    ( ~ in(X0,X1)
    | set_union2(singleton(X0),X1) = X1 ),
    inference(superposition,[status(thm)],[c_54,c_57]) ).

cnf(c_409,plain,
    set_union2(singleton(sK0),sK1) = sK1,
    inference(superposition,[status(thm)],[c_53,c_399]) ).

cnf(c_411,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_409,c_52]) ).


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