TSTP Solution File: SEU123+2 by iProver---3.8

View Problem - Process Solution

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

% Computer : n026.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:03:51 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subset(X1,X0)
        & subset(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).

fof(f17,axiom,
    ! [X0] : subset(empty_set,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).

fof(f19,conjecture,
    ! [X0] :
      ( subset(X0,empty_set)
     => empty_set = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).

fof(f20,negated_conjecture,
    ~ ! [X0] :
        ( subset(X0,empty_set)
       => empty_set = X0 ),
    inference(negated_conjecture,[],[f19]) ).

fof(f35,plain,
    ? [X0] :
      ( empty_set != X0
      & subset(X0,empty_set) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X1,X0)
        | ~ subset(X0,X1) )
      & ( ( subset(X1,X0)
          & subset(X0,X1) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X1,X0)
        | ~ subset(X0,X1) )
      & ( ( subset(X1,X0)
          & subset(X0,X1) )
        | X0 != X1 ) ),
    inference(flattening,[],[f40]) ).

fof(f62,plain,
    ( ? [X0] :
        ( empty_set != X0
        & subset(X0,empty_set) )
   => ( empty_set != sK6
      & subset(sK6,empty_set) ) ),
    introduced(choice_axiom,[]) ).

fof(f63,plain,
    ( empty_set != sK6
    & subset(sK6,empty_set) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f35,f62]) ).

fof(f70,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ subset(X1,X0)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f91,plain,
    ! [X0] : subset(empty_set,X0),
    inference(cnf_transformation,[],[f17]) ).

fof(f95,plain,
    subset(sK6,empty_set),
    inference(cnf_transformation,[],[f63]) ).

fof(f96,plain,
    empty_set != sK6,
    inference(cnf_transformation,[],[f63]) ).

cnf(c_51,plain,
    ( ~ subset(X0,X1)
    | ~ subset(X1,X0)
    | X0 = X1 ),
    inference(cnf_transformation,[],[f70]) ).

cnf(c_74,plain,
    subset(empty_set,X0),
    inference(cnf_transformation,[],[f91]) ).

cnf(c_78,negated_conjecture,
    empty_set != sK6,
    inference(cnf_transformation,[],[f96]) ).

cnf(c_79,negated_conjecture,
    subset(sK6,empty_set),
    inference(cnf_transformation,[],[f95]) ).

cnf(c_1645,plain,
    ( ~ subset(empty_set,sK6)
    | ~ subset(sK6,empty_set)
    | empty_set = sK6 ),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_1719,plain,
    subset(empty_set,sK6),
    inference(instantiation,[status(thm)],[c_74]) ).

cnf(c_1720,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1719,c_1645,c_78,c_79]) ).


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