↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SEU115+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 : n014.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:55:27 PM UTC 2026

% Result   : Theorem 1.96s 1.26s
% Output   : CNFRefutation 1.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (  13 unt;   0 def)
%            Number of atoms       :   33 (  14 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   23 (  13   ~;   8   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 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;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :    8 (   0 sgn   8   !;   0   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [X0] :
      ( empty(X0)
     => finite(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_finset_1) ).

fof(f29,axiom,
    empty(empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).

fof(f33,conjecture,
    finite_subsets(empty_set) = singleton(empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_finsub_1) ).

fof(f34,negated_conjecture,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(negated_conjecture,[status(cth)],[f33]) ).

fof(f35,axiom,
    ! [X0] :
      ( finite(X0)
     => finite_subsets(X0) = powerset(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_finsub_1) ).

fof(f36,axiom,
    powerset(empty_set) = singleton(empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_zfmisc_1) ).

fof(f38,plain,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(flattening,[],[f34]) ).

fof(f57,plain,
    ! [X0] :
      ( ~ empty(X0)
      | finite(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f68,plain,
    ! [X0] :
      ( ~ finite(X0)
      | finite_subsets(X0) = powerset(X0) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f89,plain,
    ! [X0] :
      ( ~ empty(X0)
      | finite(X0) ),
    inference(cnf_transformation,[],[f57]) ).

fof(f127,plain,
    empty(empty_set),
    inference(cnf_transformation,[],[f29]) ).

fof(f131,plain,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(cnf_transformation,[],[f38]) ).

fof(f132,plain,
    ! [X0] :
      ( ~ finite(X0)
      | finite_subsets(X0) = powerset(X0) ),
    inference(cnf_transformation,[],[f68]) ).

fof(f133,plain,
    singleton(empty_set) = powerset(empty_set),
    inference(cnf_transformation,[],[f36]) ).

tcf(c_59,plain,
    ! [X0: $i] :
      ( finite(X0)
      | ~ empty(X0) ),
    inference(cnf_transformation,[],[f89]) ).

tcf(c_97,plain,
    empty(empty_set),
    inference(cnf_transformation,[],[f127]) ).

tcf(c_101,negated_conjecture,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(cnf_transformation,[],[f131]) ).

tcf(c_102,plain,
    ! [X0: $i] :
      ( ( powerset(X0) = finite_subsets(X0) )
      | ~ finite(X0) ),
    inference(cnf_transformation,[],[f132]) ).

tcf(c_103,plain,
    powerset(empty_set) = singleton(empty_set),
    inference(cnf_transformation,[],[f133]) ).

tcf(c_121,plain,
    ( finite(empty_set)
    | ~ empty(empty_set) ),
    inference(instantiation,[status(thm)],[c_59]) ).

tcf(c_131,plain,
    ( ( powerset(empty_set) = finite_subsets(empty_set) )
    | ~ finite(empty_set) ),
    inference(instantiation,[status(thm)],[c_102]) ).

tcf(c_326,plain,
    powerset(empty_set) != finite_subsets(empty_set),
    inference(light_normalisation,[status(thm)],[c_101,c_103]) ).

tcf(c_415,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_326,c_131,c_121,c_97]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SEU115+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35  % Computer : n014.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Thu Sep 24 12:46:32 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/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.13/0.40  
% 0.13/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40  
% 0.13/0.40  % Detected problem language: tptp
% 0.13/0.41  % Proving...
% 1.96/1.26  % SZS status Started for theBenchmark.p
% 1.96/1.26  % SZS status Theorem for theBenchmark.p
% 1.96/1.26  
% 1.96/1.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.96/1.26  
% 1.96/1.26  % ------  iProver source info
% 1.96/1.26  
% 1.96/1.26  % git: date: 2026-07-19 20:42:38 +0200
% 1.96/1.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.96/1.26  % git: non_committed_changes: false
% 1.96/1.26  
% 1.96/1.26  % ------ Parsing...
% 1.96/1.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.96/1.26  
% 1.96/1.26  % ------ Preprocessing... sup_sim: 1  sf_s  rm: 16 0s  sf_e  pe_s % 
% 1.96/1.26  
% 1.96/1.26  % SZS status Theorem for theBenchmark.p
% 1.96/1.26  
% 1.96/1.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.96/1.26  
% 1.96/1.26  
%------------------------------------------------------------------------------