↑ Up

iProver---3.9.4.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(f22,axiom,
    ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__724) ).

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

fof(f24,negated_conjecture,
    ~ ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(X0) ),
    inference(negated_conjecture,[status(cth)],[f23]) ).

fof(f53,plain,
    ! [X0] :
      ( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
      | ~ aInteger0(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f59,plain,
    ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK1)
    & aInteger0(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f22]) ).

fof(f96,plain,
    sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK1),
    inference(cnf_transformation,[],[f59]) ).

fof(f97,plain,
    aInteger0(sK1),
    inference(cnf_transformation,[],[f59]) ).

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

tcf(c_83,plain,
    aInteger0(sK1),
    inference(cnf_transformation,[],[f97]) ).

tcf(c_84,plain,
    sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK1),
    inference(cnf_transformation,[],[f96]) ).

tcf(c_87,negated_conjecture,
    ! [X0: $i] :
      ( ~ aInteger0(X0)
      | ( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0) ) ),
    inference(cnf_transformation,[],[f98]) ).

tcf(c_381,plain,
    ! [X0: $i] :
      ( ~ aInteger0(X0)
      | ( sdtasdt0(xq,X0) != sdtasdt0(xq,sK1) ) ),
    inference(light_normalisation,[status(thm)],[c_87,c_84]) ).

tcf(c_1564,definition,
    iPr_def_10 = sdtasdt0(xq,sK1),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_1565,plain,
    ! [X0: $i] :
      ( ~ aInteger0(X0)
      | ( sdtasdt0(xq,X0) != iPr_def_10 ) ),
    inference(demodulation,[status(thm)],[c_381,c_1564]) ).

tcf(c_2004,plain,
    ~ aInteger0(sK1),
    inference(superposition,[status(thm)],[c_1564,c_1565]) ).

tcf(c_2005,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2004,c_83]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM425+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.12/0.37  % Computer : n011.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Thu Sep 24 03:54:28 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.42  Running first-order theorem proving
% 0.14/0.42  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.14/0.44  
% 0.14/0.44  % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.44  
% 0.14/0.44  % Detected problem language: tptp
% 0.14/0.46  % Proving...
% 2.84/1.31  % SZS status Started for theBenchmark.p
% 2.84/1.31  % SZS status Theorem for theBenchmark.p
% 2.84/1.31  
% 2.84/1.31  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.84/1.31  
% 2.84/1.31  % ------  iProver source info
% 2.84/1.31  
% 2.84/1.31  % git: date: 2026-07-19 20:42:38 +0200
% 2.84/1.31  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.84/1.31  % git: non_committed_changes: false
% 2.84/1.31  
% 2.84/1.31  % ------ Parsing...
% 2.84/1.31  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.84/1.31  
% 2.84/1.31  % ------ Preprocessing... sup_sim: 2  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 2  sf_s  rm: 2 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e % 
% 2.84/1.31  
% 2.84/1.31  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.84/1.31  
% 2.84/1.31  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.84/1.31  % ------ Proving...
% 2.84/1.31  % ------ Problem Properties 
% 2.84/1.31  
% 2.84/1.31  % 
% 2.84/1.31  % clauses                               37
% 2.84/1.31  % conjectures                           0
% 2.84/1.31  % EPR                                   9
% 2.84/1.31  % Horn                                  34
% 2.84/1.31  % unary                                 10
% 2.84/1.31  % binary                                13
% 2.84/1.31  % lits                                  86
% 2.84/1.31  % lits eq                               26
% 2.84/1.31  % fd_pure                               0
% 2.84/1.31  % fd_pseudo                             0
% 2.84/1.31  % fd_cond                               3
% 2.84/1.31  % fd_pseudo_cond                        0
% 2.84/1.31  % AC symbols                            0
% 2.84/1.31  
% 2.84/1.31  % ------ Schedule dynamic 5 is on 
% 2.84/1.31  
% 2.84/1.31  % ------ no conjectures: strip conj schedule 
% 2.84/1.31  
% 2.84/1.31  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.84/1.31  
% 2.84/1.31  
% 2.84/1.31  % ------ 
% 2.84/1.31  % Current options:
% 2.84/1.31  % ------ 
% 2.84/1.31  
% 2.84/1.31  
% 2.84/1.31  % 
% 2.84/1.31  
% 2.84/1.31  % ------ Proving...
% 2.84/1.31  % 
% 2.84/1.31  
% 2.84/1.31  % SZS status Theorem for theBenchmark.p
% 2.84/1.31  
% 2.84/1.31  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.84/1.31  
% 2.84/1.31  
%------------------------------------------------------------------------------