↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n015.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:48:53 PM UTC 2026

% Result   : Theorem 1.56s 6.29s
% Output   : CNFRefutation 1.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   9 unt;   2 def)
%            Number of atoms       :   36 (  15 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   21 (  11   ~;   5   |;   2   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   15 (   0 sgn  13   !;   2   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,conjecture,
    ! [X0,X1] :
      ( subset(singleton(X0),singleton(X1))
     => X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_zfmisc_1) ).

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

fof(f6,axiom,
    ! [X0,X1] :
      ( subset(singleton(X0),singleton(X1))
     => X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_zfmisc_1) ).

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

fof(f9,plain,
    ! [X0,X1] :
      ( ~ subset(singleton(X0),singleton(X1))
      | X0 = X1 ),
    inference(ennf_transformation,[],[f6]) ).

fof(f12,plain,
    ( subset(singleton(sK2),singleton(sK3))
    & sK2 != sK3 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f8]) ).

fof(f16,plain,
    subset(singleton(sK2),singleton(sK3)),
    inference(cnf_transformation,[],[f12]) ).

fof(f17,plain,
    sK2 != sK3,
    inference(cnf_transformation,[],[f12]) ).

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

tcf(c_52,negated_conjecture,
    sK2 != sK3,
    inference(cnf_transformation,[],[f17]) ).

tcf(c_53,negated_conjecture,
    subset(singleton(sK2),singleton(sK3)),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ subset(singleton(X0),singleton(X1)) ),
    inference(cnf_transformation,[],[f18]) ).

tcf(c_150,definition,
    iPr_def_10 = singleton(sK2),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_151,definition,
    iPr_def_11 = singleton(sK3),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_152,negated_conjecture,
    subset(iPr_def_10,iPr_def_11),
    inference(demodulation,[status(thm)],[c_53,c_151,c_150]) ).

tcf(c_153,negated_conjecture,
    sK2 != sK3,
    inference(demodulation,[status(thm)],[c_52]) ).

tcf(c_239,plain,
    ! [X0: $i] :
      ( ( X0 = sK2 )
      | ~ subset(iPr_def_10,singleton(X0)) ),
    inference(superposition,[status(thm)],[c_150,c_54]) ).

tcf(c_258,plain,
    ( ( sK2 = sK3 )
    | ~ subset(iPr_def_10,iPr_def_11) ),
    inference(superposition,[status(thm)],[c_151,c_239]) ).

tcf(c_259,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_258,c_153,c_152]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET883+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/5.38  % Computer : n015.cluster.edu
% 0.09/5.38  % Model    : x86_64 x86_64
% 0.09/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38  % Memory   : 8046.5625MB
% 0.09/5.38  % OS       : Linux 6.8.0-71-generic
% 0.09/5.38  % CPULimit : 300
% 0.09/5.38  % WCLimit  : 300
% 0.09/5.38  % DateTime : Thu Sep 24 12:23:02 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.09/5.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.41  Running first-order theorem proving
% 0.15/5.41  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.15/5.43  
% 0.15/5.43  % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43  
% 0.15/5.43  % Detected problem language: tptp
% 0.15/5.44  % Proving...
% 1.56/6.29  % SZS status Started for theBenchmark.p
% 1.56/6.29  % SZS status Theorem for theBenchmark.p
% 1.56/6.29  
% 1.56/6.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.56/6.29  
% 1.56/6.29  % ------  iProver source info
% 1.56/6.29  
% 1.56/6.29  % git: date: 2026-07-19 20:42:38 +0200
% 1.56/6.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.56/6.29  % git: non_committed_changes: false
% 1.56/6.29  
% 1.56/6.29  % ------ Parsing...
% 1.56/6.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.56/6.29  
% 1.56/6.29  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e % 
% 1.56/6.29  
% 1.56/6.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.56/6.29  
% 1.56/6.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.56/6.29  % ------ Proving...
% 1.56/6.29  % ------ Problem Properties 
% 1.56/6.29  
% 1.56/6.29  % 
% 1.56/6.29  % clauses                               7
% 1.56/6.29  % conjectures                           2
% 1.56/6.29  % EPR                                   4
% 1.56/6.29  % Horn                                  7
% 1.56/6.29  % unary                                 6
% 1.56/6.29  % binary                                1
% 1.56/6.29  % lits                                  8
% 1.56/6.29  % lits eq                               5
% 1.56/6.29  % fd_pure                               0
% 1.56/6.29  % fd_pseudo                             0
% 1.56/6.29  % fd_cond                               0
% 1.56/6.29  % fd_pseudo_cond                        1
% 1.56/6.29  % AC symbols                            0
% 1.56/6.29  
% 1.56/6.29  % ------ Schedule dynamic 5 is on 
% 1.56/6.29  
% 1.56/6.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.56/6.29  
% 1.56/6.29  
% 1.56/6.29  % ------ 
% 1.56/6.29  % Current options:
% 1.56/6.29  % ------ 
% 1.56/6.29  
% 1.56/6.29  
% 1.56/6.29  % 
% 1.56/6.29  
% 1.56/6.29  % ------ Proving...
% 1.56/6.29  % 
% 1.56/6.29  
% 1.56/6.29  % SZS status Theorem for theBenchmark.p
% 1.56/6.29  
% 1.56/6.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.56/6.29  
% 1.56/6.29  
%------------------------------------------------------------------------------