↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n006.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:56:31 PM UTC 2026

% Result   : Theorem 2.17s 1.16s
% Output   : CNFRefutation 2.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   8 unt;   1 def)
%            Number of atoms       :   29 (   1 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   19 (  10   ~;   4   |;   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  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn  12   !;   2   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f19,axiom,
    ! [X0,X1] :
      ( finite(X0)
     => finite(set_intersection2(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc11_finset_1) ).

fof(f47,conjecture,
    ! [X0,X1] :
      ( finite(X0)
     => finite(set_intersection2(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_finset_1) ).

fof(f48,negated_conjecture,
    ~ ! [X0,X1] :
        ( finite(X0)
       => finite(set_intersection2(X0,X1)) ),
    inference(negated_conjecture,[status(cth)],[f47]) ).

fof(f88,plain,
    ! [X0,X1] :
      ( ~ finite(X0)
      | finite(set_intersection2(X0,X1)) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f95,plain,
    ? [X0,X1] :
      ( finite(X0)
      & ~ finite(set_intersection2(X0,X1)) ),
    inference(ennf_transformation,[],[f48]) ).

fof(f124,plain,
    ( finite(sK19)
    & ~ finite(set_intersection2(sK19,sK20)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20]),skolemize(X0,sK19),skolemize(X1,sK20)],[f95]) ).

fof(f148,plain,
    ! [X0,X1] :
      ( ~ finite(X0)
      | finite(set_intersection2(X0,X1)) ),
    inference(cnf_transformation,[],[f88]) ).

fof(f215,plain,
    finite(sK19),
    inference(cnf_transformation,[],[f124]) ).

fof(f216,plain,
    ~ finite(set_intersection2(sK19,sK20)),
    inference(cnf_transformation,[],[f124]) ).

tcf(c_68,plain,
    ! [X0: $i,X1: $i] :
      ( finite(set_intersection2(X0,X1))
      | ~ finite(X0) ),
    inference(cnf_transformation,[],[f148]) ).

tcf(c_135,negated_conjecture,
    ~ finite(set_intersection2(sK19,sK20)),
    inference(cnf_transformation,[],[f216]) ).

tcf(c_136,negated_conjecture,
    finite(sK19),
    inference(cnf_transformation,[],[f215]) ).

tcf(c_1640,definition,
    iPr_def_10 = set_intersection2(sK19,sK20),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_1641,negated_conjecture,
    finite(sK19),
    inference(demodulation,[status(thm)],[c_136]) ).

tcf(c_1642,negated_conjecture,
    ~ finite(iPr_def_10),
    inference(demodulation,[status(thm)],[c_135,c_1640]) ).

tcf(c_2304,plain,
    ( finite(iPr_def_10)
    | ~ finite(sK19) ),
    inference(superposition,[status(thm)],[c_1640,c_68]) ).

tcf(c_2307,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2304,c_1642,c_1641]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU295+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.35  % Computer : n006.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Thu Sep 24 13:34:41 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/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...
% 2.17/1.16  % SZS status Started for theBenchmark.p
% 2.17/1.16  % SZS status Theorem for theBenchmark.p
% 2.17/1.16  
% 2.17/1.16  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.17/1.16  
% 2.17/1.16  % ------  iProver source info
% 2.17/1.16  
% 2.17/1.16  % git: date: 2026-07-19 20:42:38 +0200
% 2.17/1.16  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.17/1.16  % git: non_committed_changes: false
% 2.17/1.16  
% 2.17/1.16  % ------ Parsing...
% 2.17/1.16  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.17/1.16  
% 2.17/1.16  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 53 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 6 0s  sf_e  pe_s  pe_e % 
% 2.17/1.16  
% 2.17/1.16  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.17/1.16  
% 2.17/1.16  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.17/1.16  % ------ Proving...
% 2.17/1.16  % ------ Problem Properties 
% 2.17/1.16  
% 2.17/1.16  % 
% 2.17/1.16  % clauses                               45
% 2.17/1.16  % conjectures                           2
% 2.17/1.16  % EPR                                   24
% 2.17/1.16  % Horn                                  41
% 2.17/1.16  % unary                                 26
% 2.17/1.16  % binary                                14
% 2.17/1.16  % lits                                  69
% 2.17/1.16  % lits eq                               6
% 2.17/1.16  % fd_pure                               0
% 2.17/1.16  % fd_pseudo                             0
% 2.17/1.16  % fd_cond                               1
% 2.17/1.16  % fd_pseudo_cond                        1
% 2.17/1.16  % AC symbols                            0
% 2.17/1.16  
% 2.17/1.16  % ------ Schedule dynamic 5 is on 
% 2.17/1.16  
% 2.17/1.16  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  % ------ 
% 2.17/1.16  % Current options:
% 2.17/1.16  % ------ 
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  % 
% 2.17/1.16  
% 2.17/1.16  % ------ Proving...
% 2.17/1.16  % 
% 2.17/1.16  
% 2.17/1.16  % SZS status Theorem for theBenchmark.p
% 2.17/1.16  
% 2.17/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.17/1.16  
% 2.17/1.16  
%------------------------------------------------------------------------------