TSTP Solution File: NUM472+1 by iProver---3.8

View Problem - Process Solution

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

% Computer : n031.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 11:30:44 EDT 2023

% Result   : Theorem 2.69s 1.16s
% Output   : CNFRefutation 2.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  10 unt;   0 def)
%            Number of atoms       :   89 (  12 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  106 (  45   ~;  40   |;  15   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   42 (   0 sgn;  30   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => aNaturalNumber0(sdtpldt0(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).

fof(f18,axiom,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => ( sdtlseqdt0(X0,X1)
      <=> ? [X2] :
            ( sdtpldt0(X0,X2) = X1
            & aNaturalNumber0(X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).

fof(f34,axiom,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xl) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324) ).

fof(f39,conjecture,
    sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f40,negated_conjecture,
    ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    inference(negated_conjecture,[],[f39]) ).

fof(f43,plain,
    ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    inference(flattening,[],[f40]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( aNaturalNumber0(sdtpldt0(X0,X1))
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( aNaturalNumber0(sdtpldt0(X0,X1))
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(flattening,[],[f45]) ).

fof(f70,plain,
    ! [X0,X1] :
      ( ( sdtlseqdt0(X0,X1)
      <=> ? [X2] :
            ( sdtpldt0(X0,X2) = X1
            & aNaturalNumber0(X2) ) )
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( ( sdtlseqdt0(X0,X1)
      <=> ? [X2] :
            ( sdtpldt0(X0,X2) = X1
            & aNaturalNumber0(X2) ) )
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(flattening,[],[f70]) ).

fof(f97,plain,
    ! [X0,X1] :
      ( ( ( sdtlseqdt0(X0,X1)
          | ! [X2] :
              ( sdtpldt0(X0,X2) != X1
              | ~ aNaturalNumber0(X2) ) )
        & ( ? [X2] :
              ( sdtpldt0(X0,X2) = X1
              & aNaturalNumber0(X2) )
          | ~ sdtlseqdt0(X0,X1) ) )
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(nnf_transformation,[],[f71]) ).

fof(f98,plain,
    ! [X0,X1] :
      ( ( ( sdtlseqdt0(X0,X1)
          | ! [X2] :
              ( sdtpldt0(X0,X2) != X1
              | ~ aNaturalNumber0(X2) ) )
        & ( ? [X3] :
              ( sdtpldt0(X0,X3) = X1
              & aNaturalNumber0(X3) )
          | ~ sdtlseqdt0(X0,X1) ) )
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(rectify,[],[f97]) ).

fof(f99,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( sdtpldt0(X0,X3) = X1
          & aNaturalNumber0(X3) )
     => ( sdtpldt0(X0,sK0(X0,X1)) = X1
        & aNaturalNumber0(sK0(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f100,plain,
    ! [X0,X1] :
      ( ( ( sdtlseqdt0(X0,X1)
          | ! [X2] :
              ( sdtpldt0(X0,X2) != X1
              | ~ aNaturalNumber0(X2) ) )
        & ( ( sdtpldt0(X0,sK0(X0,X1)) = X1
            & aNaturalNumber0(sK0(X0,X1)) )
          | ~ sdtlseqdt0(X0,X1) ) )
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f98,f99]) ).

fof(f112,plain,
    ! [X0,X1] :
      ( aNaturalNumber0(sdtpldt0(X0,X1))
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f46]) ).

fof(f135,plain,
    ! [X2,X0,X1] :
      ( sdtlseqdt0(X0,X1)
      | sdtpldt0(X0,X2) != X1
      | ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f100]) ).

fof(f164,plain,
    aNaturalNumber0(xm),
    inference(cnf_transformation,[],[f34]) ).

fof(f165,plain,
    aNaturalNumber0(xn),
    inference(cnf_transformation,[],[f34]) ).

fof(f171,plain,
    ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    inference(cnf_transformation,[],[f43]) ).

fof(f172,plain,
    ! [X2,X0] :
      ( sdtlseqdt0(X0,sdtpldt0(X0,X2))
      | ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(sdtpldt0(X0,X2))
      | ~ aNaturalNumber0(X0) ),
    inference(equality_resolution,[],[f135]) ).

cnf(c_52,plain,
    ( ~ aNaturalNumber0(X0)
    | ~ aNaturalNumber0(X1)
    | aNaturalNumber0(sdtpldt0(X0,X1)) ),
    inference(cnf_transformation,[],[f112]) ).

cnf(c_73,plain,
    ( ~ aNaturalNumber0(sdtpldt0(X0,X1))
    | ~ aNaturalNumber0(X0)
    | ~ aNaturalNumber0(X1)
    | sdtlseqdt0(X0,sdtpldt0(X0,X1)) ),
    inference(cnf_transformation,[],[f172]) ).

cnf(c_102,plain,
    aNaturalNumber0(xn),
    inference(cnf_transformation,[],[f165]) ).

cnf(c_103,plain,
    aNaturalNumber0(xm),
    inference(cnf_transformation,[],[f164]) ).

cnf(c_110,negated_conjecture,
    ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    inference(cnf_transformation,[],[f171]) ).

cnf(c_147,plain,
    ( ~ aNaturalNumber0(X0)
    | ~ aNaturalNumber0(X1)
    | sdtlseqdt0(X0,sdtpldt0(X0,X1)) ),
    inference(global_subsumption_just,[status(thm)],[c_73,c_52,c_73]) ).

cnf(c_2814,plain,
    ( ~ aNaturalNumber0(xn)
    | ~ aNaturalNumber0(xm) ),
    inference(superposition,[status(thm)],[c_147,c_110]) ).

cnf(c_2815,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2814,c_103,c_102]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM472+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.34  % Computer : n031.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Fri Aug 25 16:04:07 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.69/1.16  % SZS status Started for theBenchmark.p
% 2.69/1.16  % SZS status Theorem for theBenchmark.p
% 2.69/1.16  
% 2.69/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.69/1.16  
% 2.69/1.16  ------  iProver source info
% 2.69/1.16  
% 2.69/1.16  git: date: 2023-05-31 18:12:56 +0000
% 2.69/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.69/1.16  git: non_committed_changes: false
% 2.69/1.16  git: last_make_outside_of_git: false
% 2.69/1.16  
% 2.69/1.16  ------ Parsing...
% 2.69/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.69/1.16  
% 2.69/1.16  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 2.69/1.16  
% 2.69/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.69/1.16  
% 2.69/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.69/1.16  ------ Proving...
% 2.69/1.16  ------ Problem Properties 
% 2.69/1.16  
% 2.69/1.16  
% 2.69/1.16  clauses                                 57
% 2.69/1.16  conjectures                             1
% 2.69/1.16  EPR                                     14
% 2.69/1.16  Horn                                    44
% 2.69/1.16  unary                                   12
% 2.69/1.16  binary                                  7
% 2.69/1.16  lits                                    197
% 2.69/1.16  lits eq                                 52
% 2.69/1.16  fd_pure                                 0
% 2.69/1.16  fd_pseudo                               0
% 2.69/1.16  fd_cond                                 6
% 2.69/1.16  fd_pseudo_cond                          9
% 2.69/1.16  AC symbols                              0
% 2.69/1.16  
% 2.69/1.16  ------ Schedule dynamic 5 is on 
% 2.69/1.16  
% 2.69/1.16  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.69/1.16  
% 2.69/1.16  
% 2.69/1.16  ------ 
% 2.69/1.16  Current options:
% 2.69/1.16  ------ 
% 2.69/1.16  
% 2.69/1.16  
% 2.69/1.16  
% 2.69/1.16  
% 2.69/1.16  ------ Proving...
% 2.69/1.16  
% 2.69/1.16  
% 2.69/1.16  % SZS status Theorem for theBenchmark.p
% 2.69/1.16  
% 2.69/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.69/1.16  
% 2.69/1.16  
%------------------------------------------------------------------------------