TSTP Solution File: RNG124+4 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : RNG124+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 13:55:27 EDT 2023

% Result   : Theorem 3.68s 1.16s
% Output   : CNFRefutation 3.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (   7 unt;   0 def)
%            Number of atoms       :   99 (  36 equ)
%            Maximal formula atoms :   11 (   4 avg)
%            Number of connectives :  109 (  32   ~;  22   |;  51   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  11 con; 0-2 aty)
%            Number of variables   :   31 (   0 sgn;  12   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f45,axiom,
    ( ! [X0] :
        ( ( sz00 != X0
          & ( aElementOf0(X0,xI)
            | ? [X1,X2] :
                ( sdtpldt0(X1,X2) = X0
                & aElementOf0(X2,slsdtgt0(xb))
                & aElementOf0(X1,slsdtgt0(xa)) ) ) )
       => ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) )
    & sz00 != xu
    & aElementOf0(xu,xI)
    & ? [X0,X1] :
        ( sdtpldt0(X0,X1) = xu
        & aElementOf0(X1,slsdtgt0(xb))
        & aElementOf0(X0,slsdtgt0(xa)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2273) ).

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

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

fof(f55,axiom,
    ( aElementOf0(xr,xI)
    & ? [X0,X1] :
        ( sdtpldt0(X0,X1) = xr
        & aElementOf0(X1,slsdtgt0(xb))
        & aElementOf0(X0,slsdtgt0(xa)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2729) ).

fof(f69,plain,
    ( ! [X0] :
        ( ( sz00 != X0
          & ( aElementOf0(X0,xI)
            | ? [X1,X2] :
                ( sdtpldt0(X1,X2) = X0
                & aElementOf0(X2,slsdtgt0(xb))
                & aElementOf0(X1,slsdtgt0(xa)) ) ) )
       => ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) )
    & sz00 != xu
    & aElementOf0(xu,xI)
    & ? [X3,X4] :
        ( xu = sdtpldt0(X3,X4)
        & aElementOf0(X4,slsdtgt0(xb))
        & aElementOf0(X3,slsdtgt0(xa)) ) ),
    inference(rectify,[],[f45]) ).

fof(f127,plain,
    ( ! [X0] :
        ( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
        | sz00 = X0
        | ( ~ aElementOf0(X0,xI)
          & ! [X1,X2] :
              ( sdtpldt0(X1,X2) != X0
              | ~ aElementOf0(X2,slsdtgt0(xb))
              | ~ aElementOf0(X1,slsdtgt0(xa)) ) ) )
    & sz00 != xu
    & aElementOf0(xu,xI)
    & ? [X3,X4] :
        ( xu = sdtpldt0(X3,X4)
        & aElementOf0(X4,slsdtgt0(xb))
        & aElementOf0(X3,slsdtgt0(xa)) ) ),
    inference(ennf_transformation,[],[f69]) ).

fof(f128,plain,
    ( ! [X0] :
        ( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
        | sz00 = X0
        | ( ~ aElementOf0(X0,xI)
          & ! [X1,X2] :
              ( sdtpldt0(X1,X2) != X0
              | ~ aElementOf0(X2,slsdtgt0(xb))
              | ~ aElementOf0(X1,slsdtgt0(xa)) ) ) )
    & sz00 != xu
    & aElementOf0(xu,xI)
    & ? [X3,X4] :
        ( xu = sdtpldt0(X3,X4)
        & aElementOf0(X4,slsdtgt0(xb))
        & aElementOf0(X3,slsdtgt0(xa)) ) ),
    inference(flattening,[],[f127]) ).

fof(f214,plain,
    ( ? [X3,X4] :
        ( xu = sdtpldt0(X3,X4)
        & aElementOf0(X4,slsdtgt0(xb))
        & aElementOf0(X3,slsdtgt0(xa)) )
   => ( xu = sdtpldt0(sK41,sK42)
      & aElementOf0(sK42,slsdtgt0(xb))
      & aElementOf0(sK41,slsdtgt0(xa)) ) ),
    introduced(choice_axiom,[]) ).

fof(f215,plain,
    ( ! [X0] :
        ( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
        | sz00 = X0
        | ( ~ aElementOf0(X0,xI)
          & ! [X1,X2] :
              ( sdtpldt0(X1,X2) != X0
              | ~ aElementOf0(X2,slsdtgt0(xb))
              | ~ aElementOf0(X1,slsdtgt0(xa)) ) ) )
    & sz00 != xu
    & aElementOf0(xu,xI)
    & xu = sdtpldt0(sK41,sK42)
    & aElementOf0(sK42,slsdtgt0(xb))
    & aElementOf0(sK41,slsdtgt0(xa)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK41,sK42])],[f128,f214]) ).

fof(f227,plain,
    ( ? [X0,X1] :
        ( sdtpldt0(X0,X1) = xr
        & aElementOf0(X1,slsdtgt0(xb))
        & aElementOf0(X0,slsdtgt0(xa)) )
   => ( xr = sdtpldt0(sK52,sK53)
      & aElementOf0(sK53,slsdtgt0(xb))
      & aElementOf0(sK52,slsdtgt0(xa)) ) ),
    introduced(choice_axiom,[]) ).

fof(f228,plain,
    ( aElementOf0(xr,xI)
    & xr = sdtpldt0(sK52,sK53)
    & aElementOf0(sK53,slsdtgt0(xb))
    & aElementOf0(sK52,slsdtgt0(xa)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK52,sK53])],[f55,f227]) ).

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

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

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

fof(f422,plain,
    aElementOf0(xr,xI),
    inference(cnf_transformation,[],[f228]) ).

cnf(c_201,plain,
    ( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
    | ~ aElementOf0(X0,xI)
    | X0 = sz00 ),
    inference(cnf_transformation,[],[f387]) ).

cnf(c_222,plain,
    ( sz00 = xr
    | iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ),
    inference(cnf_transformation,[],[f405]) ).

cnf(c_226,plain,
    sz00 != xr,
    inference(cnf_transformation,[],[f406]) ).

cnf(c_239,plain,
    aElementOf0(xr,xI),
    inference(cnf_transformation,[],[f422]) ).

cnf(c_360,plain,
    iLess0(sbrdtbr0(xr),sbrdtbr0(xu)),
    inference(global_subsumption_just,[status(thm)],[c_222,c_226,c_222]) ).

cnf(c_14049,plain,
    ( ~ aElementOf0(xr,xI)
    | sz00 = xr ),
    inference(superposition,[status(thm)],[c_360,c_201]) ).

cnf(c_14050,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_14049,c_226,c_239]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : RNG124+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Sun Aug 27 01:50:42 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.68/1.16  % SZS status Started for theBenchmark.p
% 3.68/1.16  % SZS status Theorem for theBenchmark.p
% 3.68/1.16  
% 3.68/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.68/1.16  
% 3.68/1.16  ------  iProver source info
% 3.68/1.16  
% 3.68/1.16  git: date: 2023-05-31 18:12:56 +0000
% 3.68/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.68/1.16  git: non_committed_changes: false
% 3.68/1.16  git: last_make_outside_of_git: false
% 3.68/1.16  
% 3.68/1.16  ------ Parsing...
% 3.68/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.68/1.16  
% 3.68/1.16  ------ Preprocessing... sup_sim: 3  sf_s  rm: 2 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 
% 3.68/1.16  
% 3.68/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.68/1.16  
% 3.68/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.68/1.16  ------ Proving...
% 3.68/1.16  ------ Problem Properties 
% 3.68/1.16  
% 3.68/1.16  
% 3.68/1.16  clauses                                 181
% 3.68/1.16  conjectures                             0
% 3.68/1.16  EPR                                     49
% 3.68/1.16  Horn                                    154
% 3.68/1.16  unary                                   69
% 3.68/1.16  binary                                  33
% 3.68/1.16  lits                                    463
% 3.68/1.16  lits eq                                 77
% 3.68/1.16  fd_pure                                 0
% 3.68/1.16  fd_pseudo                               0
% 3.68/1.16  fd_cond                                 5
% 3.68/1.16  fd_pseudo_cond                          11
% 3.68/1.16  AC symbols                              0
% 3.68/1.16  
% 3.68/1.16  ------ Schedule dynamic 5 is on 
% 3.68/1.16  
% 3.68/1.16  ------ no conjectures: strip conj schedule 
% 3.68/1.16  
% 3.68/1.16  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.68/1.16  
% 3.68/1.16  
% 3.68/1.16  ------ 
% 3.68/1.16  Current options:
% 3.68/1.16  ------ 
% 3.68/1.16  
% 3.68/1.16  
% 3.68/1.16  
% 3.68/1.16  
% 3.68/1.16  ------ Proving...
% 3.68/1.16  
% 3.68/1.16  
% 3.68/1.16  % SZS status Theorem for theBenchmark.p
% 3.68/1.16  
% 3.68/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/1.16  
% 3.68/1.16  
%------------------------------------------------------------------------------