↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n005.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.82s 11.28s
% Output   : CNFRefutation 0.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   9 unt;   0 def)
%            Number of atoms       :   27 (   2 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   20 (  11   ~;   4   |;   2   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn  18   !;   2   ?;   2   :)

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

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

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

fof(f345,axiom,
    ! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_intersection2(X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_xboole_1) ).

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

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

fof(f1188,plain,
    ( finite(sK255)
    & ~ finite(set_intersection2(sK255,sK256)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK255,sK256]),skolemize(X0,sK255),skolemize(X1,sK256)],[f656]) ).

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

fof(f2019,plain,
    finite(sK255),
    inference(cnf_transformation,[],[f1188]) ).

fof(f2020,plain,
    ~ finite(set_intersection2(sK255,sK256)),
    inference(cnf_transformation,[],[f1188]) ).

fof(f2155,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
    inference(cnf_transformation,[],[f345]) ).

fof(f2369,plain,
    ! [X0,X1] :
      ( ~ finite(X0)
      | finite(set_difference(X0,set_difference(X0,X1))) ),
    inference(definition_unfolding,[],[f1597,f2155]) ).

fof(f2487,plain,
    ~ finite(set_difference(sK255,set_difference(sK255,sK256))),
    inference(definition_unfolding,[],[f2020,f2155]) ).

tcf(c_387,plain,
    ! [X0: $i,X1: $i] :
      ( finite(set_difference(X0,set_difference(X0,X1)))
      | ~ finite(X0) ),
    inference(cnf_transformation,[],[f2369]) ).

tcf(c_809,negated_conjecture,
    ~ finite(set_difference(sK255,set_difference(sK255,sK256))),
    inference(cnf_transformation,[],[f2487]) ).

tcf(c_810,negated_conjecture,
    finite(sK255),
    inference(cnf_transformation,[],[f2019]) ).

tcf(c_1170,plain,
    ~ finite(sK255),
    inference(superposition,[status(thm)],[c_387,c_809]) ).

tcf(c_1171,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_810,c_1170]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU295+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/10.37  % Computer : n005.cluster.edu
% 0.08/10.37  % Model    : x86_64 x86_64
% 0.08/10.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.37  % Memory   : 8046.5625MB
% 0.08/10.37  % OS       : Linux 6.8.0-71-generic
% 0.08/10.37  % CPULimit : 300
% 0.08/10.37  % WCLimit  : 300
% 0.08/10.37  % DateTime : Thu Sep 24 13:34:43 UTC 2026
% 0.08/10.37  % CPUTime  : 
% 0.08/10.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/10.41  Running first-order theorem proving
% 0.14/10.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.14/10.42  
% 0.14/10.42  % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.42  
% 0.14/10.43  % Detected problem language: tptp
% 0.14/10.44  % Proving...
% 0.82/11.28  % SZS status Started for theBenchmark.p
% 0.82/11.28  % SZS status Theorem for theBenchmark.p
% 0.82/11.28  
% 0.82/11.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.82/11.28  
% 0.82/11.28  % ------  iProver source info
% 0.82/11.28  
% 0.82/11.28  % git: date: 2026-07-19 20:42:38 +0200
% 0.82/11.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.82/11.28  % git: non_committed_changes: false
% 0.82/11.28  
% 0.82/11.28  % ------ Parsing...
% 0.82/11.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.82/11.28  % ------ Proving...
% 0.82/11.28  % ------ Problem Properties 
% 0.82/11.28  
% 0.82/11.28  % 
% 0.82/11.28  % clauses                               993
% 0.82/11.28  % conjectures                           2
% 0.82/11.28  % EPR                                   153
% 0.82/11.28  % Horn                                  762
% 0.82/11.28  % unary                                 144
% 0.82/11.28  % binary                                294
% 0.82/11.28  % lits                                  2914
% 0.82/11.28  % lits eq                               419
% 0.82/11.28  % fd_pure                               0
% 0.82/11.28  % fd_pseudo                             0
% 0.82/11.28  % fd_cond                               31
% 0.82/11.28  % fd_pseudo_cond                        107
% 0.82/11.28  % AC symbols                            0
% 0.82/11.28  
% 0.82/11.28  % ------ Input Options Time Limit: Unbounded
% 0.82/11.28  
% 0.82/11.28  
% 0.82/11.28  % ------ 
% 0.82/11.28  % Current options:
% 0.82/11.28  % ------ 
% 0.82/11.28  
% 0.82/11.28  
% 0.82/11.28  % 
% 0.82/11.28  
% 0.82/11.28  % ------ Proving...
% 0.82/11.28  % 
% 0.82/11.28  
% 0.82/11.28  % SZS status Theorem for theBenchmark.p
% 0.82/11.28  
% 0.82/11.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.82/11.28  
% 0.82/11.28  
%------------------------------------------------------------------------------