↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM606+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 : n009.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:12 PM UTC 2026

% Result   : Theorem 10.90s 2.34s
% Output   : CNFRefutation 10.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (  10 unt;   0 def)
%            Number of atoms       :   70 (   5 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   67 (  26   ~;  15   |;  20   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   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    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn  17   !;   5   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f75,axiom,
    ( isCountable0(xS)
    & aSubsetOf0(xS,szNzAzT0)
    & ! [X0] :
        ( aElementOf0(X0,xS)
       => aElementOf0(X0,szNzAzT0) )
    & aSet0(xS) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).

fof(f98,axiom,
    ( aSubsetOf0(xO,xS)
    & ! [X0] :
        ( aElementOf0(X0,xO)
       => aElementOf0(X0,xS) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4998) ).

fof(f100,axiom,
    ( ~ ( xQ = slcrc0
        | ~ ? [X0] : aElementOf0(X0,xQ) )
    & ! [X0] :
        ( aElementOf0(X0,xQ)
       => aElementOf0(X0,xO) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5093) ).

fof(f101,conjecture,
    ( aSubsetOf0(xQ,szNzAzT0)
    | ! [X0] :
        ( aElementOf0(X0,xQ)
       => aElementOf0(X0,szNzAzT0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f102,negated_conjecture,
    ~ ( aSubsetOf0(xQ,szNzAzT0)
      | ! [X0] :
          ( aElementOf0(X0,xQ)
         => aElementOf0(X0,szNzAzT0) ) ),
    inference(negated_conjecture,[status(cth)],[f101]) ).

fof(f122,plain,
    ( ~ ( xQ = slcrc0
        | ~ ? [X1] : aElementOf0(X1,xQ) )
    & ! [X0] :
        ( aElementOf0(X0,xQ)
       => aElementOf0(X0,xO) ) ),
    inference(rectify,[],[f100]) ).

fof(f222,plain,
    ( isCountable0(xS)
    & aSubsetOf0(xS,szNzAzT0)
    & ! [X0] :
        ( ~ aElementOf0(X0,xS)
        | aElementOf0(X0,szNzAzT0) )
    & aSet0(xS) ),
    inference(ennf_transformation,[],[f75]) ).

fof(f250,plain,
    ( aSubsetOf0(xO,xS)
    & ! [X0] :
        ( ~ aElementOf0(X0,xO)
        | aElementOf0(X0,xS) ) ),
    inference(ennf_transformation,[],[f98]) ).

fof(f252,plain,
    ( slcrc0 != xQ
    & ? [X1] : aElementOf0(X1,xQ)
    & ! [X0] :
        ( ~ aElementOf0(X0,xQ)
        | aElementOf0(X0,xO) ) ),
    inference(ennf_transformation,[],[f122]) ).

fof(f253,plain,
    ( slcrc0 != xQ
    & ? [X1] : aElementOf0(X1,xQ)
    & ! [X0] :
        ( ~ aElementOf0(X0,xQ)
        | aElementOf0(X0,xO) ) ),
    inference(flattening,[],[f252]) ).

fof(f254,plain,
    ( ~ aSubsetOf0(xQ,szNzAzT0)
    & ? [X0] :
        ( aElementOf0(X0,xQ)
        & ~ aElementOf0(X0,szNzAzT0) ) ),
    inference(ennf_transformation,[],[f102]) ).

fof(f435,plain,
    ( slcrc0 != xQ
    & aElementOf0(sK71,xQ)
    & ! [X0] :
        ( ~ aElementOf0(X0,xQ)
        | aElementOf0(X0,xO) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK71]),skolemize(X1,sK71)],[f253]) ).

fof(f436,plain,
    ( ~ aSubsetOf0(xQ,szNzAzT0)
    & aElementOf0(sK72,xQ)
    & ~ aElementOf0(sK72,szNzAzT0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK72]),skolemize(X0,sK72)],[f254]) ).

fof(f585,plain,
    ! [X0] :
      ( ~ aElementOf0(X0,xS)
      | aElementOf0(X0,szNzAzT0) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f828,plain,
    ! [X0] :
      ( ~ aElementOf0(X0,xO)
      | aElementOf0(X0,xS) ),
    inference(cnf_transformation,[],[f250]) ).

fof(f836,plain,
    ! [X0] :
      ( ~ aElementOf0(X0,xQ)
      | aElementOf0(X0,xO) ),
    inference(cnf_transformation,[],[f435]) ).

fof(f838,plain,
    aElementOf0(sK72,xQ),
    inference(cnf_transformation,[],[f436]) ).

fof(f839,plain,
    ~ aElementOf0(sK72,szNzAzT0),
    inference(cnf_transformation,[],[f436]) ).

tcf(c_196,plain,
    ! [X0: $i] :
      ( aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X0,xS) ),
    inference(cnf_transformation,[],[f585]) ).

tcf(c_439,plain,
    ! [X0: $i] :
      ( aElementOf0(X0,xS)
      | ~ aElementOf0(X0,xO) ),
    inference(cnf_transformation,[],[f828]) ).

tcf(c_446,plain,
    ! [X0: $i] :
      ( aElementOf0(X0,xO)
      | ~ aElementOf0(X0,xQ) ),
    inference(cnf_transformation,[],[f836]) ).

tcf(c_449,negated_conjecture,
    ~ aElementOf0(sK72,szNzAzT0),
    inference(cnf_transformation,[],[f839]) ).

tcf(c_450,negated_conjecture,
    aElementOf0(sK72,xQ),
    inference(cnf_transformation,[],[f838]) ).

tcf(c_26082,negated_conjecture,
    aElementOf0(sK72,xQ),
    inference(demodulation,[status(thm)],[c_450]) ).

tcf(c_26083,negated_conjecture,
    ~ aElementOf0(sK72,szNzAzT0),
    inference(demodulation,[status(thm)],[c_449]) ).

tcf(c_31240,plain,
    aElementOf0(sK72,xO),
    inference(superposition,[status(thm)],[c_26082,c_446]) ).

tcf(c_31263,plain,
    aElementOf0(sK72,xS),
    inference(superposition,[status(thm)],[c_31240,c_439]) ).

tcf(c_31265,plain,
    aElementOf0(sK72,szNzAzT0),
    inference(superposition,[status(thm)],[c_31263,c_196]) ).

tcf(c_31266,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_31265,c_26083]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM606+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.09/0.37  % Computer : n009.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 04:52:59 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.41  Running first-order theorem proving
% 0.13/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.13/0.42  
% 0.13/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.42  
% 0.13/0.42  % Detected problem language: tptp
% 0.13/0.43  % Proving...
% 10.90/2.34  % SZS status Started for theBenchmark.p
% 10.90/2.34  % SZS status Theorem for theBenchmark.p
% 10.90/2.34  
% 10.90/2.34  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.90/2.34  
% 10.90/2.34  % ------  iProver source info
% 10.90/2.34  
% 10.90/2.34  % git: date: 2026-07-19 20:42:38 +0200
% 10.90/2.34  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.90/2.34  % git: non_committed_changes: false
% 10.90/2.34  
% 10.90/2.34  % ------ Parsing...
% 10.90/2.34  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 10.90/2.34  
% 10.90/2.34  % ------ Preprocessing... sup_sim: 9  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 % 
% 10.90/2.34  
% 10.90/2.34  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 10.90/2.34  
% 10.90/2.34  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 10.90/2.34  % ------ Proving...
% 10.90/2.34  % ------ Problem Properties 
% 10.90/2.34  
% 10.90/2.34  % 
% 10.90/2.34  % clauses                               363
% 10.90/2.34  % conjectures                           3
% 10.90/2.34  % EPR                                   63
% 10.90/2.34  % Horn                                  289
% 10.90/2.34  % unary                                 48
% 10.90/2.34  % binary                                97
% 10.90/2.34  % lits                                  1156
% 10.90/2.34  % lits eq                               166
% 10.90/2.34  % fd_pure                               0
% 10.90/2.34  % fd_pseudo                             0
% 10.90/2.34  % fd_cond                               10
% 10.90/2.34  % fd_pseudo_cond                        39
% 10.90/2.34  % AC symbols                            0
% 10.90/2.34  
% 10.90/2.34  % ------ Schedule dynamic 5 is on 
% 10.90/2.34  
% 10.90/2.34  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.90/2.34  
% 10.90/2.34  
% 10.90/2.34  % ------ 
% 10.90/2.34  % Current options:
% 10.90/2.34  % ------ 
% 10.90/2.34  
% 10.90/2.34  
% 10.90/2.34  % 
% 10.90/2.34  
% 10.90/2.34  % ------ Proving...
% 10.90/2.34  % 
% 10.90/2.34  
% 10.90/2.34  % SZS status Theorem for theBenchmark.p
% 10.90/2.34  
% 10.90/2.34  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.90/2.34  
% 10.90/2.34  
%------------------------------------------------------------------------------