TSTP Solution File: NUM427+3 by iProver---3.8

View Problem - Process Solution

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

% Computer : n009.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:23 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0] :
      ( aInteger0(X0)
     => aInteger0(smndt0(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntNeg) ).

fof(f23,axiom,
    ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,xn)
    & aInteger0(xn) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__747) ).

fof(f24,axiom,
    sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__767) ).

fof(f25,conjecture,
    ( sdteqdtlpzmzozddtrp0(xb,xa,xq)
    | aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
    | ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xa))
        & aInteger0(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f26,negated_conjecture,
    ~ ( sdteqdtlpzmzozddtrp0(xb,xa,xq)
      | aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
      | ? [X0] :
          ( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xa))
          & aInteger0(X0) ) ),
    inference(negated_conjecture,[],[f25]) ).

fof(f28,plain,
    ! [X0] :
      ( aInteger0(smndt0(X0))
      | ~ aInteger0(X0) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f55,plain,
    ( ~ sdteqdtlpzmzozddtrp0(xb,xa,xq)
    & ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
    & ! [X0] :
        ( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xa))
        | ~ aInteger0(X0) ) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f66,plain,
    ! [X0] :
      ( aInteger0(smndt0(X0))
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f102,plain,
    aInteger0(xn),
    inference(cnf_transformation,[],[f23]) ).

fof(f104,plain,
    sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
    inference(cnf_transformation,[],[f24]) ).

fof(f105,plain,
    ! [X0] :
      ( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xa))
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f55]) ).

cnf(c_51,plain,
    ( ~ aInteger0(X0)
    | aInteger0(smndt0(X0)) ),
    inference(cnf_transformation,[],[f66]) ).

cnf(c_88,plain,
    aInteger0(xn),
    inference(cnf_transformation,[],[f102]) ).

cnf(c_89,plain,
    sdtpldt0(xb,smndt0(xa)) = sdtasdt0(xq,smndt0(xn)),
    inference(cnf_transformation,[],[f104]) ).

cnf(c_92,negated_conjecture,
    ( sdtpldt0(xb,smndt0(xa)) != sdtasdt0(xq,X0)
    | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f105]) ).

cnf(c_398,plain,
    ( sdtasdt0(xq,smndt0(xn)) != sdtasdt0(xq,X0)
    | ~ aInteger0(X0) ),
    inference(light_normalisation,[status(thm)],[c_92,c_89]) ).

cnf(c_1269,plain,
    ~ aInteger0(smndt0(xn)),
    inference(equality_resolution,[status(thm)],[c_398]) ).

cnf(c_1274,plain,
    ~ aInteger0(xn),
    inference(superposition,[status(thm)],[c_51,c_1269]) ).

cnf(c_1275,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1274,c_88]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM427+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.34  % Computer : n009.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 15:54:06 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.21/0.46  Running first-order theorem proving
% 0.21/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.17/1.16  % SZS status Started for theBenchmark.p
% 2.17/1.16  % SZS status Theorem for theBenchmark.p
% 2.17/1.16  
% 2.17/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.17/1.16  
% 2.17/1.16  ------  iProver source info
% 2.17/1.16  
% 2.17/1.16  git: date: 2023-05-31 18:12:56 +0000
% 2.17/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.17/1.16  git: non_committed_changes: false
% 2.17/1.16  git: last_make_outside_of_git: false
% 2.17/1.16  
% 2.17/1.16  ------ Parsing...
% 2.17/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.17/1.16  
% 2.17/1.16  ------ Preprocessing... sup_sim: 4  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e 
% 2.17/1.16  
% 2.17/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.17/1.16  
% 2.17/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.17/1.16  ------ Proving...
% 2.17/1.16  ------ Problem Properties 
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  clauses                                 44
% 2.17/1.16  conjectures                             1
% 2.17/1.16  EPR                                     12
% 2.17/1.16  Horn                                    41
% 2.17/1.16  unary                                   15
% 2.17/1.16  binary                                  15
% 2.17/1.16  lits                                    95
% 2.17/1.16  lits eq                                 31
% 2.17/1.16  fd_pure                                 0
% 2.17/1.16  fd_pseudo                               0
% 2.17/1.16  fd_cond                                 3
% 2.17/1.16  fd_pseudo_cond                          0
% 2.17/1.16  AC symbols                              0
% 2.17/1.16  
% 2.17/1.16  ------ Schedule dynamic 5 is on 
% 2.17/1.16  
% 2.17/1.16  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  ------ 
% 2.17/1.16  Current options:
% 2.17/1.16  ------ 
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  ------ Proving...
% 2.17/1.16  
% 2.17/1.16  
% 2.17/1.16  % SZS status Theorem for theBenchmark.p
% 2.17/1.16  
% 2.17/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.17/1.16  
% 2.17/1.16  
%------------------------------------------------------------------------------