↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET064+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/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:46:20 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f41,axiom,
    ! [X0] :
      ( X0 != null_class
     => ? [X1] :
          ( disjoint(X1,X0)
          & member(X1,X0)
          & member(X1,universal_class) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',regularity) ).

fof(f44,conjecture,
    ! [X0] :
      ( ? [X1] : member(X1,X0)
      | X0 = null_class ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',null_class_is_unique) ).

fof(f45,negated_conjecture,
    ~ ! [X0] :
        ( ? [X1] : member(X1,X0)
        | X0 = null_class ),
    inference(negated_conjecture,[status(cth)],[f44]) ).

fof(f57,plain,
    ! [X0] :
      ( null_class = X0
      | ? [X1] :
          ( disjoint(X1,X0)
          & member(X1,X0)
          & member(X1,universal_class) ) ),
    inference(ennf_transformation,[],[f41]) ).

fof(f60,plain,
    ? [X0] :
      ( ! [X1] : ~ member(X1,X0)
      & null_class != X0 ),
    inference(ennf_transformation,[],[f45]) ).

fof(f101,plain,
    ! [X0] :
      ( null_class = X0
      | ( disjoint(sK4(X0),X0)
        & member(sK4(X0),X0)
        & member(sK4(X0),universal_class) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f57]) ).

fof(f103,plain,
    ( ! [X1] : ~ member(X1,sK6)
    & null_class != sK6 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X0,sK6)],[f60]) ).

fof(f186,plain,
    ! [X0] :
      ( null_class = X0
      | member(sK4(X0),X0) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f191,plain,
    ! [X1] : ~ member(X1,sK6),
    inference(cnf_transformation,[],[f103]) ).

fof(f192,plain,
    null_class != sK6,
    inference(cnf_transformation,[],[f103]) ).

tcf(c_124,plain,
    ! [X0: $i] :
      ( member(sK4(X0),X0)
      | ( X0 = null_class ) ),
    inference(cnf_transformation,[],[f186]) ).

tcf(c_128,negated_conjecture,
    null_class != sK6,
    inference(cnf_transformation,[],[f192]) ).

tcf(c_129,negated_conjecture,
    ! [X0: $i] : ~ member(X0,sK6),
    inference(cnf_transformation,[],[f191]) ).

tcf(c_1558,negated_conjecture,
    ! [X0: $i] : ~ member(X0,sK6),
    inference(demodulation,[status(thm)],[c_129]) ).

tcf(c_1559,negated_conjecture,
    null_class != sK6,
    inference(demodulation,[status(thm)],[c_128]) ).

tcf(c_2442,plain,
    null_class = sK6,
    inference(superposition,[status(thm)],[c_124,c_1558]) ).

tcf(c_2444,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2442,c_1559]) ).


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