TSTP Solution File: SEU158+3 by iProver---3.8

View Problem - Process Solution

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

% Computer : n028.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:12 EDT 2023

% Result   : Theorem 0.77s 1.19s
% Output   : CNFRefutation 0.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   27 (   4 unt;   0 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   63 (  28   ~;  25   |;   5   &)
%                                         (   3 <=>;   1  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    7 (   3 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-1 aty)
%            Number of variables   :   28 (   0 sgn;  12   !;   6   ?)

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

fof(f6,negated_conjecture,
    ~ ! [X0,X1] :
        ( subset(singleton(X0),X1)
      <=> in(X0,X1) ),
    inference(negated_conjecture,[],[f5]) ).

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

fof(f10,plain,
    ? [X0,X1] :
      ( subset(singleton(X0),X1)
    <~> in(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f15,plain,
    ? [X0,X1] :
      ( ( ~ in(X0,X1)
        | ~ subset(singleton(X0),X1) )
      & ( in(X0,X1)
        | subset(singleton(X0),X1) ) ),
    inference(nnf_transformation,[],[f10]) ).

fof(f16,plain,
    ( ? [X0,X1] :
        ( ( ~ in(X0,X1)
          | ~ subset(singleton(X0),X1) )
        & ( in(X0,X1)
          | subset(singleton(X0),X1) ) )
   => ( ( ~ in(sK2,sK3)
        | ~ subset(singleton(sK2),sK3) )
      & ( in(sK2,sK3)
        | subset(singleton(sK2),sK3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f17,plain,
    ( ( ~ in(sK2,sK3)
      | ~ subset(singleton(sK2),sK3) )
    & ( in(sK2,sK3)
      | subset(singleton(sK2),sK3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f15,f16]) ).

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

fof(f23,plain,
    ( in(sK2,sK3)
    | subset(singleton(sK2),sK3) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f24,plain,
    ( ~ in(sK2,sK3)
    | ~ subset(singleton(sK2),sK3) ),
    inference(cnf_transformation,[],[f17]) ).

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

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

cnf(c_53,negated_conjecture,
    ( ~ subset(singleton(sK2),sK3)
    | ~ in(sK2,sK3) ),
    inference(cnf_transformation,[],[f24]) ).

cnf(c_54,negated_conjecture,
    ( subset(singleton(sK2),sK3)
    | in(sK2,sK3) ),
    inference(cnf_transformation,[],[f23]) ).

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

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

cnf(c_61,plain,
    ( ~ in(sK2,sK3)
    | ~ subset(singleton(sK2),sK3) ),
    inference(prop_impl_just,[status(thm)],[c_53]) ).

cnf(c_62,plain,
    ( ~ subset(singleton(sK2),sK3)
    | ~ in(sK2,sK3) ),
    inference(renaming,[status(thm)],[c_61]) ).

cnf(c_63,plain,
    ( in(sK2,sK3)
    | subset(singleton(sK2),sK3) ),
    inference(prop_impl_just,[status(thm)],[c_54]) ).

cnf(c_64,plain,
    ( subset(singleton(sK2),sK3)
    | in(sK2,sK3) ),
    inference(renaming,[status(thm)],[c_63]) ).

cnf(c_65,plain,
    ( in(X0,X1)
    | ~ subset(singleton(X0),X1) ),
    inference(prop_impl_just,[status(thm)],[c_56]) ).

cnf(c_66,plain,
    ( ~ subset(singleton(X0),X1)
    | in(X0,X1) ),
    inference(renaming,[status(thm)],[c_65]) ).

cnf(c_67,plain,
    ( ~ in(X0,X1)
    | subset(singleton(X0),X1) ),
    inference(prop_impl_just,[status(thm)],[c_55]) ).

cnf(c_97,plain,
    in(sK2,sK3),
    inference(forward_subsumption_resolution,[status(thm)],[c_64,c_66]) ).

cnf(c_101,plain,
    ~ subset(singleton(sK2),sK3),
    inference(backward_subsumption_resolution,[status(thm)],[c_62,c_97]) ).

cnf(c_122,plain,
    ~ in(sK2,sK3),
    inference(resolution,[status(thm)],[c_101,c_67]) ).

cnf(c_123,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_122,c_97]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU158+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n028.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 14:50:19 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.77/1.19  % SZS status Started for theBenchmark.p
% 0.77/1.19  % SZS status Theorem for theBenchmark.p
% 0.77/1.19  
% 0.77/1.19  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.77/1.19  
% 0.77/1.19  ------  iProver source info
% 0.77/1.19  
% 0.77/1.19  git: date: 2023-05-31 18:12:56 +0000
% 0.77/1.19  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.77/1.19  git: non_committed_changes: false
% 0.77/1.19  git: last_make_outside_of_git: false
% 0.77/1.19  
% 0.77/1.19  ------ Parsing...
% 0.77/1.19  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.77/1.19  
% 0.77/1.19  ------ Preprocessing... sf_s  rm: 2 0s  sf_e  pe_s 
% 0.77/1.19  
% 0.77/1.19  % SZS status Theorem for theBenchmark.p
% 0.77/1.19  
% 0.77/1.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.77/1.19  
% 0.77/1.19  
%------------------------------------------------------------------------------