↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n018.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:26:15 PM UTC 2026

% Result   : Theorem 8.67s 2.63s
% Output   : CNFRefutation 8.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   27 (   9 unt;   0 def)
%            Number of atoms       :   94 (  29 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  104 (  37   ~;  27   |;  36   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   9 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn  19   !;   5   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f92,axiom,
    ( ! [X0] :
        ( aElementOf0(X0,szNzAzT0)
       => ! [X1] :
            ( ( ( aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),xk))
                | ( sbrdtbr0(X1) = xk
                  & ( aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X0)))
                    | ! [X2] :
                        ( aElementOf0(X2,X1)
                       => aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) ) )
              & aSet0(X1) )
           => sdtlpdtrp0(xd,X0) = sdtlpdtrp0(sdtlpdtrp0(xC,X0),X1) ) )
    & szDzozmdt0(xd) = szNzAzT0
    & aFunction0(xd) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4730) ).

fof(f94,axiom,
    ( ! [X0] :
        ( aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
      <=> ( sdtlpdtrp0(xd,X0) = szDzizrdt0(xd)
          & aElementOf0(X0,szDzozmdt0(xd)) ) )
    & aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & aElementOf0(szDzizrdt0(xd),xT) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4854) ).

fof(f114,axiom,
    ( ? [X0] :
        ( sdtlpdtrp0(xe,X0) = xx
        & aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
    & aElementOf0(xx,szNzAzT0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5365) ).

fof(f115,conjecture,
    ? [X0] :
      ( xx = sdtlpdtrp0(xe,X0)
      & aElementOf0(X0,szNzAzT0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f116,negated_conjecture,
    ~ ? [X0] :
        ( xx = sdtlpdtrp0(xe,X0)
        & aElementOf0(X0,szNzAzT0) ),
    inference(negated_conjecture,[status(cth)],[f115]) ).

fof(f262,plain,
    ( ! [X0] :
        ( ~ aElementOf0(X0,szNzAzT0)
        | ! [X1] :
            ( ( ~ aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),xk))
              & ( sbrdtbr0(X1) != xk
                | ( ~ aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X0)))
                  & ? [X2] :
                      ( aElementOf0(X2,X1)
                      & ~ aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) ) )
            | ~ aSet0(X1)
            | sdtlpdtrp0(xd,X0) = sdtlpdtrp0(sdtlpdtrp0(xC,X0),X1) ) )
    & szDzozmdt0(xd) = szNzAzT0
    & aFunction0(xd) ),
    inference(ennf_transformation,[],[f92]) ).

fof(f263,plain,
    ( ! [X0] :
        ( ~ aElementOf0(X0,szNzAzT0)
        | ! [X1] :
            ( ( ~ aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),xk))
              & ( sbrdtbr0(X1) != xk
                | ( ~ aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X0)))
                  & ? [X2] :
                      ( aElementOf0(X2,X1)
                      & ~ aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) ) )
            | ~ aSet0(X1)
            | sdtlpdtrp0(xd,X0) = sdtlpdtrp0(sdtlpdtrp0(xC,X0),X1) ) )
    & szDzozmdt0(xd) = szNzAzT0
    & aFunction0(xd) ),
    inference(flattening,[],[f262]) ).

fof(f276,plain,
    ! [X0] :
      ( sdtlpdtrp0(xe,X0) != xx
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(ennf_transformation,[],[f116]) ).

fof(f445,plain,
    ( ! [X0] :
        ( ~ aElementOf0(X0,szNzAzT0)
        | ! [X1] :
            ( ( ~ aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),xk))
              & ( sbrdtbr0(X1) != xk
                | ( ~ aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X0)))
                  & aElementOf0(sK67(X0,X1),X1)
                  & ~ aElementOf0(sK67(X0,X1),sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) )
            | ~ aSet0(X1)
            | sdtlpdtrp0(xd,X0) = sdtlpdtrp0(sdtlpdtrp0(xC,X0),X1) ) )
    & szDzozmdt0(xd) = szNzAzT0
    & aFunction0(xd) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK67]),skolemize(X2,sK67(X0,X1))],[f263]) ).

fof(f449,plain,
    ( ! [X0] :
        ( ( ~ aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
          | ( sdtlpdtrp0(xd,X0) = szDzizrdt0(xd)
            & aElementOf0(X0,szDzozmdt0(xd)) ) )
        & ( sdtlpdtrp0(xd,X0) != szDzizrdt0(xd)
          | ~ aElementOf0(X0,szDzozmdt0(xd))
          | aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) )
    & aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & aElementOf0(szDzizrdt0(xd),xT) ),
    inference(nnf_transformation,[],[f94]) ).

fof(f450,plain,
    ( ! [X0] :
        ( ( ~ aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
          | ( sdtlpdtrp0(xd,X0) = szDzizrdt0(xd)
            & aElementOf0(X0,szDzozmdt0(xd)) ) )
        & ( sdtlpdtrp0(xd,X0) != szDzizrdt0(xd)
          | ~ aElementOf0(X0,szDzozmdt0(xd))
          | aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) )
    & aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & aElementOf0(szDzizrdt0(xd),xT) ),
    inference(flattening,[],[f449]) ).

fof(f461,plain,
    ( xx = sdtlpdtrp0(xe,sK73)
    & aElementOf0(sK73,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & aElementOf0(xx,szNzAzT0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK73]),skolemize(X0,sK73)],[f114]) ).

fof(f820,plain,
    szNzAzT0 = szDzozmdt0(xd),
    inference(cnf_transformation,[],[f445]) ).

fof(f829,plain,
    ! [X0] :
      ( ~ aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
      | aElementOf0(X0,szDzozmdt0(xd)) ),
    inference(cnf_transformation,[],[f450]) ).

fof(f898,plain,
    xx = sdtlpdtrp0(xe,sK73),
    inference(cnf_transformation,[],[f461]) ).

fof(f899,plain,
    aElementOf0(sK73,sdtlbdtrb0(xd,szDzizrdt0(xd))),
    inference(cnf_transformation,[],[f461]) ).

fof(f901,plain,
    ! [X0] :
      ( sdtlpdtrp0(xe,X0) != xx
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(cnf_transformation,[],[f276]) ).

tcf(c_404,plain,
    szDzozmdt0(xd) = szNzAzT0,
    inference(cnf_transformation,[],[f820]) ).

tcf(c_418,plain,
    ! [X0: $i] :
      ( aElementOf0(X0,szDzozmdt0(xd))
      | ~ aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
    inference(cnf_transformation,[],[f829]) ).

tcf(c_486,plain,
    aElementOf0(sK73,sdtlbdtrb0(xd,szDzizrdt0(xd))),
    inference(cnf_transformation,[],[f899]) ).

tcf(c_487,plain,
    sdtlpdtrp0(xe,sK73) = xx,
    inference(cnf_transformation,[],[f898]) ).

tcf(c_488,negated_conjecture,
    ! [X0: $i] :
      ( ~ aElementOf0(X0,szNzAzT0)
      | ( sdtlpdtrp0(xe,X0) != xx ) ),
    inference(cnf_transformation,[],[f901]) ).

tcf(c_3728,plain,
    ! [X0: $i] :
      ( aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
    inference(light_normalisation,[status(thm)],[c_418,c_404]) ).

tcf(c_26374,negated_conjecture,
    ! [X0: $i] :
      ( ~ aElementOf0(X0,szNzAzT0)
      | ( sdtlpdtrp0(xe,X0) != xx ) ),
    inference(demodulation,[status(thm)],[c_488]) ).

tcf(c_31630,plain,
    ~ aElementOf0(sK73,szNzAzT0),
    inference(superposition,[status(thm)],[c_487,c_26374]) ).

tcf(c_31663,plain,
    aElementOf0(sK73,szNzAzT0),
    inference(superposition,[status(thm)],[c_486,c_3728]) ).

tcf(c_31664,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_31663,c_31630]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM618+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37  % Computer : n018.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Thu Sep 24 04:59:05 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42  
% 0.10/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42  
% 0.10/0.42  % Detected problem language: tptp
% 0.10/0.44  % Proving...
% 8.67/2.63  % SZS status Started for theBenchmark.p
% 8.67/2.63  % SZS status Theorem for theBenchmark.p
% 8.67/2.63  
% 8.67/2.63  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.67/2.63  
% 8.67/2.63  % ------  iProver source info
% 8.67/2.63  
% 8.67/2.63  % git: date: 2026-07-19 20:42:38 +0200
% 8.67/2.63  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.67/2.63  % git: non_committed_changes: false
% 8.67/2.63  
% 8.67/2.63  % ------ Parsing...
% 8.67/2.63  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 8.67/2.63  
% 8.67/2.63  % ------ Preprocessing... sup_sim: 16  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e  sup_sim: 0  sf_s  rm: 4 0s  sf_e  pe_s  pe_e % 
% 8.67/2.63  
% 8.67/2.63  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 8.67/2.63  
% 8.67/2.63  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 8.67/2.63  % ------ Proving...
% 8.67/2.63  % ------ Problem Properties 
% 8.67/2.63  
% 8.67/2.63  % 
% 8.67/2.63  % clauses                               393
% 8.67/2.63  % conjectures                           1
% 8.67/2.63  % EPR                                   80
% 8.67/2.63  % Horn                                  318
% 8.67/2.63  % unary                                 70
% 8.67/2.63  % binary                                104
% 8.67/2.63  % lits                                  1196
% 8.67/2.63  % lits eq                               176
% 8.67/2.63  % fd_pure                               0
% 8.67/2.63  % fd_pseudo                             0
% 8.67/2.63  % fd_cond                               11
% 8.67/2.63  % fd_pseudo_cond                        39
% 8.67/2.63  % AC symbols                            0
% 8.67/2.63  
% 8.67/2.63  % ------ Schedule dynamic 5 is on 
% 8.67/2.63  
% 8.67/2.63  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.67/2.63  
% 8.67/2.63  
% 8.67/2.63  % ------ 
% 8.67/2.63  % Current options:
% 8.67/2.63  % ------ 
% 8.67/2.63  
% 8.67/2.63  
% 8.67/2.63  % 
% 8.67/2.63  
% 8.67/2.63  % ------ Proving...
% 8.67/2.63  % 
% 8.67/2.63  
% 8.67/2.63  % SZS status Theorem for theBenchmark.p
% 8.67/2.63  
% 8.67/2.63  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.67/2.63  
% 8.67/2.63  
%------------------------------------------------------------------------------