↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n004.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:39:14 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f45,axiom,
    ( ! [X0] :
        ( ( X0 != sz00
          & aElementOf0(X0,xI) )
       => ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) )
    & xu != sz00
    & aElementOf0(xu,xI) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).

fof(f50,axiom,
    ( ( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
      | xr = sz00 )
    & xb = sdtpldt0(sdtasdt0(xq,xu),xr)
    & aElement0(xr)
    & aElement0(xq) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2666) ).

fof(f51,axiom,
    xr != sz00,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2673) ).

fof(f55,axiom,
    aElementOf0(xr,xI),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2729) ).

fof(f116,plain,
    ( ! [X0] :
        ( sz00 = X0
        | ~ aElementOf0(X0,xI)
        | ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) )
    & xu != sz00
    & aElementOf0(xu,xI) ),
    inference(ennf_transformation,[],[f45]) ).

fof(f117,plain,
    ( ! [X0] :
        ( sz00 = X0
        | ~ aElementOf0(X0,xI)
        | ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) )
    & xu != sz00
    & aElementOf0(xu,xI) ),
    inference(flattening,[],[f116]) ).

fof(f260,plain,
    ! [X0] :
      ( sz00 = X0
      | ~ aElementOf0(X0,xI)
      | ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) ),
    inference(cnf_transformation,[],[f117]) ).

fof(f269,plain,
    ( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
    | sz00 = xr ),
    inference(cnf_transformation,[],[f50]) ).

fof(f273,plain,
    sz00 != xr,
    inference(cnf_transformation,[],[f51]) ).

fof(f277,plain,
    aElementOf0(xr,xI),
    inference(cnf_transformation,[],[f55]) ).

tcf(c_154,plain,
    ! [X0: $i] :
      ( ( X0 = sz00 )
      | ~ aElementOf0(X0,xI)
      | ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) ),
    inference(cnf_transformation,[],[f260]) ).

tcf(c_164,plain,
    ( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
    | ( sz00 = xr ) ),
    inference(cnf_transformation,[],[f269]) ).

tcf(c_165,plain,
    sz00 != xr,
    inference(cnf_transformation,[],[f273]) ).

tcf(c_169,plain,
    aElementOf0(xr,xI),
    inference(cnf_transformation,[],[f277]) ).

tcf(c_249,plain,
    iLess0(sbrdtbr0(xr),sbrdtbr0(xu)),
    inference(global_subsumption_just,[status(thm)],[c_164,c_165,c_164]) ).

tcf(c_8691,plain,
    ( ( sz00 = xr )
    | ~ aElementOf0(xr,xI) ),
    inference(superposition,[status(thm)],[c_249,c_154]) ).

tcf(c_8692,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_8691,c_165,c_169]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : RNG124+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.37  % Computer : n004.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Thu Sep 24 08:21:50 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/0.42  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.09/0.43  
% 0.09/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.43  
% 0.09/0.43  % Detected problem language: tptp
% 0.09/0.44  % Proving...
% 2.09/1.19  % SZS status Started for theBenchmark.p
% 2.09/1.19  % SZS status Theorem for theBenchmark.p
% 2.09/1.19  
% 2.09/1.19  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.09/1.19  
% 2.09/1.19  % ------  iProver source info
% 2.09/1.19  
% 2.09/1.19  % git: date: 2026-07-19 20:42:38 +0200
% 2.09/1.19  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.09/1.19  % git: non_committed_changes: false
% 2.09/1.19  
% 2.09/1.19  % ------ Parsing...
% 2.09/1.19  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.09/1.19  
% 2.09/1.19  % ------ Preprocessing... sup_sim: 1  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e % 
% 2.09/1.19  
% 2.09/1.19  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.09/1.19  
% 2.09/1.19  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.09/1.19  % ------ Proving...
% 2.09/1.19  % ------ Problem Properties 
% 2.09/1.19  
% 2.09/1.19  % 
% 2.09/1.19  % clauses                               116
% 2.09/1.19  % conjectures                           0
% 2.09/1.19  % EPR                                   31
% 2.09/1.19  % Horn                                  92
% 2.09/1.19  % unary                                 31
% 2.09/1.19  % binary                                16
% 2.09/1.19  % lits                                  359
% 2.09/1.19  % lits eq                               54
% 2.09/1.19  % fd_pure                               0
% 2.09/1.19  % fd_pseudo                             0
% 2.09/1.19  % fd_cond                               5
% 2.09/1.19  % fd_pseudo_cond                        11
% 2.09/1.19  % AC symbols                            0
% 2.09/1.19  
% 2.09/1.19  % ------ Schedule dynamic 5 is on 
% 2.09/1.19  
% 2.09/1.19  % ------ no conjectures: strip conj schedule 
% 2.09/1.19  
% 2.09/1.19  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.09/1.19  
% 2.09/1.19  
% 2.09/1.19  % ------ 
% 2.09/1.19  % Current options:
% 2.09/1.19  % ------ 
% 2.09/1.19  
% 2.09/1.19  
% 2.09/1.19  % 
% 2.09/1.19  
% 2.09/1.19  % ------ Proving...
% 2.09/1.19  % 
% 2.09/1.19  
% 2.09/1.19  % SZS status Theorem for theBenchmark.p
% 2.09/1.19  
% 2.09/1.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.09/1.19  
% 2.09/1.19  
%------------------------------------------------------------------------------