TSTP Solution File: NUM603+1 by iProver---3.9

View Problem - Process Solution

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

% Computer : n016.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 : Fri May  3 02:50:08 EDT 2024

% Result   : Theorem 7.86s 1.71s
% Output   : CNFRefutation 7.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (  14 unt;   0 def)
%            Number of atoms       :   74 (   9 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   75 (  30   ~;  25   |;  15   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f24,axiom,
    aElementOf0(sz00,szNzAzT0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).

fof(f30,axiom,
    ! [X0] :
      ( aElementOf0(X0,szNzAzT0)
     => sdtlseqdt0(sz00,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroLess) ).

fof(f81,axiom,
    ( ! [X0] :
        ( aElementOf0(X0,szNzAzT0)
       => ( ( isCountable0(sdtlpdtrp0(xN,X0))
            & aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
         => ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
            & aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) ) ) )
    & xS = sdtlpdtrp0(xN,sz00)
    & szNzAzT0 = szDzozmdt0(xN)
    & aFunction0(xN) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3623) ).

fof(f83,axiom,
    ! [X0,X1] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X0,szNzAzT0) )
     => ( sdtlseqdt0(X1,X0)
       => aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3754) ).

fof(f99,axiom,
    ( xx = sdtlpdtrp0(xe,xi)
    & aElementOf0(xi,szNzAzT0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5034) ).

fof(f100,conjecture,
    aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f101,negated_conjecture,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(negated_conjecture,[],[f100]) ).

fof(f109,plain,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(flattening,[],[f101]) ).

fof(f145,plain,
    ! [X0] :
      ( sdtlseqdt0(sz00,X0)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(ennf_transformation,[],[f30]) ).

fof(f211,plain,
    ( ! [X0] :
        ( ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
          & aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) )
        | ~ isCountable0(sdtlpdtrp0(xN,X0))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
        | ~ aElementOf0(X0,szNzAzT0) )
    & xS = sdtlpdtrp0(xN,sz00)
    & szNzAzT0 = szDzozmdt0(xN)
    & aFunction0(xN) ),
    inference(ennf_transformation,[],[f81]) ).

fof(f212,plain,
    ( ! [X0] :
        ( ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
          & aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) )
        | ~ isCountable0(sdtlpdtrp0(xN,X0))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
        | ~ aElementOf0(X0,szNzAzT0) )
    & xS = sdtlpdtrp0(xN,sz00)
    & szNzAzT0 = szDzozmdt0(xN)
    & aFunction0(xN) ),
    inference(flattening,[],[f211]) ).

fof(f214,plain,
    ! [X0,X1] :
      ( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
      | ~ sdtlseqdt0(X1,X0)
      | ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(ennf_transformation,[],[f83]) ).

fof(f215,plain,
    ! [X0,X1] :
      ( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
      | ~ sdtlseqdt0(X1,X0)
      | ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(flattening,[],[f214]) ).

fof(f371,plain,
    aElementOf0(sz00,szNzAzT0),
    inference(cnf_transformation,[],[f24]) ).

fof(f378,plain,
    ! [X0] :
      ( sdtlseqdt0(sz00,X0)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(cnf_transformation,[],[f145]) ).

fof(f485,plain,
    xS = sdtlpdtrp0(xN,sz00),
    inference(cnf_transformation,[],[f212]) ).

fof(f490,plain,
    ! [X0,X1] :
      ( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
      | ~ sdtlseqdt0(X1,X0)
      | ~ aElementOf0(X1,szNzAzT0)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(cnf_transformation,[],[f215]) ).

fof(f523,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnf_transformation,[],[f99]) ).

fof(f525,plain,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(cnf_transformation,[],[f109]) ).

cnf(c_96,plain,
    aElementOf0(sz00,szNzAzT0),
    inference(cnf_transformation,[],[f371]) ).

cnf(c_103,plain,
    ( ~ aElementOf0(X0,szNzAzT0)
    | sdtlseqdt0(sz00,X0) ),
    inference(cnf_transformation,[],[f378]) ).

cnf(c_210,plain,
    sdtlpdtrp0(xN,sz00) = xS,
    inference(cnf_transformation,[],[f485]) ).

cnf(c_215,plain,
    ( ~ sdtlseqdt0(X0,X1)
    | ~ aElementOf0(X0,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0)
    | aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X0)) ),
    inference(cnf_transformation,[],[f490]) ).

cnf(c_249,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnf_transformation,[],[f523]) ).

cnf(c_250,negated_conjecture,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(cnf_transformation,[],[f525]) ).

cnf(c_18210,plain,
    ( ~ aElementOf0(X0,szNzAzT0)
    | ~ sdtlseqdt0(sz00,X0)
    | ~ aElementOf0(sz00,szNzAzT0)
    | aSubsetOf0(sdtlpdtrp0(xN,X0),xS) ),
    inference(superposition,[status(thm)],[c_210,c_215]) ).

cnf(c_18299,plain,
    ( ~ aElementOf0(X0,szNzAzT0)
    | aSubsetOf0(sdtlpdtrp0(xN,X0),xS) ),
    inference(global_subsumption_just,[status(thm)],[c_18210,c_96,c_103,c_18210]) ).

cnf(c_18310,plain,
    ~ aElementOf0(xi,szNzAzT0),
    inference(superposition,[status(thm)],[c_18299,c_250]) ).

cnf(c_18312,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_249,c_18310]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : NUM603+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command  : run_iprover %s %d THM
% 0.15/0.35  % Computer : n016.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu May  2 20:02:00 EDT 2024
% 0.15/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.86/1.71  % SZS status Started for theBenchmark.p
% 7.86/1.71  % SZS status Theorem for theBenchmark.p
% 7.86/1.71  
% 7.86/1.71  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.86/1.71  
% 7.86/1.71  ------  iProver source info
% 7.86/1.71  
% 7.86/1.71  git: date: 2024-05-02 19:28:25 +0000
% 7.86/1.71  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.86/1.71  git: non_committed_changes: false
% 7.86/1.71  
% 7.86/1.71  ------ Parsing...
% 7.86/1.71  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 7.86/1.71  
% 7.86/1.71  ------ Preprocessing... sup_sim: 2  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 
% 7.86/1.71  
% 7.86/1.71  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.86/1.71  
% 7.86/1.71  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 7.86/1.71  ------ Proving...
% 7.86/1.71  ------ Problem Properties 
% 7.86/1.71  
% 7.86/1.71  
% 7.86/1.71  clauses                                 197
% 7.86/1.71  conjectures                             1
% 7.86/1.71  EPR                                     45
% 7.86/1.71  Horn                                    158
% 7.86/1.71  unary                                   39
% 7.86/1.71  binary                                  32
% 7.86/1.71  lits                                    652
% 7.86/1.71  lits eq                                 104
% 7.86/1.71  fd_pure                                 0
% 7.86/1.71  fd_pseudo                               0
% 7.86/1.71  fd_cond                                 10
% 7.86/1.71  fd_pseudo_cond                          25
% 7.86/1.71  AC symbols                              0
% 7.86/1.71  
% 7.86/1.71  ------ Input Options Time Limit: Unbounded
% 7.86/1.71  
% 7.86/1.71  
% 7.86/1.71  ------ 
% 7.86/1.71  Current options:
% 7.86/1.71  ------ 
% 7.86/1.71  
% 7.86/1.71  
% 7.86/1.71  
% 7.86/1.71  
% 7.86/1.71  ------ Proving...
% 7.86/1.71  
% 7.86/1.71  
% 7.86/1.71  % SZS status Theorem for theBenchmark.p
% 7.86/1.71  
% 7.86/1.71  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.86/1.71  
% 7.86/1.71  
%------------------------------------------------------------------------------