TSTP Solution File: SET583+3 by iProver---3.9

View Problem - Process Solution

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

% Computer : n007.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 : Fri May  3 03:00:50 EDT 2024

% Result   : Theorem 1.76s 1.16s
% Output   : CNFRefutation 1.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (  10 unt;   0 def)
%            Number of atoms       :   54 (  18 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   52 (  20   ~;  11   |;  17   &)
%                                         (   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   :   20 (   0 sgn  12   !;   6   ?)

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

fof(f4,conjecture,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        & subset(X0,X1) )
     => X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_extensionality) ).

fof(f5,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( subset(X1,X0)
          & subset(X0,X1) )
       => X0 = X1 ),
    inference(negated_conjecture,[],[f4]) ).

fof(f7,plain,
    ? [X0,X1] :
      ( X0 != X1
      & subset(X1,X0)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f8,plain,
    ? [X0,X1] :
      ( X0 != X1
      & subset(X1,X0)
      & subset(X0,X1) ),
    inference(flattening,[],[f7]) ).

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

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

fof(f15,plain,
    ( ? [X0,X1] :
        ( X0 != X1
        & subset(X1,X0)
        & subset(X0,X1) )
   => ( sK1 != sK2
      & subset(sK2,sK1)
      & subset(sK1,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f16,plain,
    ( sK1 != sK2
    & subset(sK2,sK1)
    & subset(sK1,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f8,f15]) ).

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

fof(f24,plain,
    subset(sK1,sK2),
    inference(cnf_transformation,[],[f16]) ).

fof(f25,plain,
    subset(sK2,sK1),
    inference(cnf_transformation,[],[f16]) ).

fof(f26,plain,
    sK1 != sK2,
    inference(cnf_transformation,[],[f16]) ).

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

cnf(c_56,negated_conjecture,
    sK1 != sK2,
    inference(cnf_transformation,[],[f26]) ).

cnf(c_57,negated_conjecture,
    subset(sK2,sK1),
    inference(cnf_transformation,[],[f25]) ).

cnf(c_58,negated_conjecture,
    subset(sK1,sK2),
    inference(cnf_transformation,[],[f24]) ).

cnf(c_163,negated_conjecture,
    subset(sK1,sK2),
    inference(demodulation,[status(thm)],[c_58]) ).

cnf(c_164,negated_conjecture,
    subset(sK2,sK1),
    inference(demodulation,[status(thm)],[c_57]) ).

cnf(c_165,negated_conjecture,
    sK1 != sK2,
    inference(demodulation,[status(thm)],[c_56]) ).

cnf(c_312,plain,
    ( ~ subset(sK2,sK1)
    | sK1 = sK2 ),
    inference(superposition,[status(thm)],[c_163,c_49]) ).

cnf(c_313,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_312,c_165,c_164]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET583+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n007.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 : Thu May  2 20:05:50 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.18/0.47  Running first-order theorem proving
% 0.18/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.76/1.16  % SZS status Started for theBenchmark.p
% 1.76/1.16  % SZS status Theorem for theBenchmark.p
% 1.76/1.16  
% 1.76/1.16  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.76/1.16  
% 1.76/1.16  ------  iProver source info
% 1.76/1.16  
% 1.76/1.16  git: date: 2024-05-02 19:28:25 +0000
% 1.76/1.16  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.76/1.16  git: non_committed_changes: false
% 1.76/1.16  
% 1.76/1.16  ------ Parsing...
% 1.76/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.76/1.16  
% 1.76/1.16  ------ 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 
% 1.76/1.16  
% 1.76/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.76/1.16  
% 1.76/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.76/1.16  ------ Proving...
% 1.76/1.16  ------ Problem Properties 
% 1.76/1.16  
% 1.76/1.16  
% 1.76/1.16  clauses                                 8
% 1.76/1.16  conjectures                             3
% 1.76/1.16  EPR                                     6
% 1.76/1.16  Horn                                    7
% 1.76/1.16  unary                                   4
% 1.76/1.16  binary                                  2
% 1.76/1.16  lits                                    14
% 1.76/1.16  lits eq                                 2
% 1.76/1.16  fd_pure                                 0
% 1.76/1.16  fd_pseudo                               0
% 1.76/1.16  fd_cond                                 0
% 1.76/1.16  fd_pseudo_cond                          1
% 1.76/1.16  AC symbols                              0
% 1.76/1.16  
% 1.76/1.16  ------ Schedule dynamic 5 is on 
% 1.76/1.16  
% 1.76/1.16  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.76/1.16  
% 1.76/1.16  
% 1.76/1.16  ------ 
% 1.76/1.16  Current options:
% 1.76/1.16  ------ 
% 1.76/1.16  
% 1.76/1.16  
% 1.76/1.16  
% 1.76/1.16  
% 1.76/1.16  ------ Proving...
% 1.76/1.16  
% 1.76/1.16  
% 1.76/1.16  % SZS status Theorem for theBenchmark.p
% 1.76/1.16  
% 1.76/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.76/1.16  
% 1.76/1.16  
%------------------------------------------------------------------------------