↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET091+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 02:46:32 PM UTC 2026

% Result   : Theorem 3.24s 1.26s
% Output   : CNFRefutation 3.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (  12 unt;   1 def)
%            Number of atoms       :   64 (  45 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   57 (  28   ~;  17   |;  10   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   28 (   0 sgn  22   !;   6   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).

fof(f46,axiom,
    ! [X0] :
      ( member_of(X0) = X0
      | member(member_of(X0),universal_class) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_universal_self) ).

fof(f47,axiom,
    ! [X0] :
      ( member_of(X0) = X0
      | singleton(member_of(X0)) = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_self) ).

fof(f48,conjecture,
    ! [X0,X1] :
      ( ( X0 = X1
        & ~ ? [X2] :
              ( X0 = singleton(X2)
              & member(X2,universal_class) ) )
     => member_of(X0) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_when_not_a_singleton) ).

fof(f49,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( X0 = X1
          & ~ ? [X2] :
                ( X0 = singleton(X2)
                & member(X2,universal_class) ) )
       => member_of(X0) = X1 ),
    inference(negated_conjecture,[status(cth)],[f48]) ).

fof(f66,plain,
    ? [X0,X1] :
      ( X0 = X1
      & ! [X2] :
          ( singleton(X2) != X0
          | ~ member(X2,universal_class) )
      & member_of(X0) != X1 ),
    inference(ennf_transformation,[],[f49]) ).

fof(f67,plain,
    ? [X0,X1] :
      ( X0 = X1
      & ! [X2] :
          ( singleton(X2) != X0
          | ~ member(X2,universal_class) )
      & member_of(X0) != X1 ),
    inference(flattening,[],[f66]) ).

fof(f110,plain,
    ( sK6 = sK7
    & ! [X2] :
        ( singleton(X2) != sK6
        | ~ member(X2,universal_class) )
    & sK7 != member_of(sK6) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f67]) ).

fof(f123,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[],[f6]) ).

fof(f200,plain,
    ! [X0] :
      ( member_of(X0) = X0
      | member(member_of(X0),universal_class) ),
    inference(cnf_transformation,[],[f46]) ).

fof(f201,plain,
    ! [X0] :
      ( member_of(X0) = X0
      | singleton(member_of(X0)) = X0 ),
    inference(cnf_transformation,[],[f47]) ).

fof(f202,plain,
    sK6 = sK7,
    inference(cnf_transformation,[],[f110]) ).

fof(f203,plain,
    ! [X2] :
      ( singleton(X2) != sK6
      | ~ member(X2,universal_class) ),
    inference(cnf_transformation,[],[f110]) ).

fof(f204,plain,
    sK7 != member_of(sK6),
    inference(cnf_transformation,[],[f110]) ).

fof(f244,plain,
    ! [X0] :
      ( member_of(X0) = X0
      | unordered_pair(member_of(X0),member_of(X0)) = X0 ),
    inference(definition_unfolding,[],[f201,f123]) ).

fof(f245,plain,
    sK7 != member_of(sK7),
    inference(definition_unfolding,[],[f204,f202]) ).

fof(f246,plain,
    ! [X2] :
      ( sK7 != unordered_pair(X2,X2)
      | ~ member(X2,universal_class) ),
    inference(definition_unfolding,[],[f203,f123,f202]) ).

tcf(c_130,plain,
    ! [X0: $i] :
      ( member(member_of(X0),universal_class)
      | ( member_of(X0) = X0 ) ),
    inference(cnf_transformation,[],[f200]) ).

tcf(c_131,plain,
    ! [X0: $i] :
      ( ( member_of(X0) = X0 )
      | ( unordered_pair(member_of(X0),member_of(X0)) = X0 ) ),
    inference(cnf_transformation,[],[f244]) ).

tcf(c_132,negated_conjecture,
    member_of(sK7) != sK7,
    inference(cnf_transformation,[],[f245]) ).

tcf(c_133,negated_conjecture,
    ! [X0: $i] :
      ( ~ member(X0,universal_class)
      | ( unordered_pair(X0,X0) != sK7 ) ),
    inference(cnf_transformation,[],[f246]) ).

tcf(c_1644,definition,
    iPr_def_10 = member_of(sK7),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_1645,negated_conjecture,
    ! [X0: $i] :
      ( ~ member(X0,universal_class)
      | ( unordered_pair(X0,X0) != sK7 ) ),
    inference(demodulation,[status(thm)],[c_133]) ).

tcf(c_1646,negated_conjecture,
    iPr_def_10 != sK7,
    inference(demodulation,[status(thm)],[c_132,c_1644]) ).

tcf(c_3367,plain,
    ! [X0: $i] :
      ( ( member_of(X0) = X0 )
      | ~ member(member_of(X0),universal_class)
      | ( X0 != sK7 ) ),
    inference(superposition,[status(thm)],[c_131,c_1645]) ).

tcf(c_3502,plain,
    ! [X0: $i] :
      ( ( member_of(X0) = X0 )
      | ( X0 != sK7 ) ),
    inference(global_subsumption_just,[status(thm)],[c_3367,c_130,c_3367]) ).

tcf(c_3509,plain,
    member_of(sK7) = sK7,
    inference(equality_resolution,[status(thm)],[c_3502]) ).

tcf(c_3510,plain,
    sK7 = iPr_def_10,
    inference(light_normalisation,[status(thm)],[c_3509,c_1644]) ).

tcf(c_3514,plain,
    iPr_def_10 != iPr_def_10,
    inference(demodulation,[status(thm)],[c_1646,c_3510]) ).

tcf(c_3515,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_3514]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET091+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/0.34  % Computer : n001.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.34  % CPULimit : 300
% 0.07/0.34  % WCLimit  : 300
% 0.07/0.35  % DateTime : Thu Sep 24 09:49:08 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40  
% 0.12/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40  
% 0.12/0.40  % Detected problem language: tptp
% 0.12/0.41  % Proving...
% 3.24/1.26  % SZS status Started for theBenchmark.p
% 3.24/1.26  % SZS status Theorem for theBenchmark.p
% 3.24/1.26  
% 3.24/1.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.24/1.26  
% 3.24/1.26  % ------  iProver source info
% 3.24/1.26  
% 3.24/1.26  % git: date: 2026-07-19 20:42:38 +0200
% 3.24/1.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.24/1.26  % git: non_committed_changes: false
% 3.24/1.26  
% 3.24/1.26  % ------ Parsing...
% 3.24/1.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.24/1.26  
% 3.24/1.26  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 4 0s  sf_e  pe_s  pe_e % 
% 3.24/1.26  
% 3.24/1.26  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.24/1.26  
% 3.24/1.26  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.24/1.26  % ------ Proving...
% 3.24/1.26  % ------ Problem Properties 
% 3.24/1.26  
% 3.24/1.26  % 
% 3.24/1.26  % clauses                               81
% 3.24/1.26  % conjectures                           2
% 3.24/1.26  % EPR                                   8
% 3.24/1.26  % Horn                                  71
% 3.24/1.26  % unary                                 16
% 3.24/1.26  % binary                                44
% 3.24/1.26  % lits                                  168
% 3.24/1.26  % lits eq                               21
% 3.24/1.26  % fd_pure                               0
% 3.24/1.26  % fd_pseudo                             0
% 3.24/1.26  % fd_cond                               4
% 3.24/1.26  % fd_pseudo_cond                        3
% 3.24/1.26  % AC symbols                            0
% 3.24/1.26  
% 3.24/1.26  % ------ Schedule dynamic 5 is on 
% 3.24/1.26  
% 3.24/1.26  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.24/1.26  
% 3.24/1.26  
% 3.24/1.26  % ------ 
% 3.24/1.26  % Current options:
% 3.24/1.26  % ------ 
% 3.24/1.26  
% 3.24/1.26  
% 3.24/1.26  % 
% 3.24/1.26  
% 3.24/1.26  % ------ Proving...
% 3.24/1.26  % 
% 3.24/1.26  
% 3.24/1.26  % SZS status Theorem for theBenchmark.p
% 3.24/1.26  
% 3.24/1.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.24/1.26  
% 3.24/1.26  
%------------------------------------------------------------------------------