TSTP Solution File: NUM514+3 by iProver---3.9

View Problem - Process Solution

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

% Computer : n019.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:49:40 EDT 2024

% Result   : Theorem 4.32s 1.24s
% Output   : CNFRefutation 4.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (   6 unt;   0 def)
%            Number of atoms       :   37 (  16 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   37 (  14   ~;   7   |;  14   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    7 (   0 sgn   3   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f55,axiom,
    ( sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr))
    & xn = sdtasdt0(xr,sdtsldt0(xn,xr))
    & aNaturalNumber0(sdtsldt0(xn,xr))
    & xk = sdtasdt0(xr,sdtsldt0(xk,xr))
    & aNaturalNumber0(sdtsldt0(xk,xr)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2613) ).

fof(f56,conjecture,
    ( ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
      & aNaturalNumber0(sdtsldt0(xn,xr)) )
   => ( doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
      | ? [X0] :
          ( sdtasdt0(xp,X0) = sdtasdt0(sdtsldt0(xn,xr),xm)
          & aNaturalNumber0(X0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f57,negated_conjecture,
    ~ ( ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
        & aNaturalNumber0(sdtsldt0(xn,xr)) )
     => ( doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
        | ? [X0] :
            ( sdtasdt0(xp,X0) = sdtasdt0(sdtsldt0(xn,xr),xm)
            & aNaturalNumber0(X0) ) ) ),
    inference(negated_conjecture,[],[f56]) ).

fof(f141,plain,
    ( ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
    & ! [X0] :
        ( sdtasdt0(xp,X0) != sdtasdt0(sdtsldt0(xn,xr),xm)
        | ~ aNaturalNumber0(X0) )
    & xn = sdtasdt0(xr,sdtsldt0(xn,xr))
    & aNaturalNumber0(sdtsldt0(xn,xr)) ),
    inference(ennf_transformation,[],[f57]) ).

fof(f142,plain,
    ( ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
    & ! [X0] :
        ( sdtasdt0(xp,X0) != sdtasdt0(sdtsldt0(xn,xr),xm)
        | ~ aNaturalNumber0(X0) )
    & xn = sdtasdt0(xr,sdtsldt0(xn,xr))
    & aNaturalNumber0(sdtsldt0(xn,xr)) ),
    inference(flattening,[],[f141]) ).

fof(f356,plain,
    aNaturalNumber0(sdtsldt0(xk,xr)),
    inference(cnf_transformation,[],[f55]) ).

fof(f360,plain,
    sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
    inference(cnf_transformation,[],[f55]) ).

fof(f363,plain,
    ! [X0] :
      ( sdtasdt0(xp,X0) != sdtasdt0(sdtsldt0(xn,xr),xm)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f142]) ).

cnf(c_203,plain,
    sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
    inference(cnf_transformation,[],[f360]) ).

cnf(c_207,plain,
    aNaturalNumber0(sdtsldt0(xk,xr)),
    inference(cnf_transformation,[],[f356]) ).

cnf(c_209,negated_conjecture,
    ( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X0)
    | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f363]) ).

cnf(c_1270,plain,
    ( sdtasdt0(xp,sdtsldt0(xk,xr)) != sdtasdt0(xp,X0)
    | ~ aNaturalNumber0(X0) ),
    inference(light_normalisation,[status(thm)],[c_209,c_203]) ).

cnf(c_11230,plain,
    ~ aNaturalNumber0(sdtsldt0(xk,xr)),
    inference(equality_resolution,[status(thm)],[c_1270]) ).

cnf(c_11231,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_11230,c_207]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : NUM514+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu May  2 19:44:29 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/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
% 4.32/1.24  % SZS status Started for theBenchmark.p
% 4.32/1.24  % SZS status Theorem for theBenchmark.p
% 4.32/1.24  
% 4.32/1.24  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.32/1.24  
% 4.32/1.24  ------  iProver source info
% 4.32/1.24  
% 4.32/1.24  git: date: 2024-05-02 19:28:25 +0000
% 4.32/1.24  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.32/1.24  git: non_committed_changes: false
% 4.32/1.24  
% 4.32/1.24  ------ Parsing...
% 4.32/1.24  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 4.32/1.24  
% 4.32/1.24  ------ Preprocessing... sup_sim: 11  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 
% 4.32/1.24  
% 4.32/1.24  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 4.32/1.24  
% 4.32/1.24  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.32/1.24  ------ Proving...
% 4.32/1.24  ------ Problem Properties 
% 4.32/1.24  
% 4.32/1.24  
% 4.32/1.24  clauses                                 149
% 4.32/1.24  conjectures                             2
% 4.32/1.24  EPR                                     55
% 4.32/1.24  Horn                                    106
% 4.32/1.24  unary                                   64
% 4.32/1.24  binary                                  19
% 4.32/1.24  lits                                    426
% 4.32/1.24  lits eq                                 136
% 4.32/1.24  fd_pure                                 0
% 4.32/1.24  fd_pseudo                               0
% 4.32/1.24  fd_cond                                 24
% 4.32/1.24  fd_pseudo_cond                          11
% 4.32/1.24  AC symbols                              0
% 4.32/1.24  
% 4.32/1.24  ------ Schedule dynamic 5 is on 
% 4.32/1.24  
% 4.32/1.24  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.32/1.24  
% 4.32/1.24  
% 4.32/1.24  ------ 
% 4.32/1.24  Current options:
% 4.32/1.24  ------ 
% 4.32/1.24  
% 4.32/1.24  
% 4.32/1.24  
% 4.32/1.24  
% 4.32/1.24  ------ Proving...
% 4.32/1.24  
% 4.32/1.24  
% 4.32/1.24  % SZS status Theorem for theBenchmark.p
% 4.32/1.24  
% 4.32/1.24  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.32/1.24  
% 4.32/1.24  
%------------------------------------------------------------------------------