↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n012.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 0.31s 1.12s
% Output   : CNFRefutation 0.31s
% 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(f16,axiom,
    ! [X0,X1] :
      ( finite(X0)
     => finite(set_intersection2(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc11_finset_1) ).

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

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

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

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

fof(f146,plain,
    ( finite(sK26)
    & ~ finite(set_intersection2(sK26,sK27)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK26,sK27]),skolemize(X0,sK26),skolemize(X1,sK27)],[f110]) ).

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

fof(f262,plain,
    finite(sK26),
    inference(cnf_transformation,[],[f146]) ).

fof(f263,plain,
    ~ finite(set_intersection2(sK26,sK27)),
    inference(cnf_transformation,[],[f146]) ).

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

tcf(c_159,negated_conjecture,
    ~ finite(set_intersection2(sK26,sK27)),
    inference(cnf_transformation,[],[f263]) ).

tcf(c_160,negated_conjecture,
    finite(sK26),
    inference(cnf_transformation,[],[f262]) ).

tcf(c_1823,definition,
    iPr_def_10 = set_intersection2(sK26,sK27),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_1824,negated_conjecture,
    finite(sK26),
    inference(demodulation,[status(thm)],[c_160]) ).

tcf(c_1825,negated_conjecture,
    ~ finite(iPr_def_10),
    inference(demodulation,[status(thm)],[c_159,c_1823]) ).

tcf(c_2511,plain,
    ( finite(iPr_def_10)
    | ~ finite(sK26) ),
    inference(superposition,[status(thm)],[c_1823,c_70]) ).

tcf(c_2513,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2511,c_1825,c_1824]) ).


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